Home › Code › manhattan_distance

manhattan_distance

Syntologyentry name in harvested code

Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record.

manhattan_distance appears in the code Syntology harvested for 13 papers, as 11 distinct code bodies found in 13 places (a place is one code body under one paper). Of the 13 papers, 10 with a sample that ran: 9 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument. 7 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named manhattan_distance do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 11 distinct code bodies named manhattan_distance: 10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

2ran · honoured contract
1ran · violated contract
1ran · our draft was wrong
0ran; the contract check could not run
6ran
1unverified
7fingerprinted

Licence is a property of each copy, so it is counted per place: 7 of the 13 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

13 papers shown of 13, newest first; 13 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 1 papers added by Syntology. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Augmenting Biological Fitness Prediction Benchmarks with Landscapes Features from GraphFLA added by Syntology 2025-10 (from id) COLA-Laboratory/GraphFLA/graphfla/distances.py 14330842b1a0f393 ran MIT (permissive)
From Text to Space: Mapping Abstract Spatial Models in LLMs during a Grid-World Navigation Task 23 Feb 2025 mneuronico/griw-world-spatial-orientation-task/analysis/correctness_analysis.py f105a9126dcc821d ran fingerprinted MIT (permissive)
Monte Carlo Tree Search based Space Transfer for Black-box Optimization 10 Dec 2024 lamda-bbo/mcts-transfer/mcts/MCTS.py 3e34043a45f43b60 ran · honoured contract fingerprinted no licence file found · pointer only
Navigating Noisy Feedback: Enhancing Reinforcement Learning with Error-Prone Language Models 22 Oct 2024 sy-shi/RLAIF_ScoreDiff/generate_ranking_data.py f0e515a163e67f9f ran · honoured contract fingerprinted no licence file found · pointer only
ARMA-Design: Optimal Treatment Allocation Strategies for A/B Testing in Partially Observable Time Series Experiments 9 Aug 2024 datake/armadesign/ARMAdesign.py e1717c7d14ab8b9f ran no licence file found · pointer only
Beyond A*: Better Planning with Transformers via Search Dynamics Bootstrapping 21 Feb 2024 facebookresearch/searchformer/searchformer/sokoban.py e6efc6bfc4f2862d ran fingerprinted licence not identified · pointer only
A Configurable Library for Generating and Manipulating Maze Datasets 19 Sep 2023 understanding-search/maze-dataset/maze_dataset/utils.py 135b4d661d0338ef ran LGPL-3.0 (copyleft) · pointer only
Thought Cloning: Learning to Think while Acting by Imitating Human Thinking 1 Jun 2023 ShengranHu/Thought-Cloning/babyai/bot.py c1ffbae9fb9c6fc2 unverified MIT (permissive)
Neural Distance Embeddings for Biological Sequences 20 Sep 2021 gcorso/neuroseed/edit_distance/models/pair_encoder.py 74beb371d13f031f ran · our draft was wrong fingerprinted MIT (permissive)
BabyAI 1.1 24 Jul 2020 mila-iqia/babyai/babyai/bot.py c1ffbae9fb9c6fc2 unverified BSD-3-Clause (permissive)
Adversarial NLI: A New Benchmark for Natural Language Understanding 31 Oct 2019 tlatkowski/multihead-siamese-nets/layers/similarity.py 63ceb8de67b2b5d4 ran fingerprinted MIT (permissive)
BabyAI: A Platform to Study the Sample Efficiency of Grounded Language Learning 18 Oct 2018 identical code first harvested elsewhere c1ffbae9fb9c6fc2 unverified licence of this copy not recorded
Multimodal Generative Models for Scalable Weakly-Supervised Learning 14 Feb 2018 gabinsane/multimodal-vae-comparison/multimodal_compare/eval/eval_cdsprites.py 069b8e2ab4d7baeb ran · violated contract fingerprinted GPL-3.0 (copyleft) · pointer only

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections