{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/hamming-distance","entry":"hamming_distance","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":6,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":10,"n_samples_ran":5,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":5},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2609.13356","paper":"/paper/arxiv-2609-13356","title":"ZGCM-1: A Fully Open and Extremely Efficient Foundation Model for Math and Agentic Search","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"zgcagi/ZGCM-1","path":"data-process/src/zgcm_data_pipeline/dedup.py","file_url":"https://github.com/zgcagi/ZGCM-1/blob/HEAD/data-process/src/zgcm_data_pipeline/dedup.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"74690db5ac71bd4d","mcp_get_code":{"code_sha256":"74690db5ac71bd4d"}},{"arxiv_id":"2608.15073","paper":"/paper/arxiv-2608-15073","title":"BOCoDe: Engineering-Centered Benchmarking for Bayesian Optimization","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"LeoIV/bounce","path":"bounce/neighbors.py","file_url":"https://github.com/LeoIV/bounce/blob/HEAD/bounce/neighbors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f6f012a1fb08b48e","mcp_get_code":{"code_sha256":"f6f012a1fb08b48e"}},{"arxiv_id":"2605.24305","paper":"/paper/arxiv-2605-24305","title":"ChaosBench-Logic v2: Evaluating LLM Logical Reasoning over Dynamical Systems at Scale","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"11NOel11/ChaosBench-Logic","path":"chaosbench/eval/belief_dynamics.py","file_url":"https://github.com/11NOel11/ChaosBench-Logic/blob/HEAD/chaosbench/eval/belief_dynamics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"89ed08e1db753746","mcp_get_code":{"code_sha256":"89ed08e1db753746"}},{"arxiv_id":"2602.16012","paper":"/paper/arxiv-2602-16012","title":"Towards Efficient Constraint Handling in Neural Solvers for Routing Problems","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"jieyibi/CaR-constraint","path":"analysis/similarity.py","file_url":"https://github.com/jieyibi/CaR-constraint/blob/HEAD/analysis/similarity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6c620551834a7442","mcp_get_code":{"code_sha256":"6c620551834a7442"}},{"arxiv_id":"2512.06870","paper":"/paper/arxiv-2512-06870","title":"Towards Robust Pseudo-Label Learning in Semantic Segmentation: An Encoding Perspective","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"Woof6/ECOCSeg","path":"ECOC/ecoc.py","file_url":"https://github.com/Woof6/ECOCSeg/blob/HEAD/ECOC/ecoc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4b23763055edf651","mcp_get_code":{"code_sha256":"4b23763055edf651"}},{"arxiv_id":"2510.24826","paper":"/paper/arxiv-2510-24826","title":"Augmenting Biological Fitness Prediction Benchmarks with Landscapes Features from GraphFLA","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"COLA-Laboratory/GraphFLA","path":"graphfla/distances.py","file_url":"https://github.com/COLA-Laboratory/GraphFLA/blob/HEAD/graphfla/distances.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2077a8d30a200751","mcp_get_code":{"code_sha256":"2077a8d30a200751"}},{"arxiv_id":"2411.11045","paper":"/paper/stablev2v-stablizing-shape-consistency-in","title":"StableV2V: Stablizing Shape Consistency in Video-to-Video Editing","date":"2024-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alonzoleeeooo/stablev2v","path":"utils/loss_utils.py","file_url":"https://github.com/alonzoleeeooo/stablev2v/blob/HEAD/utils/loss_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be1f11500a65f0f6","mcp_get_code":{"code_sha256":"be1f11500a65f0f6"}},{"arxiv_id":"2405.15523","paper":"/paper/mosaic-memory-fuzzy-duplication-in-copyright","title":"The Mosaic Memory of Large Language Models","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"computationalprivacy/mosaic_memory","path":"slimpajama/py_src/near_duplicates/utils.py","file_url":"https://github.com/computationalprivacy/mosaic_memory/blob/HEAD/slimpajama/py_src/near_duplicates/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9dc75d54d914e3fd","mcp_get_code":{"code_sha256":"9dc75d54d914e3fd"}},{"arxiv_id":"2404.08608","paper":"/paper/hyperbolic-delaunay-geometric-alignment","title":"Hyperbolic Delaunay Geometric Alignment","date":"2024-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anissmedbouhi/hyperdga","path":"lib/dataset/binary_tree.py","file_url":"https://github.com/anissmedbouhi/hyperdga/blob/HEAD/lib/dataset/binary_tree.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f54613f3c9fde1dc","mcp_get_code":{"code_sha256":"f54613f3c9fde1dc"}},{"arxiv_id":"2310.09336","paper":"/paper/compositional-abilities-emerge","title":"Compositional Abilities Emerge Multiplicatively: Exploring Diffusion Models on a Synthetic Task","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phys-ai/concept_graphs","path":"plotting.py","file_url":"https://github.com/phys-ai/concept_graphs/blob/HEAD/plotting.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"455a82152e9085bc","mcp_get_code":{"code_sha256":"455a82152e9085bc"}},{"arxiv_id":"2307.00618","paper":"/paper/bounce-a-reliable-bayesian-optimization","title":"Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spaces","date":"2023-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leoiv/bounce","path":"bounce/neighbors.py","file_url":"https://github.com/leoiv/bounce/blob/HEAD/bounce/neighbors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f6f012a1fb08b48e","mcp_get_code":{"code_sha256":"f6f012a1fb08b48e"}}]}