{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/hamming-distance","entry":"hamming_distance","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":5,"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":10,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":11,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":3,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":3,"ran":3,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"74690db5ac71bd4d","code_sha256_prefix":"74690db5ac71bd4d","mcp_get_code":{"code_sha256":"74690db5ac71bd4d"}},{"arxiv_id":"2608.15073","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f6f012a1fb08b48e","code_sha256_prefix":"f6f012a1fb08b48e","mcp_get_code":{"code_sha256":"f6f012a1fb08b48e"}},{"arxiv_id":"2605.24305","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"89ed08e1db753746","code_sha256_prefix":"89ed08e1db753746","mcp_get_code":{"code_sha256":"89ed08e1db753746"}},{"arxiv_id":"2602.16012","arxiv_id_is_arxiv":true,"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":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6c620551834a7442","code_sha256_prefix":"6c620551834a7442","mcp_get_code":{"code_sha256":"6c620551834a7442"}},{"arxiv_id":"2512.06870","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Woof6/ECOCSeg when it was checked","code_sha256":"4b23763055edf651","code_sha256_prefix":"4b23763055edf651","mcp_get_code":{"code_sha256":"4b23763055edf651"}},{"arxiv_id":"2510.24826","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2077a8d30a200751","code_sha256_prefix":"2077a8d30a200751","mcp_get_code":{"code_sha256":"2077a8d30a200751"}},{"arxiv_id":"2411.11045","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be1f11500a65f0f6","code_sha256_prefix":"be1f11500a65f0f6","mcp_get_code":{"code_sha256":"be1f11500a65f0f6"}},{"arxiv_id":"2405.15523","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9dc75d54d914e3fd","code_sha256_prefix":"9dc75d54d914e3fd","mcp_get_code":{"code_sha256":"9dc75d54d914e3fd"}},{"arxiv_id":"2404.08608","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f54613f3c9fde1dc","code_sha256_prefix":"f54613f3c9fde1dc","mcp_get_code":{"code_sha256":"f54613f3c9fde1dc"}},{"arxiv_id":"2310.09336","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, phys-ai/concept_graphs when it was checked","code_sha256":"455a82152e9085bc","code_sha256_prefix":"455a82152e9085bc","mcp_get_code":{"code_sha256":"455a82152e9085bc"}},{"arxiv_id":"2307.00618","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f6f012a1fb08b48e","code_sha256_prefix":"f6f012a1fb08b48e","mcp_get_code":{"code_sha256":"f6f012a1fb08b48e"}}],"record_sha256":"2d199a94edc459cb2dfac91b7b6a00b8cd68130779a715f051f9ffd2d688dbb9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}