{"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/check-exist","entry":"check_exist","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":5,"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":0,"ran_violates":3,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2505.22988","arxiv_id_is_arxiv":true,"paper":"/paper/model-preserving-adaptive-rounding","title":"Model-Preserving Adaptive Rounding","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cornell-RelaxML/yaqa-quantization","path":"quantize_llama/quantize_finetune_llama.py","file_url":"https://github.com/Cornell-RelaxML/yaqa-quantization/blob/HEAD/quantize_llama/quantize_finetune_llama.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, Cornell-RelaxML/yaqa-quantization, is not in the permissive set Syntology serves inline","code_sha256":"379ac2a276b17fe0","code_sha256_prefix":"379ac2a276b17fe0","mcp_get_code":{"code_sha256":"379ac2a276b17fe0"}},{"arxiv_id":"2412.13670","arxiv_id_is_arxiv":true,"paper":"/paper/antileak-bench-preventing-data-contamination","title":"AntiLeak-Bench: Preventing Data Contamination by Automatically Constructing Benchmarks with Updated Real-World Knowledge","date":"2024-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bobxwu/antileak-bench","path":"building/build_singlehop.py","file_url":"https://github.com/bobxwu/antileak-bench/blob/HEAD/building/build_singlehop.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, bobxwu/antileak-bench when it was checked","code_sha256":"008d42c071b99ed5","code_sha256_prefix":"008d42c071b99ed5","mcp_get_code":{"code_sha256":"008d42c071b99ed5"}},{"arxiv_id":"2406.11235","arxiv_id_is_arxiv":true,"paper":"/paper/qtip-quantization-with-trellises-and","title":"QTIP: Quantization with Trellises and Incoherence Processing","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cornell-RelaxML/qtip","path":"quantize_llama/quantize_finetune_llama.py","file_url":"https://github.com/Cornell-RelaxML/qtip/blob/HEAD/quantize_llama/quantize_finetune_llama.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, Cornell-RelaxML/qtip, is not in the permissive set Syntology serves inline","code_sha256":"6a853f497a6fd273","code_sha256_prefix":"6a853f497a6fd273","mcp_get_code":{"code_sha256":"6a853f497a6fd273"}},{"arxiv_id":"2403.05297","arxiv_id_is_arxiv":true,"paper":"/paper/peeb-part-based-image-classifiers-with-an","title":"PEEB: Part-based Image Classifiers with an Explainable and Editable Language Bottleneck","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anguyen8/peeb","path":"src/precompute_boxes.py","file_url":"https://github.com/anguyen8/peeb/blob/HEAD/src/precompute_boxes.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":"2ff51a5d9e6dcdf3","code_sha256_prefix":"2ff51a5d9e6dcdf3","mcp_get_code":{"code_sha256":"2ff51a5d9e6dcdf3"}},{"arxiv_id":"2402.04396","arxiv_id_is_arxiv":true,"paper":"/paper/quip-even-better-llm-quantization-with","title":"QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebooks","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cornell-relaxml/quip-sharp","path":"quantize_llama/quantize_finetune_llama.py","file_url":"https://github.com/cornell-relaxml/quip-sharp/blob/HEAD/quantize_llama/quantize_finetune_llama.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, cornell-relaxml/quip-sharp, is not in the permissive set Syntology serves inline","code_sha256":"6ab265cc90f28f05","code_sha256_prefix":"6ab265cc90f28f05","mcp_get_code":{"code_sha256":"6ab265cc90f28f05"}},{"arxiv_id":"2401.11911","arxiv_id_is_arxiv":true,"paper":"/paper/blinded-by-generated-contexts-how-language","title":"Blinded by Generated Contexts: How Language Models Merge Generated and Retrieved Contexts When Knowledge Conflicts?","date":"2024-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tan-hexiang/retrieveorgenerated","path":"src/llm.py","file_url":"https://github.com/tan-hexiang/retrieveorgenerated/blob/HEAD/src/llm.py","status":"unverified","verification_level":0,"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, tan-hexiang/retrieveorgenerated when it was checked","code_sha256":"3d6c6e5375eae12b","code_sha256_prefix":"3d6c6e5375eae12b","mcp_get_code":{"code_sha256":"3d6c6e5375eae12b"}}],"record_sha256":"20f347779fae192a27b72d3a9d8538bfd64392d88ef876a3cb1905698954ee1f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}