{"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/distance","entry":"distance","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":53,"n_papers_ran":25,"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":46,"n_samples_ran":19,"n_samples_fingerprinted":12,"n_places":54,"n_places_pointer_only":13,"by_status":{"ran_honours":10,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":6,"unverified":27},"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":"2505.00596","paper":"/paper/a-finite-state-controller-based-offline","title":"A Finite-State Controller Based Offline Solver for Deterministic POMDPs","date":"2025-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ori-goals/DetMCVI","path":"experiments/CTP/CTP_generator.py","file_url":"https://github.com/ori-goals/DetMCVI/blob/HEAD/experiments/CTP/CTP_generator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8ff313a007236b93","mcp_get_code":{"code_sha256":"8ff313a007236b93"}},{"arxiv_id":"2503.07981","paper":"/paper/regulatory-dna-sequence-design-with","title":"Regulatory DNA sequence Design with Reinforcement Learning","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangzhao1230/taco","path":"aggregate_mbo.py","file_url":"https://github.com/yangzhao1230/taco/blob/HEAD/aggregate_mbo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"20a43164a23f4fa6","mcp_get_code":{"code_sha256":"20a43164a23f4fa6"}},{"arxiv_id":"2410.18403","paper":"/paper/structure-language-models-for-protein","title":"Structure Language Models for Protein Conformation Generation","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lujiarui/esmdiff","path":"slm/utils/geo_utils.py","file_url":"https://github.com/lujiarui/esmdiff/blob/HEAD/slm/utils/geo_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"d1caaec311724c12","mcp_get_code":{"code_sha256":"d1caaec311724c12"}},{"arxiv_id":"2410.15474","paper":"/paper/optimizing-backward-policies-in-gflownets-via","title":"Optimizing Backward Policies in GFlowNets via Trajectory Likelihood Maximization","date":"2024-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tgritsaev/gflownet-tlm","path":"bitseq/utils.py","file_url":"https://github.com/tgritsaev/gflownet-tlm/blob/HEAD/bitseq/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"94f929faf5e1b4e9","mcp_get_code":{"code_sha256":"94f929faf5e1b4e9"}},{"arxiv_id":"2405.15677","paper":"/paper/smart-scalable-multi-agent-real-time","title":"SMART: Scalable Multi-agent Real-time Motion Generation via Next-token Prediction","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rainmaker22/SMART","path":"smart/datasets/scalable_dataset.py","file_url":"https://github.com/rainmaker22/SMART/blob/HEAD/smart/datasets/scalable_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4377b106a2248a85","mcp_get_code":{"code_sha256":"4377b106a2248a85"}},{"arxiv_id":"2404.16277","paper":"/paper/causally-inspired-regularization-enables","title":"Causally Inspired Regularization Enables Domain General Representations","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"olawalesalaudeen/tcri","path":"DomainBed/domainbed/lib/misc.py","file_url":"https://github.com/olawalesalaudeen/tcri/blob/HEAD/DomainBed/domainbed/lib/misc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fbb8c05a0a7696ec","mcp_get_code":{"code_sha256":"fbb8c05a0a7696ec"}},{"arxiv_id":"2404.07504","paper":"/paper/mitigating-object-dependencies-improving","title":"Mitigating Object Dependencies: Improving Point Cloud Self-Supervised Learning through Object Exchange","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanhaowu/oessl","path":"pcd_utils/ScanNet_Choose_Segment_Fun.py","file_url":"https://github.com/yanhaowu/oessl/blob/HEAD/pcd_utils/ScanNet_Choose_Segment_Fun.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9bf5a2651a416126","mcp_get_code":{"code_sha256":"9bf5a2651a416126"}},{"arxiv_id":"2404.01743","paper":"/paper/atom-level-optical-chemical-structure","title":"Atom-Level Optical Chemical Structure Recognition with Limited Supervision","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"molden/atomlenz","path":"AtomLenz/utils_graph.py","file_url":"https://github.com/molden/atomlenz/blob/HEAD/AtomLenz/utils_graph.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8a805833e6e55c05","mcp_get_code":{"code_sha256":"8a805833e6e55c05"}},{"arxiv_id":"2401.14846","paper":"/paper/understanding-domain-generalization-a-noise","title":"Understanding Domain Generalization: A Noise Robustness Perspective","date":"2024-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiaoruiyt/NoiseRobustDG","path":"domainbed/lib/misc.py","file_url":"https://github.com/qiaoruiyt/NoiseRobustDG/blob/HEAD/domainbed/lib/misc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fbb8c05a0a7696ec","mcp_get_code":{"code_sha256":"fbb8c05a0a7696ec"}},{"arxiv_id":"2311.10476","paper":"/paper/frcsyn-challenge-at-wacv-2024-face","title":"FRCSyn Challenge at WACV 2024:Face Recognition Challenge in the Era of Synthetic Data","date":"2023-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ndido98/frcsyn","path":"utils.py","file_url":"https://github.com/ndido98/frcsyn/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5ee46308f94853c9","mcp_get_code":{"code_sha256":"5ee46308f94853c9"}},{"arxiv_id":"2310.02286","paper":"/paper/a-comparison-of-mesh-free-differentiable","title":"A Comparison of Mesh-Free Differentiable Programming and Data-Driven Strategies for Optimal Control under PDE Constraints","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ddrous/updec","path":"updes/utils.py","file_url":"https://github.com/ddrous/updec/blob/HEAD/updes/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bc6b70282da387be","mcp_get_code":{"code_sha256":"bc6b70282da387be"}},{"arxiv_id":"2308.11166","paper":"/paper/hierarchical-point-based-active-learning-for","title":"Hierarchical Point-based Active Learning for Semi-supervised Point Cloud Semantic Segmentation","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SmiletoE/HPAL","path":"helper_utils.py","file_url":"https://github.com/SmiletoE/HPAL/blob/HEAD/helper_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9bf5a2651a416126","mcp_get_code":{"code_sha256":"9bf5a2651a416126"}},{"arxiv_id":"2308.09543","paper":"/paper/latent-state-models-of-training-dynamics","title":"Latent State Models of Training Dynamics","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michahu/modeling-training","path":"src/data.py","file_url":"https://github.com/michahu/modeling-training/blob/HEAD/src/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a5330d2e9abcc8f6","mcp_get_code":{"code_sha256":"a5330d2e9abcc8f6"}},{"arxiv_id":"2307.12502","paper":"/paper/cross-contrastive-feature-perturbation-for","title":"Cross Contrasting Feature Perturbation for Domain Generalization","date":"2023-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hackmebroo/ccfp","path":"lib/misc.py","file_url":"https://github.com/hackmebroo/ccfp/blob/HEAD/lib/misc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fbb8c05a0a7696ec","mcp_get_code":{"code_sha256":"fbb8c05a0a7696ec"}},{"arxiv_id":"2307.09829","paper":"/paper/what-do-neural-networks-learn-in-image","title":"What do neural networks learn in image classification? A frequency shortcut perspective","date":"2023-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nis-research/nn-frequency-shortcuts","path":"Evaluation/compute_ADCS.py","file_url":"https://github.com/nis-research/nn-frequency-shortcuts/blob/HEAD/Evaluation/compute_ADCS.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c22b5ef829cbb73","mcp_get_code":{"code_sha256":"3c22b5ef829cbb73"}},{"arxiv_id":"2306.03117","paper":"/paper/score-based-enhanced-sampling-for-protein","title":"Str2Str: A Score-based Framework for Zero-shot Protein Conformation Sampling","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lujiarui/Str2Str","path":"src/common/geo_utils.py","file_url":"https://github.com/lujiarui/Str2Str/blob/HEAD/src/common/geo_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d1caaec311724c12","mcp_get_code":{"code_sha256":"d1caaec311724c12"}},{"arxiv_id":"2302.00203","paper":"/paper/end-to-end-full-atom-antibody-design","title":"End-to-End Full-Atom Antibody Design","date":"2023-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"A4Bio/dyAb","path":"models/denoiser.py","file_url":"https://github.com/A4Bio/dyAb/blob/HEAD/models/denoiser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d7081d3937a74966","mcp_get_code":{"code_sha256":"d7081d3937a74966"}},{"arxiv_id":"2212.10305","paper":"/paper/which-pixel-to-annotate-a-label-efficient","title":"Which Pixel to Annotate: a Label-Efficient Nuclei Segmentation Framework","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhaof/nuseg","path":"CSinGAN/mask_synthesis.py","file_url":"https://github.com/lhaof/nuseg/blob/HEAD/CSinGAN/mask_synthesis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"55220eef2bb85c32","mcp_get_code":{"code_sha256":"55220eef2bb85c32"}},{"arxiv_id":"2209.08425","paper":"/paper/introspective-learning-a-two-stage-approach-1","title":"Introspective Learning : A Two-Stage Approach for Inference in Neural Networks","date":"2022-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"81e261e3bc5ae477","mcp_get_code":{"code_sha256":"81e261e3bc5ae477"}},{"arxiv_id":"2206.11397","paper":"/paper/online-bipartite-matching-with-advice-tight","title":"Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model","date":null,"month_inferred_from_arxiv_id":"2022-06","title_source":"archive","repo":"mapleox/matching_predictions","path":"utils.py","file_url":"https://github.com/mapleox/matching_predictions/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f504e2c1c9c22aaf","mcp_get_code":{"code_sha256":"f504e2c1c9c22aaf"}},{"arxiv_id":"2205.10343","paper":"/paper/towards-understanding-grokking-an-effective","title":"Towards Understanding Grokking: An Effective Theory of Representation Learning","date":"2022-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejmichaud/grokking-squared","path":"scripts/run_toy_model.py","file_url":"https://github.com/ejmichaud/grokking-squared/blob/HEAD/scripts/run_toy_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d906e3f7123c3bad","mcp_get_code":{"code_sha256":"d906e3f7123c3bad"}},{"arxiv_id":"2204.00628","paper":"/paper/learning-neural-acoustic-fields-1","title":"Learning Neural Acoustic Fields","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aluo-x/learning_neural_acoustic_fields","path":"model/networks.py","file_url":"https://github.com/aluo-x/learning_neural_acoustic_fields/blob/HEAD/model/networks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3fa206e7936537d5","mcp_get_code":{"code_sha256":"3fa206e7936537d5"}},{"arxiv_id":"2111.01124","paper":"/paper/when-does-contrastive-learning-preserve","title":"When Does Contrastive Learning Preserve Adversarial Robustness from Pretraining to Finetuning?","date":"2021-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LijieFan/AdvCL","path":"fr_util.py","file_url":"https://github.com/LijieFan/AdvCL/blob/HEAD/fr_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"07a57c775004c229","mcp_get_code":{"code_sha256":"07a57c775004c229"}},{"arxiv_id":"2110.06169","paper":"/paper/offline-reinforcement-learning-with-implicit","title":"Offline Reinforcement Learning with Implicit Q-Learning","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dasgringuen/assetto_corsa_gym","path":"assetto_corsa_gym/AssettoCorsaEnv/gap_cpu.py","file_url":"https://github.com/dasgringuen/assetto_corsa_gym/blob/HEAD/assetto_corsa_gym/AssettoCorsaEnv/gap_cpu.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9c4866bb7ea6847e","mcp_get_code":{"code_sha256":"9c4866bb7ea6847e"}},{"arxiv_id":"2110.06169","paper":"/paper/offline-reinforcement-learning-with-implicit","title":"Offline Reinforcement Learning with Implicit Q-Learning","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dasgringuen/assetto_corsa_gym","path":"assetto_corsa_gym/AssettoCorsaEnv/gap_torch.py","file_url":"https://github.com/dasgringuen/assetto_corsa_gym/blob/HEAD/assetto_corsa_gym/AssettoCorsaEnv/gap_torch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8262bb9a6731a45a","mcp_get_code":{"code_sha256":"8262bb9a6731a45a"}},{"arxiv_id":"2108.13654","paper":"/paper/discretized-integrated-gradients-for","title":"Discretized Integrated Gradients for Explaining Language Models","date":"2021-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ink-usc/dig","path":"monotonic_paths.py","file_url":"https://github.com/ink-usc/dig/blob/HEAD/monotonic_paths.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"83a6815c4f83e018","mcp_get_code":{"code_sha256":"83a6815c4f83e018"}},{"arxiv_id":"2106.13687","paper":"/paper/multi-goal-reinforcement-learning","title":"Multi-Goal Reinforcement Learning environments for simulated Franka Emika Panda robot","date":"2021-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qgallouedec/panda-gym","path":"panda_gym/utils.py","file_url":"https://github.com/qgallouedec/panda-gym/blob/HEAD/panda_gym/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"324ac51d7ec27133","mcp_get_code":{"code_sha256":"324ac51d7ec27133"}},{"arxiv_id":"2106.09675","paper":"/paper/gone-fishing-neural-active-learning-with","title":"Gone Fishing: Neural Active Learning with Fisher Embeddings","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"81e261e3bc5ae477","mcp_get_code":{"code_sha256":"81e261e3bc5ae477"}},{"arxiv_id":"2106.03632","paper":"/paper/quantifying-and-improving-transferability-in","title":"Quantifying and Improving Transferability in Domain Generalization","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gordon-guojun-zhang/transferability-neurips2021","path":"domainbed/algorithms.py","file_url":"https://github.com/gordon-guojun-zhang/transferability-neurips2021/blob/HEAD/domainbed/algorithms.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fbb8c05a0a7696ec","mcp_get_code":{"code_sha256":"fbb8c05a0a7696ec"}},{"arxiv_id":"2106.03306","paper":"/paper/horopca-hyperbolic-dimensionality-reduction","title":"HoroPCA: Hyperbolic Dimensionality Reduction via Horospherical Projections","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/HoroPCA","path":"learning/pca.py","file_url":"https://github.com/HazyResearch/HoroPCA/blob/HEAD/learning/pca.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"434b92113b2560b5","mcp_get_code":{"code_sha256":"434b92113b2560b5"}},{"arxiv_id":"2105.04714","paper":"/paper/sample-and-computation-redistribution-for","title":"Sample and Computation Redistribution for Efficient Face Detection","date":"2021-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aralhekimoglu/face","path":"recognition/oneflow_face/validation_util.py","file_url":"https://github.com/aralhekimoglu/face/blob/HEAD/recognition/oneflow_face/validation_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7522ada649e29d57","mcp_get_code":{"code_sha256":"7522ada649e29d57"}},{"arxiv_id":"2104.06689","paper":"/paper/learning-normal-dynamics-in-videos-with-meta","title":"Learning Normal Dynamics in Videos with Meta Prototype Network","date":"2021-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ktr-hubrt/MPN","path":"model/meta_prototype.py","file_url":"https://github.com/ktr-hubrt/MPN/blob/HEAD/model/meta_prototype.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"01c5f5dad9e9c151","mcp_get_code":{"code_sha256":"01c5f5dad9e9c151"}},{"arxiv_id":"2103.12710","paper":"/paper/spatial-intention-maps-for-multi-agent-mobile","title":"Spatial Intention Maps for Multi-Agent Mobile Manipulation","date":"2021-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jimmyyhwu/spatial-intention-maps","path":"envs.py","file_url":"https://github.com/jimmyyhwu/spatial-intention-maps/blob/HEAD/envs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db123ad5a66b6bcf","mcp_get_code":{"code_sha256":"db123ad5a66b6bcf"}},{"arxiv_id":"2011.12807","paper":"/paper/surfree-a-fast-surrogate-free-black-box","title":"SurFree: a fast surrogate-free black-box attack","date":"2020-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"t-maho/SurFree","path":"surfree.py","file_url":"https://github.com/t-maho/SurFree/blob/HEAD/surfree.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"216f982e716876f4","mcp_get_code":{"code_sha256":"216f982e716876f4"}},{"arxiv_id":"2011.00373","paper":"/paper/causal-inference-for-spatial-treatments","title":"Causal Inference for Spatial Treatments","date":"2020-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michaelpollmann/spatialtreat-example","path":"distance.py","file_url":"https://github.com/michaelpollmann/spatialtreat-example/blob/HEAD/distance.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"69c9f840693a2c0d","mcp_get_code":{"code_sha256":"69c9f840693a2c0d"}},{"arxiv_id":"2010.11742","paper":"/paper/learning-black-box-attackers-with","title":"Learning Black-Box Attackers with Transferable Priors and Query Feedback","date":"2020-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TrustworthyDL/LeBA","path":"LeBA10.py","file_url":"https://github.com/TrustworthyDL/LeBA/blob/HEAD/LeBA10.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":"312dffd937510c4d","mcp_get_code":{"code_sha256":"312dffd937510c4d"}},{"arxiv_id":"2009.09805","paper":"/paper/learning-audio-visual-representations-with","title":"Active Contrastive Learning of Audio-Visual Video Representations","date":"2020-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunyikristy/CM-ACC","path":"kmeanspp.py","file_url":"https://github.com/yunyikristy/CM-ACC/blob/HEAD/kmeanspp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b1b989baab3936b2","mcp_get_code":{"code_sha256":"b1b989baab3936b2"}},{"arxiv_id":"2007.09547","paper":"/paper/sat2graph-road-graph-extraction-through-graph","title":"Sat2Graph: Road Graph Extraction through Graph-Tensor Encoding","date":"2020-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songtaohe/Sat2Graph","path":"model/douglasPeucker.py","file_url":"https://github.com/songtaohe/Sat2Graph/blob/HEAD/model/douglasPeucker.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f17d07d137a2bf6d","mcp_get_code":{"code_sha256":"f17d07d137a2bf6d"}},{"arxiv_id":"2004.09141","paper":"/paper/spatial-action-maps-for-mobile-manipulation","title":"Spatial Action Maps for Mobile Manipulation","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jimmyyhwu/spatial-action-maps","path":"environment.py","file_url":"https://github.com/jimmyyhwu/spatial-action-maps/blob/HEAD/environment.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5c828d1f7c7beb58","mcp_get_code":{"code_sha256":"5c828d1f7c7beb58"}},{"arxiv_id":"2003.00920","paper":"/paper/structured-prediction-with-partial-labelling","title":"Structured Prediction with Partial Labelling through the Infimum Loss","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VivienCabannes/infimum_loss","path":"weights/fast_laplacian.py","file_url":"https://github.com/VivienCabannes/infimum_loss/blob/HEAD/weights/fast_laplacian.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1aaba74a2a955bd2","mcp_get_code":{"code_sha256":"1aaba74a2a955bd2"}},{"arxiv_id":"1910.14564","paper":"/paper/statistical-estimation-of-the-poincar-e","title":"Statistical Estimation of the Poincar{\\'e} constant and Application to Sampling Multimodal Distributions","date":null,"month_inferred_from_arxiv_id":"2019-10","title_source":"archive","repo":"viviencabannes/laplacian","path":"src/klap/kernels/helper.py","file_url":"https://github.com/viviencabannes/laplacian/blob/HEAD/src/klap/kernels/helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"80b744647b3da00a","mcp_get_code":{"code_sha256":"80b744647b3da00a"}},{"arxiv_id":"1906.03671","paper":"/paper/deep-batch-active-learning-by-diverse","title":"Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Bounds","date":"2019-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JordanAsh/badge","path":"query_strategies/badge_sampling.py","file_url":"https://github.com/JordanAsh/badge/blob/HEAD/query_strategies/badge_sampling.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"81e261e3bc5ae477","mcp_get_code":{"code_sha256":"81e261e3bc5ae477"}},{"arxiv_id":"1904.02099","paper":"/paper/75-languages-1-model-parsing-universal","title":"75 Languages, 1 Model: Parsing Universal Dependencies Universally","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyperparticle/udify","path":"udify/dataset_readers/evaluate_2019_task2.py","file_url":"https://github.com/hyperparticle/udify/blob/HEAD/udify/dataset_readers/evaluate_2019_task2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"665f20ac94b4aa09","mcp_get_code":{"code_sha256":"665f20ac94b4aa09"}},{"arxiv_id":"1902.09513","paper":"/paper/feelvos-fast-end-to-end-embedding-learning","title":"FEELVOS: Fast End-to-End Embedding Learning for Video Object Segmentation","date":"2019-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kim-younghan/FEELVOS","path":"feelvos/models/Matching.py","file_url":"https://github.com/kim-younghan/FEELVOS/blob/HEAD/feelvos/models/Matching.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1f5afcb309f3974f","mcp_get_code":{"code_sha256":"1f5afcb309f3974f"}},{"arxiv_id":"1902.06626","paper":"/paper/mockingbird-defending-against-deep-learning","title":"Mockingbird: Defending Against Deep-Learning-Based Website Fingerprinting Attacks with Adversarial Traces","date":null,"month_inferred_from_arxiv_id":"2019-02","title_source":"archive","repo":"msrocean/mockingbird","path":"mockingbird_utility.py","file_url":"https://github.com/msrocean/mockingbird/blob/HEAD/mockingbird_utility.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"66181ae4102bc5d8","mcp_get_code":{"code_sha256":"66181ae4102bc5d8"}},{"arxiv_id":"1812.05905","paper":"/paper/soft-actor-critic-algorithms-and-applications","title":"Soft Actor-Critic Algorithms and Applications","date":"2018-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alpaficia/MOSEAC_Limo","path":"limo-sim/envs/limo_world.py","file_url":"https://github.com/alpaficia/MOSEAC_Limo/blob/HEAD/limo-sim/envs/limo_world.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bd08ae9e89d819a9","mcp_get_code":{"code_sha256":"bd08ae9e89d819a9"}},{"arxiv_id":"1810.01279","paper":"/paper/adv-bnn-improved-adversarial-defense-through","title":"Adv-BNN: Improved Adversarial Defense through Robust Bayesian Neural Network","date":"2018-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuanqing94/BayesianDefense","path":"acc_under_attack.py","file_url":"https://github.com/xuanqing94/BayesianDefense/blob/HEAD/acc_under_attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"995b6550b7810165","mcp_get_code":{"code_sha256":"995b6550b7810165"}},{"arxiv_id":"1806.07755","paper":"/paper/an-empirical-study-on-evaluation-metrics-of","title":"An empirical study on evaluation metrics of generative adversarial networks","date":"2018-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuqiantong/GAN-Metrics","path":"framework/metric.py","file_url":"https://github.com/xuqiantong/GAN-Metrics/blob/HEAD/framework/metric.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"87a2229a391f2f47","mcp_get_code":{"code_sha256":"87a2229a391f2f47"}},{"arxiv_id":"1802.05733","paper":"/paper/fair-clustering-through-fairlets","title":"Fair Clustering Through Fairlets","date":"2018-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guptakhil12/fair-clustering-fairlets","path":"utils.py","file_url":"https://github.com/guptakhil12/fair-clustering-fairlets/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7512c7ade27d3fab","mcp_get_code":{"code_sha256":"7512c7ade27d3fab"}},{"arxiv_id":"1712.05474","paper":"/paper/ai2-thor-an-interactive-3d-environment-for","title":"AI2-THOR: An Interactive 3D Environment for Visual AI","date":"2017-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/ai2thor","path":"ai2thor/controller.py","file_url":"https://github.com/allenai/ai2thor/blob/HEAD/ai2thor/controller.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"065729fd3f79761e","mcp_get_code":{"code_sha256":"065729fd3f79761e"}},{"arxiv_id":"1710.04196","paper":"/paper/pyroomacoustics-a-python-package-for-audio","title":"Pyroomacoustics: A Python package for audio room simulations and array processing algorithms","date":null,"month_inferred_from_arxiv_id":"2017-10","title_source":"archive","repo":"LCAV/pyroomacoustics","path":"pyroomacoustics/beamforming.py","file_url":"https://github.com/LCAV/pyroomacoustics/blob/HEAD/pyroomacoustics/beamforming.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2f2e9584a57ff754","mcp_get_code":{"code_sha256":"2f2e9584a57ff754"}},{"arxiv_id":"1503.03832","paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"altndrr/persona","path":"src/utils/lfw.py","file_url":"https://github.com/altndrr/persona/blob/HEAD/src/utils/lfw.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7522ada649e29d57","mcp_get_code":{"code_sha256":"7522ada649e29d57"}},{"arxiv_id":"1206.6474","paper":"/paper/estimation-of-simultaneously-sparse-and-low","title":"Estimation of Simultaneously Sparse and Low Rank Matrices","date":"2012-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmantoux/sparse-low-rank-decomposition","path":"estimation_positive_symmetric.py","file_url":"https://github.com/cmantoux/sparse-low-rank-decomposition/blob/HEAD/estimation_positive_symmetric.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"63abc6d8d32649f2","mcp_get_code":{"code_sha256":"63abc6d8d32649f2"}},{"arxiv_id":"astro-ph/0604362","paper":"/paper/improving-cosmological-distance-measurements","title":"Improving Cosmological Distance Measurements by Reconstruction of the Baryon Acoustic Peak","date":"2006-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cosmodesi/pyrecon","path":"pyrecon/utils.py","file_url":"https://github.com/cosmodesi/pyrecon/blob/HEAD/pyrecon/utils.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":"27f129f84cf81324","mcp_get_code":{"code_sha256":"27f129f84cf81324"}}]}