{"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-columns","entry":"normalize_columns","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":4,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":5,"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":4,"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":"2608.11327","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-11327","title":"Long-Horizon Forecasting of Complete Financial Statements with Forma","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"forma-lab-mccombs/proforma-20q","path":"src/proforma20q/schema.py","file_url":"https://github.com/forma-lab-mccombs/proforma-20q/blob/HEAD/src/proforma20q/schema.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4e410c00366e3314","code_sha256_prefix":"4e410c00366e3314","mcp_get_code":{"code_sha256":"4e410c00366e3314"}},{"arxiv_id":"2608.07436","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-07436","title":"Post-Grokking Collapse at the Representation-Readout Interface in Muon-Trained Transformers","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Na00s/muon-grokking","path":"analysis/compare_grokking_speed.py","file_url":"https://github.com/Na00s/muon-grokking/blob/HEAD/analysis/compare_grokking_speed.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, Na00s/muon-grokking when it was checked","code_sha256":"7986cea2cd3e4a4b","code_sha256_prefix":"7986cea2cd3e4a4b","mcp_get_code":{"code_sha256":"7986cea2cd3e4a4b"}},{"arxiv_id":"2603.07567","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-07567","title":"Revisiting the LiRA Membership Inference Attack Under Realistic Assumptions","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"najeebjebreel/lira_analysis","path":"comprehensive_analysis/loss_ratio_tpr.py","file_url":"https://github.com/najeebjebreel/lira_analysis/blob/HEAD/comprehensive_analysis/loss_ratio_tpr.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4263be4e1529343","code_sha256_prefix":"b4263be4e1529343","mcp_get_code":{"code_sha256":"b4263be4e1529343"}},{"arxiv_id":"2410.13708","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-role-of-attention-heads-in-large","title":"On the Role of Attention Heads in Large Language Model Safety","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ydyjya/SafetyHeadAttribution","path":"lib/Sahara/svd.py","file_url":"https://github.com/ydyjya/SafetyHeadAttribution/blob/HEAD/lib/Sahara/svd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, ydyjya/SafetyHeadAttribution when it was checked","code_sha256":"4c67b494ef77df17","code_sha256_prefix":"4c67b494ef77df17","mcp_get_code":{"code_sha256":"4c67b494ef77df17"}},{"arxiv_id":"1906.07906","arxiv_id_is_arxiv":true,"paper":"/paper/discovery-of-physics-from-data-universal-laws","title":"Discovery of Physics from Data: Universal Laws and Discrepancies","date":"2019-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"briandesilva/discovery-of-physics-from-data","path":"code/helpers/utils.py","file_url":"https://github.com/briandesilva/discovery-of-physics-from-data/blob/HEAD/code/helpers/utils.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":"042df78bb2bdf5bb","code_sha256_prefix":"042df78bb2bdf5bb","mcp_get_code":{"code_sha256":"042df78bb2bdf5bb"}}],"record_sha256":"ecc863a871ab4b02d5e3aa6d5113c437e1019b3637402d4f5d8065fb18a1516d","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}