{"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-values","entry":"get_values","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":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":1,"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":1,"ran_fixture":0,"ran":2,"unverified":3},"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":"2406.11911","arxiv_id_is_arxiv":true,"paper":"/paper/a-notion-of-complexity-for-theory-of-mind-via","title":"A Notion of Complexity for Theory of Mind via Discrete World Models","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flecart/complexity-tom-dwm","path":"main/tot_prompt.py","file_url":"https://github.com/flecart/complexity-tom-dwm/blob/HEAD/main/tot_prompt.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":"d082501c44608619","code_sha256_prefix":"d082501c44608619","mcp_get_code":{"code_sha256":"d082501c44608619"}},{"arxiv_id":"2310.04668","arxiv_id_is_arxiv":true,"paper":"/paper/label-free-node-classification-on-graphs-with","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pmernyei/wiki-cs-dataset","path":"data_processing/pyscripts/mysqldump_to_csv.py","file_url":"https://github.com/pmernyei/wiki-cs-dataset/blob/HEAD/data_processing/pyscripts/mysqldump_to_csv.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":"2b9ee849ce40d859","code_sha256_prefix":"2b9ee849ce40d859","mcp_get_code":{"code_sha256":"2b9ee849ce40d859"}},{"arxiv_id":"2307.12375","arxiv_id_is_arxiv":true,"paper":"/paper/in-context-learning-in-large-language-models","title":"In-Context Learning Learns Label Relationships but Is Not Conventional Learning","date":"2023-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jlko/in_context_learning","path":"llm/plot_utils.py","file_url":"https://github.com/jlko/in_context_learning/blob/HEAD/llm/plot_utils.py","status":"unverified","verification_level":0,"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, jlko/in_context_learning when it was checked","code_sha256":"a7b6896a43973ffb","code_sha256_prefix":"a7b6896a43973ffb","mcp_get_code":{"code_sha256":"a7b6896a43973ffb"}},{"arxiv_id":"2304.04782","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-from-passive-data-via","title":"Reinforcement Learning from Passive Data via Latent Intentions","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dibyaghosh/icvf_release","path":"experiments/antmaze/train_icvf.py","file_url":"https://github.com/dibyaghosh/icvf_release/blob/HEAD/experiments/antmaze/train_icvf.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":"a2628498c8976d46","code_sha256_prefix":"a2628498c8976d46","mcp_get_code":{"code_sha256":"a2628498c8976d46"}},{"arxiv_id":"2206.01079","arxiv_id_is_arxiv":true,"paper":"/paper/when-does-return-conditioned-supervised","title":"When does return-conditioned supervised learning work for offline reinforcement learning?","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidbrandfonbrener/rcsl-paper","path":"jax_continuous_rl/jaxrl/networks/rvs_critics.py","file_url":"https://github.com/davidbrandfonbrener/rcsl-paper/blob/HEAD/jax_continuous_rl/jaxrl/networks/rvs_critics.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":"37e948f523448090","code_sha256_prefix":"37e948f523448090","mcp_get_code":{"code_sha256":"37e948f523448090"}},{"arxiv_id":"2203.06904","arxiv_id_is_arxiv":true,"paper":"/paper/delta-tuning-a-comprehensive-study-of","title":"Delta Tuning: A Comprehensive Study of Parameter Efficient Methods for Pre-trained Language Models","date":"2022-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/opendelta","path":"opendelta/auto_delta.py","file_url":"https://github.com/thunlp/opendelta/blob/HEAD/opendelta/auto_delta.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61752df4de80a655","code_sha256_prefix":"61752df4de80a655","mcp_get_code":{"code_sha256":"61752df4de80a655"}}],"record_sha256":"88c5b839a9e7f99a5d61ae11078e5b6ed247e7ee589ff5598a08e55f2a4e5ca8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}