{"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/deprecated","entry":"deprecated","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":25,"n_papers_ran":24,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":12,"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":19,"n_samples_ran":18,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":26,"n_places_pointer_only":7,"n_places_pointer_only_link_open":1,"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":6,"ran_fixture":0,"ran":12,"unverified":1},"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":"2606.19164","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-19164","title":"Essential Subspace Merging for Multi-Task Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"kiddo127/ESM","path":"ESM-RoBERTa/utils.py","file_url":"https://github.com/kiddo127/ESM/blob/HEAD/ESM-RoBERTa/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, kiddo127/ESM when it was checked","code_sha256":"670b577dd9aa8aa8","code_sha256_prefix":"670b577dd9aa8aa8","mcp_get_code":{"code_sha256":"670b577dd9aa8aa8"}},{"arxiv_id":"2605.18421","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18421","title":"EvoMemBench: Benchmarking Agent Memory from a Self-Evolving Perspective","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"DSAIL-Memory/EvoMemBench","path":"EvoMemBench-Memory-Systems/MemOS/src/memos/deprecation.py","file_url":"https://github.com/DSAIL-Memory/EvoMemBench/blob/HEAD/EvoMemBench-Memory-Systems/MemOS/src/memos/deprecation.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, DSAIL-Memory/EvoMemBench when it was checked","code_sha256":"ab3353e27ad3508a","code_sha256_prefix":"ab3353e27ad3508a","mcp_get_code":{"code_sha256":"ab3353e27ad3508a"}},{"arxiv_id":"2603.13377","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-13377","title":"Deep Learning for BioImaging: What Are We Really Learning?","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"mahmoodlab/HEST","path":"src/hest/utils.py","file_url":"https://github.com/mahmoodlab/HEST/blob/HEAD/src/hest/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, mahmoodlab/HEST (NOASSERTION)","code_sha256":"773a0c308d1f3410","code_sha256_prefix":"773a0c308d1f3410","mcp_get_code":{"code_sha256":"773a0c308d1f3410"}},{"arxiv_id":"2602.00534","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-00534","title":"AIRE-Prune: Asymptotic Impulse-Response Energy for State Pruning in State Space Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"falcon-arrow/AIRE-Prune","path":"s5/dataloaders/base.py","file_url":"https://github.com/falcon-arrow/AIRE-Prune/blob/HEAD/s5/dataloaders/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25edc240223b76c0","code_sha256_prefix":"25edc240223b76c0","mcp_get_code":{"code_sha256":"25edc240223b76c0"}},{"arxiv_id":"2501.07018","arxiv_id_is_arxiv":true,"paper":"/paper/pdlp-a-practical-first-order-method-for-large","title":"PDLP: A Practical First-Order Method for Large-Scale Linear Programming","date":null,"month_inferred_from_arxiv_id":"2025-01","title_source":"archive","repo":"google/or-tools","path":"ortools/sat/python/cp_model.py","file_url":"https://github.com/google/or-tools/blob/HEAD/ortools/sat/python/cp_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":"fdadc7e6c0d5856d","code_sha256_prefix":"fdadc7e6c0d5856d","mcp_get_code":{"code_sha256":"fdadc7e6c0d5856d"}},{"arxiv_id":"2411.02824","arxiv_id_is_arxiv":true,"paper":"/paper/layer-adaptive-state-pruning-for-deep-state","title":"Layer-Adaptive State Pruning for Deep State Space Models","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"msgwak/LAST","path":"s5/dataloaders/base.py","file_url":"https://github.com/msgwak/LAST/blob/HEAD/s5/dataloaders/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, msgwak/LAST when it was checked","code_sha256":"25edc240223b76c0","code_sha256_prefix":"25edc240223b76c0","mcp_get_code":{"code_sha256":"25edc240223b76c0"}},{"arxiv_id":"2406.19708","arxiv_id_is_arxiv":true,"paper":"/paper/a-differentiable-approach-to-multi-scale","title":"A Differentiable Approach to Multi-scale Brain Modeling","date":"2024-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brainpy/BrainPy","path":"brainpy/deprecations.py","file_url":"https://github.com/brainpy/BrainPy/blob/HEAD/brainpy/deprecations.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, brainpy/BrainPy, is not in the permissive set Syntology serves inline","code_sha256":"24682edde32d3895","code_sha256_prefix":"24682edde32d3895","mcp_get_code":{"code_sha256":"24682edde32d3895"}},{"arxiv_id":"2406.15479","arxiv_id_is_arxiv":true,"paper":"/paper/twin-merging-dynamic-integration-of-modular","title":"Twin-Merging: Dynamic Integration of Modular Expertise in Model Merging","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LZY-the-boys/Twin-Merging","path":"discriminative/utils.py","file_url":"https://github.com/LZY-the-boys/Twin-Merging/blob/HEAD/discriminative/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from kiddo127/ESM, and GitHub detected no licence in that repository when it was checked","code_sha256":"670b577dd9aa8aa8","code_sha256_prefix":"670b577dd9aa8aa8","mcp_get_code":{"code_sha256":"670b577dd9aa8aa8"}},{"arxiv_id":"2406.02923","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-spiking-neural-networks-as-state","title":"P-SpikeSSM: Harnessing Probabilistic Spiking State Space Models for Long-Range Dependency Tasks","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NeuroCompLab-psu/PSpikeSSMs","path":"src/dataloaders/base.py","file_url":"https://github.com/NeuroCompLab-psu/PSpikeSSMs/blob/HEAD/src/dataloaders/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25edc240223b76c0","code_sha256_prefix":"25edc240223b76c0","mcp_get_code":{"code_sha256":"25edc240223b76c0"}},{"arxiv_id":"2405.21063","arxiv_id_is_arxiv":true,"paper":"/paper/neural-network-verification-with-branch-and","title":"Neural Network Verification with Branch-and-Bound for General Nonlinearities","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huanzhang12/alpha-beta-CROWN","path":"complete_verifier/bab.py","file_url":"https://github.com/huanzhang12/alpha-beta-CROWN/blob/HEAD/complete_verifier/bab.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, huanzhang12/alpha-beta-CROWN (NOASSERTION)","code_sha256":"02af614e12c22731","code_sha256_prefix":"02af614e12c22731","mcp_get_code":{"code_sha256":"02af614e12c22731"}},{"arxiv_id":"2406.02560","arxiv_id_is_arxiv":true,"paper":"/paper/less-peaky-and-more-accurate-ctc-forced","title":"Less Peaky and More Accurate CTC Forced Alignment by Label Priors","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangruizhe/audio","path":"torchaudio/_internal/module_utils.py","file_url":"https://github.com/huangruizhe/audio/blob/HEAD/torchaudio/_internal/module_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"23bbafb2ef4c5399","code_sha256_prefix":"23bbafb2ef4c5399","mcp_get_code":{"code_sha256":"23bbafb2ef4c5399"}},{"arxiv_id":"2403.03234","arxiv_id_is_arxiv":true,"paper":"/paper/caduceus-bi-directional-equivariant-long","title":"Caduceus: Bi-Directional Equivariant Long-Range DNA Sequence Modeling","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jimmylihui/genbench","path":"src/dataloaders/base.py","file_url":"https://github.com/jimmylihui/genbench/blob/HEAD/src/dataloaders/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25edc240223b76c0","code_sha256_prefix":"25edc240223b76c0","mcp_get_code":{"code_sha256":"25edc240223b76c0"}},{"arxiv_id":"2402.15584","arxiv_id_is_arxiv":true,"paper":"/paper/state-space-models-for-event-cameras","title":"State Space Models for Event Cameras","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lindermanlab/S5","path":"s5/dataloaders/base.py","file_url":"https://github.com/lindermanlab/S5/blob/HEAD/s5/dataloaders/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25edc240223b76c0","code_sha256_prefix":"25edc240223b76c0","mcp_get_code":{"code_sha256":"25edc240223b76c0"}},{"arxiv_id":"2311.04898","arxiv_id_is_arxiv":true,"paper":"/paper/two-complementary-perspectives-to-continual","title":"Two Complementary Perspectives to Continual Learning: Ask Not Only What to Optimize, But Also How","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"timmhess/twocomplementaryperspectivescl","path":"avalanche/_annotations.py","file_url":"https://github.com/timmhess/twocomplementaryperspectivescl/blob/HEAD/avalanche/_annotations.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":"667a50347702db96","code_sha256_prefix":"667a50347702db96","mcp_get_code":{"code_sha256":"667a50347702db96"}},{"arxiv_id":"2310.02980","arxiv_id_is_arxiv":true,"paper":"/paper/never-train-from-scratch-fair-comparison-of","title":"Never Train from Scratch: Fair Comparison of Long-Sequence Models Requires Data-Driven Priors","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idoamos/not-from-scratch","path":"src/dataloaders/base.py","file_url":"https://github.com/idoamos/not-from-scratch/blob/HEAD/src/dataloaders/base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25edc240223b76c0","code_sha256_prefix":"25edc240223b76c0","mcp_get_code":{"code_sha256":"25edc240223b76c0"}},{"arxiv_id":"2203.02094","arxiv_id_is_arxiv":true,"paper":"/paper/litetransformersearch-training-free-on-device","title":"LiteTransformerSearch: Training-free Neural Architecture Search for Efficient Language Models","date":"2022-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/archai","path":"archai/common/deprecation_utils.py","file_url":"https://github.com/microsoft/archai/blob/HEAD/archai/common/deprecation_utils.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":"d9fa680dfcf3fc67","code_sha256_prefix":"d9fa680dfcf3fc67","mcp_get_code":{"code_sha256":"d9fa680dfcf3fc67"}},{"arxiv_id":"2104.00405","arxiv_id_is_arxiv":true,"paper":"/paper/avalanche-an-end-to-end-library-for-continual","title":"Avalanche: an End-to-End Library for Continual Learning","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lrzpellegrini/avalanche","path":"avalanche/_annotations.py","file_url":"https://github.com/lrzpellegrini/avalanche/blob/HEAD/avalanche/_annotations.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":"667a50347702db96","code_sha256_prefix":"667a50347702db96","mcp_get_code":{"code_sha256":"667a50347702db96"}},{"arxiv_id":"2010.01921","arxiv_id_is_arxiv":true,"paper":"/paper/x-torch-differentiable-scientific-computing","title":"$ξ$-torch: differentiable scientific computing library","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xitorch/xitorch","path":"xitorch/_utils/decorators.py","file_url":"https://github.com/xitorch/xitorch/blob/HEAD/xitorch/_utils/decorators.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":"37d7d9e3c5432824","code_sha256_prefix":"37d7d9e3c5432824","mcp_get_code":{"code_sha256":"37d7d9e3c5432824"}},{"arxiv_id":"2007.13904","arxiv_id_is_arxiv":true,"paper":"/paper/la-maml-look-ahead-meta-learning-for","title":"La-MAML: Look-ahead Meta Learning for Continual Learning","date":"2020-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ContinualAI/avalanche","path":"avalanche/training/regularization.py","file_url":"https://github.com/ContinualAI/avalanche/blob/HEAD/avalanche/training/regularization.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c786263dfd96b80c","code_sha256_prefix":"c786263dfd96b80c","mcp_get_code":{"code_sha256":"c786263dfd96b80c"}},{"arxiv_id":"2002.08679","arxiv_id_is_arxiv":true,"paper":"/paper/neural-network-compression-framework-for-fast","title":"Neural Network Compression Framework for fast model inference","date":"2020-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openvinotoolkit/nncf","path":"src/nncf/common/deprecation.py","file_url":"https://github.com/openvinotoolkit/nncf/blob/HEAD/src/nncf/common/deprecation.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":"aad730edbb0a232f","code_sha256_prefix":"aad730edbb0a232f","mcp_get_code":{"code_sha256":"aad730edbb0a232f"}},{"arxiv_id":"1909.04947","arxiv_id_is_arxiv":true,"paper":"/paper/crocoddyl-an-efficient-and-versatile","title":"Crocoddyl: An Efficient and Versatile Framework for Multi-Contact Optimal Control","date":null,"month_inferred_from_arxiv_id":"2019-09","title_source":"archive","repo":"loco-3d/crocoddyl","path":"bindings/python/crocoddyl/deprecated.py","file_url":"https://github.com/loco-3d/crocoddyl/blob/HEAD/bindings/python/crocoddyl/deprecated.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ebbdc9b24c69b28b","code_sha256_prefix":"ebbdc9b24c69b28b","mcp_get_code":{"code_sha256":"ebbdc9b24c69b28b"}},{"arxiv_id":"1907.10902","arxiv_id_is_arxiv":true,"paper":"/paper/optuna-a-next-generation-hyperparameter","title":"Optuna: A Next-generation Hyperparameter Optimization Framework","date":"2019-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crcrpar/benchmark-runner-ci","path":"optuna/_deprecated.py","file_url":"https://github.com/crcrpar/benchmark-runner-ci/blob/HEAD/optuna/_deprecated.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":"e0f487fc31fe6108","code_sha256_prefix":"e0f487fc31fe6108","mcp_get_code":{"code_sha256":"e0f487fc31fe6108"}},{"arxiv_id":"1907.10902","arxiv_id_is_arxiv":true,"paper":"/paper/optuna-a-next-generation-hyperparameter","title":"Optuna: A Next-generation Hyperparameter Optimization Framework","date":"2019-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"himkt/optuna-test-rtds","path":"optuna/_deprecated.py","file_url":"https://github.com/himkt/optuna-test-rtds/blob/HEAD/optuna/_deprecated.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":"a4522433f0feab75","code_sha256_prefix":"a4522433f0feab75","mcp_get_code":{"code_sha256":"a4522433f0feab75"}},{"arxiv_id":"1907.10164","arxiv_id_is_arxiv":true,"paper":"/paper/cap2det-learning-to-amplify-weak-caption","title":"Cap2Det: Learning to Amplify Weak Caption Supervision for Object Detection","date":"2019-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yekeren/Cap2Det","path":"core/utils.py","file_url":"https://github.com/yekeren/Cap2Det/blob/HEAD/core/utils.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":"9f0bf8e77b1abe07","code_sha256_prefix":"9f0bf8e77b1abe07","mcp_get_code":{"code_sha256":"9f0bf8e77b1abe07"}},{"arxiv_id":"1202.3665","arxiv_id_is_arxiv":true,"paper":"/paper/emcee-the-mcmc-hammer","title":"emcee: The MCMC Hammer","date":null,"month_inferred_from_arxiv_id":"2012-02","title_source":"archive","repo":"dfm/emcee","path":"src/emcee/utils.py","file_url":"https://github.com/dfm/emcee/blob/HEAD/src/emcee/utils.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":"87b482abfc07970e","code_sha256_prefix":"87b482abfc07970e","mcp_get_code":{"code_sha256":"87b482abfc07970e"}},{"arxiv_id":"0809.3437","arxiv_id_is_arxiv":true,"paper":"/paper/multinest-an-efficient-and-robust-bayesian","title":"MultiNest: an efficient and robust Bayesian inference tool for cosmology and particle physics","date":"2008-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Joshuaalbert/jaxns","path":"src/jaxns/warnings.py","file_url":"https://github.com/Joshuaalbert/jaxns/blob/HEAD/src/jaxns/warnings.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":"ef0473308b02e671","code_sha256_prefix":"ef0473308b02e671","mcp_get_code":{"code_sha256":"ef0473308b02e671"}}],"record_sha256":"0de8636d98657602b1a56de09d05c3e9a508cb3a0c04478fc38557f435c91138","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}