{"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/sign","entry":"sign","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":1,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":6,"n_places":10,"n_places_pointer_only":4,"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":2,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"unverified":1},"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":"2606.09751","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e5996c400ed86e87","code_sha256_prefix":"e5996c400ed86e87","mcp_get_code":{"code_sha256":"e5996c400ed86e87"}},{"arxiv_id":"2509.25411","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, zewei-Zhang/ImitSAT (NOASSERTION)","code_sha256":"383136cc51620a27","code_sha256_prefix":"383136cc51620a27","mcp_get_code":{"code_sha256":"383136cc51620a27"}},{"arxiv_id":"2310.14918","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"403df393850e86d3","code_sha256_prefix":"403df393850e86d3","mcp_get_code":{"code_sha256":"403df393850e86d3"}},{"arxiv_id":"2306.06446","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b470af6a393acb1","code_sha256_prefix":"3b470af6a393acb1","mcp_get_code":{"code_sha256":"3b470af6a393acb1"}},{"arxiv_id":"2305.01777","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d1cc2925adf7260d","code_sha256_prefix":"d1cc2925adf7260d","mcp_get_code":{"code_sha256":"d1cc2925adf7260d"}},{"arxiv_id":"2110.12425","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ljsthu/kernelized-hrm when it was checked","code_sha256":"3b6283c878822a61","code_sha256_prefix":"3b6283c878822a61","mcp_get_code":{"code_sha256":"3b6283c878822a61"}},{"arxiv_id":"2105.03818","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"3b6283c878822a61","code_sha256_prefix":"3b6283c878822a61","mcp_get_code":{"code_sha256":"3b6283c878822a61"}},{"arxiv_id":"2010.05636","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"36197426e216d22b","code_sha256_prefix":"36197426e216d22b","mcp_get_code":{"code_sha256":"36197426e216d22b"}},{"arxiv_id":"2010.00712","arxiv_id_is_arxiv":true,"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_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, jayzhang0727/Faster-Binary-Embeddings-for-Preserving-Euclidean-Distances when it was checked","code_sha256":"902d718e6fa622f5","code_sha256_prefix":"902d718e6fa622f5","mcp_get_code":{"code_sha256":"902d718e6fa622f5"}},{"arxiv_id":"1906.02107","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7204bb0e23dc1a2","code_sha256_prefix":"a7204bb0e23dc1a2","mcp_get_code":{"code_sha256":"a7204bb0e23dc1a2"}}],"record_sha256":"e3841c6873c2abba07b0020a9b0bae7c171940f53e55fe710a2144140213d0da","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}