{"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/take","entry":"take","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":6,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"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":"2605.18959","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18959","title":"Hyrax: An Extensible Framework for Rapid ML Experimentation and Unsupervised Discovery in the Era of Rubin, Roman, and Euclid","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"more-itertools/more-itertools","path":"more_itertools/recipes.py","file_url":"https://github.com/more-itertools/more-itertools/blob/HEAD/more_itertools/recipes.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"156b3c696d0bc8d5","code_sha256_prefix":"156b3c696d0bc8d5","mcp_get_code":{"code_sha256":"156b3c696d0bc8d5"}},{"arxiv_id":"2407.14985","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-v-s-memorization-tracing","title":"Generalization v.s. Memorization: Tracing Language Models' Capabilities Back to Pretraining Data","date":"2024-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EleutherAI/the-pile","path":"the_pile/pile.py","file_url":"https://github.com/EleutherAI/the-pile/blob/HEAD/the_pile/pile.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7ed0726edbb13bb5","code_sha256_prefix":"7ed0726edbb13bb5","mcp_get_code":{"code_sha256":"7ed0726edbb13bb5"}},{"arxiv_id":"2404.00152","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-fly-definition-augmentation-of-llms","title":"On-the-fly Definition Augmentation of LLMs for Biomedical NER","date":"2024-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/beacon","path":"finetuning_data/conll_formatting.py","file_url":"https://github.com/allenai/beacon/blob/HEAD/finetuning_data/conll_formatting.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"93075ac4da9d7fb7","code_sha256_prefix":"93075ac4da9d7fb7","mcp_get_code":{"code_sha256":"93075ac4da9d7fb7"}},{"arxiv_id":"2311.08385","arxiv_id_is_arxiv":true,"paper":"/paper/choire-characterizing-and-predicting-human","title":"Aligning Large Language Models with Human Opinions through Persona Selection and Value--Belief--Norm Reasoning","date":"2023-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dxlong2000/coo","path":"src/gptinference/utils.py","file_url":"https://github.com/dxlong2000/coo/blob/HEAD/src/gptinference/utils.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, dxlong2000/coo when it was checked","code_sha256":"91a346890319e7f8","code_sha256_prefix":"91a346890319e7f8","mcp_get_code":{"code_sha256":"91a346890319e7f8"}},{"arxiv_id":"2201.07311","arxiv_id_is_arxiv":true,"paper":"/paper/datasheet-for-the-pile","title":"Datasheet for the Pile","date":"2022-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"7ed0726edbb13bb5","code_sha256_prefix":"7ed0726edbb13bb5","mcp_get_code":{"code_sha256":"7ed0726edbb13bb5"}},{"arxiv_id":"2111.12193","arxiv_id_is_arxiv":true,"paper":"/paper/multiset-equivariant-set-prediction-with-1","title":"Multiset-Equivariant Set Prediction with Approximate Implicit Differentiation","date":"2021-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davzha/multiset-equivariance","path":"analysis/plot-clevr.py","file_url":"https://github.com/davzha/multiset-equivariance/blob/HEAD/analysis/plot-clevr.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","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, davzha/multiset-equivariance when it was checked","code_sha256":"861885a08ceef677","code_sha256_prefix":"861885a08ceef677","mcp_get_code":{"code_sha256":"861885a08ceef677"}},{"arxiv_id":"2101.00027","arxiv_id_is_arxiv":true,"paper":"/paper/the-pile-an-800gb-dataset-of-diverse-text-for","title":"The Pile: An 800GB Dataset of Diverse Text for Language Modeling","date":"2020-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EleutherAI/The-Pile","path":"the_pile/pile.py","file_url":"https://github.com/EleutherAI/The-Pile/blob/HEAD/the_pile/pile.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7ed0726edbb13bb5","code_sha256_prefix":"7ed0726edbb13bb5","mcp_get_code":{"code_sha256":"7ed0726edbb13bb5"}},{"arxiv_id":"1906.06565","arxiv_id_is_arxiv":true,"paper":"/paper/deep-set-prediction-networks","title":"Deep Set Prediction Networks","date":"2019-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cyanogenoid/dspn","path":"dspn/plot-state-progress.py","file_url":"https://github.com/Cyanogenoid/dspn/blob/HEAD/dspn/plot-state-progress.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from davzha/multiset-equivariance, and GitHub detected no licence in that repository when it was checked","code_sha256":"861885a08ceef677","code_sha256_prefix":"861885a08ceef677","mcp_get_code":{"code_sha256":"861885a08ceef677"}}],"record_sha256":"80ac36aba200750f216bef13ee0888c8bf162d2aac35992dd13a8267a33381fc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}