{"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/entropy","entry":"entropy","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":112,"n_papers_ran":62,"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":96,"n_samples_ran":52,"n_samples_fingerprinted":38,"n_places":112,"n_places_pointer_only":38,"by_status":{"ran_honours":8,"ran_violates":3,"ran_draft_wrong":12,"ran_fixture":5,"ran":24,"unverified":44},"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":"2608.25478","paper":"/paper/arxiv-2608-25478","title":"VietAIDetector: An Open-Source Zero-Shot Detector for Vietnamese AI-Generated Text","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"trieuntu/VietAIDetector","path":"core/metrics.py","file_url":"https://github.com/trieuntu/VietAIDetector/blob/HEAD/core/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a354ee52988ff24e","mcp_get_code":{"code_sha256":"a354ee52988ff24e"}},{"arxiv_id":"2607.20533","paper":"/paper/arxiv-2607-20533","title":"Grounding Investor Views: Neural Predicates in the Black-Litterman Model","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"themarcosf/deepproblog-black-litterman-demo","path":"src/lib/allocation.py","file_url":"https://github.com/themarcosf/deepproblog-black-litterman-demo/blob/HEAD/src/lib/allocation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"734de688a3be47fc","mcp_get_code":{"code_sha256":"734de688a3be47fc"}},{"arxiv_id":"2606.22914","paper":"/paper/arxiv-2606-22914","title":"PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"mala-lab/PromptDyG","path":"PromptDyG.py","file_url":"https://github.com/mala-lab/PromptDyG/blob/HEAD/PromptDyG.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1951897c2a79f684","mcp_get_code":{"code_sha256":"1951897c2a79f684"}},{"arxiv_id":"2605.24903","paper":"/paper/arxiv-2605-24903","title":"SEED: Semi-supervised Continual MalwarE Detection for Tackling ConcEpt Drift on a BuDget","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"amalapuram/SEED","path":"SSCL.py","file_url":"https://github.com/amalapuram/SEED/blob/HEAD/SSCL.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"abf64df52e402e4a","mcp_get_code":{"code_sha256":"abf64df52e402e4a"}},{"arxiv_id":"2605.04507","paper":"/paper/arxiv-2605-04507","title":"Distilling Bayesian Belief States into Language Models for Auditable Negotiation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"kaneis1/CaSiNo_negotiation-agent","path":"src/casino_belief/belief/posterior.py","file_url":"https://github.com/kaneis1/CaSiNo_negotiation-agent/blob/HEAD/src/casino_belief/belief/posterior.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"954f4110f8d7c59c","mcp_get_code":{"code_sha256":"954f4110f8d7c59c"}},{"arxiv_id":"2604.20276","paper":"/paper/arxiv-2604-20276","title":"Rethinking Intrinsic Dimension Estimation in Neural Representations","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"rickmer-schulte/rethinking-neural-id","path":"src/rethinking_neural_id/metrics/layerwise.py","file_url":"https://github.com/rickmer-schulte/rethinking-neural-id/blob/HEAD/src/rethinking_neural_id/metrics/layerwise.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e49a00e7ca03f0b2","mcp_get_code":{"code_sha256":"e49a00e7ca03f0b2"}},{"arxiv_id":"2509.15550","paper":"/paper/arxiv-2509-15550","title":"DNA-DetectLLM: Unveiling AI-Generated Text via a DNA-Inspired Mutation-Repair Paradigm","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Xiaoweizhu57/DNA-DetectLLM","path":"DNA-DetectLLM/dna_detectllm/detector.py","file_url":"https://github.com/Xiaoweizhu57/DNA-DetectLLM/blob/HEAD/DNA-DetectLLM/dna_detectllm/detector.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b7dc135c8fe24757","mcp_get_code":{"code_sha256":"b7dc135c8fe24757"}},{"arxiv_id":"2504.14032","paper":"/paper/loftup-learning-a-coordinate-based-feature","title":"LoftUp: Learning a Coordinate-Based Feature Upsampler for Vision Foundation Models","date":"2025-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrehuang/loftup","path":"training_utils.py","file_url":"https://github.com/andrehuang/loftup/blob/HEAD/training_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"405aa5d9f24e4bb4","mcp_get_code":{"code_sha256":"405aa5d9f24e4bb4"}},{"arxiv_id":"2504.07092","paper":"/paper/are-we-done-with-object-centric-learning","title":"Are We Done with Object-Centric Learning?","date":"2025-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexanderrubinstein/occam","path":"occam/ood_detection/uncertainty_scores.py","file_url":"https://github.com/alexanderrubinstein/occam/blob/HEAD/occam/ood_detection/uncertainty_scores.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"46d8ea7b571ec1ba","mcp_get_code":{"code_sha256":"46d8ea7b571ec1ba"}},{"arxiv_id":"2503.07082","paper":"/paper/on-the-generalization-of-representation","title":"On the Generalization of Representation Uncertainty in Earth Observation","date":"2025-03-10","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":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"888c1a93e404a608","mcp_get_code":{"code_sha256":"888c1a93e404a608"}},{"arxiv_id":"2411.17525","paper":"/paper/pushing-the-limits-of-large-language-model","title":"Pushing the Limits of Large Language Model Quantization via the Linearity Theorem","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goodevening13/aquakv","path":"aquakv/edenn.py","file_url":"https://github.com/goodevening13/aquakv/blob/HEAD/aquakv/edenn.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":"0e7f23886f4a1549","mcp_get_code":{"code_sha256":"0e7f23886f4a1549"}},{"arxiv_id":"2411.04975","paper":"/paper/suffixdecoding-a-model-free-approach-to","title":"SuffixDecoding: Extreme Speculative Decoding for Emerging AI Applications","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snowflakedb/ArcticInference","path":"arctic_inference/dynasor/entropy.py","file_url":"https://github.com/snowflakedb/ArcticInference/blob/HEAD/arctic_inference/dynasor/entropy.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":"e29c5d4b90190e5f","mcp_get_code":{"code_sha256":"e29c5d4b90190e5f"}},{"arxiv_id":"2411.01006","paper":"/paper/abstracted-shapes-as-tokens-a-generalizable","title":"Abstracted Shapes as Tokens -- A Generalizable and Interpretable Model for Time-series Classification","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunshiwen/vqshape","path":"vqshape/model.py","file_url":"https://github.com/yunshiwen/vqshape/blob/HEAD/vqshape/model.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":"2a8f2551e933d3c4","mcp_get_code":{"code_sha256":"2a8f2551e933d3c4"}},{"arxiv_id":"2409.04409","paper":"/paper/train-till-you-drop-towards-stable-and-robust","title":"Train Till You Drop: Towards Stable and Robust Source-free Unsupervised 3D Domain Adaptation","date":"2024-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valeoai/TTYD","path":"train_ttyd_st.py","file_url":"https://github.com/valeoai/TTYD/blob/HEAD/train_ttyd_st.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a801fbd82ec2a383","mcp_get_code":{"code_sha256":"a801fbd82ec2a383"}},{"arxiv_id":"2408.01584","paper":"/paper/2408-01584","title":"GPUDrive: Data-driven, multi-agent driving simulation at 1 million FPS","date":"2024-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Emerge-Lab/gpudrive","path":"gpudrive/networks/late_fusion.py","file_url":"https://github.com/Emerge-Lab/gpudrive/blob/HEAD/gpudrive/networks/late_fusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"140d1fb7fc50b991","mcp_get_code":{"code_sha256":"140d1fb7fc50b991"}},{"arxiv_id":"2407.17396","paper":"/paper/systematic-reasoning-about-relational-domains","title":"Systematic Reasoning About Relational Domains With Graph Neural Networks","date":"2024-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erg0dic/gnn-sg","path":"src/model_nbf_general.py","file_url":"https://github.com/erg0dic/gnn-sg/blob/HEAD/src/model_nbf_general.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8941c24e039224c5","mcp_get_code":{"code_sha256":"8941c24e039224c5"}},{"arxiv_id":"2407.15773","paper":"/paper/stamp-outlier-aware-test-time-adaptation-with","title":"STAMP: Outlier-Aware Test-Time Adaptation with Stable Memory Replay","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyongcan/stamp","path":"src/methods/stamp.py","file_url":"https://github.com/yuyongcan/stamp/blob/HEAD/src/methods/stamp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a643637f40e01f21","mcp_get_code":{"code_sha256":"a643637f40e01f21"}},{"arxiv_id":"2406.06813","paper":"/paper/stable-neighbor-denoising-for-source-free","title":"Stable Neighbor Denoising for Source-free Domain Adaptive Segmentation","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DZhaoXd/SND","path":"core/apis/inference.py","file_url":"https://github.com/DZhaoXd/SND/blob/HEAD/core/apis/inference.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b96aef516c6d4f9a","mcp_get_code":{"code_sha256":"b96aef516c6d4f9a"}},{"arxiv_id":"2405.20543","paper":"/paper/towards-a-general-gnn-framework-for","title":"Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenkelf/copt","path":"graphgym/loss/copt_loss.py","file_url":"https://github.com/wenkelf/copt/blob/HEAD/graphgym/loss/copt_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d67f3603be7d0949","mcp_get_code":{"code_sha256":"d67f3603be7d0949"}},{"arxiv_id":"2405.02793","paper":"/paper/imageinwords-unlocking-hyper-detailed-image","title":"ImageInWords: Unlocking Hyper-Detailed Image Descriptions","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-deepmind/proactive_t2i_agents","path":"agent/agent_classes.py","file_url":"https://github.com/google-deepmind/proactive_t2i_agents/blob/HEAD/agent/agent_classes.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":"ac24c3867c0d6c29","mcp_get_code":{"code_sha256":"ac24c3867c0d6c29"}},{"arxiv_id":"2404.14367","paper":"/paper/preference-fine-tuning-of-llms-should","title":"Preference Fine-Tuning of LLMs Should Leverage Suboptimal, On-Policy Data","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Asap7772/understanding-rlhf","path":"bandit_experiment/metrics.py","file_url":"https://github.com/Asap7772/understanding-rlhf/blob/HEAD/bandit_experiment/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"806d61305979434e","mcp_get_code":{"code_sha256":"806d61305979434e"}},{"arxiv_id":"2404.10859","paper":"/paper/forcing-diffuse-distributions-out-of-language","title":"Forcing Diffuse Distributions out of Language Models","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"y0mingzhang/diffuse-distributions","path":"src/utils.py","file_url":"https://github.com/y0mingzhang/diffuse-distributions/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"15735f319b9def0e","mcp_get_code":{"code_sha256":"15735f319b9def0e"}},{"arxiv_id":"2404.09586","paper":"/paper/mitigating-the-curse-of-dimensionality-for","title":"Mitigating the Curse of Dimensionality for Certified Robustness via Dual Randomized Smoothing","date":"2024-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiasong0501/DRS","path":"imagenet_train_lowres_2.py","file_url":"https://github.com/xiasong0501/DRS/blob/HEAD/imagenet_train_lowres_2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"23f822c3d6d64a12","mcp_get_code":{"code_sha256":"23f822c3d6d64a12"}},{"arxiv_id":"2404.07990","paper":"/paper/openbias-open-set-bias-detection-in-text-to","title":"OpenBias: Open-set Bias Detection in Text-to-Image Generative Models","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"picsart-ai-research/openbias","path":"make_plots.py","file_url":"https://github.com/picsart-ai-research/openbias/blob/HEAD/make_plots.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bf7a4ec207a5dd04","mcp_get_code":{"code_sha256":"bf7a4ec207a5dd04"}},{"arxiv_id":"2404.02759","paper":"/paper/unsupervised-occupancy-learning-from-sparse","title":"Unsupervised Occupancy Learning from Sparse Point Cloud","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ouasfi/SparseOcc","path":"train_socc.py","file_url":"https://github.com/Ouasfi/SparseOcc/blob/HEAD/train_socc.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":"6f956c806fb01d5c","mcp_get_code":{"code_sha256":"6f956c806fb01d5c"}},{"arxiv_id":"2403.06946","paper":"/paper/split-to-merge-unifying-separated-modalities","title":"Split to Merge: Unifying Separated Modalities for Unsupervised Domain Adaptation","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TL-UESTC/UniMoS","path":"model.py","file_url":"https://github.com/TL-UESTC/UniMoS/blob/HEAD/model.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":"6a961f224b4737a1","mcp_get_code":{"code_sha256":"6a961f224b4737a1"}},{"arxiv_id":"2403.05062","paper":"/paper/agile-multi-source-free-domain-adaptation","title":"Agile Multi-Source-Free Domain Adaptation","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TL-UESTC/Bi-ATEN","path":"models/model.py","file_url":"https://github.com/TL-UESTC/Bi-ATEN/blob/HEAD/models/model.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":"6a961f224b4737a1","mcp_get_code":{"code_sha256":"6a961f224b4737a1"}},{"arxiv_id":"2403.01482","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/train_crf.py","file_url":"https://github.com/MICV-yonsei/EAGLE/blob/HEAD/src_EAGLE/train_crf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed616f74daccc88e","mcp_get_code":{"code_sha256":"ed616f74daccc88e"}},{"arxiv_id":"2402.06262","paper":"/paper/on-the-efficacy-of-eviction-policy-for-key","title":"On the Efficacy of Eviction Policy for Key-Value Constrained Generative Language Model Inference","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drsy/easykv","path":"easykv/easykv.py","file_url":"https://github.com/drsy/easykv/blob/HEAD/easykv/easykv.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5f9c91cf82e9ea48","mcp_get_code":{"code_sha256":"5f9c91cf82e9ea48"}},{"arxiv_id":"2402.03774","paper":"/paper/learning-a-decision-tree-algorithm-with","title":"Learning a Decision Tree Algorithm with Transformers","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"evanzhuang/metatree","path":"metatree/model_metatree.py","file_url":"https://github.com/evanzhuang/metatree/blob/HEAD/metatree/model_metatree.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aaed837329b05922","mcp_get_code":{"code_sha256":"aaed837329b05922"}},{"arxiv_id":"2402.01401","paper":"/paper/zero-shot-machine-unlearning-at-scale-via","title":"An Information Theoretic Approach to Machine Unlearning","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jwf40/zeroshot-unlearning-at-scale","path":"src/metrics.py","file_url":"https://github.com/jwf40/zeroshot-unlearning-at-scale/blob/HEAD/src/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4a12bd3434683bbc","mcp_get_code":{"code_sha256":"4a12bd3434683bbc"}},{"arxiv_id":"2401.12070","paper":"/paper/spotting-llms-with-binoculars-zero-shot","title":"Spotting LLMs With Binoculars: Zero-Shot Detection of Machine-Generated Text","date":"2024-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahans30/binoculars","path":"binoculars/metrics.py","file_url":"https://github.com/ahans30/binoculars/blob/HEAD/binoculars/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"cb88212ccd3fafe9","mcp_get_code":{"code_sha256":"cb88212ccd3fafe9"}},{"arxiv_id":"2401.10480","paper":"/paper/escape-sky-high-cost-early-stopping-self","title":"Escape Sky-high Cost: Early-stopping Self-Consistency for Multi-step Reasoning","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yiwei98/ESC","path":"consistency_coin.py","file_url":"https://github.com/Yiwei98/ESC/blob/HEAD/consistency_coin.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"85b14139a0b81918","mcp_get_code":{"code_sha256":"85b14139a0b81918"}},{"arxiv_id":"2312.14333","paper":"/paper/behaviour-modelling-of-social-animals-via","title":"Behaviour Modelling of Social Animals via Causal Structure Discovery and Graph Neural Networks","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"strong-ai-lab/behavior-causal-discovery","path":"src/evaluate/evaluation.py","file_url":"https://github.com/strong-ai-lab/behavior-causal-discovery/blob/HEAD/src/evaluate/evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"996f712a8f0429e3","mcp_get_code":{"code_sha256":"996f712a8f0429e3"}},{"arxiv_id":"2312.01314","paper":"/paper/nlebench-norglm-a-comprehensive-empirical","title":"NLEBench+NorGLM: A Comprehensive Empirical Analysis and Benchmark Dataset for Generative Language Models in Norwegian","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smartmedia-ai/norglm","path":"results/instruction/evaluation_metrics.py","file_url":"https://github.com/smartmedia-ai/norglm/blob/HEAD/results/instruction/evaluation_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"3daebba93205bdf4","mcp_get_code":{"code_sha256":"3daebba93205bdf4"}},{"arxiv_id":"2310.19152","paper":"/paper/bert-lost-patience-won-t-be-robust-to-1","title":"BERT Lost Patience Won't Be Robust to Adversarial Slowdown","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ztcoalson/waffle","path":"project/deebert/modeling_highway_bert.py","file_url":"https://github.com/ztcoalson/waffle/blob/HEAD/project/deebert/modeling_highway_bert.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"63301b5cf89d7b03","mcp_get_code":{"code_sha256":"63301b5cf89d7b03"}},{"arxiv_id":"2310.18574","paper":"/paper/breaking-the-trilemma-of-privacy-utility","title":"Breaking the Trilemma of Privacy, Utility, Efficiency via Controllable Machine Unlearning","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guangyaodou/conmu","path":"evaluation_metrics.py","file_url":"https://github.com/guangyaodou/conmu/blob/HEAD/evaluation_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4a12bd3434683bbc","mcp_get_code":{"code_sha256":"4a12bd3434683bbc"}},{"arxiv_id":"2310.11989","paper":"/paper/image-clustering-with-external-guidance","title":"Image Clustering with External Guidance","date":"2023-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xlearning-scu/2024-icml-tac","path":"loss_utils.py","file_url":"https://github.com/xlearning-scu/2024-icml-tac/blob/HEAD/loss_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9d678f06508155ff","mcp_get_code":{"code_sha256":"9d678f06508155ff"}},{"arxiv_id":"2310.02156","paper":"/paper/probabilistically-rewired-message-passing","title":"Probabilistically Rewired Message-Passing Neural Networks","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chendiqian/PR-MPNN","path":"models/aux_loss.py","file_url":"https://github.com/chendiqian/PR-MPNN/blob/HEAD/models/aux_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8905abdce603331c","mcp_get_code":{"code_sha256":"8905abdce603331c"}},{"arxiv_id":"2309.12742","paper":"/paper/make-the-u-in-uda-matter-invariant-1","title":"Make the U in UDA Matter: Invariant Consistency Learning for Unsupervised Domain Adaptation","date":"2023-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yue-zhongqi/ICON","path":"icon/entropy.py","file_url":"https://github.com/yue-zhongqi/ICON/blob/HEAD/icon/entropy.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"410274324074f68f","mcp_get_code":{"code_sha256":"410274324074f68f"}},{"arxiv_id":"2308.11880","paper":"/paper/summit-source-free-adaptation-of-uni-modal","title":"SUMMIT: Source-Free Adaptation of Uni-Modal Models to Multi-Modal Targets","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csimo005/SUMMIT","path":"xmuda/check_margin.py","file_url":"https://github.com/csimo005/SUMMIT/blob/HEAD/xmuda/check_margin.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"b1d825d3e46bc644","mcp_get_code":{"code_sha256":"b1d825d3e46bc644"}},{"arxiv_id":"2308.07707","paper":"/paper/fast-machine-unlearning-without-retraining","title":"Fast Machine Unlearning Without Retraining Through Selective Synaptic Dampening","date":"2023-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"if-loops/selective-synaptic-dampening","path":"src/metrics.py","file_url":"https://github.com/if-loops/selective-synaptic-dampening/blob/HEAD/src/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4a12bd3434683bbc","mcp_get_code":{"code_sha256":"4a12bd3434683bbc"}},{"arxiv_id":"2307.10907","paper":"/paper/the-role-of-entropy-and-reconstruction-in","title":"The Role of Entropy and Reconstruction in Multi-View Self-Supervised Learning","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-entropy-reconstruction","path":"entropy_reconstruction.py","file_url":"https://github.com/apple/ml-entropy-reconstruction/blob/HEAD/entropy_reconstruction.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"5d7c8a7590c98650","mcp_get_code":{"code_sha256":"5d7c8a7590c98650"}},{"arxiv_id":"2307.08507","paper":"/paper/efficient-and-accurate-optimal-transport-with","title":"Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adaptive-agents-lab/mdot-pncg","path":"utils/measurements.py","file_url":"https://github.com/adaptive-agents-lab/mdot-pncg/blob/HEAD/utils/measurements.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"88437d3c987de4f1","mcp_get_code":{"code_sha256":"88437d3c987de4f1"}},{"arxiv_id":"2307.03810","paper":null,"title":"arXiv:2307.03810","date":null,"month_inferred_from_arxiv_id":"2023-07","title_source":null,"repo":"mkirchhof/url","path":"timm/models/_uncertainizer.py","file_url":"https://github.com/mkirchhof/url/blob/HEAD/timm/models/_uncertainizer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"888c1a93e404a608","mcp_get_code":{"code_sha256":"888c1a93e404a608"}},{"arxiv_id":"2307.03749","paper":"/paper/on-the-efficacy-of-sampling-adapters","title":"On the Efficacy of Sampling Adapters","date":"2023-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rycolab/sampling-adapters","path":"metrics.py","file_url":"https://github.com/rycolab/sampling-adapters/blob/HEAD/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"13bce9552d1cbfb4","mcp_get_code":{"code_sha256":"13bce9552d1cbfb4"}},{"arxiv_id":"2305.17352","paper":"/paper/is-centralized-training-with-decentralized","title":"Is Centralized Training with Decentralized Execution Framework Centralized Enough for MARL?","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyh1999/cadp","path":"CADP-VD/src/learners/qplex_learner_teacher.py","file_url":"https://github.com/zyh1999/cadp/blob/HEAD/CADP-VD/src/learners/qplex_learner_teacher.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"6d8bc4da0dae2a06","mcp_get_code":{"code_sha256":"6d8bc4da0dae2a06"}},{"arxiv_id":"2305.15508","paper":"/paper/improving-selective-classification","title":"How to Fix a Broken Confidence Estimator: Evaluating Post-hoc Methods for Selective Classification with Deep Neural Networks","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lfpc/fixselectiveclassification","path":"utils/measures.py","file_url":"https://github.com/lfpc/fixselectiveclassification/blob/HEAD/utils/measures.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1c1ca7bac1d99a0a","mcp_get_code":{"code_sha256":"1c1ca7bac1d99a0a"}},{"arxiv_id":"2304.11961","paper":"/paper/towards-mode-balancing-of-generative-models","title":"Towards Mode Balancing of Generative Models via Diversity Weights","date":"2023-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sebastianberns/diversity-weights","path":"optimize.py","file_url":"https://github.com/sebastianberns/diversity-weights/blob/HEAD/optimize.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8493af3c4ee600a5","mcp_get_code":{"code_sha256":"8493af3c4ee600a5"}},{"arxiv_id":"2303.00596","paper":"/paper/information-plane-analysis-for-dropout-neural","title":"Information Plane Analysis for Dropout Neural Networks","date":null,"month_inferred_from_arxiv_id":"2023-03","title_source":"archive","repo":"link-er/ip_dropout","path":"mi_estimators/npeet/entropy_estimators.py","file_url":"https://github.com/link-er/ip_dropout/blob/HEAD/mi_estimators/npeet/entropy_estimators.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2053e11470cf9117","mcp_get_code":{"code_sha256":"2053e11470cf9117"}},{"arxiv_id":"2302.00903","paper":"/paper/no-one-left-behind-real-world-federated-class","title":"No One Left Behind: Real-World Federated Class-Incremental Learning","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiahuadong/lga","path":"LGA.py","file_url":"https://github.com/jiahuadong/lga/blob/HEAD/LGA.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"be3aa807c2960a0b","mcp_get_code":{"code_sha256":"be3aa807c2960a0b"}},{"arxiv_id":"2301.02057","paper":"/paper/textdescriptives-a-python-package-for","title":"TextDescriptives: A Python package for calculating a large variety of metrics from text","date":"2023-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HLasse/TextDescriptives","path":"src/textdescriptives/components/information_theory.py","file_url":"https://github.com/HLasse/TextDescriptives/blob/HEAD/src/textdescriptives/components/information_theory.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":"a81a43ec428def5c","mcp_get_code":{"code_sha256":"a81a43ec428def5c"}},{"arxiv_id":"2212.09000","paper":"/paper/confidence-aware-training-of-smoothed-1","title":"Confidence-aware Training of Smoothed Classifiers for Certified Robustness","date":"2022-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alinlab/smoothing-catrs","path":"code/consistency.py","file_url":"https://github.com/alinlab/smoothing-catrs/blob/HEAD/code/consistency.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"23f822c3d6d64a12","mcp_get_code":{"code_sha256":"23f822c3d6d64a12"}},{"arxiv_id":"2211.14946","paper":"/paper/self-destructing-models-increasing-the-costs","title":"Self-Destructing Models: Increasing the Costs of Harmful Dual Uses of Foundation Models","date":"2022-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"breakend/selfdestructingmodels","path":"losses.py","file_url":"https://github.com/breakend/selfdestructingmodels/blob/HEAD/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa15fefe327c91ff","mcp_get_code":{"code_sha256":"aa15fefe327c91ff"}},{"arxiv_id":"2211.05244","paper":"/paper/deep-learning-for-time-series-anomaly","title":"Deep Learning for Time Series Anomaly Detection: A Survey","date":"2022-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zamanzadeh/CARLA","path":"losses/losses.py","file_url":"https://github.com/zamanzadeh/CARLA/blob/HEAD/losses/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"60021cab8043955f","mcp_get_code":{"code_sha256":"60021cab8043955f"}},{"arxiv_id":"2211.04486","paper":"/paper/active-example-selection-for-in-context","title":"Active Example Selection for In-Context Learning","date":"2022-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chicagohai/active-example-selection","path":"src/prompting/strategies/greedy_strategies.py","file_url":"https://github.com/chicagohai/active-example-selection/blob/HEAD/src/prompting/strategies/greedy_strategies.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1425a704ec322a88","mcp_get_code":{"code_sha256":"1425a704ec322a88"}},{"arxiv_id":"2210.14889","paper":"/paper/perfectly-secure-steganography-using-minimum","title":"Perfectly Secure Steganography Using Minimum Entropy Coupling","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssokota/mec","path":"mec/utilities.py","file_url":"https://github.com/ssokota/mec/blob/HEAD/mec/utilities.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7be456a9b2eae0a8","mcp_get_code":{"code_sha256":"7be456a9b2eae0a8"}},{"arxiv_id":"2210.04563","paper":"/paper/towards-robust-visual-question-answering","title":"Towards Robust Visual Question Answering: Making the Most of Biased Samples via Contrastive Learning","date":"2022-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phoebussi/mmbs","path":"main_MMBS.py","file_url":"https://github.com/phoebussi/mmbs/blob/HEAD/main_MMBS.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f23054c5865de419","mcp_get_code":{"code_sha256":"f23054c5865de419"}},{"arxiv_id":"2208.02813","paper":"/paper/towards-understanding-mixture-of-experts-in","title":"Towards Understanding Mixture of Experts in Deep Learning","date":"2022-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclaml/MoE","path":"cifar10-rotate/utils.py","file_url":"https://github.com/uclaml/MoE/blob/HEAD/cifar10-rotate/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":"470b52f8557d6cc9","mcp_get_code":{"code_sha256":"470b52f8557d6cc9"}},{"arxiv_id":"2207.13048","paper":"/paper/domain-adaptation-under-open-set-label-shift","title":"Domain Adaptation under Open Set Label Shift","date":"2022-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisionLearningGroup/DANCE","path":"utils/loss.py","file_url":"https://github.com/VisionLearningGroup/DANCE/blob/HEAD/utils/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"28cffa65eceff97d","mcp_get_code":{"code_sha256":"28cffa65eceff97d"}},{"arxiv_id":"2207.07517","paper":"/paper/on-the-usefulness-of-deep-ensemble-diversity","title":"On the Usefulness of Deep Ensemble Diversity for Out-of-Distribution Detection","date":"2022-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guoxoug/ens-div-ood-detect","path":"utils/eval_utils.py","file_url":"https://github.com/guoxoug/ens-div-ood-detect/blob/HEAD/utils/eval_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"46d8ea7b571ec1ba","mcp_get_code":{"code_sha256":"46d8ea7b571ec1ba"}},{"arxiv_id":"2205.08096","paper":"/paper/can-bad-teaching-induce-forgetting-unlearning","title":"Can Bad Teaching Induce Forgetting? Unlearning in Deep Networks using an Incompetent Teacher","date":"2022-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vikram2000b/bad-teaching-unlearning","path":"metrics.py","file_url":"https://github.com/vikram2000b/bad-teaching-unlearning/blob/HEAD/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4a12bd3434683bbc","mcp_get_code":{"code_sha256":"4a12bd3434683bbc"}},{"arxiv_id":"2205.04183","paper":"/paper/local-prediction-aggregation-a-frustratingly","title":"Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptation","date":"2022-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albert0147/aad_sfda","path":"snd.py","file_url":"https://github.com/albert0147/aad_sfda/blob/HEAD/snd.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1b0bf9bd060bf1a1","mcp_get_code":{"code_sha256":"1b0bf9bd060bf1a1"}},{"arxiv_id":"2204.09179","paper":"/paper/on-the-representation-collapse-of-sparse","title":"On the Representation Collapse of Sparse Mixture of Experts","date":"2022-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/torchscale","path":"torchscale/component/xmoe/routing.py","file_url":"https://github.com/microsoft/torchscale/blob/HEAD/torchscale/component/xmoe/routing.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":"4b3cc005618b1ec8","mcp_get_code":{"code_sha256":"4b3cc005618b1ec8"}},{"arxiv_id":"2204.08491","paper":"/paper/active-learning-helps-pretrained-models-learn","title":"Active Learning Helps Pretrained Models Learn the Intended Task","date":"2022-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alextamkin/active-learning-pretrained-models","path":"models/acquisition.py","file_url":"https://github.com/alextamkin/active-learning-pretrained-models/blob/HEAD/models/acquisition.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":"0123d0a848b9b0b8","mcp_get_code":{"code_sha256":"0123d0a848b9b0b8"}},{"arxiv_id":"2203.11473","paper":"/paper/federated-class-incremental-learning","title":"Federated Class-Incremental Learning","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"be3aa807c2960a0b","mcp_get_code":{"code_sha256":"be3aa807c2960a0b"}},{"arxiv_id":"2203.02016","paper":"/paper/interventions-where-and-how-experimental","title":"Interventions, Where and How? Experimental Design for Causal Models at Scale","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yannadani/cbed","path":"strategies/cbed.py","file_url":"https://github.com/yannadani/cbed/blob/HEAD/strategies/cbed.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f3d9d8d76b2fe6b0","mcp_get_code":{"code_sha256":"f3d9d8d76b2fe6b0"}},{"arxiv_id":"2202.11258","paper":"/paper/many-processors-little-time-mcmc-for","title":"Many processors, little time: MCMC for partitions via optimal transport couplings","date":"2022-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tinnguyen96/partition-coupling","path":"modules/partitions.py","file_url":"https://github.com/tinnguyen96/partition-coupling/blob/HEAD/modules/partitions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4bae1bb8c1f13a15","mcp_get_code":{"code_sha256":"4bae1bb8c1f13a15"}},{"arxiv_id":"2202.05621","paper":"/paper/long-time-convergence-and-propagation-of","title":"Nonlinear MCMC for Bayesian Machine Learning","date":"2022-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamesvuc/jax-bayes","path":"jax_bayes/utils.py","file_url":"https://github.com/jamesvuc/jax-bayes/blob/HEAD/jax_bayes/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9d7883e526e416c","mcp_get_code":{"code_sha256":"a9d7883e526e416c"}},{"arxiv_id":"2202.01273","paper":"/paper/beyond-images-label-noise-transition-matrix","title":"Beyond Images: Label Noise Transition Matrix Estimation for Tasks with Lower-Quality Features","date":"2022-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/est-t-mi","path":"utils_mi.py","file_url":"https://github.com/ucsc-real/est-t-mi/blob/HEAD/utils_mi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0b72d6d48231f171","mcp_get_code":{"code_sha256":"0b72d6d48231f171"}},{"arxiv_id":"2201.05629","paper":"/paper/zero-shot-machine-unlearning","title":"Zero-Shot Machine Unlearning","date":"2022-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ayu987/zero-shot-unlearning","path":"metrics.py","file_url":"https://github.com/ayu987/zero-shot-unlearning/blob/HEAD/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5e5d6c342a945de8","mcp_get_code":{"code_sha256":"5e5d6c342a945de8"}},{"arxiv_id":"2111.00064","paper":"/paper/node-feature-extraction-by-self-supervised-1","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","date":"2021-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elichienxD/SAGN_with_SLE","path":"src/utils.py","file_url":"https://github.com/elichienxD/SAGN_with_SLE/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a4d2591506684852","mcp_get_code":{"code_sha256":"a4d2591506684852"}},{"arxiv_id":"2110.14038","paper":"/paper/robustness-of-graph-neural-networks-at-scale","title":"Robustness of Graph Neural Networks at Scale","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ventr1c/res-gcl","path":"PRBCD.py","file_url":"https://github.com/ventr1c/res-gcl/blob/HEAD/PRBCD.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":"984b1cb236080dc5","mcp_get_code":{"code_sha256":"984b1cb236080dc5"}},{"arxiv_id":"2110.10232","paper":"/paper/test-time-adaptation-through-perturbation","title":"Test time Adaptation through Perturbation Robustness","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prabhuteja12/pest","path":"utils/loss.py","file_url":"https://github.com/prabhuteja12/pest/blob/HEAD/utils/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f26b332f594df3e","mcp_get_code":{"code_sha256":"3f26b332f594df3e"}},{"arxiv_id":"2110.06274","paper":"/paper/list-lite-self-training-makes-efficient-few-1","title":"LiST: Lite Prompted Self-training Makes Parameter-Efficient Few-shot Learners","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/list","path":"src/loss.py","file_url":"https://github.com/microsoft/list/blob/HEAD/src/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e6d40262bdef1d5","mcp_get_code":{"code_sha256":"3e6d40262bdef1d5"}},{"arxiv_id":"2109.15310","paper":"/paper/width-based-planning-and-active-learning-for","title":"Is Policy Learning Overrated?: Width-Based Planning and Active Learning for Atari","date":"2021-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/atari-active-learning","path":"active_learning_screen.py","file_url":"https://github.com/ibm/atari-active-learning/blob/HEAD/active_learning_screen.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2034f222774b1d7f","mcp_get_code":{"code_sha256":"2034f222774b1d7f"}},{"arxiv_id":"2108.13941","paper":"/paper/bubblewrap-online-tiling-and-real-time-flow","title":"Bubblewrap: Online tiling and real-time flow prediction on neural manifolds","date":"2021-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pearsonlab/bubblewrap","path":"bubblewrap.py","file_url":"https://github.com/pearsonlab/bubblewrap/blob/HEAD/bubblewrap.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"baa42cadf2ef94da","mcp_get_code":{"code_sha256":"baa42cadf2ef94da"}},{"arxiv_id":"2108.06129","paper":"/paper/learning-transferable-parameters-for","title":"Learning Transferable Parameters for Unsupervised Domain Adaptation","date":"2021-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyhan/transpar","path":"examples/domain_adaptation/classification/cdan-TransPar.py","file_url":"https://github.com/zhyhan/transpar/blob/HEAD/examples/domain_adaptation/classification/cdan-TransPar.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"74b84c5dfe56c37b","mcp_get_code":{"code_sha256":"74b84c5dfe56c37b"}},{"arxiv_id":"2107.05326","paper":"/paper/learning-interaction-rules-from-multi-animal","title":"Learning interaction rules from multi-animal trajectories via augmented behavioral models","date":"2021-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tailintalent/causal","path":"estimators/entropy_estimators.py","file_url":"https://github.com/tailintalent/causal/blob/HEAD/estimators/entropy_estimators.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b717486cc49d1dd9","mcp_get_code":{"code_sha256":"b717486cc49d1dd9"}},{"arxiv_id":"2104.09376","paper":"/paper/scalable-and-adaptive-graph-neural-networks","title":"Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced training","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skepsun/SAGN_with_SLE","path":"src/utils.py","file_url":"https://github.com/skepsun/SAGN_with_SLE/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a4d2591506684852","mcp_get_code":{"code_sha256":"a4d2591506684852"}},{"arxiv_id":"2104.03344","paper":"/paper/ovanet-one-vs-all-network-for-universal","title":"OVANet: One-vs-All Network for Universal Domain Adaptation","date":"2021-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisionLearningGroup/OVANet","path":"utils/loss.py","file_url":"https://github.com/VisionLearningGroup/OVANet/blob/HEAD/utils/loss.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b0bf9bd060bf1a1","mcp_get_code":{"code_sha256":"1b0bf9bd060bf1a1"}},{"arxiv_id":"2103.04505","paper":"/paper/split-computing-and-early-exiting-for-deep","title":"Split Computing and Early Exiting for Deep Learning Applications: Survey and Research Challenges","date":"2021-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"castorini/earlyexiting-monobert","path":"transformers/modeling_highway_bert.py","file_url":"https://github.com/castorini/earlyexiting-monobert/blob/HEAD/transformers/modeling_highway_bert.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":"87cde55ede2fa968","mcp_get_code":{"code_sha256":"87cde55ede2fa968"}},{"arxiv_id":"2010.01899","paper":"/paper/dynamic-anticipation-and-completion-for-multi","title":"Dynamic Anticipation and Completion for Multi-Hop Reasoning over Sparse Knowledge Graph","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THU-KEG/DacKGR","path":"src/utils/ops.py","file_url":"https://github.com/THU-KEG/DacKGR/blob/HEAD/src/utils/ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"84a908f10b383452","mcp_get_code":{"code_sha256":"84a908f10b383452"}},{"arxiv_id":"2008.07928","paper":"/paper/visibility-aware-multi-view-stereo-network","title":"Visibility-aware Multi-view Stereo Network","date":"2020-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jzhangbs/Vis-MVSNet","path":"core/nn_utils.py","file_url":"https://github.com/jzhangbs/Vis-MVSNet/blob/HEAD/core/nn_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f6699ba2ecb27033","mcp_get_code":{"code_sha256":"f6699ba2ecb27033"}},{"arxiv_id":"2007.01919","paper":"/paper/efficient-marginalization-of-discrete-and","title":"Efficient Marginalization of Discrete and Structured Latent Variables via Sparsity","date":"2020-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deep-spin/sparse-marginalization-lvm","path":"lvmhelpers/marg.py","file_url":"https://github.com/deep-spin/sparse-marginalization-lvm/blob/HEAD/lvmhelpers/marg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d210e2764237d74e","mcp_get_code":{"code_sha256":"d210e2764237d74e"}},{"arxiv_id":"2007.00720","paper":"/paper/adversarial-example-games","title":"Adversarial Example Games","date":"2020-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeybose/Adversarial-Example-Games","path":"models/generators.py","file_url":"https://github.com/joeybose/Adversarial-Example-Games/blob/HEAD/models/generators.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":"6d165108cf098369","mcp_get_code":{"code_sha256":"6d165108cf098369"}},{"arxiv_id":"2006.04062","paper":"/paper/consistency-regularization-for-certified","title":"Consistency Regularization for Certified Robustness of Smoothed Classifiers","date":"2020-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jh-jeong/smoothing-consistency","path":"code/consistency.py","file_url":"https://github.com/jh-jeong/smoothing-consistency/blob/HEAD/code/consistency.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"23f822c3d6d64a12","mcp_get_code":{"code_sha256":"23f822c3d6d64a12"}},{"arxiv_id":"2004.12993","paper":"/paper/deebert-dynamic-early-exiting-for","title":"DeeBERT: Dynamic Early Exiting for Accelerating BERT Inference","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JulesBelveze/bert-squeeze","path":"bert_squeeze/models/custom_transformers/deebert.py","file_url":"https://github.com/JulesBelveze/bert-squeeze/blob/HEAD/bert_squeeze/models/custom_transformers/deebert.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"76ecddd69557ac5b","mcp_get_code":{"code_sha256":"76ecddd69557ac5b"}},{"arxiv_id":"2004.12529","paper":"/paper/towards-accurate-and-robust-domain-adaptation","title":"Towards Accurate and Robust Domain Adaptation under Noisy Environments","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyhan/RDA","path":"model/RDA.py","file_url":"https://github.com/zhyhan/RDA/blob/HEAD/model/RDA.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8ae1cfe379f57196","mcp_get_code":{"code_sha256":"8ae1cfe379f57196"}},{"arxiv_id":"2003.02645","paper":"/paper/200302645","title":"SentenceMIM: A Latent Variable Language Model","date":"2020-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seraphlabs-ca/SentenceMIM-demo","path":"npeet/entropy_estimators.py","file_url":"https://github.com/seraphlabs-ca/SentenceMIM-demo/blob/HEAD/npeet/entropy_estimators.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2053e11470cf9117","mcp_get_code":{"code_sha256":"2053e11470cf9117"}},{"arxiv_id":"1910.09457","paper":"/paper/aleatoric-and-epistemic-uncertainty-in","title":"Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methods","date":"2019-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tfmortie/uaml","path":"uaml/utils.py","file_url":"https://github.com/tfmortie/uaml/blob/HEAD/uaml/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e8bb1fd9b5c4f5e2","mcp_get_code":{"code_sha256":"e8bb1fd9b5c4f5e2"}},{"arxiv_id":"1909.01506","paper":"/paper/prediction-consistency-curvature","title":"Prediction, Consistency, Curvature: Representation Learning for Locally-Linear Control","date":"2019-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VinAIResearch/PCC-pytorch","path":"losses.py","file_url":"https://github.com/VinAIResearch/PCC-pytorch/blob/HEAD/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"58762fb5c6301c4b","mcp_get_code":{"code_sha256":"58762fb5c6301c4b"}},{"arxiv_id":"1904.12774","paper":"/paper/routing-networks-and-the-challenges-of","title":"Routing Networks and the Challenges of Modular and Compositional Computation","date":"2019-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cle-ros/RoutingNetworks","path":"PytorchRouting/DecisionLayers/Others/RELAX.py","file_url":"https://github.com/cle-ros/RoutingNetworks/blob/HEAD/PytorchRouting/DecisionLayers/Others/RELAX.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":"a415d1da67633beb","mcp_get_code":{"code_sha256":"a415d1da67633beb"}},{"arxiv_id":"1904.06487","paper":"/paper/semi-supervised-domain-adaptation-via-minimax","title":"Semi-supervised Domain Adaptation via Minimax Entropy","date":"2019-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisionLearningGroup/SSDA_MME","path":"utils/loss.py","file_url":"https://github.com/VisionLearningGroup/SSDA_MME/blob/HEAD/utils/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b2ee349e9ce0fc83","mcp_get_code":{"code_sha256":"b2ee349e9ce0fc83"}},{"arxiv_id":"1902.01568","paper":"/paper/relevance-factor-vae-learning-and-identifying","title":"Relevance Factor VAE: Learning and Identifying Disentangled Factors","date":"2019-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ThomasMrY/RF-VAE","path":"ops.py","file_url":"https://github.com/ThomasMrY/RF-VAE/blob/HEAD/ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b83a9785aff580b5","mcp_get_code":{"code_sha256":"b83a9785aff580b5"}},{"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":"wwwyyun/HDGI","path":"execute.py","file_url":"https://github.com/wwwyyun/HDGI/blob/HEAD/execute.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f5bc6debaeb77061","mcp_get_code":{"code_sha256":"f5bc6debaeb77061"}},{"arxiv_id":"1808.10568","paper":"/paper/multi-hop-knowledge-graph-reasoning-with","title":"Multi-Hop Knowledge Graph Reasoning with Reward Shaping","date":"2018-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/MultiHopKG","path":"src/utils/ops.py","file_url":"https://github.com/salesforce/MultiHopKG/blob/HEAD/src/utils/ops.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":"84a908f10b383452","mcp_get_code":{"code_sha256":"84a908f10b383452"}},{"arxiv_id":"1805.04487","paper":"/paper/non-stationary-texture-synthesis-by","title":"Non-Stationary Texture Synthesis by Adversarial Expansion","date":"2018-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jessemelpolio/non-stationary_texture_syn","path":"cnn-vis.py","file_url":"https://github.com/jessemelpolio/non-stationary_texture_syn/blob/HEAD/cnn-vis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a0ec3df8d9bf0375","mcp_get_code":{"code_sha256":"a0ec3df8d9bf0375"}},{"arxiv_id":"1712.09657","paper":"/paper/the-information-bottleneck-and-geometric","title":"The information bottleneck and geometric clustering","date":"2017-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"f825bb885d6e69b7","mcp_get_code":{"code_sha256":"f825bb885d6e69b7"}},{"arxiv_id":"1707.06347","paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hamishs/JAX-RL","path":"src/jax_rl/algorithms/ppo.py","file_url":"https://github.com/hamishs/JAX-RL/blob/HEAD/src/jax_rl/algorithms/ppo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1732d17d766f28da","mcp_get_code":{"code_sha256":"1732d17d766f28da"}},{"arxiv_id":"1703.00810","paper":"/paper/opening-the-black-box-of-deep-neural-networks","title":"Opening the Black Box of Deep Neural Networks via Information","date":"2017-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sepehr-rasouli/ITRL","path":"mnist_mi.py","file_url":"https://github.com/sepehr-rasouli/ITRL/blob/HEAD/mnist_mi.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5fcc1acb6f40d03b","mcp_get_code":{"code_sha256":"5fcc1acb6f40d03b"}},{"arxiv_id":"1608.06993","paper":"/paper/densely-connected-convolutional-networks","title":"Densely Connected Convolutional Networks","date":"2016-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hycis/TensorGraph","path":"tensorgraph/cost.py","file_url":"https://github.com/hycis/TensorGraph/blob/HEAD/tensorgraph/cost.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":"3489cf036722364c","mcp_get_code":{"code_sha256":"3489cf036722364c"}},{"arxiv_id":"1607.04606","paper":"/paper/enriching-word-vectors-with-subword","title":"Enriching Word Vectors with Subword Information","date":"2016-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plasticityai/magnitude","path":"pymagnitude/converter.py","file_url":"https://github.com/plasticityai/magnitude/blob/HEAD/pymagnitude/converter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6e32ac79f67582c1","mcp_get_code":{"code_sha256":"6e32ac79f67582c1"}},{"arxiv_id":"1604.00268","paper":"/paper/the-deterministic-information-bottleneck","title":"The deterministic information bottleneck","date":"2016-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"djstrouse/information-bottleneck","path":"IB.py","file_url":"https://github.com/djstrouse/information-bottleneck/blob/HEAD/IB.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f825bb885d6e69b7","mcp_get_code":{"code_sha256":"f825bb885d6e69b7"}},{"arxiv_id":"1602.01783","paper":"/paper/asynchronous-methods-for-deep-reinforcement","title":"Asynchronous Methods for Deep Reinforcement Learning","date":"2016-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qihongl/demo-advantage-actor-critic","path":"src/models/_A2C_discrete.py","file_url":"https://github.com/qihongl/demo-advantage-actor-critic/blob/HEAD/src/models/_A2C_discrete.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"57a38c7adc4b0687","mcp_get_code":{"code_sha256":"57a38c7adc4b0687"}},{"arxiv_id":"1505.07818","paper":"/paper/domain-adversarial-training-of-neural","title":"Domain-Adversarial Training of Neural Networks","date":"2015-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"timgaripov/asa","path":"support_alignment/core/algorithms.py","file_url":"https://github.com/timgaripov/asa/blob/HEAD/support_alignment/core/algorithms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5b9be386bbb3d10e","mcp_get_code":{"code_sha256":"5b9be386bbb3d10e"}},{"arxiv_id":"1411.2003","paper":"/paper/efficient-estimation-of-mutual-information","title":"Efficient Estimation of Mutual Information for Strongly Dependent Variables","date":"2014-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gregversteeg/NPEET","path":"npeet/entropy_estimators.py","file_url":"https://github.com/gregversteeg/NPEET/blob/HEAD/npeet/entropy_estimators.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"631c7d5fc16cefe2","mcp_get_code":{"code_sha256":"631c7d5fc16cefe2"}},{"arxiv_id":"ijcai2025_0803","paper":null,"title":"arXiv:ijcai2025_0803","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zyh1999/CADP","path":"CADP-VD/src/learners/qplex_learner_teacher.py","file_url":"https://github.com/zyh1999/CADP/blob/HEAD/CADP-VD/src/learners/qplex_learner_teacher.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"6d8bc4da0dae2a06","mcp_get_code":{"code_sha256":"6d8bc4da0dae2a06"}},{"arxiv_id":"Lemmer_Ground-Truth_or_DAER_Selective_Re-Query_of_Secondary_Information_ICCV_2021_paper","paper":null,"title":"arXiv:Lemmer_Ground-Truth_or_DAER_Selective_Re-Query_of_Secondary_Information_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lemmersj/ground-truth-or-daer","path":"kcve/generate_score_csvs.py","file_url":"https://github.com/lemmersj/ground-truth-or-daer/blob/HEAD/kcve/generate_score_csvs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6b6f4dd8434ad240","mcp_get_code":{"code_sha256":"6b6f4dd8434ad240"}},{"arxiv_id":"2023.findings-emnlp.528","paper":null,"title":"arXiv:2023.findings-emnlp.528","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wjn1996/UPET","path":"model/loss.py","file_url":"https://github.com/wjn1996/UPET/blob/HEAD/model/loss.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":"3e6d40262bdef1d5","mcp_get_code":{"code_sha256":"3e6d40262bdef1d5"}},{"arxiv_id":"2023.emnlp-main.803","paper":null,"title":"arXiv:2023.emnlp-main.803","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yisunlp/Anti-CF","path":"AntiCF.py","file_url":"https://github.com/yisunlp/Anti-CF/blob/HEAD/AntiCF.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"31810455721891a8","mcp_get_code":{"code_sha256":"31810455721891a8"}},{"arxiv_id":"2022.findings-emnlp.364","paper":null,"title":"arXiv:2022.findings-emnlp.364","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"BenjaminTowle/PASA","path":"models.py","file_url":"https://github.com/BenjaminTowle/PASA/blob/HEAD/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c8c99f947cc0db2","mcp_get_code":{"code_sha256":"7c8c99f947cc0db2"}}]}