Home › Code › hamming_distance

hamming_distance

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

hamming_distance appears in the code Syntology harvested for 11 papers, as 10 distinct code bodies found in 11 places (a place is one code body under one paper). Of the 11 papers, 11 with a sample that ran: 6 with a run with no instrument failure, 5 where every run was a failure of Syntology's instrument. 5 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 hamming_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 10 distinct code bodies named hamming_distance: 10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 0 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:

3ran · honoured contract
0ran · violated contract
1ran · our draft was wrong
3ran; the contract check could not run
3ran
0unverified
5fingerprinted

Licence is a property of each copy, so it is counted per place: 2 of the 11 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

11 papers shown of 11, newest first; 11 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 6 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
ZGCM-1: A Fully Open and Extremely Efficient Foundation Model for Math and Agentic Search added by Syntology 2026-09 (from id) zgcagi/ZGCM-1/data-process/src/zgcm_data_pipeline/dedup.py 74690db5ac71bd4d ran · honoured contract fingerprinted MIT (permissive)
BOCoDe: Engineering-Centered Benchmarking for Bayesian Optimization added by Syntology 2026-08 (from id) LeoIV/bounce/bounce/neighbors.py f6f012a1fb08b48e ran; the contract check could not run (RAISES) MIT (permissive)
ChaosBench-Logic v2: Evaluating LLM Logical Reasoning over Dynamical Systems at Scale added by Syntology 2026-05 (from id) 11NOel11/ChaosBench-Logic/chaosbench/eval/belief_dynamics.py 89ed08e1db753746 ran · honoured contract MIT (permissive)
Towards Efficient Constraint Handling in Neural Solvers for Routing Problems added by Syntology 2026-02 (from id) jieyibi/CaR-constraint/analysis/similarity.py 6c620551834a7442 ran; the contract check could not run (RAISES) fingerprinted MIT (permissive)
Towards Robust Pseudo-Label Learning in Semantic Segmentation: An Encoding Perspective added by Syntology 2025-12 (from id) Woof6/ECOCSeg/ECOC/ecoc.py 4b23763055edf651 ran · honoured contract fingerprinted no licence file found · pointer only
Augmenting Biological Fitness Prediction Benchmarks with Landscapes Features from GraphFLA added by Syntology 2025-10 (from id) COLA-Laboratory/GraphFLA/graphfla/distances.py 2077a8d30a200751 ran MIT (permissive)
StableV2V: Stablizing Shape Consistency in Video-to-Video Editing 17 Nov 2024 alonzoleeeooo/stablev2v/utils/loss_utils.py be1f11500a65f0f6 ran · our draft was wrong fingerprinted MIT (permissive)
The Mosaic Memory of Large Language Models 24 May 2024 computationalprivacy/mosaic_memory/slimpajama/py_src/near_duplicates/utils.py 9dc75d54d914e3fd ran; the contract check could not run (RAISES) fingerprinted Apache-2.0 (permissive)
Hyperbolic Delaunay Geometric Alignment 12 Apr 2024 anissmedbouhi/hyperdga/lib/dataset/binary_tree.py f54613f3c9fde1dc ran MIT (permissive)
Compositional Abilities Emerge Multiplicatively: Exploring Diffusion Models on a Synthetic Task 13 Oct 2023 phys-ai/concept_graphs/plotting.py 455a82152e9085bc ran no licence file found · pointer only
Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spaces 2 Jul 2023 leoiv/bounce/bounce/neighbors.py f6f012a1fb08b48e ran; the contract check could not run (RAISES) MIT (permissive)

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