{"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/train-probe","entry":"train_probe","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":4,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":2,"ran_fixture":0,"ran":2,"unverified":2},"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":"2604.12493","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-12493","title":"Latent Planning Emerges with Scale","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"hannamw/model-planning-public","path":"animal_stories/probing.py","file_url":"https://github.com/hannamw/model-planning-public/blob/HEAD/animal_stories/probing.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":"8674d9a18fef0cbd","code_sha256_prefix":"8674d9a18fef0cbd","mcp_get_code":{"code_sha256":"8674d9a18fef0cbd"}},{"arxiv_id":"2602.07812","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-07812","title":"LLMs Know More About Numbers than They Can Say","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"VCY019/Numeracy-Probing","path":"src/train_probe_arxiv.py","file_url":"https://github.com/VCY019/Numeracy-Probing/blob/HEAD/src/train_probe_arxiv.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":"7f2582833fce5e80","code_sha256_prefix":"7f2582833fce5e80","mcp_get_code":{"code_sha256":"7f2582833fce5e80"}},{"arxiv_id":"2602.02315","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02315","title":"The Shape of Beliefs: Geometry, Dynamics, and Interventions along Representation Manifolds of Language Models' Posteriors","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"raphael-goodfire/shape-of-beliefs","path":"linear_field_probes.py","file_url":"https://github.com/raphael-goodfire/shape-of-beliefs/blob/HEAD/linear_field_probes.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, raphael-goodfire/shape-of-beliefs when it was checked","code_sha256":"24829bb892bcde80","code_sha256_prefix":"24829bb892bcde80","mcp_get_code":{"code_sha256":"24829bb892bcde80"}},{"arxiv_id":"2311.00863","arxiv_id_is_arxiv":true,"paper":"/paper/training-dynamics-of-contextual-n-grams-in","title":"Training Dynamics of Contextual N-Grams in Language Models","date":"2023-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luciaquirke/contextual-ngrams","path":"generate_checkpoint_probe_data.py","file_url":"https://github.com/luciaquirke/contextual-ngrams/blob/HEAD/generate_checkpoint_probe_data.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, luciaquirke/contextual-ngrams when it was checked","code_sha256":"61f8653dac2da1f9","code_sha256_prefix":"61f8653dac2da1f9","mcp_get_code":{"code_sha256":"61f8653dac2da1f9"}},{"arxiv_id":"2305.10204","arxiv_id_is_arxiv":true,"paper":"/paper/shielded-representations-protecting-sensitive","title":"Shielded Representations: Protecting Sensitive Attributes Through Iterative Gradient-Based Projection","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"technion-cs-nlp/igbp_nonlinear-removal","path":"src/debias_representation.py","file_url":"https://github.com/technion-cs-nlp/igbp_nonlinear-removal/blob/HEAD/src/debias_representation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, technion-cs-nlp/igbp_nonlinear-removal when it was checked","code_sha256":"a0117f0eefa663ec","code_sha256_prefix":"a0117f0eefa663ec","mcp_get_code":{"code_sha256":"a0117f0eefa663ec"}},{"arxiv_id":"2024.findings-emnlp.918","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.918","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CLMBRs/targeted-xlms","path":"src/eval_probe.py","file_url":"https://github.com/CLMBRs/targeted-xlms/blob/HEAD/src/eval_probe.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":"2bc11e1614508b49","code_sha256_prefix":"2bc11e1614508b49","mcp_get_code":{"code_sha256":"2bc11e1614508b49"}}],"record_sha256":"59ddb0b11eee856fca4dc062b33b19503d6be85bc3c08e1393976b8ef45d0a28","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}