{"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/criticnetwork","entry":"CriticNetwork","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":5,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":11,"n_samples_ran":6,"n_samples_constructed":6,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":5,"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":5},"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":"2603.24366","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-24366","title":"CoordLight: Learning Decentralized Coordination for Network-Wide Traffic Signal Control","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"marmotlab/CoordLight","path":"Models/CoordLightModel.py","file_url":"https://github.com/marmotlab/CoordLight/blob/HEAD/Models/CoordLightModel.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":"bda7507c3cc10545","code_sha256_prefix":"bda7507c3cc10545","mcp_get_code":{"code_sha256":"bda7507c3cc10545"}},{"arxiv_id":"2506.08417","arxiv_id_is_arxiv":true,"paper":"/paper/offline-rl-with-smooth-ood-generalization-in","title":"Offline RL with Smooth OOD Generalization in Convex Hull and its Neighborhood","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yqpqry/sqog","path":"SQOG.py","file_url":"https://github.com/yqpqry/sqog/blob/HEAD/SQOG.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, yqpqry/sqog when it was checked","code_sha256":"0c9976aa09f749fe","code_sha256_prefix":"0c9976aa09f749fe","mcp_get_code":{"code_sha256":"0c9976aa09f749fe"}},{"arxiv_id":"2211.03413","arxiv_id_is_arxiv":true,"paper":"/paper/max-min-off-policy-actor-critic-method","title":"Max-Min Off-Policy Actor-Critic Method Focusing on Worst-Case Robustness to Model Misspecification","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akimotolab/m2td3","path":"M2TD3/m2td3.py","file_url":"https://github.com/akimotolab/m2td3/blob/HEAD/M2TD3/m2td3.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, akimotolab/m2td3 when it was checked","code_sha256":"a72ab09853236a35","code_sha256_prefix":"a72ab09853236a35","mcp_get_code":{"code_sha256":"a72ab09853236a35"}},{"arxiv_id":"1706.02275","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baradist/multiagent-particle-envs","path":"multiagent/ddpg/ddpg_agent.py","file_url":"https://github.com/baradist/multiagent-particle-envs/blob/HEAD/multiagent/ddpg/ddpg_agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"619856d2049bc612","code_sha256_prefix":"619856d2049bc612","mcp_get_code":{"code_sha256":"619856d2049bc612"}},{"arxiv_id":"1706.02275","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"philtabor/Multi-Agent-Deep-Deterministic-Policy-Gradients","path":"maddpg.py","file_url":"https://github.com/philtabor/Multi-Agent-Deep-Deterministic-Policy-Gradients/blob/HEAD/maddpg.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, philtabor/Multi-Agent-Deep-Deterministic-Policy-Gradients when it was checked","code_sha256":"1a6507f0b27d66e3","code_sha256_prefix":"1a6507f0b27d66e3","mcp_get_code":{"code_sha256":"1a6507f0b27d66e3"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sliao-mi-luku/DeepRL-multiple-agents-tennis-udacity-drlnd-p3","path":"maddpgAgent.py","file_url":"https://github.com/sliao-mi-luku/DeepRL-multiple-agents-tennis-udacity-drlnd-p3/blob/HEAD/maddpgAgent.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, sliao-mi-luku/DeepRL-multiple-agents-tennis-udacity-drlnd-p3 when it was checked","code_sha256":"b796e48c52beebc5","code_sha256_prefix":"b796e48c52beebc5","mcp_get_code":{"code_sha256":"b796e48c52beebc5"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"T3chy/DDPG","path":"ddpg_torch.py","file_url":"https://github.com/T3chy/DDPG/blob/HEAD/ddpg_torch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, T3chy/DDPG, is not in the permissive set Syntology serves inline","code_sha256":"c64a46f5ad45b01a","code_sha256_prefix":"c64a46f5ad45b01a","mcp_get_code":{"code_sha256":"c64a46f5ad45b01a"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KelvinYang0320/deepbots-panda","path":"Panda_RL/controllers/robot_supervisor_manager/agent/ddpg.py","file_url":"https://github.com/KelvinYang0320/deepbots-panda/blob/HEAD/Panda_RL/controllers/robot_supervisor_manager/agent/ddpg.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":"6429748a5267bb8a","code_sha256_prefix":"6429748a5267bb8a","mcp_get_code":{"code_sha256":"6429748a5267bb8a"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YoUNG824/DDPG","path":"ddpg.py","file_url":"https://github.com/YoUNG824/DDPG/blob/HEAD/ddpg.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":"ebdd58004bdf82fd","code_sha256_prefix":"ebdd58004bdf82fd","mcp_get_code":{"code_sha256":"ebdd58004bdf82fd"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bmeyers/VirtualMicrogridSegmentation","path":"virtual_microgrids/algorithms/ddpg.py","file_url":"https://github.com/bmeyers/VirtualMicrogridSegmentation/blob/HEAD/virtual_microgrids/algorithms/ddpg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4644458fd0a4374e","code_sha256_prefix":"4644458fd0a4374e","mcp_get_code":{"code_sha256":"4644458fd0a4374e"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samuelmat19/DDPG-tf2","path":"src/model.py","file_url":"https://github.com/samuelmat19/DDPG-tf2/blob/HEAD/src/model.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":"6bb81ff3c30fb32a","code_sha256_prefix":"6bb81ff3c30fb32a","mcp_get_code":{"code_sha256":"6bb81ff3c30fb32a"}}],"record_sha256":"c172443a22180352b788bb1f00d13995238aba5105977aecb836957fa6f58426","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}