{"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/file-sha256","entry":"file_sha256","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"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":0,"ran_violates":0,"ran_draft_wrong":6,"ran_fixture":0,"ran":1,"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":"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/common/manifest.py","file_url":"https://github.com/zgcagi/ZGCM-1/blob/HEAD/data-process/src/zgcm_data_pipeline/common/manifest.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c730ac1fded39006","code_sha256_prefix":"c730ac1fded39006","mcp_get_code":{"code_sha256":"c730ac1fded39006"}},{"arxiv_id":"2608.24229","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24229","title":"A Theory of Finite-Noise Optima and Generalization in Quantum Machine Learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"dongsnaq/Finite-Noise-Generalization-QML","path":"code/compute_molecular_deff.py","file_url":"https://github.com/dongsnaq/Finite-Noise-Generalization-QML/blob/HEAD/code/compute_molecular_deff.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"970994898fa7a46d","code_sha256_prefix":"970994898fa7a46d","mcp_get_code":{"code_sha256":"970994898fa7a46d"}},{"arxiv_id":"2608.08212","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-08212","title":"Harmful Content Is Not Enough: Continuation Framing Moderates In-Context Emergent Misalignment","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"PeiYangLiu/icl-em-format-control","path":"analyze_model_scope.py","file_url":"https://github.com/PeiYangLiu/icl-em-format-control/blob/HEAD/analyze_model_scope.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, PeiYangLiu/icl-em-format-control when it was checked","code_sha256":"abdf8e2a5e6f9795","code_sha256_prefix":"abdf8e2a5e6f9795","mcp_get_code":{"code_sha256":"abdf8e2a5e6f9795"}},{"arxiv_id":"2608.01358","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-01358","title":"HopRefusalBench: Diagnosing Refusal Failures in Search-Augmented Agents for Multi-Hop Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"JiananXie/HopRefusalBench","path":"src/artifacts.py","file_url":"https://github.com/JiananXie/HopRefusalBench/blob/HEAD/src/artifacts.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, JiananXie/HopRefusalBench when it was checked","code_sha256":"5f7fc23d9638482e","code_sha256_prefix":"5f7fc23d9638482e","mcp_get_code":{"code_sha256":"5f7fc23d9638482e"}},{"arxiv_id":"2606.03980","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-03980","title":"Skill-RM: Unifying Heterogeneous Evaluation Criteria via Agent Skill","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Qwen-Applications/Skill-RM","path":"experiments/if_rewardbench/io_utils.py","file_url":"https://github.com/Qwen-Applications/Skill-RM/blob/HEAD/experiments/if_rewardbench/io_utils.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":"033ad83fd1fe07e9","code_sha256_prefix":"033ad83fd1fe07e9","mcp_get_code":{"code_sha256":"033ad83fd1fe07e9"}},{"arxiv_id":"2605.13688","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-13688","title":"MedCore: Boundary-Preserving Medical Core Pruning for MedSAM","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"cenweizhang/MedCore","path":"medcore_pruning/utils.py","file_url":"https://github.com/cenweizhang/MedCore/blob/HEAD/medcore_pruning/utils.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":"f8aa46dcd86ec93d","code_sha256_prefix":"f8aa46dcd86ec93d","mcp_get_code":{"code_sha256":"f8aa46dcd86ec93d"}},{"arxiv_id":"2604.08554","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-08554","title":"Drift and selection in LLM text ecosystems","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"SR123/LLM-text-ecosystems","path":"src/drift_selection/manifests.py","file_url":"https://github.com/SR123/LLM-text-ecosystems/blob/HEAD/src/drift_selection/manifests.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1e3d2b319c17f814","code_sha256_prefix":"1e3d2b319c17f814","mcp_get_code":{"code_sha256":"1e3d2b319c17f814"}},{"arxiv_id":"2204.03972","arxiv_id_is_arxiv":true,"paper":"/paper/fashionclip-connecting-language-and-images","title":"Contrastive language and vision learning of general fashion concepts","date":"2022-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"patrickjohncyh/fashion-clip","path":"fashion_clip/utils.py","file_url":"https://github.com/patrickjohncyh/fashion-clip/blob/HEAD/fashion_clip/utils.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":"55b709f744380b0b","code_sha256_prefix":"55b709f744380b0b","mcp_get_code":{"code_sha256":"55b709f744380b0b"}}],"record_sha256":"34f5bb6263ac48f11bbd8021b34a5ea4c5ca8280a24524e0eae98f65c701106b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}