{"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/normalize-obs","entry":"normalize_obs","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":7,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":3,"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":"2405.03878","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-compression-speeds-up-credit","title":"Sequence Compression Speeds Up Credit Assignment in Reinforcement Learning","date":"2024-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aditya-ramesh-10/chunktd","path":"chunkers.py","file_url":"https://github.com/aditya-ramesh-10/chunktd/blob/HEAD/chunkers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9c7567fe7998ff18","code_sha256_prefix":"9c7567fe7998ff18","mcp_get_code":{"code_sha256":"9c7567fe7998ff18"}},{"arxiv_id":"2312.10812","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-act-without-actions","title":"Learning to Act without Actions","date":"2023-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"schmidtdominik/LAPO","path":"lapo/data_loader.py","file_url":"https://github.com/schmidtdominik/LAPO/blob/HEAD/lapo/data_loader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, schmidtdominik/LAPO when it was checked","code_sha256":"7a0b7ee2a602e57d","code_sha256_prefix":"7a0b7ee2a602e57d","mcp_get_code":{"code_sha256":"7a0b7ee2a602e57d"}},{"arxiv_id":"2305.09943","arxiv_id_is_arxiv":true,"paper":"/paper/demonstration-free-autonomous-reinforcement","title":"Demonstration-free Autonomous Reinforcement Learning via Implicit and Bidirectional Curriculum","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-larr/ibc_official","path":"ibc.py","file_url":"https://github.com/snu-larr/ibc_official/blob/HEAD/ibc.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, snu-larr/ibc_official when it was checked","code_sha256":"13ef231a67b07fe5","code_sha256_prefix":"13ef231a67b07fe5","mcp_get_code":{"code_sha256":"13ef231a67b07fe5"}},{"arxiv_id":"2210.13708","arxiv_id_is_arxiv":true,"paper":"/paper/marllib-extending-rllib-for-multi-agent","title":"MARLlib: A Scalable and Efficient Multi-agent Reinforcement Learning Library","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"replicable-marl/marllib","path":"marllib/envs/base_env/mamujoco.py","file_url":"https://github.com/replicable-marl/marllib/blob/HEAD/marllib/envs/base_env/mamujoco.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":"7127a59833466d3d","code_sha256_prefix":"7127a59833466d3d","mcp_get_code":{"code_sha256":"7127a59833466d3d"}},{"arxiv_id":"1906.01202","arxiv_id_is_arxiv":true,"paper":"/paper/learning-transferable-cooperative-behavior-in","title":"Learning Transferable Cooperative Behavior in Multi-Agent Teams","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sumitsk/matrl","path":"utils.py","file_url":"https://github.com/sumitsk/matrl/blob/HEAD/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":"ee2205a763af3ea4","code_sha256_prefix":"ee2205a763af3ea4","mcp_get_code":{"code_sha256":"ee2205a763af3ea4"}},{"arxiv_id":"1805.12114","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-in-a-handful-of","title":"Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Models","date":"2018-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ByMic/PETS","path":"utils/ensemble.py","file_url":"https://github.com/ByMic/PETS/blob/HEAD/utils/ensemble.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, ByMic/PETS when it was checked","code_sha256":"f1b4f8263ddf0967","code_sha256_prefix":"f1b4f8263ddf0967","mcp_get_code":{"code_sha256":"f1b4f8263ddf0967"}},{"arxiv_id":"1702.02429","arxiv_id_is_arxiv":true,"paper":"/paper/trainable-greedy-decoding-for-neural-machine","title":"Trainable Greedy Decoding for Neural Machine Translation","date":"2017-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kyunghyuncho/rl-pong","path":"utils.py","file_url":"https://github.com/kyunghyuncho/rl-pong/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1c1c1a958ec013c9","code_sha256_prefix":"1c1c1a958ec013c9","mcp_get_code":{"code_sha256":"1c1c1a958ec013c9"}}],"record_sha256":"8fabb1b83e62930ff0941962297d560666de0b3013027de0e6d403359e2dc375","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}