{"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/normalize-model-name","entry":"normalize_model_name","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":7,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":7,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":7,"n_places_pointer_only":6,"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":7,"ran_fixture":0,"ran":0,"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":"2606.16710","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-16710","title":"Misinformation Propagation in Benign Multi-Agent Systems","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"jonas-becker/MINT","path":"model_server_config.py","file_url":"https://github.com/jonas-becker/MINT/blob/HEAD/model_server_config.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, jonas-becker/MINT when it was checked","code_sha256":"96b73089f0196142","code_sha256_prefix":"96b73089f0196142","mcp_get_code":{"code_sha256":"96b73089f0196142"}},{"arxiv_id":"2605.18374","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18374","title":"Beyond Inference-Time Search: Reinforcement Learning Synthesizes Reusable Solvers","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"IDEALLab/neural-solver-synthesis","path":"evaluation/bigcode/evaluate.py","file_url":"https://github.com/IDEALLab/neural-solver-synthesis/blob/HEAD/evaluation/bigcode/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, IDEALLab/neural-solver-synthesis when it was checked","code_sha256":"83fa161891bf2706","code_sha256_prefix":"83fa161891bf2706","mcp_get_code":{"code_sha256":"83fa161891bf2706"}},{"arxiv_id":"2605.08587","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08587","title":"Kaczmarz Linear Attention","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"anonymous-kla-review/kla-anonymous","path":"analysis_plot_style.py","file_url":"https://github.com/anonymous-kla-review/kla-anonymous/blob/HEAD/analysis_plot_style.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, anonymous-kla-review/kla-anonymous (NOASSERTION)","code_sha256":"b6c0fb1683b9e6fc","code_sha256_prefix":"b6c0fb1683b9e6fc","mcp_get_code":{"code_sha256":"b6c0fb1683b9e6fc"}},{"arxiv_id":"2603.26233","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-26233","title":"Ask or Assume? Uncertainty-Aware Clarification-Seeking in Coding Agents","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"nedwards99/ask-or-assume","path":"openhands/llm/model_features.py","file_url":"https://github.com/nedwards99/ask-or-assume/blob/HEAD/openhands/llm/model_features.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, nedwards99/ask-or-assume (NOASSERTION)","code_sha256":"0700b13f24276bd8","code_sha256_prefix":"0700b13f24276bd8","mcp_get_code":{"code_sha256":"0700b13f24276bd8"}},{"arxiv_id":"2601.17130","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-17130","title":"Impact of Graph Structure on Membership-Inference Risk for Graph Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"PriXAI/GraphStructurePrivacyAnalysis-public","path":"utils/plot_3panel_attack_test_sizes.py","file_url":"https://github.com/PriXAI/GraphStructurePrivacyAnalysis-public/blob/HEAD/utils/plot_3panel_attack_test_sizes.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8d7535d6176fe33f","code_sha256_prefix":"8d7535d6176fe33f","mcp_get_code":{"code_sha256":"8d7535d6176fe33f"}},{"arxiv_id":"2601.16644","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16644","title":"Sycophancy Hides Linearly in the Attention Heads","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"rifoagenadi/sycophancy","path":"extension/metrics.py","file_url":"https://github.com/rifoagenadi/sycophancy/blob/HEAD/extension/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, rifoagenadi/sycophancy when it was checked","code_sha256":"43313c83caddac01","code_sha256_prefix":"43313c83caddac01","mcp_get_code":{"code_sha256":"43313c83caddac01"}},{"arxiv_id":"2510.27497","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-27497","title":"InertialAR: Autoregressive 3D Molecule Generation with Inertial Frames","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"HaoruiLi46/InertialAR","path":"InertialAR/config.py","file_url":"https://github.com/HaoruiLi46/InertialAR/blob/HEAD/InertialAR/config.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, HaoruiLi46/InertialAR when it was checked","code_sha256":"afdc84598c74bff9","code_sha256_prefix":"afdc84598c74bff9","mcp_get_code":{"code_sha256":"afdc84598c74bff9"}}],"record_sha256":"9d591d14b4e45e4b19c8d58e03d04740fb0aa011ccfa9cf7abe56c7b0027fd08","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}