{"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/ortho-init","entry":"ortho_init","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":12,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":7,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":4,"n_places_pointer_only_link_open":2,"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":1,"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":"2403.10760","arxiv_id_is_arxiv":true,"paper":"/paper/corn-contact-based-object-representation-for","title":"CORN: Contact-based Object Representation for Nonprehensile Manipulation of General Unseen Objects","date":null,"month_inferred_from_arxiv_id":"2024-03","title_source":"archive","repo":"contact-non-prehensile/corn","path":"pkm/src/pkm/models/rl/nets.py","file_url":"https://github.com/contact-non-prehensile/corn/blob/HEAD/pkm/src/pkm/models/rl/nets.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":"f08bd01d6576b1b1","code_sha256_prefix":"f08bd01d6576b1b1","mcp_get_code":{"code_sha256":"f08bd01d6576b1b1"}},{"arxiv_id":"2111.03941","arxiv_id_is_arxiv":true,"paper":"/paper/time-discretization-invariant-safe-action","title":"Time Discretization-Invariant Safe Action Repetition for Policy Gradient Methods","date":"2021-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"artberryx/SAR","path":"sb/stable_baselines/common/tf_layers.py","file_url":"https://github.com/artberryx/SAR/blob/HEAD/sb/stable_baselines/common/tf_layers.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":"90935b4a6d887717","code_sha256_prefix":"90935b4a6d887717","mcp_get_code":{"code_sha256":"90935b4a6d887717"}},{"arxiv_id":"2105.13345","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-intrinsic-motivation-for","title":"Adversarial Intrinsic Motivation for Reinforcement Learning","date":"2021-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iDurugkar/adversarial-intrinsic-motivation","path":"stable_baselines/common/tf_layers.py","file_url":"https://github.com/iDurugkar/adversarial-intrinsic-motivation/blob/HEAD/stable_baselines/common/tf_layers.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":"90935b4a6d887717","code_sha256_prefix":"90935b4a6d887717","mcp_get_code":{"code_sha256":"90935b4a6d887717"}},{"arxiv_id":"2105.09452","arxiv_id_is_arxiv":true,"paper":"/paper/minimum-delay-adaptation-in-non-stationary","title":"Minimum-Delay Adaptation in Non-Stationary Reinforcement Learning via Online High-Confidence Change-Point Detection","date":"2021-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LucasAlegre/mbcd","path":"mbcd/models/fc.py","file_url":"https://github.com/LucasAlegre/mbcd/blob/HEAD/mbcd/models/fc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0cb9b8299fe38738","code_sha256_prefix":"0cb9b8299fe38738","mcp_get_code":{"code_sha256":"0cb9b8299fe38738"}},{"arxiv_id":"2010.07916","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-trust-region-policy-optimization","title":"Multi-Agent Trust Region Policy Optimization","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hepengli/matrpo","path":"matrpo/common/models.py","file_url":"https://github.com/hepengli/matrpo/blob/HEAD/matrpo/common/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0cb9b8299fe38738","code_sha256_prefix":"0cb9b8299fe38738","mcp_get_code":{"code_sha256":"0cb9b8299fe38738"}},{"arxiv_id":"2010.07777","arxiv_id_is_arxiv":true,"paper":"/paper/a-game-theoretic-analysis-of-networked-system","title":"A game-theoretic analysis of networked system control for common-pool resource management using multi-agent reinforcement learning","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"instadeepai/EGTA-NMARL","path":"egta/agents/utils.py","file_url":"https://github.com/instadeepai/EGTA-NMARL/blob/HEAD/egta/agents/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 cts198859/deeprl_network, and GitHub detected no licence in that repository when it was checked","code_sha256":"6583a667fee3e221","code_sha256_prefix":"6583a667fee3e221","mcp_get_code":{"code_sha256":"6583a667fee3e221"}},{"arxiv_id":"2004.01339","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-reinforcement-learning-for-2","title":"Multi-agent Reinforcement Learning for Networked System Control","date":"2020-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cts198859/deeprl_network","path":"agents/models.py","file_url":"https://github.com/cts198859/deeprl_network/blob/HEAD/agents/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, cts198859/deeprl_network when it was checked","code_sha256":"6583a667fee3e221","code_sha256_prefix":"6583a667fee3e221","mcp_get_code":{"code_sha256":"6583a667fee3e221"}},{"arxiv_id":"2001.03415","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-interactions-modeling-with-1","title":"Multi-Agent Interactions Modeling with Correlated Policies","date":"2020-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apexrl/CoDAIL","path":"multi-agent-irl/irl/mack/kfac_discriminator_codail.py","file_url":"https://github.com/apexrl/CoDAIL/blob/HEAD/multi-agent-irl/irl/mack/kfac_discriminator_codail.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0cb9b8299fe38738","code_sha256_prefix":"0cb9b8299fe38738","mcp_get_code":{"code_sha256":"0cb9b8299fe38738"}},{"arxiv_id":"1903.04527","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-deep-reinforcement-learning-for-2","title":"Multi-Agent Deep Reinforcement Learning for Large-scale Traffic Signal Control","date":"2019-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cts198859/deeprl_signal_control","path":"agents/utils.py","file_url":"https://github.com/cts198859/deeprl_signal_control/blob/HEAD/agents/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 cts198859/deeprl_network, and GitHub detected no licence in that repository when it was checked","code_sha256":"6583a667fee3e221","code_sha256_prefix":"6583a667fee3e221","mcp_get_code":{"code_sha256":"6583a667fee3e221"}},{"arxiv_id":"1801.01290","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yhisaki/average-reward-drl","path":"average_reward_drl/algorithms/sac.py","file_url":"https://github.com/yhisaki/average-reward-drl/blob/HEAD/average_reward_drl/algorithms/sac.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, yhisaki/average-reward-drl when it was checked","code_sha256":"5c5bce3523ed4d69","code_sha256_prefix":"5c5bce3523ed4d69","mcp_get_code":{"code_sha256":"5c5bce3523ed4d69"}},{"arxiv_id":"1710.11417","arxiv_id_is_arxiv":true,"paper":"/paper/treeqn-and-atreec-differentiable-tree","title":"TreeQN and ATreeC: Differentiable Tree-Structured Models for Deep Reinforcement Learning","date":"2017-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oxwhirl/treeqn","path":"treeqn/utils/pytorch_utils.py","file_url":"https://github.com/oxwhirl/treeqn/blob/HEAD/treeqn/utils/pytorch_utils.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":"aec7854e1d8f8fc2","code_sha256_prefix":"aec7854e1d8f8fc2","mcp_get_code":{"code_sha256":"aec7854e1d8f8fc2"}},{"arxiv_id":"1602.01783","arxiv_id_is_arxiv":true,"paper":"/paper/asynchronous-methods-for-deep-reinforcement","title":"Asynchronous Methods for Deep Reinforcement Learning","date":"2016-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qihongl/demo-advantage-actor-critic","path":"src/models/_A2C_discrete.py","file_url":"https://github.com/qihongl/demo-advantage-actor-critic/blob/HEAD/src/models/_A2C_discrete.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":"3f6057b22a1416fa","code_sha256_prefix":"3f6057b22a1416fa","mcp_get_code":{"code_sha256":"3f6057b22a1416fa"}}],"record_sha256":"ce720ff16ed13ebaa9bd3caaacd11283e222c946a4757913712661e8e37e02ac","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}