{"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-rows","entry":"normalize_rows","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":5,"n_papers_ran_instrument_only":2,"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":5,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":7,"n_places_pointer_only":1,"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":1,"ran_violates":3,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"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":"2609.04105","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-04105","title":"Hardware-Aware FP4 FlashAttention-4","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MrHuff/fp4-fa4","path":"results/fp4_fa4_unified_20260801/p_format_range_diagnostic.py","file_url":"https://github.com/MrHuff/fp4-fa4/blob/HEAD/results/fp4_fa4_unified_20260801/p_format_range_diagnostic.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9bd15075d9712845","code_sha256_prefix":"9bd15075d9712845","mcp_get_code":{"code_sha256":"9bd15075d9712845"}},{"arxiv_id":"2606.10402","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10402","title":"Harnessing the Collective Intelligence of AI Agents in the Wild for New Discoveries","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"vinid/einstein-arena","path":"analysis/kissing_fingerprint_features.py","file_url":"https://github.com/vinid/einstein-arena/blob/HEAD/analysis/kissing_fingerprint_features.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"16710438886bf0d9","code_sha256_prefix":"16710438886bf0d9","mcp_get_code":{"code_sha256":"16710438886bf0d9"}},{"arxiv_id":"2605.28062","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-28062","title":"ConvMemory: A Lightweight Learned Memory Reranker, a Negative Attribution Result, and a Research-Preview Conflict Editor","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"pth2002/ConvMemory","path":"convmemory/reranker.py","file_url":"https://github.com/pth2002/ConvMemory/blob/HEAD/convmemory/reranker.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"03589bbe0a298b97","code_sha256_prefix":"03589bbe0a298b97","mcp_get_code":{"code_sha256":"03589bbe0a298b97"}},{"arxiv_id":"2605.07662","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07662","title":"Direction-Preserving Number Representations","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"bardia01/Direction-Preserving-Number-Representations","path":"Experiments/src/utils.py","file_url":"https://github.com/bardia01/Direction-Preserving-Number-Representations/blob/HEAD/Experiments/src/utils.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":"bccecdf3cf099a03","code_sha256_prefix":"bccecdf3cf099a03","mcp_get_code":{"code_sha256":"bccecdf3cf099a03"}},{"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/markov.py","file_url":"https://github.com/SR123/LLM-text-ecosystems/blob/HEAD/src/drift_selection/markov.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"65b509daa33381f3","code_sha256_prefix":"65b509daa33381f3","mcp_get_code":{"code_sha256":"65b509daa33381f3"}},{"arxiv_id":"2602.08976","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-08976","title":"Distributionally Robust Optimization via Generative Ambiguity Modeling","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"CIGLAB-Houston/GAS-DRO","path":"Utils/utils.py","file_url":"https://github.com/CIGLAB-Houston/GAS-DRO/blob/HEAD/Utils/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b5caf6c15103b657","code_sha256_prefix":"b5caf6c15103b657","mcp_get_code":{"code_sha256":"b5caf6c15103b657"}},{"arxiv_id":"2310.15047","arxiv_id_is_arxiv":true,"paper":"/paper/meta-out-of-context-learning-in-neural","title":"Implicit meta-learning may lead language models to trust more reliable sources","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krasheninnikov/internalization","path":"activation_centroid_plotting.py","file_url":"https://github.com/krasheninnikov/internalization/blob/HEAD/activation_centroid_plotting.py","status":"ran","verification_level":1,"contract_check":null,"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, krasheninnikov/internalization when it was checked","code_sha256":"6918fbf0270593a0","code_sha256_prefix":"6918fbf0270593a0","mcp_get_code":{"code_sha256":"6918fbf0270593a0"}}],"record_sha256":"30bb36a89337de6950c3e872ed3814882ae26cd475751be842324bc770900b8a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}