{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/check","entry":"check","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":38,"n_papers_ran":24,"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":34,"n_samples_ran":18,"n_samples_fingerprinted":5,"n_places":40,"n_places_pointer_only":19,"by_status":{"ran_honours":2,"ran_violates":5,"ran_draft_wrong":0,"ran_fixture":1,"ran":10,"unverified":16},"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":"2609.02155","paper":"/paper/arxiv-2609-02155","title":"Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"piyush314/random-projection-geometry","path":"verification/harness.py","file_url":"https://github.com/piyush314/random-projection-geometry/blob/HEAD/verification/harness.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e4a010ab9e09fe09","mcp_get_code":{"code_sha256":"e4a010ab9e09fe09"}},{"arxiv_id":"2608.00979","paper":"/paper/arxiv-2608-00979","title":"Passing Coarse Marginal Checks Can Be Cheap: Persona Mixtures and Imprecise Treatment-Response Estimates in an LLM Persona Panel","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"yoheinakajima/synthetic-players","path":"artifacts/api-server/engine/gate0.py","file_url":"https://github.com/yoheinakajima/synthetic-players/blob/HEAD/artifacts/api-server/engine/gate0.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"2d72a93c1f4d60c0","mcp_get_code":{"code_sha256":"2d72a93c1f4d60c0"}},{"arxiv_id":"2604.03616","paper":"/paper/arxiv-2604-03616","title":"The Format Tax","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ivnle/the-format-tax","path":"dev/check_reference_contract.py","file_url":"https://github.com/ivnle/the-format-tax/blob/HEAD/dev/check_reference_contract.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"0d866330a7b461b5","mcp_get_code":{"code_sha256":"0d866330a7b461b5"}},{"arxiv_id":"2601.22047","paper":"/paper/arxiv-2601-22047","title":"On the Paradoxical Interference between Instruction-Following and Task Solving","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"kijlk/IF-Interference","path":"src/code_human-eval/constraint/check.py","file_url":"https://github.com/kijlk/IF-Interference/blob/HEAD/src/code_human-eval/constraint/check.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d599086282e5279c","mcp_get_code":{"code_sha256":"d599086282e5279c"}},{"arxiv_id":"2511.22549","paper":"/paper/arxiv-2511-22549","title":"Diff-ICMH: Harmonizing Machine and Human Vision in Image Compression with Generative Prior","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"RuoyuFeng/Diff-ICMH","path":"diagnise_tensorboard.py","file_url":"https://github.com/RuoyuFeng/Diff-ICMH/blob/HEAD/diagnise_tensorboard.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"374fa6e4af2b9ea8","mcp_get_code":{"code_sha256":"374fa6e4af2b9ea8"}},{"arxiv_id":"2510.03904","paper":"/paper/arxiv-2510-03904","title":"LLM as an Algorithmist: Enhancing Anomaly Detectors via Programmatic Synthesis","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"HangtingYe/LLM_DAS","path":"check_env.py","file_url":"https://github.com/HangtingYe/LLM_DAS/blob/HEAD/check_env.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9ddf5e8f6bfb8c5b","mcp_get_code":{"code_sha256":"9ddf5e8f6bfb8c5b"}},{"arxiv_id":"2509.25550","paper":"/paper/arxiv-2509-25550","title":"Unifying Agent Interaction and World Information for Multi-agent Coordination","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"zoeyuchao/mappo","path":"onpolicy/algorithms/utils/util.py","file_url":"https://github.com/zoeyuchao/mappo/blob/HEAD/onpolicy/algorithms/utils/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9589eca5bae9de80","mcp_get_code":{"code_sha256":"9589eca5bae9de80"}},{"arxiv_id":"2507.03331","paper":"/paper/task-specific-generative-dataset-distillation","title":"Task-Specific Generative Dataset Distillation with Difficulty-Guided Sampling","date":"2025-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Guang000/Awesome-Dataset-Distillation","path":"validate_articles.py","file_url":"https://github.com/Guang000/Awesome-Dataset-Distillation/blob/HEAD/validate_articles.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e561c2d698c8e9e","mcp_get_code":{"code_sha256":"9e561c2d698c8e9e"}},{"arxiv_id":"2410.03531","paper":"/paper/mare-multi-aspect-rationale-extractor-on","title":"MARE: Multi-Aspect Rationale Extractor on Unsupervised Rationale Extraction","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CSU-NLP-Group/MARE","path":"src/run_classification.py","file_url":"https://github.com/CSU-NLP-Group/MARE/blob/HEAD/src/run_classification.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5b66bd511e0a59b1","mcp_get_code":{"code_sha256":"5b66bd511e0a59b1"}},{"arxiv_id":"2410.02884","paper":"/paper/llama-berry-pairwise-optimization-for-o1-like","title":"LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trotsky1997/mathblackbox","path":"gen_mcts_dpo.py","file_url":"https://github.com/trotsky1997/mathblackbox/blob/HEAD/gen_mcts_dpo.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d7e6f3e1a5b46443","mcp_get_code":{"code_sha256":"d7e6f3e1a5b46443"}},{"arxiv_id":"2409.08754","paper":"/paper/uncertainty-estimation-by-density-aware","title":"Uncertainty Estimation by Density Aware Evidential Deep Learning","date":"2024-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TaeseongYoon/DAEDL","path":"ood_detection.py","file_url":"https://github.com/TaeseongYoon/DAEDL/blob/HEAD/ood_detection.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cc7e84fa873a83c2","mcp_get_code":{"code_sha256":"cc7e84fa873a83c2"}},{"arxiv_id":"2408.04872","paper":"/paper/scoi-syntax-augmented-coverage-based-in","title":"SCOI: Syntax-augmented Coverage-based In-context Example Selection for Machine Translation","date":"2024-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hplt-project/sacremoses","path":"audit/attacks.py","file_url":"https://github.com/hplt-project/sacremoses/blob/HEAD/audit/attacks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9570b2dda6ffa32f","mcp_get_code":{"code_sha256":"9570b2dda6ffa32f"}},{"arxiv_id":"2406.04298","paper":"/paper/measuring-and-addressing-indexical-bias-in","title":"Measuring and Addressing Indexical Bias in Information Retrieval","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SALT-NLP/pair","path":"src/experiments/metric_validation.py","file_url":"https://github.com/SALT-NLP/pair/blob/HEAD/src/experiments/metric_validation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"434a3e71d0c58b17","mcp_get_code":{"code_sha256":"434a3e71d0c58b17"}},{"arxiv_id":"2404.17521","paper":"/paper/ag2manip-learning-novel-manipulation-skills","title":"Ag2Manip: Learning Novel Manipulation Skills with Agent-Agnostic Visual and Action Representations","date":"2024-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xiaoyao-Li/Ag2Manip","path":"algos/utils/util.py","file_url":"https://github.com/Xiaoyao-Li/Ag2Manip/blob/HEAD/algos/utils/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9589eca5bae9de80","mcp_get_code":{"code_sha256":"9589eca5bae9de80"}},{"arxiv_id":"2403.02966","paper":"/paper/evidence-focused-fact-summarization-for","title":"Evidence-Focused Fact Summarization for Knowledge-Augmented Zero-Shot Question Answering","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kk13332488/EFSum","path":"inference/clear_inference.py","file_url":"https://github.com/kk13332488/EFSum/blob/HEAD/inference/clear_inference.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9a3a615125ef770d","mcp_get_code":{"code_sha256":"9a3a615125ef770d"}},{"arxiv_id":"2402.16029","paper":"/paper/graphwiz-an-instruction-following-language","title":"GraphWiz: An Instruction-Following Language Model for Graph Problems","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nuochenpku/Graph-Reasoning-LLM","path":"evaluation/evaluate_nlg.py","file_url":"https://github.com/nuochenpku/Graph-Reasoning-LLM/blob/HEAD/evaluation/evaluate_nlg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2af60a15ea79a591","mcp_get_code":{"code_sha256":"2af60a15ea79a591"}},{"arxiv_id":"2402.06700","paper":"/paper/entropy-regularized-token-level-policy","title":"Entropy-Regularized Token-Level Policy Optimization for Language Agent Reinforcement","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"morning9393/etpo","path":"etpo/utils/util.py","file_url":"https://github.com/morning9393/etpo/blob/HEAD/etpo/utils/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1136e568a8e6dd2e","mcp_get_code":{"code_sha256":"1136e568a8e6dd2e"}},{"arxiv_id":"2402.02097","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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4829105008c71d83","mcp_get_code":{"code_sha256":"4829105008c71d83"}},{"arxiv_id":"2312.02519","paper":"/paper/creative-agents-empowering-agents-with","title":"Creative Agents: Empowering Agents with Imagination for Creative Tasks","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pku-rl/creative-agents","path":"cot_gpt4.py","file_url":"https://github.com/pku-rl/creative-agents/blob/HEAD/cot_gpt4.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d3928f6429ce22ab","mcp_get_code":{"code_sha256":"d3928f6429ce22ab"}},{"arxiv_id":"2311.17113","paper":"/paper/human-gaussian-splatting-real-time-rendering","title":"Human Gaussian Splatting: Real-time Rendering of Animatable Avatars","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mrnerf/awesome-3d-gaussian-splatting","path":"src/check_links.py","file_url":"https://github.com/mrnerf/awesome-3d-gaussian-splatting/blob/HEAD/src/check_links.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e39a7481af630616","mcp_get_code":{"code_sha256":"e39a7481af630616"}},{"arxiv_id":"2311.03154","paper":"/paper/convergence-analysis-of-sequential-federated-1","title":"Convergence Analysis of Sequential Federated Learning on Heterogeneous Data","date":"2023-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bird-two/convergence","path":"sim/models/build_models.py","file_url":"https://github.com/bird-two/convergence/blob/HEAD/sim/models/build_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"32e789ea8ca7aa0b","mcp_get_code":{"code_sha256":"32e789ea8ca7aa0b"}},{"arxiv_id":"2310.15638","paper":"/paper/coannotating-uncertainty-guided-work","title":"CoAnnotating: Uncertainty-Guided Work Allocation between Human and Large Language Models for Data Annotation","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salt-nlp/coannotating","path":"Expertise_Estimation.py","file_url":"https://github.com/salt-nlp/coannotating/blob/HEAD/Expertise_Estimation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"be735c0fcc114e9b","mcp_get_code":{"code_sha256":"be735c0fcc114e9b"}},{"arxiv_id":"2309.14753","paper":"/paper/advanced-volleyball-stats-for-all-levels","title":"Advanced Volleyball Stats for All Levels: Automatic Setting Tactic Detection and Classification with a Single Camera","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"volleyIEEE/VolleyStats","path":"full_version_set_classifier.py","file_url":"https://github.com/volleyIEEE/VolleyStats/blob/HEAD/full_version_set_classifier.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8be2d912b455a192","mcp_get_code":{"code_sha256":"8be2d912b455a192"}},{"arxiv_id":"2308.07641","paper":"/paper/ternary-singular-value-decomposition-as-a","title":"Ternary Singular Value Decomposition as a Better Parameterized Form in Linear Mapping","date":"2023-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ozzzp/ternary_decompose","path":"tern_svd/ternary_decompose_pytorch.py","file_url":"https://github.com/ozzzp/ternary_decompose/blob/HEAD/tern_svd/ternary_decompose_pytorch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"6cedb1a32211a3ec","mcp_get_code":{"code_sha256":"6cedb1a32211a3ec"}},{"arxiv_id":"2308.00436","paper":"/paper/selfcheck-using-llms-to-zero-shot-check-their","title":"SelfCheck: Using LLMs to Zero-Shot Check Their Own Step-by-Step Reasoning","date":"2023-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ningmiao/selfcheck","path":"src/multiprocess.py","file_url":"https://github.com/ningmiao/selfcheck/blob/HEAD/src/multiprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"82c1d9826986afae","mcp_get_code":{"code_sha256":"82c1d9826986afae"}},{"arxiv_id":"2305.10037","paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/hamilton.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/hamilton.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"782c581cdb1bbb73","mcp_get_code":{"code_sha256":"782c581cdb1bbb73"}},{"arxiv_id":"2305.10037","paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/topology.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/topology.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5c1d56344deffa84","mcp_get_code":{"code_sha256":"5c1d56344deffa84"}},{"arxiv_id":"2302.06205","paper":"/paper/order-matters-agent-by-agent-policy","title":"Order Matters: Agent-by-agent Policy Optimization","date":"2023-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xihuai18/A2PO-ICLR2023","path":"onpolicy/algorithms/utils/util.py","file_url":"https://github.com/xihuai18/A2PO-ICLR2023/blob/HEAD/onpolicy/algorithms/utils/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9589eca5bae9de80","mcp_get_code":{"code_sha256":"9589eca5bae9de80"}},{"arxiv_id":"2211.16116","paper":"/paper/machine-learning-emulation-of-a-local-scale","title":"Machine learning emulation of a local-scale UK climate model","date":"2022-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"henryaddison/score_sde_pytorch","path":"bin/check_preds.py","file_url":"https://github.com/henryaddison/score_sde_pytorch/blob/HEAD/bin/check_preds.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ab032f73c303b54a","mcp_get_code":{"code_sha256":"ab032f73c303b54a"}},{"arxiv_id":"2209.15265","paper":"/paper/relu-neural-networks-learn-the-simplest","title":"Overparameterized ReLU Neural Networks Learn the Simplest Models: Neural Isometry and Exact Recovery","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pilancilab/neural-recovery","path":"ReLU_normal/cvx_train_normal.py","file_url":"https://github.com/pilancilab/neural-recovery/blob/HEAD/ReLU_normal/cvx_train_normal.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8bf3dc700f89c7d","mcp_get_code":{"code_sha256":"b8bf3dc700f89c7d"}},{"arxiv_id":"2207.05631","paper":"/paper/dgpo-discovering-multiple-strategies-with","title":"DGPO: Discovering Multiple Strategies with Diversity-Guided Policy Optimization","date":"2022-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenRL-Lab/DGPO","path":"onpolicy/algorithms/utils/util.py","file_url":"https://github.com/OpenRL-Lab/DGPO/blob/HEAD/onpolicy/algorithms/utils/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9589eca5bae9de80","mcp_get_code":{"code_sha256":"9589eca5bae9de80"}},{"arxiv_id":"2206.07912","paper":"/paper/double-sampling-randomized-smoothing","title":"Double Sampling Randomized Smoothing","date":"2022-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dsgiitr/re_dsrs","path":"dsrs/algo/algo.py","file_url":"https://github.com/dsgiitr/re_dsrs/blob/HEAD/dsrs/algo/algo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"20f04d1a583d6fc1","mcp_get_code":{"code_sha256":"20f04d1a583d6fc1"}},{"arxiv_id":"2206.07912","paper":"/paper/double-sampling-randomized-smoothing","title":"Double Sampling Randomized Smoothing","date":"2022-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llylly/dsrs","path":"algo/algo.py","file_url":"https://github.com/llylly/dsrs/blob/HEAD/algo/algo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"e2025ff88e86c006","mcp_get_code":{"code_sha256":"e2025ff88e86c006"}},{"arxiv_id":"2109.11251","paper":"/paper/trust-region-policy-optimisation-in-multi","title":"Trust Region Policy Optimisation in Multi-Agent Reinforcement Learning","date":"2021-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mehdinasiri/mirror-descent-in-marl","path":"algorithms/utils/util.py","file_url":"https://github.com/mehdinasiri/mirror-descent-in-marl/blob/HEAD/algorithms/utils/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9589eca5bae9de80","mcp_get_code":{"code_sha256":"9589eca5bae9de80"}},{"arxiv_id":"2106.14334","paper":"/paper/noisy-mappo-noisy-advantage-values-for","title":"Policy Regularization via Noisy Advantage Values for Cooperative Multi-agent Actor-Critic methods","date":null,"month_inferred_from_arxiv_id":"2021-06","title_source":"archive","repo":"hijkzzz/noisy-mappo","path":"onpolicy/algorithms/utils/util.py","file_url":"https://github.com/hijkzzz/noisy-mappo/blob/HEAD/onpolicy/algorithms/utils/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9589eca5bae9de80","mcp_get_code":{"code_sha256":"9589eca5bae9de80"}},{"arxiv_id":"2010.08961","paper":"/paper/capturing-longer-context-for-document-level","title":"Rethinking Document-level Neural Machine Translation","date":"2020-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunzewei2715/Doc2Doc_NMT","path":"tcp.py","file_url":"https://github.com/sunzewei2715/Doc2Doc_NMT/blob/HEAD/tcp.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b5c21dcc7a707088","mcp_get_code":{"code_sha256":"b5c21dcc7a707088"}},{"arxiv_id":"2002.06622","paper":"/paper/robustness-verification-for-transformers-1","title":"Robustness Verification for Transformers","date":"2020-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shizhouxing/Robustness-Verification-for-Transformers","path":"Verifiers/VerifierForward.py","file_url":"https://github.com/shizhouxing/Robustness-Verification-for-Transformers/blob/HEAD/Verifiers/VerifierForward.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"6a76b134a3b9b730","mcp_get_code":{"code_sha256":"6a76b134a3b9b730"}},{"arxiv_id":"1706.02275","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":"morning9393/HAPPO-HATRPO","path":"algorithms/happo_trainer.py","file_url":"https://github.com/morning9393/HAPPO-HATRPO/blob/HEAD/algorithms/happo_trainer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9589eca5bae9de80","mcp_get_code":{"code_sha256":"9589eca5bae9de80"}},{"arxiv_id":"2024.findings-naacl.194","paper":null,"title":"arXiv:2024.findings-naacl.194","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"siat-nlp/MAMS-for-ABSA","path":"data_process/utils.py","file_url":"https://github.com/siat-nlp/MAMS-for-ABSA/blob/HEAD/data_process/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a3de188c054e2d7f","mcp_get_code":{"code_sha256":"a3de188c054e2d7f"}},{"arxiv_id":"2023.findings-emnlp.835","paper":null,"title":"arXiv:2023.findings-emnlp.835","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"THU-KEG/ProbTree","path":"src/2wiki/Tree_Generation/3_postprocess_tree.py","file_url":"https://github.com/THU-KEG/ProbTree/blob/HEAD/src/2wiki/Tree_Generation/3_postprocess_tree.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"719e55880a367bf2","mcp_get_code":{"code_sha256":"719e55880a367bf2"}}]}