{"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/placeholder","entry":"placeholder","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":1,"n_papers_ran_no_instrument_failure":1,"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":5,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":1,"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":1,"unverified":4},"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":"2401.14758","arxiv_id_is_arxiv":true,"paper":"/paper/off-policy-primal-dual-safe-reinforcement","title":"Off-Policy Primal-Dual Safe Reinforcement Learning","date":"2024-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlgTUDelft/WCSAC","path":"wc_sac/sac/wcsac.py","file_url":"https://github.com/AlgTUDelft/WCSAC/blob/HEAD/wc_sac/sac/wcsac.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":"17b03c462ce92576","code_sha256_prefix":"17b03c462ce92576","mcp_get_code":{"code_sha256":"17b03c462ce92576"}},{"arxiv_id":"2302.02738","arxiv_id_is_arxiv":true,"paper":"/paper/increase-inductive-graph-representation","title":"INCREASE: Inductive Graph Representation Learning for Spatio-Temporal Kriging","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengchuanpan/increase","path":"Beijing/INCREASE/model.py","file_url":"https://github.com/zhengchuanpan/increase/blob/HEAD/Beijing/INCREASE/model.py","status":"ran","verification_level":1,"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":"a78bcd06d14fe429","code_sha256_prefix":"a78bcd06d14fe429","mcp_get_code":{"code_sha256":"a78bcd06d14fe429"}},{"arxiv_id":"2302.02738","arxiv_id_is_arxiv":true,"paper":"/paper/increase-inductive-graph-representation","title":"INCREASE: Inductive Graph Representation Learning for Spatio-Temporal Kriging","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengchuanpan/increase","path":"METR-LA/INCREASE/model.py","file_url":"https://github.com/zhengchuanpan/increase/blob/HEAD/METR-LA/INCREASE/model.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":"9659197a9a3f0077","code_sha256_prefix":"9659197a9a3f0077","mcp_get_code":{"code_sha256":"9659197a9a3f0077"}},{"arxiv_id":"2302.00808","arxiv_id_is_arxiv":true,"paper":"/paper/average-constrained-policy-optimization","title":"ACPO: A Policy Optimization Algorithm for Average MDPs with Constraints","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/safety-starter-agents","path":"safe_rl/sac/sac.py","file_url":"https://github.com/openai/safety-starter-agents/blob/HEAD/safe_rl/sac/sac.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":"17b03c462ce92576","code_sha256_prefix":"17b03c462ce92576","mcp_get_code":{"code_sha256":"17b03c462ce92576"}},{"arxiv_id":"1911.08415","arxiv_id_is_arxiv":true,"paper":"/paper/gman-a-graph-multi-attention-network-for","title":"GMAN: A Graph Multi-Attention Network for Traffic Prediction","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengchuanpan/GMAN","path":"METR/model.py","file_url":"https://github.com/zhengchuanpan/GMAN/blob/HEAD/METR/model.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":"87a81a456578efcc","code_sha256_prefix":"87a81a456578efcc","mcp_get_code":{"code_sha256":"87a81a456578efcc"}},{"arxiv_id":"1911.08415","arxiv_id_is_arxiv":true,"paper":"/paper/gman-a-graph-multi-attention-network-for","title":"GMAN: A Graph Multi-Attention Network for Traffic Prediction","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengchuanpan/GMAN","path":"PeMS/model.py","file_url":"https://github.com/zhengchuanpan/GMAN/blob/HEAD/PeMS/model.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":"c11afb5b81b2e8bd","code_sha256_prefix":"c11afb5b81b2e8bd","mcp_get_code":{"code_sha256":"c11afb5b81b2e8bd"}},{"arxiv_id":"1910.07224","arxiv_id_is_arxiv":true,"paper":"/paper/teacher-algorithms-for-curriculum-learning-of","title":"Teacher algorithms for curriculum learning of Deep RL in continuously parameterized environments","date":"2019-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flowersteam/teachDeepRL","path":"teachDRL/spinup/algos/ddpg/core.py","file_url":"https://github.com/flowersteam/teachDeepRL/blob/HEAD/teachDRL/spinup/algos/ddpg/core.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":"17b03c462ce92576","code_sha256_prefix":"17b03c462ce92576","mcp_get_code":{"code_sha256":"17b03c462ce92576"}},{"arxiv_id":"1812.02690","arxiv_id_is_arxiv":true,"paper":"/paper/provably-efficient-maximum-entropy","title":"Provably Efficient Maximum Entropy Exploration","date":"2018-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abbyvansoest/maxent","path":"core.py","file_url":"https://github.com/abbyvansoest/maxent/blob/HEAD/core.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":"17b03c462ce92576","code_sha256_prefix":"17b03c462ce92576","mcp_get_code":{"code_sha256":"17b03c462ce92576"}},{"arxiv_id":"1802.09477","arxiv_id_is_arxiv":true,"paper":"/paper/addressing-function-approximation-error-in","title":"Addressing Function Approximation Error in Actor-Critic Methods","date":"2018-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robintyh1/icml2021-pengqlambda","path":"spinup/algos/tf1/td3_peng/core.py","file_url":"https://github.com/robintyh1/icml2021-pengqlambda/blob/HEAD/spinup/algos/tf1/td3_peng/core.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, robintyh1/icml2021-pengqlambda, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"17b03c462ce92576","code_sha256_prefix":"17b03c462ce92576","mcp_get_code":{"code_sha256":"17b03c462ce92576"}}],"record_sha256":"c5c0bdfe73c8fb51024cf39280c5c1f8a0a9030bd31eebf935d5615ceff18798","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}