{"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-domain","entry":"get_domain","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":11,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":6,"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":8,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":3,"n_places":11,"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":3,"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":"2608.03467","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-03467","title":"When Correct Solutions Repeat: Rarity-Aware Credit Redistribution for GRPO","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"CzZ12/When-Correct-Solutions-Repeat-Rarity-Aware-Credit-Redistribution-for-GRPO","path":"domain_config.py","file_url":"https://github.com/CzZ12/When-Correct-Solutions-Repeat-Rarity-Aware-Credit-Redistribution-for-GRPO/blob/HEAD/domain_config.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":"9984d0bb3d685c13","code_sha256_prefix":"9984d0bb3d685c13","mcp_get_code":{"code_sha256":"9984d0bb3d685c13"}},{"arxiv_id":"2607.15766","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-15766","title":"Before the Action: Benchmarking LLMs on Prospective Hypothesis Discovery","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"SKYLENAGE-AI/HypoArena","path":"basics/domain.py","file_url":"https://github.com/SKYLENAGE-AI/HypoArena/blob/HEAD/basics/domain.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, SKYLENAGE-AI/HypoArena when it was checked","code_sha256":"a2162894ffed007a","code_sha256_prefix":"a2162894ffed007a","mcp_get_code":{"code_sha256":"a2162894ffed007a"}},{"arxiv_id":"2503.13342","arxiv_id_is_arxiv":true,"paper":"/paper/valid-text-to-sql-generation-with-unification","title":"Valid Text-to-SQL Generation with Unification-based DeepStochLog","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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":"487252da3c521e4a","code_sha256_prefix":"487252da3c521e4a","mcp_get_code":{"code_sha256":"487252da3c521e4a"}},{"arxiv_id":"2306.07012","arxiv_id_is_arxiv":true,"paper":"/paper/generating-language-corrections-for-teaching","title":"Generating Language Corrections for Teaching Physical Control Tasks","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Stanford-ILIAD/corgi","path":"interfaces/data-collection-interface/utils.py","file_url":"https://github.com/Stanford-ILIAD/corgi/blob/HEAD/interfaces/data-collection-interface/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":"959205ed1d9b53ee","code_sha256_prefix":"959205ed1d9b53ee","mcp_get_code":{"code_sha256":"959205ed1d9b53ee"}},{"arxiv_id":"2211.12740","arxiv_id_is_arxiv":true,"paper":"/paper/masked-autoencoding-for-scalable-and","title":"Masked Autoencoding for Scalable and Generalizable Decision Making","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fangchenliu/maskdp_public","path":"finetune_rl.py","file_url":"https://github.com/fangchenliu/maskdp_public/blob/HEAD/finetune_rl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"41404a565ac3bb46","code_sha256_prefix":"41404a565ac3bb46","mcp_get_code":{"code_sha256":"41404a565ac3bb46"}},{"arxiv_id":"2201.13425","arxiv_id_is_arxiv":true,"paper":"/paper/don-t-change-the-algorithm-change-the-data","title":"Don't Change the Algorithm, Change the Data: Exploratory Data for Offline Reinforcement Learning","date":"2022-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"denisyarats/exorl","path":"train_offline.py","file_url":"https://github.com/denisyarats/exorl/blob/HEAD/train_offline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"41404a565ac3bb46","code_sha256_prefix":"41404a565ac3bb46","mcp_get_code":{"code_sha256":"41404a565ac3bb46"}},{"arxiv_id":"2106.12574","arxiv_id_is_arxiv":true,"paper":"/paper/deepstochlog-neural-stochastic-logic","title":"DeepStochLog: Neural Stochastic Logic Programming","date":"2021-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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":"487252da3c521e4a","code_sha256_prefix":"487252da3c521e4a","mcp_get_code":{"code_sha256":"487252da3c521e4a"}},{"arxiv_id":"2106.05042","arxiv_id_is_arxiv":true,"paper":"/paper/polynomial-magic-hermite-polynomials-for","title":"Hermite Polynomial Features for Private Data Generation","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parklabml/dp-hp","path":"dp_mehp/marginals_eval.py","file_url":"https://github.com/parklabml/dp-hp/blob/HEAD/dp_mehp/marginals_eval.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":"5a74baea61336356","code_sha256_prefix":"5a74baea61336356","mcp_get_code":{"code_sha256":"5a74baea61336356"}},{"arxiv_id":"1906.02738","arxiv_id_is_arxiv":true,"paper":"/paper/conversing-by-reading-contentful-neural","title":"Conversing by Reading: Contentful Neural Conversation with On-demand Machine Reading","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qkaren/converse_reading_cmr","path":"data/src/create_official_data.py","file_url":"https://github.com/qkaren/converse_reading_cmr/blob/HEAD/data/src/create_official_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"695aa5d2a378108f","code_sha256_prefix":"695aa5d2a378108f","mcp_get_code":{"code_sha256":"695aa5d2a378108f"}},{"arxiv_id":"1902.08858","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-action-spaces-for-reinforcement","title":"Rethinking Action Spaces for Reinforcement Learning in End-to-end Dialog Agents with Latent Variable Models","date":"2019-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snakeztc/NeuralDialog-LaRL","path":"FB/domain.py","file_url":"https://github.com/snakeztc/NeuralDialog-LaRL/blob/HEAD/FB/domain.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":"0b8bbebd022d579a","code_sha256_prefix":"0b8bbebd022d579a","mcp_get_code":{"code_sha256":"0b8bbebd022d579a"}},{"arxiv_id":"1809.08887","arxiv_id_is_arxiv":true,"paper":"/paper/spider-a-large-scale-human-labeled-dataset","title":"Spider: A Large-Scale Human-Labeled Dataset for Complex and Cross-Domain Semantic Parsing and Text-to-SQL Task","date":"2018-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ML-KULeuven/deepstochlog-lm","path":"src/task2/task2.py","file_url":"https://github.com/ML-KULeuven/deepstochlog-lm/blob/HEAD/src/task2/task2.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":"487252da3c521e4a","code_sha256_prefix":"487252da3c521e4a","mcp_get_code":{"code_sha256":"487252da3c521e4a"}}],"record_sha256":"8c22804bc980f62d1e1ce938d440315a24a073118e15f499e2a2e3f06e411278","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}