{"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/buffer","entry":"Buffer","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":23,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":18,"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":26,"n_samples_ran":19,"n_samples_constructed":16,"n_samples_ran_checked":19,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":26,"n_places_pointer_only":11,"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":19,"unverified":7},"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":"2503.14564","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2503.14564","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":null,"repo":"flash1803/EATTA","path":"classification/methods/eatta.py","file_url":"https://github.com/flash1803/EATTA/blob/HEAD/classification/methods/eatta.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":"c805e78993db72b6","code_sha256_prefix":"c805e78993db72b6","mcp_get_code":{"code_sha256":"c805e78993db72b6"}},{"arxiv_id":"2411.04138","arxiv_id_is_arxiv":true,"paper":"/paper/networkgym-reinforcement-learning","title":"NetworkGym: Reinforcement Learning Environments for Multi-Access Traffic Management in Network Simulation","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmomin/networkgym","path":"NetworkAgent/ptd3/agent.py","file_url":"https://github.com/hmomin/networkgym/blob/HEAD/NetworkAgent/ptd3/agent.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":"5364f4044a619e47","code_sha256_prefix":"5364f4044a619e47","mcp_get_code":{"code_sha256":"5364f4044a619e47"}},{"arxiv_id":"2403.17503","arxiv_id_is_arxiv":true,"paper":"/paper/ds-al-a-dual-stream-analytic-learning-for","title":"DS-AL: A Dual-Stream Analytic Learning for Exemplar-Free Class-Incremental Learning","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZHUANGHP/Analytic-continual-learning","path":"analytic/DSAL.py","file_url":"https://github.com/ZHUANGHP/Analytic-continual-learning/blob/HEAD/analytic/DSAL.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":"1d08f115abdc4600","code_sha256_prefix":"1d08f115abdc4600","mcp_get_code":{"code_sha256":"1d08f115abdc4600"}},{"arxiv_id":"2403.13249","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-and-general-framework-for-continual","title":"A Unified and General Framework for Continual Learning","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joey-wang123/cl-refresh-learning","path":"models/rpc.py","file_url":"https://github.com/joey-wang123/cl-refresh-learning/blob/HEAD/models/rpc.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":"8f59cbb3d51b6c85","code_sha256_prefix":"8f59cbb3d51b6c85","mcp_get_code":{"code_sha256":"8f59cbb3d51b6c85"}},{"arxiv_id":"2403.04398","arxiv_id_is_arxiv":true,"paper":"/paper/magr-manifold-aligned-graph-regularization","title":"MAGR: Manifold-Aligned Graph Regularization for Continual Action Quality Assessment","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhouKanglei/MAGR_CAQA","path":"models/fea_gr.py","file_url":"https://github.com/ZhouKanglei/MAGR_CAQA/blob/HEAD/models/fea_gr.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, ZhouKanglei/MAGR_CAQA when it was checked","code_sha256":"0dc99786a7ca9094","code_sha256_prefix":"0dc99786a7ca9094","mcp_get_code":{"code_sha256":"0dc99786a7ca9094"}},{"arxiv_id":"2402.03917","arxiv_id_is_arxiv":true,"paper":"/paper/elastic-feature-consolidation-for-cold-start","title":"Elastic Feature Consolidation for Cold Start Exemplar-Free Incremental Learning","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simomagi/elastic_feature_consolidation","path":"continual_learning/ElasticFeatureConsolidation.py","file_url":"https://github.com/simomagi/elastic_feature_consolidation/blob/HEAD/continual_learning/ElasticFeatureConsolidation.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":"d728f908ea887920","code_sha256_prefix":"d728f908ea887920","mcp_get_code":{"code_sha256":"d728f908ea887920"}},{"arxiv_id":"2310.18803","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-coupled-deep-q-networks","title":"Weakly Coupled Deep Q-Networks","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibrahim-elshar/WCDQN_NeurIPS","path":"src/Inv_control/WCDQN.py","file_url":"https://github.com/ibrahim-elshar/WCDQN_NeurIPS/blob/HEAD/src/Inv_control/WCDQN.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, ibrahim-elshar/WCDQN_NeurIPS when it was checked","code_sha256":"1c1c0cd257ab6271","code_sha256_prefix":"1c1c0cd257ab6271","mcp_get_code":{"code_sha256":"1c1c0cd257ab6271"}},{"arxiv_id":"2310.18593","arxiv_id_is_arxiv":true,"paper":"/paper/fair-streaming-principal-component-analysis-1","title":"Fair Streaming Principal Component Analysis: Statistical and Algorithmic Viewpoint","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanseuljo/fair-streaming-pca","path":"synthetic_fair_streaming_pca/fairPCA.py","file_url":"https://github.com/hanseuljo/fair-streaming-pca/blob/HEAD/synthetic_fair_streaming_pca/fairPCA.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, hanseuljo/fair-streaming-pca when it was checked","code_sha256":"2465949524b1a154","code_sha256_prefix":"2465949524b1a154","mcp_get_code":{"code_sha256":"2465949524b1a154"}},{"arxiv_id":"2310.08217","arxiv_id_is_arxiv":true,"paper":"/paper/trire-a-multi-mechanism-learning-paradigm-for-1","title":"TriRE: A Multi-Mechanism Learning Paradigm for Continual Knowledge Retention and Promotion","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NeurAI-Lab/TriRE","path":"models/trire.py","file_url":"https://github.com/NeurAI-Lab/TriRE/blob/HEAD/models/trire.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, NeurAI-Lab/TriRE when it was checked","code_sha256":"a34a68bbb3e6ccdf","code_sha256_prefix":"a34a68bbb3e6ccdf","mcp_get_code":{"code_sha256":"a34a68bbb3e6ccdf"}},{"arxiv_id":"2302.11346","arxiv_id_is_arxiv":true,"paper":"/paper/task-aware-information-routing-from-common","title":"Task-Aware Information Routing from Common Representation Space in Lifelong Learning","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurai-lab/tamil","path":"models/tam.py","file_url":"https://github.com/neurai-lab/tamil/blob/HEAD/models/tam.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, neurai-lab/tamil when it was checked","code_sha256":"1f0a698eea371060","code_sha256_prefix":"1f0a698eea371060","mcp_get_code":{"code_sha256":"1f0a698eea371060"}},{"arxiv_id":"2302.11344","arxiv_id_is_arxiv":true,"paper":"/paper/error-sensitivity-modulation-based-experience","title":"Error Sensitivity Modulation based Experience Replay: Mitigating Abrupt Representation Drift in Continual Learning","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurai-lab/esmer","path":"models/esmer.py","file_url":"https://github.com/neurai-lab/esmer/blob/HEAD/models/esmer.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":"e7451956d67f9229","code_sha256_prefix":"e7451956d67f9229","mcp_get_code":{"code_sha256":"e7451956d67f9229"}},{"arxiv_id":"2302.01242","arxiv_id_is_arxiv":true,"paper":"/paper/neuro-symbolic-continual-learning-knowledge","title":"Neuro-Symbolic Continual Learning: Knowledge, Reasoning Shortcuts and Concept Rehearsal","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ema-marconato/nesy-cl","path":"models/cool.py","file_url":"https://github.com/ema-marconato/nesy-cl/blob/HEAD/models/cool.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":"d9319734afd720b0","code_sha256_prefix":"d9319734afd720b0","mcp_get_code":{"code_sha256":"d9319734afd720b0"}},{"arxiv_id":"2210.09960","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-value-function-learning-for","title":"Rethinking Value Function Learning for Generalization in Reinforcement Learning","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/dcpg","path":"dcpg/algos/dcpg.py","file_url":"https://github.com/snu-mllab/dcpg/blob/HEAD/dcpg/algos/dcpg.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":"9b26c22d5d39f9a9","code_sha256_prefix":"9b26c22d5d39f9a9","mcp_get_code":{"code_sha256":"9b26c22d5d39f9a9"}},{"arxiv_id":"2206.08853","arxiv_id_is_arxiv":true,"paper":"/paper/minedojo-building-open-ended-embodied-agents","title":"MineDojo: Building Open-Ended Embodied Agents with Internet-Scale Knowledge","date":"2022-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pku-rl/copl","path":"src/core/ppo.py","file_url":"https://github.com/pku-rl/copl/blob/HEAD/src/core/ppo.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":"ad104c89d024fd04","code_sha256_prefix":"ad104c89d024fd04","mcp_get_code":{"code_sha256":"ad104c89d024fd04"}},{"arxiv_id":"2205.14922","arxiv_id_is_arxiv":true,"paper":"/paper/acil-analytic-class-incremental-learning-with","title":"ACIL: Analytic Class-Incremental Learning with Absolute Memorization and Privacy Protection","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZHUANGHP/Analytic-continual-learning","path":"analytic/ACIL.py","file_url":"https://github.com/ZHUANGHP/Analytic-continual-learning/blob/HEAD/analytic/ACIL.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":"c0381c8b57c0a37e","code_sha256_prefix":"c0381c8b57c0a37e","mcp_get_code":{"code_sha256":"c0381c8b57c0a37e"}},{"arxiv_id":"2204.11167","arxiv_id_is_arxiv":true,"paper":"/paper/relvit-concept-guided-vision-transformer-for-1","title":"RelViT: Concept-guided Vision Transformer for Visual Relational Reasoning","date":"2022-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/RelViT","path":"utils/relvit.py","file_url":"https://github.com/NVlabs/RelViT/blob/HEAD/utils/relvit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, NVlabs/RelViT (NOASSERTION)","code_sha256":"4df4c993c5727035","code_sha256_prefix":"4df4c993c5727035","mcp_get_code":{"code_sha256":"4df4c993c5727035"}},{"arxiv_id":"2202.04933","arxiv_id_is_arxiv":true,"paper":"/paper/energy-based-contrastive-learning-of-visual","title":"Energy-Based Contrastive Learning of Visual Representations","date":"2022-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1202kbs/ebclr","path":"libs/ebclr.py","file_url":"https://github.com/1202kbs/ebclr/blob/HEAD/libs/ebclr.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, 1202kbs/ebclr when it was checked","code_sha256":"6ac1e9429f4fe7fa","code_sha256_prefix":"6ac1e9429f4fe7fa","mcp_get_code":{"code_sha256":"6ac1e9429f4fe7fa"}},{"arxiv_id":"2201.12604","arxiv_id_is_arxiv":true,"paper":"/paper/learning-fast-learning-slow-a-general-1","title":"Learning Fast, Learning Slow: A General Continual Learning Method based on Complementary Learning System","date":"2022-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NeurAI-Lab/CLS-ER","path":"models/clser.py","file_url":"https://github.com/NeurAI-Lab/CLS-ER/blob/HEAD/models/clser.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":"cbf06486bbe7b6ac","code_sha256_prefix":"cbf06486bbe7b6ac","mcp_get_code":{"code_sha256":"cbf06486bbe7b6ac"}},{"arxiv_id":"2110.06976","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-representational-continuity-1","title":"Representational Continuity for Unsupervised Continual Learning","date":"2021-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divyam3897/ucl","path":"models/mixup.py","file_url":"https://github.com/divyam3897/ucl/blob/HEAD/models/mixup.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, divyam3897/ucl (NOASSERTION)","code_sha256":"60c8f08559dd5eba","code_sha256_prefix":"60c8f08559dd5eba","mcp_get_code":{"code_sha256":"60c8f08559dd5eba"}},{"arxiv_id":"2002.00632","arxiv_id_is_arxiv":true,"paper":"/paper/effective-diversity-in-population-based","title":"Effective Diversity in Population Based Reinforcement Learning","date":"2020-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"holounic/DvD-TD3","path":"td3/algorithm.py","file_url":"https://github.com/holounic/DvD-TD3/blob/HEAD/td3/algorithm.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, holounic/DvD-TD3 when it was checked","code_sha256":"aeecae3f15ea94c6","code_sha256_prefix":"aeecae3f15ea94c6","mcp_get_code":{"code_sha256":"aeecae3f15ea94c6"}},{"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":"garyzyr001/rethinking-airl","path":"airl/algo/sac.py","file_url":"https://github.com/garyzyr001/rethinking-airl/blob/HEAD/airl/algo/sac.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, garyzyr001/rethinking-airl when it was checked","code_sha256":"94573a894a42ebff","code_sha256_prefix":"94573a894a42ebff","mcp_get_code":{"code_sha256":"94573a894a42ebff"}},{"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":"ku2482/gail-airl-ppo.pytorch","path":"gail_airl_ppo/algo/sac.py","file_url":"https://github.com/ku2482/gail-airl-ppo.pytorch/blob/HEAD/gail_airl_ppo/algo/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":"b6b1a23b07a627dd","code_sha256_prefix":"b6b1a23b07a627dd","mcp_get_code":{"code_sha256":"b6b1a23b07a627dd"}},{"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":"Gregory-Eales/proximal-policy-optimization","path":"ppo/modules/ppo.py","file_url":"https://github.com/Gregory-Eales/proximal-policy-optimization/blob/HEAD/ppo/modules/ppo.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":"5eac27c1ede5a3f1","code_sha256_prefix":"5eac27c1ede5a3f1","mcp_get_code":{"code_sha256":"5eac27c1ede5a3f1"}},{"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":"bay3s/ppo-rl","path":"src/ppo/ppo.py","file_url":"https://github.com/bay3s/ppo-rl/blob/HEAD/src/ppo/ppo.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, bay3s/ppo-rl when it was checked","code_sha256":"d0735a6f70135e3f","code_sha256_prefix":"d0735a6f70135e3f","mcp_get_code":{"code_sha256":"d0735a6f70135e3f"}},{"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":"hamishs/JAX-RL","path":"src/jax_rl/algorithms/ppo.py","file_url":"https://github.com/hamishs/JAX-RL/blob/HEAD/src/jax_rl/algorithms/ppo.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":"6f2b092fd868a348","code_sha256_prefix":"6f2b092fd868a348","mcp_get_code":{"code_sha256":"6f2b092fd868a348"}},{"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":"DanielLSM/safe-rl-tutorial","path":"tutorial/ddpg.py","file_url":"https://github.com/DanielLSM/safe-rl-tutorial/blob/HEAD/tutorial/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":"96855c8d20a0088b","code_sha256_prefix":"96855c8d20a0088b","mcp_get_code":{"code_sha256":"96855c8d20a0088b"}}],"record_sha256":"16e0398cc640cd0f69c5c4fcb61e7294cf8b688f648df7dc37b9313de42ec83a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}