{"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/shuffle","entry":"shuffle","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":35,"n_papers_ran":32,"n_papers_ran_no_instrument_failure":24,"n_papers_ran_instrument_only":8,"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":30,"n_samples_ran":27,"n_samples_constructed":0,"n_samples_ran_checked":21,"n_samples_instrument":6,"n_samples_unverified":3,"n_samples_fingerprinted":18,"n_places":35,"n_places_pointer_only":13,"n_places_pointer_only_link_open":0,"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":7,"ran_violates":2,"ran_draft_wrong":4,"ran_fixture":2,"ran":12,"unverified":3},"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":"2604.21238","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-21238","title":"Unlocking the Power of Large Language Models for Multi-Table Entity Matching","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Ymeki/LLM4MEM","path":"utils.py","file_url":"https://github.com/Ymeki/LLM4MEM/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Ymeki/LLM4MEM when it was checked","code_sha256":"c97239d4646d3339","code_sha256_prefix":"c97239d4646d3339","mcp_get_code":{"code_sha256":"c97239d4646d3339"}},{"arxiv_id":"2601.22029","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22029","title":"The Ensemble Inverse Problem: Applications and Methods","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"ZhengyanHuan/The-Ensemble-Inverse-Problem--Applications-and-Methods","path":"Sec3p2/plot_func.py","file_url":"https://github.com/ZhengyanHuan/The-Ensemble-Inverse-Problem--Applications-and-Methods/blob/HEAD/Sec3p2/plot_func.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ZhengyanHuan/The-Ensemble-Inverse-Problem--Applications-and-Methods when it was checked","code_sha256":"84489a68e2b4465d","code_sha256_prefix":"84489a68e2b4465d","mcp_get_code":{"code_sha256":"84489a68e2b4465d"}},{"arxiv_id":"2506.20512","arxiv_id_is_arxiv":true,"paper":"/paper/octothinker-mid-training-incentivizes","title":"OctoThinker: Mid-training Incentivizes Reinforcement Learning Scaling","date":"2025-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gair-nlp/octothinker","path":"eval/utils.py","file_url":"https://github.com/gair-nlp/octothinker/blob/HEAD/eval/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3358374eed4646e4","code_sha256_prefix":"3358374eed4646e4","mcp_get_code":{"code_sha256":"3358374eed4646e4"}},{"arxiv_id":"2410.13761","arxiv_id_is_arxiv":true,"paper":"/paper/gder-safeguarding-efficiency-balancing-and","title":"GDeR: Safeguarding Efficiency, Balancing, and Robustness via Prototypical Graph Pruning","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ins1stenc3/GDeR","path":"load_dataset.py","file_url":"https://github.com/ins1stenc3/GDeR/blob/HEAD/load_dataset.py","status":"unverified","verification_level":0,"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, ins1stenc3/GDeR when it was checked","code_sha256":"c9784c69b04f8033","code_sha256_prefix":"c9784c69b04f8033","mcp_get_code":{"code_sha256":"c9784c69b04f8033"}},{"arxiv_id":"2408.07471","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-and-modeling-correlations-in","title":"Bridging and Modeling Correlations in Pairwise Data for Direct Preference Optimization","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YJiangcm/BMC","path":"eval/math/prepare_train_data.py","file_url":"https://github.com/YJiangcm/BMC/blob/HEAD/eval/math/prepare_train_data.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":"c35f14527d73a1ed","code_sha256_prefix":"c35f14527d73a1ed","mcp_get_code":{"code_sha256":"c35f14527d73a1ed"}},{"arxiv_id":"2406.15812","arxiv_id_is_arxiv":true,"paper":"/paper/intrinsic-dimension-correlation-uncovering","title":"Intrinsic Dimension Correlation: uncovering nonlinear connections in multimodal representations","date":"2024-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorenzobasile/IDCorrelation","path":"utils/metrics.py","file_url":"https://github.com/lorenzobasile/IDCorrelation/blob/HEAD/utils/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lorenzobasile/IDCorrelation when it was checked","code_sha256":"50810c2ae403377b","code_sha256_prefix":"50810c2ae403377b","mcp_get_code":{"code_sha256":"50810c2ae403377b"}},{"arxiv_id":"2405.17767","arxiv_id_is_arxiv":true,"paper":"/paper/linguistic-collapse-neural-collapse-in-large","title":"Linguistic Collapse: Neural Collapse in (Large) Language Models","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rhubarbwu/linguistic-collapse","path":"count.py","file_url":"https://github.com/rhubarbwu/linguistic-collapse/blob/HEAD/count.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, rhubarbwu/linguistic-collapse when it was checked","code_sha256":"07dd1a4ae14651c9","code_sha256_prefix":"07dd1a4ae14651c9","mcp_get_code":{"code_sha256":"07dd1a4ae14651c9"}},{"arxiv_id":"2405.14365","arxiv_id_is_arxiv":true,"paper":"/paper/jiuzhang3-0-efficiently-improving","title":"JiuZhang3.0: Efficiently Improving Mathematical Reasoning by Training Small Data Synthesis Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/jiuzhang3.0","path":"prepare_train_data.py","file_url":"https://github.com/rucaibox/jiuzhang3.0/blob/HEAD/prepare_train_data.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, rucaibox/jiuzhang3.0 when it was checked","code_sha256":"c35f14527d73a1ed","code_sha256_prefix":"c35f14527d73a1ed","mcp_get_code":{"code_sha256":"c35f14527d73a1ed"}},{"arxiv_id":"2404.03392","arxiv_id_is_arxiv":true,"paper":"/paper/two-tricks-to-improve-unsupervised","title":"Boosting Unsupervised Segmentation Learning","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alperensari/segmentation-tricks","path":"utils_metric.py","file_url":"https://github.com/alperensari/segmentation-tricks/blob/HEAD/utils_metric.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alperensari/segmentation-tricks when it was checked","code_sha256":"205e834237bf794c","code_sha256_prefix":"205e834237bf794c","mcp_get_code":{"code_sha256":"205e834237bf794c"}},{"arxiv_id":"2403.01482","arxiv_id_is_arxiv":true,"paper":"/paper/eagle-eigen-aggregation-learning-for-object","title":"EAGLE: Eigen Aggregation Learning for Object-Centric Unsupervised Semantic Segmentation","date":"2024-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MICV-yonsei/EAGLE","path":"src_EAGLE/utils.py","file_url":"https://github.com/MICV-yonsei/EAGLE/blob/HEAD/src_EAGLE/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"205e834237bf794c","code_sha256_prefix":"205e834237bf794c","mcp_get_code":{"code_sha256":"205e834237bf794c"}},{"arxiv_id":"2402.03300","arxiv_id_is_arxiv":true,"paper":"/paper/deepseekmath-pushing-the-limits-of","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepseek-ai/deepseek-math","path":"evaluation/utils.py","file_url":"https://github.com/deepseek-ai/deepseek-math/blob/HEAD/evaluation/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d4da55afb0377ec","code_sha256_prefix":"1d4da55afb0377ec","mcp_get_code":{"code_sha256":"1d4da55afb0377ec"}},{"arxiv_id":"2310.13852","arxiv_id_is_arxiv":true,"paper":"/paper/gradual-domain-adaptation-theory-and","title":"Gradual Domain Adaptation: Theory and Algorithms","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifei-he/goat","path":"dataset.py","file_url":"https://github.com/yifei-he/goat/blob/HEAD/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"73a5a29137cb1d07","code_sha256_prefix":"73a5a29137cb1d07","mcp_get_code":{"code_sha256":"73a5a29137cb1d07"}},{"arxiv_id":"2310.02233","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-schrodinger-bridge-matching","title":"Generalized Schrödinger Bridge Matching","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/generalized-schrodinger-bridge-matching","path":"gsbm/evaluator.py","file_url":"https://github.com/facebookresearch/generalized-schrodinger-bridge-matching/blob/HEAD/gsbm/evaluator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/generalized-schrodinger-bridge-matching (NOASSERTION)","code_sha256":"d0bda32f4b2dc376","code_sha256_prefix":"d0bda32f4b2dc376","mcp_get_code":{"code_sha256":"d0bda32f4b2dc376"}},{"arxiv_id":"2309.13439","arxiv_id_is_arxiv":true,"paper":"/paper/finding-order-in-chaos-a-novel-data-1","title":"Finding Order in Chaos: A Novel Data Augmentation Method for Time Series in Contrastive Learning","date":"2023-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-siplab/finding_order_in_chaos","path":"augmentations.py","file_url":"https://github.com/eth-siplab/finding_order_in_chaos/blob/HEAD/augmentations.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, eth-siplab/finding_order_in_chaos when it was checked","code_sha256":"c28d10c26b7b61d0","code_sha256_prefix":"c28d10c26b7b61d0","mcp_get_code":{"code_sha256":"c28d10c26b7b61d0"}},{"arxiv_id":"2212.02233","arxiv_id_is_arxiv":true,"paper":"/paper/wearable-based-human-activity-recognition","title":"Wearable-based Human Activity Recognition with Spatio-Temporal Spiking Neural Networks","date":"2022-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-computing-lab-yale/snn_har","path":"augmentations.py","file_url":"https://github.com/intelligent-computing-lab-yale/snn_har/blob/HEAD/augmentations.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":"8a18464ef09fd0f6","code_sha256_prefix":"8a18464ef09fd0f6","mcp_get_code":{"code_sha256":"8a18464ef09fd0f6"}},{"arxiv_id":"2207.04895","arxiv_id_is_arxiv":true,"paper":"/paper/bottlenecks-club-unifying-information","title":"Bottlenecks CLUB: Unifying Information-Theoretic Trade-offs Among Complexity, Leakage, and Utility","date":"2022-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BehroozRazeghi/CLUB","path":"utils/mine.py","file_url":"https://github.com/BehroozRazeghi/CLUB/blob/HEAD/utils/mine.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dcb7882ba2120be4","code_sha256_prefix":"dcb7882ba2120be4","mcp_get_code":{"code_sha256":"dcb7882ba2120be4"}},{"arxiv_id":"2206.09843","arxiv_id_is_arxiv":true,"paper":"/paper/contextual-squeeze-and-excitation-for","title":"Contextual Squeeze-and-Excitation for Efficient Few-Shot Image Classification","date":"2022-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mpatacchiola/contextual-squeeze-and-excitation","path":"run_metadataset.py","file_url":"https://github.com/mpatacchiola/contextual-squeeze-and-excitation/blob/HEAD/run_metadataset.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"180ce251fbb5b1ad","code_sha256_prefix":"180ce251fbb5b1ad","mcp_get_code":{"code_sha256":"180ce251fbb5b1ad"}},{"arxiv_id":"2203.08414","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-semantic-segmentation-by-2","title":"Unsupervised Semantic Segmentation by Distilling Feature Correspondences","date":"2022-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mhamilton723/STEGO","path":"src/train_segmentation.py","file_url":"https://github.com/mhamilton723/STEGO/blob/HEAD/src/train_segmentation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"205e834237bf794c","code_sha256_prefix":"205e834237bf794c","mcp_get_code":{"code_sha256":"205e834237bf794c"}},{"arxiv_id":"2107.01105","arxiv_id_is_arxiv":true,"paper":"/paper/memory-efficient-meta-learning-with-large","title":"Memory Efficient Meta-Learning with Large Images","date":"2021-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridge-mlg/LITE","path":"src/utils.py","file_url":"https://github.com/cambridge-mlg/LITE/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e3e669ad7a0bde46","code_sha256_prefix":"e3e669ad7a0bde46","mcp_get_code":{"code_sha256":"e3e669ad7a0bde46"}},{"arxiv_id":"2106.08453","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-trained-weights-in-wide-neural","title":"How to Train Your Wide Neural Network Without Backprop: An Input-Weight Alignment Perspective","date":"2021-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fietelab/wide-network-alignment","path":"alignment_cifar.py","file_url":"https://github.com/fietelab/wide-network-alignment/blob/HEAD/alignment_cifar.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"169575fc2515e3b6","code_sha256_prefix":"169575fc2515e3b6","mcp_get_code":{"code_sha256":"169575fc2515e3b6"}},{"arxiv_id":"2104.01320","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-on-channel-effects-for","title":"An Empirical Study on Channel Effects for Synthetic Voice Spoofing Countermeasure Systems","date":"2021-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzyouzhang/asvspoof2021_air","path":"main_train.py","file_url":"https://github.com/yzyouzhang/asvspoof2021_air/blob/HEAD/main_train.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":"6e88ac6fb45d54ef","code_sha256_prefix":"6e88ac6fb45d54ef","mcp_get_code":{"code_sha256":"6e88ac6fb45d54ef"}},{"arxiv_id":"2006.06332","arxiv_id_is_arxiv":true,"paper":"/paper/a-variational-approach-to-privacy-and","title":"A Variational Approach to Privacy and Fairness","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BehroozRazeghi/Variational-Leakage","path":"utils/mine.py","file_url":"https://github.com/BehroozRazeghi/Variational-Leakage/blob/HEAD/utils/mine.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dcb7882ba2120be4","code_sha256_prefix":"dcb7882ba2120be4","mcp_get_code":{"code_sha256":"dcb7882ba2120be4"}},{"arxiv_id":"2002.04694","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-robustness-for-code","title":"Adversarial Robustness for Code","date":"2020-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/robust-code","path":"robustcode/parsers/parser.py","file_url":"https://github.com/eth-sri/robust-code/blob/HEAD/robustcode/parsers/parser.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aa232e245bdcd69e","code_sha256_prefix":"aa232e245bdcd69e","mcp_get_code":{"code_sha256":"aa232e245bdcd69e"}},{"arxiv_id":"1907.06902","arxiv_id_is_arxiv":true,"paper":"/paper/are-we-really-making-much-progress-a-worrying","title":"Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches","date":"2019-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaurizioFD/RecSys2019_DeepLearning_Evaluation","path":"Conferences/IJCAI/ConvNCF_our_interface/ConvNCF.py","file_url":"https://github.com/MaurizioFD/RecSys2019_DeepLearning_Evaluation/blob/HEAD/Conferences/IJCAI/ConvNCF_our_interface/ConvNCF.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, MaurizioFD/RecSys2019_DeepLearning_Evaluation, is not in the permissive set Syntology serves inline","code_sha256":"6f9a56e47e7765ae","code_sha256_prefix":"6f9a56e47e7765ae","mcp_get_code":{"code_sha256":"6f9a56e47e7765ae"}},{"arxiv_id":"1905.09275","arxiv_id_is_arxiv":true,"paper":"/paper/cobra-data-efficient-model-based-rl-through","title":"COBRA: Data-Efficient Model-Based RL through Unsupervised Object Discovery and Curiosity-Driven Exploration","date":"2019-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/spriteworld","path":"spriteworld/sprite_generators.py","file_url":"https://github.com/deepmind/spriteworld/blob/HEAD/spriteworld/sprite_generators.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":"5af55bc5d9e1b38d","code_sha256_prefix":"5af55bc5d9e1b38d","mcp_get_code":{"code_sha256":"5af55bc5d9e1b38d"}},{"arxiv_id":"1809.05922","arxiv_id_is_arxiv":true,"paper":"/paper/memory-efficient-experience-replay-for","title":"Memory Efficient Experience Replay for Streaming Learning","date":"2018-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tyler-hayes/ExStream","path":"utils.py","file_url":"https://github.com/tyler-hayes/ExStream/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"288311e940d7b1e2","code_sha256_prefix":"288311e940d7b1e2","mcp_get_code":{"code_sha256":"288311e940d7b1e2"}},{"arxiv_id":"1807.09536","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-incremental-learning","title":"End-to-End Incremental Learning","date":"2018-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"axelmukwena/biometricECG","path":"utils.py","file_url":"https://github.com/axelmukwena/biometricECG/blob/HEAD/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":"e88d07e0f6a17a4e","code_sha256_prefix":"e88d07e0f6a17a4e","mcp_get_code":{"code_sha256":"e88d07e0f6a17a4e"}},{"arxiv_id":"1805.03162","arxiv_id_is_arxiv":true,"paper":"/paper/polite-dialogue-generation-without-parallel","title":"Polite Dialogue Generation Without Parallel Data","date":"2018-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WolfNiu/polite-dialogue-generation","path":"src/model/LSTM-CNN-multi-GPU-new_vocab.py","file_url":"https://github.com/WolfNiu/polite-dialogue-generation/blob/HEAD/src/model/LSTM-CNN-multi-GPU-new_vocab.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a4b5a8d188329b96","code_sha256_prefix":"a4b5a8d188329b96","mcp_get_code":{"code_sha256":"a4b5a8d188329b96"}},{"arxiv_id":"1801.04062","arxiv_id_is_arxiv":true,"paper":"/paper/mine-mutual-information-neural-estimation","title":"MINE: Mutual Information Neural Estimation","date":"2018-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChengzhangZhu/MINE","path":"mine.py","file_url":"https://github.com/ChengzhangZhu/MINE/blob/HEAD/mine.py","status":"unverified","verification_level":0,"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, ChengzhangZhu/MINE when it was checked","code_sha256":"7697af4755f25282","code_sha256_prefix":"7697af4755f25282","mcp_get_code":{"code_sha256":"7697af4755f25282"}},{"arxiv_id":"1711.06114","arxiv_id_is_arxiv":true,"paper":"/paper/robust-unsupervised-domain-adaptation-for","title":"Robust Unsupervised Domain Adaptation for Neural Networks via Moment Alignment","date":"2017-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wzell/mann","path":"sentiment_analysis.py","file_url":"https://github.com/wzell/mann/blob/HEAD/sentiment_analysis.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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, wzell/mann, is not in the permissive set Syntology serves inline","code_sha256":"8536663c9d029ddb","code_sha256_prefix":"8536663c9d029ddb","mcp_get_code":{"code_sha256":"8536663c9d029ddb"}},{"arxiv_id":"1602.02830","arxiv_id_is_arxiv":true,"paper":"/paper/binarized-neural-networks-training-deep","title":"Binarized Neural Networks: Training Deep Neural Networks with Weights and Activations Constrained to +1 or -1","date":"2016-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mateusgrellert/binary-net-tensorflow","path":"mnist.py","file_url":"https://github.com/mateusgrellert/binary-net-tensorflow/blob/HEAD/mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mateusgrellert/binary-net-tensorflow when it was checked","code_sha256":"7b7c7ba07fb321f9","code_sha256_prefix":"7b7c7ba07fb321f9","mcp_get_code":{"code_sha256":"7b7c7ba07fb321f9"}},{"arxiv_id":"1511.05644","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-autoencoders","title":"Adversarial Autoencoders","date":"2015-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"greentfrapp/adversarialautoencoder","path":"anomaly_detectors.py","file_url":"https://github.com/greentfrapp/adversarialautoencoder/blob/HEAD/anomaly_detectors.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"145208e8e4762951","code_sha256_prefix":"145208e8e4762951","mcp_get_code":{"code_sha256":"145208e8e4762951"}},{"arxiv_id":"1506.03099","arxiv_id_is_arxiv":true,"paper":"/paper/scheduled-sampling-for-sequence-prediction","title":"Scheduled Sampling for Sequence Prediction with Recurrent Neural Networks","date":"2015-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oplatek/e2end","path":"e2end/utils.py","file_url":"https://github.com/oplatek/e2end/blob/HEAD/e2end/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8694c9cd02e9f95c","code_sha256_prefix":"8694c9cd02e9f95c","mcp_get_code":{"code_sha256":"8694c9cd02e9f95c"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arthurflor23/surface-crack-detection","path":"src/util/misc.py","file_url":"https://github.com/arthurflor23/surface-crack-detection/blob/HEAD/src/util/misc.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":"14b138f819cf2ea1","code_sha256_prefix":"14b138f819cf2ea1","mcp_get_code":{"code_sha256":"14b138f819cf2ea1"}},{"arxiv_id":"2025.acl-long.1506","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.acl-long.1506","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"deepseek-ai/DeepSeek-Math","path":"evaluation/utils.py","file_url":"https://github.com/deepseek-ai/DeepSeek-Math/blob/HEAD/evaluation/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d4da55afb0377ec","code_sha256_prefix":"1d4da55afb0377ec","mcp_get_code":{"code_sha256":"1d4da55afb0377ec"}}],"record_sha256":"5e9d8bb7bee9a5887fa57ae21e5d67f4179dcd2b2d40593566033d14544f4049","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}