{"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/logsumexp","entry":"logsumexp","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":55,"n_papers_ran":28,"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":43,"n_samples_ran":16,"n_samples_fingerprinted":9,"n_places":57,"n_places_pointer_only":13,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":9,"ran_fixture":0,"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":"2609.15657","paper":"/paper/arxiv-2609-15657","title":"Predictive Likelihood Ratios for Language Model Watermark Detection","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"MaStatLab/PLRWatermark","path":"code/bayesian_watermark.py","file_url":"https://github.com/MaStatLab/PLRWatermark/blob/HEAD/code/bayesian_watermark.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ea708dfa2b17d157","mcp_get_code":{"code_sha256":"ea708dfa2b17d157"}},{"arxiv_id":"2608.11746","paper":"/paper/arxiv-2608-11746","title":"Epiplexity Guided Data Selection and Generation for Out-of-Distribution Generalization","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"eysu35/EpiSelect","path":"src/data_selectors/episelect.py","file_url":"https://github.com/eysu35/EpiSelect/blob/HEAD/src/data_selectors/episelect.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ce4f99f57dbd7b4c","mcp_get_code":{"code_sha256":"ce4f99f57dbd7b4c"}},{"arxiv_id":"2607.27987","paper":"/paper/arxiv-2607-27987","title":"It's All Just Vectorization: einx, a Universal Notation for Tensor Operations","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"fferflo/einx","path":"einx/_src/adapter/classical_from_classical.py","file_url":"https://github.com/fferflo/einx/blob/HEAD/einx/_src/adapter/classical_from_classical.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dd2dd2ebfc97a75d","mcp_get_code":{"code_sha256":"dd2dd2ebfc97a75d"}},{"arxiv_id":"2605.15488","paper":"/paper/arxiv-2605-15488","title":"SurvivalPFN: Amortizing Survival Prediction via In-Context Bayesian Inference","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"XintianHan/Survival-MDN","path":"mdn_models.py","file_url":"https://github.com/XintianHan/Survival-MDN/blob/HEAD/mdn_models.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":"c850f0c294b86e9d","mcp_get_code":{"code_sha256":"c850f0c294b86e9d"}},{"arxiv_id":"2604.19335","paper":"/paper/arxiv-2604-19335","title":"When Active Learning Falls Short: An Empirical Study on Chemical Reaction Extraction","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"jiangfeng1124/ChemRxnExtractor","path":"chemrxnextractor/models/utils.py","file_url":"https://github.com/jiangfeng1124/ChemRxnExtractor/blob/HEAD/chemrxnextractor/models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"35b6de3a6dc2aecf","mcp_get_code":{"code_sha256":"35b6de3a6dc2aecf"}},{"arxiv_id":"2503.16799","paper":"/paper/causally-aligned-curriculum-learning","title":"Causally Aligned Curriculum Learning","date":"2025-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psclklnk/currot","path":"misc/paper_figures.py","file_url":"https://github.com/psclklnk/currot/blob/HEAD/misc/paper_figures.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e25dc8dc90b7f61d","mcp_get_code":{"code_sha256":"e25dc8dc90b7f61d"}},{"arxiv_id":"2412.03719","paper":"/paper/from-language-models-over-tokens-to-language","title":"From Language Models over Tokens to Language Models over Characters","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"genlm/genlm-bytes","path":"genlm/bytes/util.py","file_url":"https://github.com/genlm/genlm-bytes/blob/HEAD/genlm/bytes/util.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":"b666cd13c0a71c46","mcp_get_code":{"code_sha256":"b666cd13c0a71c46"}},{"arxiv_id":"2410.11820","paper":"/paper/adaptive-data-optimization-dynamic-sample","title":"Adaptive Data Optimization: Dynamic Sample Selection with Scaling Laws","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yidingjiang/ado","path":"src/data_selectors/ado.py","file_url":"https://github.com/yidingjiang/ado/blob/HEAD/src/data_selectors/ado.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a53948498ea45ede","mcp_get_code":{"code_sha256":"a53948498ea45ede"}},{"arxiv_id":"2406.13892","paper":"/paper/adaptable-logical-control-for-large-language","title":"Adaptable Logical Control for Large Language Models","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joshuacnf/Ctrl-G","path":"ctrlg/utils.py","file_url":"https://github.com/joshuacnf/Ctrl-G/blob/HEAD/ctrlg/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d3a5928db0c06ba7","mcp_get_code":{"code_sha256":"d3a5928db0c06ba7"}},{"arxiv_id":"2406.07424","paper":"/paper/miners-multilingual-language-models-as","title":"MINERS: Multilingual Language Models as Semantic Retrievers","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gentaiscool/miners","path":"icl.py","file_url":"https://github.com/gentaiscool/miners/blob/HEAD/icl.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":"80c5aec8fadb2125","mcp_get_code":{"code_sha256":"80c5aec8fadb2125"}},{"arxiv_id":"2405.19080","paper":"/paper/ompo-a-unified-framework-for-rl-under-policy","title":"OMPO: A Unified Framework for RL under Policy and Dynamics Shifts","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"roythuly/ompo","path":"model/utils.py","file_url":"https://github.com/roythuly/ompo/blob/HEAD/model/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"09556d56c8b73050","mcp_get_code":{"code_sha256":"09556d56c8b73050"}},{"arxiv_id":"2401.14758","paper":"/paper/off-policy-primal-dual-safe-reinforcement","title":"Off-Policy Primal-Dual Safe Reinforcement Learning","date":"2024-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZifanWu/CAL","path":"agent/utils.py","file_url":"https://github.com/ZifanWu/CAL/blob/HEAD/agent/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"09556d56c8b73050","mcp_get_code":{"code_sha256":"09556d56c8b73050"}},{"arxiv_id":"2401.13231","paper":"/paper/dittogym-learning-to-control-soft-shape","title":"DittoGym: Learning to Control Soft Shape-Shifting Robots","date":"2024-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suninghuang19/cfp","path":"utils.py","file_url":"https://github.com/suninghuang19/cfp/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":"09556d56c8b73050","mcp_get_code":{"code_sha256":"09556d56c8b73050"}},{"arxiv_id":"2401.04890","paper":"/paper/nonparametric-partial-disentanglement-via","title":"Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions, Interventions and Sparse Temporal Dependencies","date":"2024-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"slachapelle/disentanglement_via_mechanism_sparsity","path":"baseline_models/beta-tcvae/elbo_decomposition.py","file_url":"https://github.com/slachapelle/disentanglement_via_mechanism_sparsity/blob/HEAD/baseline_models/beta-tcvae/elbo_decomposition.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fca04e40e0d22d1e","mcp_get_code":{"code_sha256":"fca04e40e0d22d1e"}},{"arxiv_id":"2311.07941","paper":"/paper/non-autoregressive-machine-translation-with-4","title":"Non-autoregressive Machine Translation with Probabilistic Context-free Grammar","date":"2023-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictnlp/pcfg-nat","path":"fs_plugins/models/glat_decomposed_with_link_two_hands_tri_pcfg.py","file_url":"https://github.com/ictnlp/pcfg-nat/blob/HEAD/fs_plugins/models/glat_decomposed_with_link_two_hands_tri_pcfg.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c16270c5c7c1f2e7","mcp_get_code":{"code_sha256":"c16270c5c7c1f2e7"}},{"arxiv_id":"2310.19089","paper":"/paper/pushdown-layers-encoding-recursive-structure","title":"Pushdown Layers: Encoding Recursive Structure in Transformer Language Models","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"murtyshikhar/pushdown-layers","path":"beam_search_util.py","file_url":"https://github.com/murtyshikhar/pushdown-layers/blob/HEAD/beam_search_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6b331f505ce51944","mcp_get_code":{"code_sha256":"6b331f505ce51944"}},{"arxiv_id":"2310.07403","paper":"/paper/daspeech-directed-acyclic-transformer-for-1","title":"DASpeech: Directed Acyclic Transformer for Fast and High-quality Speech-to-Speech Translation","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictnlp/daspeech","path":"DASpeech/models/s2t_conformer_dag.py","file_url":"https://github.com/ictnlp/daspeech/blob/HEAD/DASpeech/models/s2t_conformer_dag.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"02e100cf1bbee4fc","mcp_get_code":{"code_sha256":"02e100cf1bbee4fc"}},{"arxiv_id":"2307.12063","paper":"/paper/balancing-exploration-and-exploitation-in","title":"Balancing Exploration and Exploitation in Hierarchical Reinforcement Learning via Latent Landmark Graphs","date":"2023-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"papercode2022/hill","path":"HILL/hill/algos/sac/utils.py","file_url":"https://github.com/papercode2022/hill/blob/HEAD/HILL/hill/algos/sac/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"09556d56c8b73050","mcp_get_code":{"code_sha256":"09556d56c8b73050"}},{"arxiv_id":"2306.07176","paper":"/paper/unbalanced-optimal-transport-meets-sliced","title":"Slicing Unbalanced Optimal Transport","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clbonet/Slicing_Unbalanced_Optimal_Transport","path":"sliceduot/sliced_uot.py","file_url":"https://github.com/clbonet/Slicing_Unbalanced_Optimal_Transport/blob/HEAD/sliceduot/sliced_uot.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fdfc994f94c3f151","mcp_get_code":{"code_sha256":"fdfc994f94c3f151"}},{"arxiv_id":"2306.03081","paper":"/paper/sequential-monte-carlo-steering-of-large","title":"Sequential Monte Carlo Steering of Large Language Models using Probabilistic Programs","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"probcomp/hfppl","path":"llamppl/util.py","file_url":"https://github.com/probcomp/hfppl/blob/HEAD/llamppl/util.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":"4aa1e61f6833bddb","mcp_get_code":{"code_sha256":"4aa1e61f6833bddb"}},{"arxiv_id":"2305.05760","paper":"/paper/reducing-the-cost-of-cycle-time-tuning-for","title":"Reducing the Cost of Cycle-Time Tuning for Real-World Policy Optimization","date":"2023-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"homayoonfarrahi/cycle-time-study","path":"sac/utils.py","file_url":"https://github.com/homayoonfarrahi/cycle-time-study/blob/HEAD/sac/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"09556d56c8b73050","mcp_get_code":{"code_sha256":"09556d56c8b73050"}},{"arxiv_id":"2304.14762","paper":"/paper/using-perturbation-to-improve-goodness-of-fit","title":"Using Perturbation to Improve Goodness-of-Fit Tests based on Kernelized Stein Discrepancy","date":"2023-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XingLLiu/pksd","path":"pksd/models_np.py","file_url":"https://github.com/XingLLiu/pksd/blob/HEAD/pksd/models_np.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e9f4edd607a92bd","mcp_get_code":{"code_sha256":"1e9f4edd607a92bd"}},{"arxiv_id":"2304.11791","paper":"/paper/directed-acyclic-transformer-pre-training-for","title":"Directed Acyclic Transformer Pre-training for High-quality Non-autoregressive Text Generation","date":"2023-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"c16270c5c7c1f2e7","mcp_get_code":{"code_sha256":"c16270c5c7c1f2e7"}},{"arxiv_id":"2210.05193","paper":"/paper/viterbi-decoding-of-directed-acyclic","title":"Viterbi Decoding of Directed Acyclic Transformer for Non-Autoregressive Machine Translation","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"c16270c5c7c1f2e7","mcp_get_code":{"code_sha256":"c16270c5c7c1f2e7"}},{"arxiv_id":"2206.14774","paper":"/paper/tweetnlp-cutting-edge-natural-language","title":"TweetNLP: Cutting-Edge Natural Language Processing for Social Media","date":"2022-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cardiffnlp/tweetnlp","path":"tweetnlp/ner/allennlp_crf.py","file_url":"https://github.com/cardiffnlp/tweetnlp/blob/HEAD/tweetnlp/ner/allennlp_crf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"35b6de3a6dc2aecf","mcp_get_code":{"code_sha256":"35b6de3a6dc2aecf"}},{"arxiv_id":"2205.07459","paper":"/paper/directed-acyclic-transformer-for-non","title":"Directed Acyclic Transformer for Non-Autoregressive Machine Translation","date":"2022-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"c16270c5c7c1f2e7","mcp_get_code":{"code_sha256":"c16270c5c7c1f2e7"}},{"arxiv_id":"2202.04933","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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a5d7c8bbd5782ef5","mcp_get_code":{"code_sha256":"a5d7c8bbd5782ef5"}},{"arxiv_id":"2106.01528","paper":"/paper/normalizing-flows-for-knockoff-free","title":"Normalizing Flows for Knockoff-free Controlled Feature Selection","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tansey/hrt","path":"pyhrt/hrt.py","file_url":"https://github.com/tansey/hrt/blob/HEAD/pyhrt/hrt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c73bee7360661346","mcp_get_code":{"code_sha256":"c73bee7360661346"}},{"arxiv_id":"2105.12848","paper":"/paper/bertifying-the-hidden-markov-model-for-multi","title":"BERTifying the Hidden Markov Model for Multi-Source Weakly Supervised Named Entity Recognition","date":"2021-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yinghao-Li/Sparse-CHMM","path":"sparse_chmm/math.py","file_url":"https://github.com/Yinghao-Li/Sparse-CHMM/blob/HEAD/sparse_chmm/math.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":"9b68df96cc5a0174","mcp_get_code":{"code_sha256":"9b68df96cc5a0174"}},{"arxiv_id":"2010.09163","paper":"/paper/d2rl-deep-dense-architectures-in-1","title":"D2RL: Deep Dense Architectures in Reinforcement Learning","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pairlab/d2rl","path":"sac/utils.py","file_url":"https://github.com/pairlab/d2rl/blob/HEAD/sac/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"09556d56c8b73050","mcp_get_code":{"code_sha256":"09556d56c8b73050"}},{"arxiv_id":"2010.08830","paper":"/paper/mesa-boost-ensemble-imbalanced-learning-with","title":"MESA: Boost Ensemble Imbalanced Learning with MEta-SAmpler","date":"2020-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhiningLiu1998/mesa","path":"sac_src/utils.py","file_url":"https://github.com/ZhiningLiu1998/mesa/blob/HEAD/sac_src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"09556d56c8b73050","mcp_get_code":{"code_sha256":"09556d56c8b73050"}},{"arxiv_id":"2010.02014","paper":"/paper/self-supervised-variational-auto-encoders-1","title":"Self-Supervised Variational Auto-Encoders","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ioangatop/srVAE","path":"src/modules/distributions.py","file_url":"https://github.com/ioangatop/srVAE/blob/HEAD/src/modules/distributions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e31acf8ae4c97fee","mcp_get_code":{"code_sha256":"e31acf8ae4c97fee"}},{"arxiv_id":"2008.00401","paper":"/paper/multilingual-translation-with-extensible","title":"Multilingual Translation with Extensible Multilingual Pretraining and Finetuning","date":"2020-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kenji-imamura/sentpiece_mimic","path":"src/SentPiece.py","file_url":"https://github.com/kenji-imamura/sentpiece_mimic/blob/HEAD/src/SentPiece.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":"6f6b1d2434485fd7","mcp_get_code":{"code_sha256":"6f6b1d2434485fd7"}},{"arxiv_id":"2007.04504","paper":"/paper/learning-differential-equations-that-are-easy","title":"Learning Differential Equations that are Easy to Solve","date":"2020-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacobjinkelly/easy-neural-ode","path":"latent_ode.py","file_url":"https://github.com/jacobjinkelly/easy-neural-ode/blob/HEAD/latent_ode.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e4000e2918f09cf6","mcp_get_code":{"code_sha256":"e4000e2918f09cf6"}},{"arxiv_id":"2004.14451","paper":"/paper/pragmatic-issue-sensitive-image-captioning","title":"Pragmatic Issue-Sensitive Image Captioning","date":"2020-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"a4b037b438505679","mcp_get_code":{"code_sha256":"a4b037b438505679"}},{"arxiv_id":"2004.04096","paper":"/paper/probabilistic-embeddings-for-speaker","title":"Probabilistic embeddings for speaker diarization","date":"2020-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bsxfan/probabilistic_embeddings","path":"lib/deriv/adfunctions.py","file_url":"https://github.com/bsxfan/probabilistic_embeddings/blob/HEAD/lib/deriv/adfunctions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f64ca25c9836a19a","mcp_get_code":{"code_sha256":"f64ca25c9836a19a"}},{"arxiv_id":"2002.08276","paper":"/paper/partial-gromov-wasserstein-with-applications","title":"Partial Optimal Transport with Applications on Positive-Unlabeled Learning","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rflamary/POT","path":"ot/dr.py","file_url":"https://github.com/rflamary/POT/blob/HEAD/ot/dr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c7a68e23d2667c68","mcp_get_code":{"code_sha256":"c7a68e23d2667c68"}},{"arxiv_id":"2002.02798","paper":"/paper/how-to-train-your-neural-ode","title":"How to train your neural ODE: the world of Jacobian and kinetic regularization","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-hash-code/ffjord-rnode-finalweek-mnist","path":"lib/utils.py","file_url":"https://github.com/D-hash-code/ffjord-rnode-finalweek-mnist/blob/HEAD/lib/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bc02f37ed2da5d95","mcp_get_code":{"code_sha256":"bc02f37ed2da5d95"}},{"arxiv_id":"1911.02256","paper":"/paper/a-divergence-minimization-perspective-on","title":"A Divergence Minimization Perspective on Imitation Learning Methods","date":"2019-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KamyarGh/rl_swiss","path":"neural_processes/neural_process.py","file_url":"https://github.com/KamyarGh/rl_swiss/blob/HEAD/neural_processes/neural_process.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a4b037b438505679","mcp_get_code":{"code_sha256":"a4b037b438505679"}},{"arxiv_id":"1909.04121","paper":"/paper/ac-teach-a-bayesian-actor-critic-method-for","title":"AC-Teach: A Bayesian Actor-Critic Method for Policy Learning with an Ensemble of Suboptimal Teachers","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"StanfordVL/ac-teach","path":"src/rl_with_teachers/learners.py","file_url":"https://github.com/StanfordVL/ac-teach/blob/HEAD/src/rl_with_teachers/learners.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e953bace630bfce8","mcp_get_code":{"code_sha256":"e953bace630bfce8"}},{"arxiv_id":"1906.02771","paper":"/paper/improving-exploration-in-soft-actor-critic","title":"Improving Exploration in Soft-Actor-Critic with Normalizing Flows Policies","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeybose/FloRL","path":"pytorch-soft-actor-critic/utils.py","file_url":"https://github.com/joeybose/FloRL/blob/HEAD/pytorch-soft-actor-critic/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"09556d56c8b73050","mcp_get_code":{"code_sha256":"09556d56c8b73050"}},{"arxiv_id":"1906.02735","paper":"/paper/residual-flows-for-invertible-generative","title":"Residual Flows for Invertible Generative Modeling","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eyalbetzalel/residual-flows","path":"lib/utils.py","file_url":"https://github.com/eyalbetzalel/residual-flows/blob/HEAD/lib/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bc02f37ed2da5d95","mcp_get_code":{"code_sha256":"bc02f37ed2da5d95"}},{"arxiv_id":"1905.10659","paper":"/paper/an-ensemble-of-bayesian-neural-networks-for","title":"An Ensemble of Bayesian Neural Networks for Exoplanetary Atmospheric Retrieval","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"exoml/plan-net","path":"code/plan_net.py","file_url":"https://github.com/exoml/plan-net/blob/HEAD/code/plan_net.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a33dbe4bc8f3c8e0","mcp_get_code":{"code_sha256":"a33dbe4bc8f3c8e0"}},{"arxiv_id":"1904.02343","paper":"/paper/density-matching-for-bilingual-word-embedding","title":"Density Matching for Bilingual Word Embedding","date":"2019-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"violet-zct/DeMa-BWE","path":"modules/flows/mog_flow.py","file_url":"https://github.com/violet-zct/DeMa-BWE/blob/HEAD/modules/flows/mog_flow.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":"e805f303d844a45d","mcp_get_code":{"code_sha256":"e805f303d844a45d"}},{"arxiv_id":"1809.10341","paper":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SpaceLearner/DisenGraphRep","path":"models/infomax.py","file_url":"https://github.com/SpaceLearner/DisenGraphRep/blob/HEAD/models/infomax.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef2e8969dc4b82fe","mcp_get_code":{"code_sha256":"ef2e8969dc4b82fe"}},{"arxiv_id":"1809.10341","paper":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SpaceLearner/DisenGraphRep","path":"models/dgi.py","file_url":"https://github.com/SpaceLearner/DisenGraphRep/blob/HEAD/models/dgi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5b63bfbc3d382b97","mcp_get_code":{"code_sha256":"5b63bfbc3d382b97"}},{"arxiv_id":"1806.02426","paper":"/paper/deep-variational-reinforcement-learning-for","title":"Deep Variational Reinforcement Learning for POMDPs","date":"2018-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maximilianigl/DVRL","path":"code/aesmc/math.py","file_url":"https://github.com/maximilianigl/DVRL/blob/HEAD/code/aesmc/math.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":"73ebd32c9d197241","mcp_get_code":{"code_sha256":"73ebd32c9d197241"}},{"arxiv_id":"1806.00550","paper":"/paper/a-swiss-army-infinitesimal-jackknife","title":"A Swiss Army Infinitesimal Jackknife","date":null,"month_inferred_from_arxiv_id":"2018-06","title_source":"archive","repo":"rgiordan/paragami","path":"paragami/simplex_patterns.py","file_url":"https://github.com/rgiordan/paragami/blob/HEAD/paragami/simplex_patterns.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":"39be29e5b164b2e7","mcp_get_code":{"code_sha256":"39be29e5b164b2e7"}},{"arxiv_id":"1805.10522","paper":"/paper/calibrating-deep-convolutional-gaussian","title":"Calibrating Deep Convolutional Gaussian Processes","date":"2018-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GiaLacTRAN/convolutional_deep_gp_random_features","path":"code/utils.py","file_url":"https://github.com/GiaLacTRAN/convolutional_deep_gp_random_features/blob/HEAD/code/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":"90a47165c25ec08f","mcp_get_code":{"code_sha256":"90a47165c25ec08f"}},{"arxiv_id":"1802.04942","paper":"/paper/isolating-sources-of-disentanglement-in","title":"Isolating Sources of Disentanglement in Variational Autoencoders","date":"2018-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianyu-lu/tcvae","path":"elbo_decomposition.py","file_url":"https://github.com/tianyu-lu/tcvae/blob/HEAD/elbo_decomposition.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fca04e40e0d22d1e","mcp_get_code":{"code_sha256":"fca04e40e0d22d1e"}},{"arxiv_id":"1802.04942","paper":"/paper/isolating-sources-of-disentanglement-in","title":"Isolating Sources of Disentanglement in Variational Autoencoders","date":"2018-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rtqichen/beta-tcvae","path":"lib/utils.py","file_url":"https://github.com/rtqichen/beta-tcvae/blob/HEAD/lib/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0213e98ab9ef1e9b","mcp_get_code":{"code_sha256":"0213e98ab9ef1e9b"}},{"arxiv_id":"1710.11417","paper":"/paper/treeqn-and-atreec-differentiable-tree","title":"TreeQN and ATreeC: Differentiable Tree-Structured Models for Deep Reinforcement Learning","date":"2017-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oxwhirl/treeqn","path":"treeqn/utils/pytorch_utils.py","file_url":"https://github.com/oxwhirl/treeqn/blob/HEAD/treeqn/utils/pytorch_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c619fbfa4f66965","mcp_get_code":{"code_sha256":"3c619fbfa4f66965"}},{"arxiv_id":"1606.04934","paper":"/paper/improving-variational-inference-with-inverse","title":"Improving Variational Inference with Inverse Autoregressive Flow","date":"2016-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/iaf","path":"tf_utils/distributions.py","file_url":"https://github.com/openai/iaf/blob/HEAD/tf_utils/distributions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ce0ecda2d9784fab","mcp_get_code":{"code_sha256":"ce0ecda2d9784fab"}},{"arxiv_id":"1603.01354","paper":"/paper/end-to-end-sequence-labeling-via-bi","title":"End-to-end Sequence Labeling via Bi-directional LSTM-CNNs-CRF","date":"2016-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epwalsh/pytorch-crf","path":"pycrf/modules/crf.py","file_url":"https://github.com/epwalsh/pytorch-crf/blob/HEAD/pycrf/modules/crf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c43b937718b773ad","mcp_get_code":{"code_sha256":"c43b937718b773ad"}},{"arxiv_id":"1406.2751","paper":"/paper/reweighted-wake-sleep","title":"Reweighted Wake-Sleep","date":"2014-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kpoeppel/pytorch_probgraph","path":"pytorch_probgraph/hm.py","file_url":"https://github.com/kpoeppel/pytorch_probgraph/blob/HEAD/pytorch_probgraph/hm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"fc88f487990b9397","mcp_get_code":{"code_sha256":"fc88f487990b9397"}},{"arxiv_id":"2025.findings-emnlp.327","paper":null,"title":"arXiv:2025.findings-emnlp.327","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jipy0222/TNAD","path":"models/dat_utils.py","file_url":"https://github.com/jipy0222/TNAD/blob/HEAD/models/dat_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b3cb10c3a5e6c8f7","mcp_get_code":{"code_sha256":"b3cb10c3a5e6c8f7"}},{"arxiv_id":"2021.emnlp-main.291","paper":null,"title":"arXiv:2021.emnlp-main.291","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"JZX555/FGDA","path":"model/bertCRF.py","file_url":"https://github.com/JZX555/FGDA/blob/HEAD/model/bertCRF.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":"ddffb47a00250425","mcp_get_code":{"code_sha256":"ddffb47a00250425"}}]}