{"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/get-entropy","entry":"get_entropy","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":18,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":9,"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":17,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":8,"n_samples_unverified":2,"n_samples_fingerprinted":10,"n_places":18,"n_places_pointer_only":8,"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":2,"ran_violates":0,"ran_draft_wrong":7,"ran_fixture":1,"ran":5,"unverified":2},"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":"2506.03521","arxiv_id_is_arxiv":true,"paper":"/paper/target-semantics-clustering-via-text-1","title":"Target Semantics Clustering via Text Representations for Robust Universal Domain Adaptation","date":"2025-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sapphire-356/TASC","path":"train_sapphire_TASCBase.py","file_url":"https://github.com/Sapphire-356/TASC/blob/HEAD/train_sapphire_TASCBase.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":"2904c1a5e4c8fd97","code_sha256_prefix":"2904c1a5e4c8fd97","mcp_get_code":{"code_sha256":"2904c1a5e4c8fd97"}},{"arxiv_id":"2410.15430","arxiv_id_is_arxiv":true,"paper":"/paper/boostadapter-improving-test-time-adaptation","title":"BoostAdapter: Improving Vision-Language Test-Time Adaptation via Regional Bootstrapping","date":"2024-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taolinzhang/boostadapter","path":"runner.py","file_url":"https://github.com/taolinzhang/boostadapter/blob/HEAD/runner.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f61d80185edfb078","code_sha256_prefix":"f61d80185edfb078","mcp_get_code":{"code_sha256":"f61d80185edfb078"}},{"arxiv_id":"2311.09358","arxiv_id_is_arxiv":true,"paper":"/paper/empirical-evaluation-of-uncertainty","title":"Empirical evaluation of Uncertainty Quantification in Retrieval-Augmented Language Models for Science","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pnnl/expert2","path":"model/evaluation_scripts/custom_evaluate.py","file_url":"https://github.com/pnnl/expert2/blob/HEAD/model/evaluation_scripts/custom_evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"274a5f5175c05893","code_sha256_prefix":"274a5f5175c05893","mcp_get_code":{"code_sha256":"274a5f5175c05893"}},{"arxiv_id":"2310.00488","arxiv_id_is_arxiv":true,"paper":"/paper/on-memorization-and-privacy-risks-of","title":"On Memorization and Privacy Risks of Sharpness Aware Minimization","date":"2023-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"inspire-group/MIAdefenseSELENA","path":"attack/dsq_attack.py","file_url":"https://github.com/inspire-group/MIAdefenseSELENA/blob/HEAD/attack/dsq_attack.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":"7f77c88b76031ff0","code_sha256_prefix":"7f77c88b76031ff0","mcp_get_code":{"code_sha256":"7f77c88b76031ff0"}},{"arxiv_id":"2306.03301","arxiv_id_is_arxiv":true,"paper":"/paper/estimating-conditional-mutual-information-for-1","title":"Estimating Conditional Mutual Information for Dynamic Feature Selection","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suinleelab/dime","path":"dime/cmi_estimator.py","file_url":"https://github.com/suinleelab/dime/blob/HEAD/dime/cmi_estimator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af280a71e2e6e9f0","code_sha256_prefix":"af280a71e2e6e9f0","mcp_get_code":{"code_sha256":"af280a71e2e6e9f0"}},{"arxiv_id":"2305.00350","arxiv_id_is_arxiv":true,"paper":"/paper/pouf-prompt-oriented-unsupervised-fine-tuning","title":"POUF: Prompt-oriented unsupervised fine-tuning for large pre-trained models","date":"2023-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"korawat-tanwisuth/POUF","path":"pouf_lvm/examples/pouf/image_classification/pouf.py","file_url":"https://github.com/korawat-tanwisuth/POUF/blob/HEAD/pouf_lvm/examples/pouf/image_classification/pouf.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, korawat-tanwisuth/POUF when it was checked","code_sha256":"a7625322cc9fda06","code_sha256_prefix":"a7625322cc9fda06","mcp_get_code":{"code_sha256":"a7625322cc9fda06"}},{"arxiv_id":"2212.07473","arxiv_id_is_arxiv":true,"paper":"/paper/mabsplit-faster-forest-training-using-multi","title":"MABSplit: Faster Forest Training Using Multi-Armed Bandits","date":"2022-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thrungroup/fastforest","path":"utils/solvers.py","file_url":"https://github.com/thrungroup/fastforest/blob/HEAD/utils/solvers.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, thrungroup/fastforest when it was checked","code_sha256":"c11ef2293c1894fc","code_sha256_prefix":"c11ef2293c1894fc","mcp_get_code":{"code_sha256":"c11ef2293c1894fc"}},{"arxiv_id":"2208.01230","arxiv_id_is_arxiv":true,"paper":"/paper/a-multifaceted-benchmarking-of-synthetic","title":"A Multifaceted Benchmarking of Synthetic Electronic Health Record Generation Models","date":"2022-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yy6linda/synthetic-ehr-benchmarking","path":"privacy_evaluation/Synthetic_risk_model_attr.py","file_url":"https://github.com/yy6linda/synthetic-ehr-benchmarking/blob/HEAD/privacy_evaluation/Synthetic_risk_model_attr.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":"aa43b0b035541e98","code_sha256_prefix":"aa43b0b035541e98","mcp_get_code":{"code_sha256":"aa43b0b035541e98"}},{"arxiv_id":"2206.09677","arxiv_id_is_arxiv":true,"paper":"/paper/graphframex-towards-systematic-evaluation-of","title":"GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networks","date":"2022-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphframex/graphframex","path":"code/evaluate/mask_utils.py","file_url":"https://github.com/graphframex/graphframex/blob/HEAD/code/evaluate/mask_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, graphframex/graphframex when it was checked","code_sha256":"666c8934355b4dcf","code_sha256_prefix":"666c8934355b4dcf","mcp_get_code":{"code_sha256":"666c8934355b4dcf"}},{"arxiv_id":"2204.11181","arxiv_id_is_arxiv":true,"paper":"/paper/realistic-evaluation-of-transductive-few-shot-1","title":"Realistic Evaluation of Transductive Few-Shot Learning","date":"2022-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oveilleux/realistic_transductive_few_shot","path":"src/methods/tim.py","file_url":"https://github.com/oveilleux/realistic_transductive_few_shot/blob/HEAD/src/methods/tim.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, oveilleux/realistic_transductive_few_shot when it was checked","code_sha256":"e6a5040deda27fed","code_sha256_prefix":"e6a5040deda27fed","mcp_get_code":{"code_sha256":"e6a5040deda27fed"}},{"arxiv_id":"2201.12091","arxiv_id_is_arxiv":true,"paper":"/paper/linear-adversarial-concept-erasure","title":"Linear Adversarial Concept Erasure","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shauli-ravfogel/rlace-icml","path":"rlace.py","file_url":"https://github.com/shauli-ravfogel/rlace-icml/blob/HEAD/rlace.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shauli-ravfogel/rlace-icml when it was checked","code_sha256":"e50fcbca94b3abf5","code_sha256_prefix":"e50fcbca94b3abf5","mcp_get_code":{"code_sha256":"e50fcbca94b3abf5"}},{"arxiv_id":"2201.04234","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-unlabeled-data-to-predict-out-of-1","title":"Leveraging Unlabeled Data to Predict Out-of-Distribution Performance","date":"2022-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saurabhgarg1996/atc_code","path":"ATC_helper.py","file_url":"https://github.com/saurabhgarg1996/atc_code/blob/HEAD/ATC_helper.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"78930d84e33719b5","code_sha256_prefix":"78930d84e33719b5","mcp_get_code":{"code_sha256":"78930d84e33719b5"}},{"arxiv_id":"2106.05303","arxiv_id_is_arxiv":true,"paper":"/paper/explaining-time-series-predictions-with","title":"Explaining Time Series Predictions with Dynamic Masks","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JonathanCrabbe/Dynamask","path":"attribution/mask.py","file_url":"https://github.com/JonathanCrabbe/Dynamask/blob/HEAD/attribution/mask.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bed3944a2f922019","code_sha256_prefix":"bed3944a2f922019","mcp_get_code":{"code_sha256":"bed3944a2f922019"}},{"arxiv_id":"2006.05065","arxiv_id_is_arxiv":true,"paper":"/paper/self-distillation-as-instance-specific-label","title":"Self-Distillation as Instance-Specific Label Smoothing","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhiluZhang123/neurips_2020_distillation","path":"loss.py","file_url":"https://github.com/ZhiluZhang123/neurips_2020_distillation/blob/HEAD/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, ZhiluZhang123/neurips_2020_distillation when it was checked","code_sha256":"b5e4e66a4c429046","code_sha256_prefix":"b5e4e66a4c429046","mcp_get_code":{"code_sha256":"b5e4e66a4c429046"}},{"arxiv_id":"1902.04056","arxiv_id_is_arxiv":true,"paper":"/paper/policy-learning-for-fairness-in-ranking","title":"Policy Learning for Fairness in Ranking","date":"2019-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ashudeep/Fair-PGRank","path":"train_yahoo_dataset.py","file_url":"https://github.com/ashudeep/Fair-PGRank/blob/HEAD/train_yahoo_dataset.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, ashudeep/Fair-PGRank when it was checked","code_sha256":"cd0eee905c41d0c4","code_sha256_prefix":"cd0eee905c41d0c4","mcp_get_code":{"code_sha256":"cd0eee905c41d0c4"}},{"arxiv_id":"1810.00821","arxiv_id_is_arxiv":true,"paper":"/paper/variational-discriminator-bottleneck","title":"Variational Discriminator Bottleneck: Improving Imitation Learning, Inverse RL, and GANs by Constraining Information Flow","date":"2018-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reinforcement-learning-kr/lets-do-irl","path":"mujoco/gail/utils/utils.py","file_url":"https://github.com/reinforcement-learning-kr/lets-do-irl/blob/HEAD/mujoco/gail/utils/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":"f80db665bb06675c","code_sha256_prefix":"f80db665bb06675c","mcp_get_code":{"code_sha256":"f80db665bb06675c"}},{"arxiv_id":"1609.09106","arxiv_id_is_arxiv":true,"paper":"/paper/hypernetworks","title":"HyperNetworks","date":"2016-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gtegner/hyper-gan","path":"hypergan_utils.py","file_url":"https://github.com/gtegner/hyper-gan/blob/HEAD/hypergan_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, gtegner/hyper-gan when it was checked","code_sha256":"410618de180f045a","code_sha256_prefix":"410618de180f045a","mcp_get_code":{"code_sha256":"410618de180f045a"}},{"arxiv_id":"ijcai2025_0115","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0115","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Gwxer/Hierarchical-Adapter","path":"tda_help.py","file_url":"https://github.com/Gwxer/Hierarchical-Adapter/blob/HEAD/tda_help.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f61d80185edfb078","code_sha256_prefix":"f61d80185edfb078","mcp_get_code":{"code_sha256":"f61d80185edfb078"}}],"record_sha256":"196f53e894515487554651cc0a28045b7e5ef0b9ccae68d11a618754a23c71d3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}