{"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/categorical","entry":"Categorical","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":6,"n_papers_ran_no_instrument_failure":6,"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":6,"n_samples_constructed":4,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":4,"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":6,"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":"2402.02097","arxiv_id_is_arxiv":true,"paper":"/paper/settling-decentralized-multi-agent","title":"Settling Decentralized Multi-Agent Coordinated Exploration by Novelty Sharing","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sigmabm/mace","path":"src/algo/r_mappo/hdd_net.py","file_url":"https://github.com/sigmabm/mace/blob/HEAD/src/algo/r_mappo/hdd_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sigmabm/mace when it was checked","code_sha256":"7e51bfa5785fa3e2","code_sha256_prefix":"7e51bfa5785fa3e2","mcp_get_code":{"code_sha256":"7e51bfa5785fa3e2"}},{"arxiv_id":"2309.08138","arxiv_id_is_arxiv":true,"paper":"/paper/find-what-you-want-learning-demand-1","title":"Find What You Want: Learning Demand-conditioned Object Attribute Space for Demand-driven Navigation","date":"2023-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whcpumpkin/demand-driven-navigation","path":"agent.py","file_url":"https://github.com/whcpumpkin/demand-driven-navigation/blob/HEAD/agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, whcpumpkin/demand-driven-navigation when it was checked","code_sha256":"e14269a86b6d505a","code_sha256_prefix":"e14269a86b6d505a","mcp_get_code":{"code_sha256":"e14269a86b6d505a"}},{"arxiv_id":"2011.01928","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-to-new-actions-in-1","title":"Generalization to New Actions in Reinforcement Learning","date":"2020-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clvrai/new-actions-rl","path":"method/models/main_method.py","file_url":"https://github.com/clvrai/new-actions-rl/blob/HEAD/method/models/main_method.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, clvrai/new-actions-rl when it was checked","code_sha256":"2e0973cb87fadfb6","code_sha256_prefix":"2e0973cb87fadfb6","mcp_get_code":{"code_sha256":"2e0973cb87fadfb6"}},{"arxiv_id":"2004.13912","arxiv_id_is_arxiv":true,"paper":"/paper/neural-additive-models-interpretable-machine","title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","date":"2020-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fortuinlab/la-nam","path":"src/laplace_skorch/modules.py","file_url":"https://github.com/fortuinlab/la-nam/blob/HEAD/src/laplace_skorch/modules.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2c6a77de4277d87c","code_sha256_prefix":"2c6a77de4277d87c","mcp_get_code":{"code_sha256":"2c6a77de4277d87c"}},{"arxiv_id":"1802.01561","arxiv_id_is_arxiv":true,"paper":"/paper/impala-scalable-distributed-deep-rl-with","title":"IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures","date":"2018-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"villinvic/Georges","path":"training/RL.py","file_url":"https://github.com/villinvic/Georges/blob/HEAD/training/RL.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":"89ed626ce6f952a2","code_sha256_prefix":"89ed626ce6f952a2","mcp_get_code":{"code_sha256":"89ed626ce6f952a2"}},{"arxiv_id":"1707.06347","arxiv_id_is_arxiv":true,"paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JonasRSV/PPO","path":"ppo.py","file_url":"https://github.com/JonasRSV/PPO/blob/HEAD/ppo.py","status":"ran","verification_level":1,"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, JonasRSV/PPO when it was checked","code_sha256":"cc0a6d60ba0d615d","code_sha256_prefix":"cc0a6d60ba0d615d","mcp_get_code":{"code_sha256":"cc0a6d60ba0d615d"}}],"record_sha256":"5e3f30f588727c07387400a06ec4b367c40bd3d60d51cccf5f9bd891405b726e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}