{"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/sign","entry":"sign","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":10,"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":9,"n_samples_ran":5,"n_samples_fingerprinted":4,"n_places":10,"n_places_pointer_only":4,"by_status":{"ran_honours":1,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":4},"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":"2606.09751","paper":"/paper/arxiv-2606-09751","title":"Collaborative Human-Agent Protocol (CHAP) An open protocol for auditable, structured multi-human and multi-agent collaboration","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"BrightbeamAI/chap","path":"packages/coordinator-py/chap_coordinator/crypto.py","file_url":"https://github.com/BrightbeamAI/chap/blob/HEAD/packages/coordinator-py/chap_coordinator/crypto.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e5996c400ed86e87","mcp_get_code":{"code_sha256":"e5996c400ed86e87"}},{"arxiv_id":"2509.25411","paper":"/paper/arxiv-2509-25411","title":"Boolean Satisfiability via Imitation Learning","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"zewei-Zhang/ImitSAT","path":"ImitSAT/ImitSAT_MiniSAT.py","file_url":"https://github.com/zewei-Zhang/ImitSAT/blob/HEAD/ImitSAT/ImitSAT_MiniSAT.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"383136cc51620a27","mcp_get_code":{"code_sha256":"383136cc51620a27"}},{"arxiv_id":"2310.14918","paper":"/paper/arniqa-learning-distortion-manifold-for-image","title":"ARNIQA: Learning Distortion Manifold for Image Quality Assessment","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miccunifi/arniqa","path":"utils/utils_distortions.py","file_url":"https://github.com/miccunifi/arniqa/blob/HEAD/utils/utils_distortions.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":"403df393850e86d3","mcp_get_code":{"code_sha256":"403df393850e86d3"}},{"arxiv_id":"2306.06446","paper":"/paper/shiftaddvit-mixture-of-multiplication-1","title":"ShiftAddViT: Mixture of Multiplication Primitives Towards Efficient Vision Transformer","date":"2023-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gatech-eic/shiftaddvit","path":"pvt/deepshift/modules.py","file_url":"https://github.com/gatech-eic/shiftaddvit/blob/HEAD/pvt/deepshift/modules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3b470af6a393acb1","mcp_get_code":{"code_sha256":"3b470af6a393acb1"}},{"arxiv_id":"2305.01777","paper":"/paper/representation-learning-via-manifold","title":"Representation Learning via Manifold Flattening and Reconstruction","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michael-psenka/manifold-linearization","path":"models/umap_scripts/distances.py","file_url":"https://github.com/michael-psenka/manifold-linearization/blob/HEAD/models/umap_scripts/distances.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d1cc2925adf7260d","mcp_get_code":{"code_sha256":"d1cc2925adf7260d"}},{"arxiv_id":"2110.12425","paper":"/paper/kernelized-heterogeneous-risk-minimization","title":"Kernelized Heterogeneous Risk Minimization","date":"2021-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljsthu/kernelized-hrm","path":"KernelHRM_sim2.py","file_url":"https://github.com/ljsthu/kernelized-hrm/blob/HEAD/KernelHRM_sim2.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3b6283c878822a61","mcp_get_code":{"code_sha256":"3b6283c878822a61"}},{"arxiv_id":"2105.03818","paper":"/paper/heterogeneous-risk-minimization","title":"Heterogeneous Risk Minimization","date":"2021-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"3b6283c878822a61","mcp_get_code":{"code_sha256":"3b6283c878822a61"}},{"arxiv_id":"2010.05636","paper":"/paper/k-simplex2vec-a-simplicial-extension-of","title":"k-simplex2vec: a simplicial extension of node2vec","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"celiahacker/k-simplex2vec","path":"k_simplex2vec.py","file_url":"https://github.com/celiahacker/k-simplex2vec/blob/HEAD/k_simplex2vec.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"36197426e216d22b","mcp_get_code":{"code_sha256":"36197426e216d22b"}},{"arxiv_id":"2010.00712","paper":"/paper/faster-binary-embeddings-for-preserving","title":"Faster Binary Embeddings for Preserving Euclidean Distances","date":"2020-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances","path":"quantizer.py","file_url":"https://github.com/jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances/blob/HEAD/quantizer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"902d718e6fa622f5","mcp_get_code":{"code_sha256":"902d718e6fa622f5"}},{"arxiv_id":"1906.02107","paper":"/paper/latent-weights-do-not-exist-rethinking","title":"Latent Weights Do Not Exist: Rethinking Binarized Neural Network Optimization","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"larq/larq","path":"larq/math.py","file_url":"https://github.com/larq/larq/blob/HEAD/larq/math.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a7204bb0e23dc1a2","mcp_get_code":{"code_sha256":"a7204bb0e23dc1a2"}}]}