{"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/get-model-family","entry":"get_model_family","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":4,"n_papers_ran_instrument_only":0,"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":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"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":"2607.19317","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-19317","title":"Circuit Discovery, Evaluation, and Application Toolkit for Mechanistic Interpretability","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Lexsi-Labs/CircuitKIT","path":"src/circuitkit/applications/arch_registry.py","file_url":"https://github.com/Lexsi-Labs/CircuitKIT/blob/HEAD/src/circuitkit/applications/arch_registry.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Lexsi-Labs/CircuitKIT (NOASSERTION)","code_sha256":"202a8ec5c82de84c","code_sha256_prefix":"202a8ec5c82de84c","mcp_get_code":{"code_sha256":"202a8ec5c82de84c"}},{"arxiv_id":"2405.20947","arxiv_id_is_arxiv":true,"paper":"/paper/or-bench-an-over-refusal-benchmark-for-large","title":"OR-Bench: An Over-Refusal Benchmark for Large Language Models","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justincui03/or-bench","path":"plot.py","file_url":"https://github.com/justincui03/or-bench/blob/HEAD/plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8c4e4c1d7c7dd67d","code_sha256_prefix":"8c4e4c1d7c7dd67d","mcp_get_code":{"code_sha256":"8c4e4c1d7c7dd67d"}},{"arxiv_id":"2405.10938","arxiv_id_is_arxiv":true,"paper":"/paper/observational-scaling-laws-and-the","title":"Observational Scaling Laws and the Predictability of Language Model Performance","date":"2024-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ryoungj/ObsScaling","path":"utils/selection.py","file_url":"https://github.com/ryoungj/ObsScaling/blob/HEAD/utils/selection.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be5e108bf6b36aa5","code_sha256_prefix":"be5e108bf6b36aa5","mcp_get_code":{"code_sha256":"be5e108bf6b36aa5"}},{"arxiv_id":"2310.02207","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-represent-space-and-time","title":"Language Models Represent Space and Time","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wesg52/world-models","path":"utils.py","file_url":"https://github.com/wesg52/world-models/blob/HEAD/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":"9931b4001e67bb95","code_sha256_prefix":"9931b4001e67bb95","mcp_get_code":{"code_sha256":"9931b4001e67bb95"}},{"arxiv_id":"2305.09731","arxiv_id_is_arxiv":true,"paper":"/paper/what-in-context-learning-learns-in-context","title":"What In-Context Learning \"Learns\" In-Context: Disentangling Task Recognition and Task Learning","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/whaticllearns","path":"spb/compute_summary_stats.py","file_url":"https://github.com/princeton-nlp/whaticllearns/blob/HEAD/spb/compute_summary_stats.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":"2cc275485c860a52","code_sha256_prefix":"2cc275485c860a52","mcp_get_code":{"code_sha256":"2cc275485c860a52"}},{"arxiv_id":"2211.01834","arxiv_id_is_arxiv":true,"paper":"/paper/toward-unsupervised-outlier-model-selection","title":"Toward Unsupervised Outlier Model Selection","date":"2022-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzhao062/elect","path":"utility.py","file_url":"https://github.com/yzhao062/elect/blob/HEAD/utility.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ee8efc17fd683c52","code_sha256_prefix":"ee8efc17fd683c52","mcp_get_code":{"code_sha256":"ee8efc17fd683c52"}}],"record_sha256":"06c29b1051e9263a4c1549b60593497dba370d51a1d520b841582b7f530f9072","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}