{"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/phi","entry":"phi","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":30,"n_papers_ran":22,"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":31,"n_samples_ran":23,"n_samples_fingerprinted":19,"n_places":32,"n_places_pointer_only":19,"by_status":{"ran_honours":5,"ran_violates":5,"ran_draft_wrong":1,"ran_fixture":2,"ran":10,"unverified":8},"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.02232","paper":"/paper/arxiv-2606-02232","title":"A Doeblin-Anchored Contrastive Chart for Learning Markov Transition Kernels","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Ao-Xu/doeblin_exp_2026","path":"experiments/run_experiments.py","file_url":"https://github.com/Ao-Xu/doeblin_exp_2026/blob/HEAD/experiments/run_experiments.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a573d597ab276906","mcp_get_code":{"code_sha256":"a573d597ab276906"}},{"arxiv_id":"2605.21341","paper":"/paper/arxiv-2605-21341","title":"Semiparametric Efficient Bilevel Gradient Estimation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fareselkhoury/Semiparametric-Efficient-Bilevel-Gradient-Estimation","path":"Bellman_b1_obigrad_experiment.py","file_url":"https://github.com/fareselkhoury/Semiparametric-Efficient-Bilevel-Gradient-Estimation/blob/HEAD/Bellman_b1_obigrad_experiment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a0d20c08821184f8","mcp_get_code":{"code_sha256":"a0d20c08821184f8"}},{"arxiv_id":"2605.21341","paper":"/paper/arxiv-2605-21341","title":"Semiparametric Efficient Bilevel Gradient Estimation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fareselkhoury/Semiparametric-Efficient-Bilevel-Gradient-Estimation","path":"Bellman_b4_kbo_regularization_experiment.py","file_url":"https://github.com/fareselkhoury/Semiparametric-Efficient-Bilevel-Gradient-Estimation/blob/HEAD/Bellman_b4_kbo_regularization_experiment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8683e9da241bb40","mcp_get_code":{"code_sha256":"b8683e9da241bb40"}},{"arxiv_id":"2603.27884","paper":"/paper/arxiv-2603-27884","title":"Near-Optimal Primal-Dual Algorithm for Learning Linear Mixture CMDPs with Adversarial Rewards","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"kihyun-yu/pd-powers","path":"cmdp_primal_dual_power.py","file_url":"https://github.com/kihyun-yu/pd-powers/blob/HEAD/cmdp_primal_dual_power.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8a5a69296643c3bf","mcp_get_code":{"code_sha256":"8a5a69296643c3bf"}},{"arxiv_id":"2603.01281","paper":"/paper/arxiv-2603-01281","title":"Spectral Attention Steering for Prompt Highlighting","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"waylonli/SEKA","path":"src/utils.py","file_url":"https://github.com/waylonli/SEKA/blob/HEAD/src/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":"b409389f20aac5ac","mcp_get_code":{"code_sha256":"b409389f20aac5ac"}},{"arxiv_id":"2412.00154","paper":"/paper/o1-coder-an-o1-replication-for-coding","title":"o1-Coder: an o1 Replication for Coding","date":"2024-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adam-bjtu/o1-coder","path":"src/RL/rewards/rewards.py","file_url":"https://github.com/adam-bjtu/o1-coder/blob/HEAD/src/RL/rewards/rewards.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a07a0dde2579431e","mcp_get_code":{"code_sha256":"a07a0dde2579431e"}},{"arxiv_id":"2410.01022","paper":"/paper/learning-grid-cells-by-predictive-coding","title":"Learning grid cells by predictive coding","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"C16Mftang/place-cell-pred-coding","path":"pattern_formation.py","file_url":"https://github.com/C16Mftang/place-cell-pred-coding/blob/HEAD/pattern_formation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7135f81d84a2a308","mcp_get_code":{"code_sha256":"7135f81d84a2a308"}},{"arxiv_id":"2410.02810","paper":"/paper/stateact-state-tracking-and-reasoning-for","title":"StateAct: State Tracking and Reasoning for Acting and Planning with Large Language Models","date":"2024-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai-nikolai/stateact","path":"textcraft_runs/run_textcraft_thread.py","file_url":"https://github.com/ai-nikolai/stateact/blob/HEAD/textcraft_runs/run_textcraft_thread.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9eae20ece0fa12fe","mcp_get_code":{"code_sha256":"9eae20ece0fa12fe"}},{"arxiv_id":"2409.12293","paper":"/paper/provable-in-context-learning-of-linear","title":"In-Context Learning of Linear Systems: Generalization Theory and Applications to Operator Learning","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lugroupumn/icl_linear_systems","path":"utils/data_utils.py","file_url":"https://github.com/lugroupumn/icl_linear_systems/blob/HEAD/utils/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bbc3ea5030c78329","mcp_get_code":{"code_sha256":"bbc3ea5030c78329"}},{"arxiv_id":"2407.07564","paper":"/paper/trainable-highly-expressive-activation","title":"Trainable Highly-expressive Activation Functions","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bgu-cs-vil/ditac","path":"ditac/utils/misc.py","file_url":"https://github.com/bgu-cs-vil/ditac/blob/HEAD/ditac/utils/misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"57b024a42d9d2520","mcp_get_code":{"code_sha256":"57b024a42d9d2520"}},{"arxiv_id":"2406.18752","paper":"/paper/competitive-algorithms-for-online-knapsack","title":"Competitive Algorithms for Online Knapsack with Succinct Predictions","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moreda-a/OKP","path":"Fig 2a/code.py","file_url":"https://github.com/moreda-a/OKP/blob/HEAD/Fig%202a/code.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d2ddfda24bb83b7a","mcp_get_code":{"code_sha256":"d2ddfda24bb83b7a"}},{"arxiv_id":"2406.14036","paper":"/paper/toward-infinite-long-prefix-in-transformer","title":"Towards Infinite-Long Prefix in Transformer","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"christianyang37/chiwun","path":"src/NTK-Attention/ntk_attn_demo.py","file_url":"https://github.com/christianyang37/chiwun/blob/HEAD/src/NTK-Attention/ntk_attn_demo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"46730dd388443496","mcp_get_code":{"code_sha256":"46730dd388443496"}},{"arxiv_id":"2406.01345","paper":"/paper/bmrs-bayesian-model-reduction-for-structured","title":"BMRS: Bayesian Model Reduction for Structured Pruning","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saintslab/bmrs-structured-pruning","path":"modules/layers.py","file_url":"https://github.com/saintslab/bmrs-structured-pruning/blob/HEAD/modules/layers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3f5012a9ea5a467a","mcp_get_code":{"code_sha256":"3f5012a9ea5a467a"}},{"arxiv_id":"2405.17402","paper":"/paper/thread-thinking-deeper-with-recursive","title":"THREAD: Thinking Deeper with Recursive Spawning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"philipmit/thread","path":"alfworld/run_alfworld.py","file_url":"https://github.com/philipmit/thread/blob/HEAD/alfworld/run_alfworld.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9eae20ece0fa12fe","mcp_get_code":{"code_sha256":"9eae20ece0fa12fe"}},{"arxiv_id":"2405.17402","paper":"/paper/thread-thinking-deeper-with-recursive","title":"THREAD: Thinking Deeper with Recursive Spawning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"philipmit/thread","path":"mimiciii_icu_qa/run_mimiciii_icuqa.py","file_url":"https://github.com/philipmit/thread/blob/HEAD/mimiciii_icu_qa/run_mimiciii_icuqa.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"923f66a00de77f15","mcp_get_code":{"code_sha256":"923f66a00de77f15"}},{"arxiv_id":"2403.08757","paper":"/paper/efficient-combinatorial-optimization-via-heat","title":"Efficient Combinatorial Optimization via Heat Diffusion","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AwakerMhy/HeO","path":"mvc.py","file_url":"https://github.com/AwakerMhy/HeO/blob/HEAD/mvc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"721c115ded88d833","mcp_get_code":{"code_sha256":"721c115ded88d833"}},{"arxiv_id":"2307.15593","paper":"/paper/robust-distortion-free-watermarks-for","title":"Robust Distortion-free Watermarks for Language Models","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jthickstun/watermark","path":"watermarking/detection.py","file_url":"https://github.com/jthickstun/watermark/blob/HEAD/watermarking/detection.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4259f229c063dddd","mcp_get_code":{"code_sha256":"4259f229c063dddd"}},{"arxiv_id":"2210.04527","paper":"/paper/a-policy-gradient-approach-for-finite-horizon","title":"A policy gradient approach for Finite Horizon Constrained Markov Decision Processes","date":"2022-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gsoumyajit/Finite-Horizon-with-constraints","path":"finite/acf.py","file_url":"https://github.com/gsoumyajit/Finite-Horizon-with-constraints/blob/HEAD/finite/acf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f30988b943203ca4","mcp_get_code":{"code_sha256":"f30988b943203ca4"}},{"arxiv_id":"2112.15400","paper":"/paper/settling-the-bias-and-variance-of-meta","title":"A Theoretical Understanding of Gradient Bias in Meta-Reinforcement Learning","date":"2021-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Benjamin-eecs/Theoretical-GMRL","path":"lola/lola_dice_original.py","file_url":"https://github.com/Benjamin-eecs/Theoretical-GMRL/blob/HEAD/lola/lola_dice_original.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1bfb38a7f9b8eda2","mcp_get_code":{"code_sha256":"1bfb38a7f9b8eda2"}},{"arxiv_id":"2111.10275","paper":"/paper/composite-goodness-of-fit-tests-with-kernels","title":"Composite Goodness-of-fit Tests with Kernels","date":"2021-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oscarkey/composite-tests","path":"src/composite_tests/distributions/kef.py","file_url":"https://github.com/oscarkey/composite-tests/blob/HEAD/src/composite_tests/distributions/kef.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b96ed8238f45cae0","mcp_get_code":{"code_sha256":"b96ed8238f45cae0"}},{"arxiv_id":"2109.08090","paper":"/paper/disunknown-distilling-unknown-factors-for","title":"DisUnknown: Distilling Unknown Factors for Disentanglement Learning","date":"2021-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stormraiser/disunknown","path":"modules/WNPReLU.py","file_url":"https://github.com/stormraiser/disunknown/blob/HEAD/modules/WNPReLU.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c189942704ce5012","mcp_get_code":{"code_sha256":"c189942704ce5012"}},{"arxiv_id":"2009.14794","paper":"/paper/rethinking-attention-with-performers","title":"Rethinking Attention with Performers","date":"2020-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"teddykoker/performer","path":"performer.py","file_url":"https://github.com/teddykoker/performer/blob/HEAD/performer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d10e6f7a10a8b0d9","mcp_get_code":{"code_sha256":"d10e6f7a10a8b0d9"}},{"arxiv_id":"2008.07298","paper":"/paper/waffle-watermarking-in-federated-learning","title":"WAFFLE: Watermarking in Federated Learning","date":"2020-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssg-research/WAFFLE","path":"src/SBP_utils.py","file_url":"https://github.com/ssg-research/WAFFLE/blob/HEAD/src/SBP_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":"7f2454521cfb65b0","mcp_get_code":{"code_sha256":"7f2454521cfb65b0"}},{"arxiv_id":"2006.13189","paper":"/paper/expert-supervised-reinforcement-learning-for","title":"Expert-Supervised Reinforcement Learning for Offline Policy Learning and Evaluation","date":"2020-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asonabend/dtr_via_surrogate_loss","path":"utils.py","file_url":"https://github.com/asonabend/dtr_via_surrogate_loss/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"91b5337c783e792e","mcp_get_code":{"code_sha256":"91b5337c783e792e"}},{"arxiv_id":"2006.11267","paper":"/paper/fast-matrix-square-roots-with-applications-to","title":"Fast Matrix Square Roots with Applications to Gaussian Processes and Bayesian Optimization","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gpleiss/ciq_experiments","path":"svgp/crps.py","file_url":"https://github.com/gpleiss/ciq_experiments/blob/HEAD/svgp/crps.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":"400cde6d40f64792","mcp_get_code":{"code_sha256":"400cde6d40f64792"}},{"arxiv_id":"2005.02575","paper":"/paper/active-preference-based-gaussian-process","title":"Active Preference-Based Gaussian Process Regression for Reward Learning","date":"2020-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Stanford-ILIAD/active-preference-based-gpr","path":"util.py","file_url":"https://github.com/Stanford-ILIAD/active-preference-based-gpr/blob/HEAD/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e50939e74b93fad3","mcp_get_code":{"code_sha256":"e50939e74b93fad3"}},{"arxiv_id":"1912.03905","paper":"/paper/chainerrl-a-deep-reinforcement-learning","title":"ChainerRL: A Deep Reinforcement Learning Library","date":"2019-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chainer/chainerrl","path":"examples/atari/train_a2c_ale.py","file_url":"https://github.com/chainer/chainerrl/blob/HEAD/examples/atari/train_a2c_ale.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0a2023b3034fef07","mcp_get_code":{"code_sha256":"0a2023b3034fef07"}},{"arxiv_id":"1911.09860","paper":"/paper/data-programming-using-continuous-and-quality","title":"Data Programming using Continuous and Quality-Guided Labeling Functions","date":"2019-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oishik75/CAGE","path":"cage.py","file_url":"https://github.com/oishik75/CAGE/blob/HEAD/cage.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"879c9d9c95108744","mcp_get_code":{"code_sha256":"879c9d9c95108744"}},{"arxiv_id":"1910.09714","paper":"/paper/smoothness-adaptive-stochastic-bandits","title":"Smoothness-Adaptive Contextual Bandits","date":"2019-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"armmn/Smoothness-Adaptive-Contextual-Bandits","path":"Exp211.py","file_url":"https://github.com/armmn/Smoothness-Adaptive-Contextual-Bandits/blob/HEAD/Exp211.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"03dd80301bb5f93c","mcp_get_code":{"code_sha256":"03dd80301bb5f93c"}},{"arxiv_id":"1905.06873","paper":"/paper/das3h-modeling-student-learning-and","title":"DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Skills","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theophilegervet/learner-performance-prediction","path":"encode.py","file_url":"https://github.com/theophilegervet/learner-performance-prediction/blob/HEAD/encode.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7ebe2a9b54bc2a7f","mcp_get_code":{"code_sha256":"7ebe2a9b54bc2a7f"}},{"arxiv_id":"1804.00099","paper":"/paper/graph-convolutional-neural-networks-via-1","title":"Graph Convolutional Neural Networks via Scattering","date":"2018-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmzou/SCAT","path":"scat.py","file_url":"https://github.com/dmzou/SCAT/blob/HEAD/scat.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cc7b03c440566127","mcp_get_code":{"code_sha256":"cc7b03c440566127"}},{"arxiv_id":"1701.08784","paper":"/paper/deep-learning-top-taggers-or-the-end-of-qcd","title":"Deep-learning Top Taggers or The End of QCD?","date":null,"month_inferred_from_arxiv_id":"2017-01","title_source":"archive","repo":"elsaeessc/Deep-Top-based-CNN","path":"preprocessing.py","file_url":"https://github.com/elsaeessc/Deep-Top-based-CNN/blob/HEAD/preprocessing.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5cdbbda47e910667","mcp_get_code":{"code_sha256":"5cdbbda47e910667"}}]}