{"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/compute-entropy","entry":"compute_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":19,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":9,"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":19,"n_samples_ran":18,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":9,"n_samples_unverified":1,"n_samples_fingerprinted":12,"n_places":19,"n_places_pointer_only":7,"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":4,"ran_violates":0,"ran_draft_wrong":7,"ran_fixture":2,"ran":5,"unverified":1},"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":"2608.24952","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24952","title":"The Dialect Tax: Dialectal Biases Persist throughout the Language Modeling Pipeline","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"socialnlp/dialecttax","path":"src/dialecttax/logits.py","file_url":"https://github.com/socialnlp/dialecttax/blob/HEAD/src/dialecttax/logits.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":"80bd1696a29c9b2f","code_sha256_prefix":"80bd1696a29c9b2f","mcp_get_code":{"code_sha256":"80bd1696a29c9b2f"}},{"arxiv_id":"2602.22278","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-22278","title":"RETLLM: Training and Data-Free MLLMs for Multimodal Information Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"alivecat05/RETLLM","path":"Codes/Qwen_vl.py","file_url":"https://github.com/alivecat05/RETLLM/blob/HEAD/Codes/Qwen_vl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c98c3c7150fdcd2f","code_sha256_prefix":"c98c3c7150fdcd2f","mcp_get_code":{"code_sha256":"c98c3c7150fdcd2f"}},{"arxiv_id":"2602.21054","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-21054","title":"VAUQ: Vision-Aware Uncertainty Quantification for LVLM Self-Evaluation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"deeplearning-wisc/vauq","path":"vauq/scoring.py","file_url":"https://github.com/deeplearning-wisc/vauq/blob/HEAD/vauq/scoring.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d1f6db28a2a7ff6a","code_sha256_prefix":"d1f6db28a2a7ff6a","mcp_get_code":{"code_sha256":"d1f6db28a2a7ff6a"}},{"arxiv_id":"2601.17563","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-17563","title":"Towards Generalisable Imitation Learning Through Conditioned Transition Estimation and Online Behaviour Alignment","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"NathanGavenski/UfO","path":"utils/utils.py","file_url":"https://github.com/NathanGavenski/UfO/blob/HEAD/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, NathanGavenski/UfO when it was checked","code_sha256":"58f18a79a5425d3a","code_sha256_prefix":"58f18a79a5425d3a","mcp_get_code":{"code_sha256":"58f18a79a5425d3a"}},{"arxiv_id":"2506.13688","arxiv_id_is_arxiv":true,"paper":"/paper/what-happens-during-the-loss-plateau","title":"What Happens During the Loss Plateau? Understanding Abrupt Learning in Transformers","date":"2025-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pulkitgopalani/tf-loss-plateau","path":"src/train_add.py","file_url":"https://github.com/pulkitgopalani/tf-loss-plateau/blob/HEAD/src/train_add.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, pulkitgopalani/tf-loss-plateau when it was checked","code_sha256":"df1baca5141c4e64","code_sha256_prefix":"df1baca5141c4e64","mcp_get_code":{"code_sha256":"df1baca5141c4e64"}},{"arxiv_id":"2504.10739","arxiv_id_is_arxiv":true,"paper":"/paper/hippomm-hippocampal-inspired-multimodal","title":"HippoMM: Hippocampal-inspired Multimodal Memory for Long Audiovisual Event Understanding","date":null,"month_inferred_from_arxiv_id":"2025-04","title_source":"archive","repo":"linyueqian/hippomm","path":"hippomm/utils/vector_ops.py","file_url":"https://github.com/linyueqian/hippomm/blob/HEAD/hippomm/utils/vector_ops.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":"726aa68ab9de3ced","code_sha256_prefix":"726aa68ab9de3ced","mcp_get_code":{"code_sha256":"726aa68ab9de3ced"}},{"arxiv_id":"2503.07082","arxiv_id_is_arxiv":true,"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":"Orion-AI-Lab/EOUncertaintyGeneralization","path":"inference/infere_uncertainties.py","file_url":"https://github.com/Orion-AI-Lab/EOUncertaintyGeneralization/blob/HEAD/inference/infere_uncertainties.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d20673febf1cc6cb","code_sha256_prefix":"d20673febf1cc6cb","mcp_get_code":{"code_sha256":"d20673febf1cc6cb"}},{"arxiv_id":"2405.20790","arxiv_id_is_arxiv":true,"paper":"/paper/intersectional-unfairness-discovery","title":"Intersectional Unfairness Discovery","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xugezheng/bggn","path":"engine/engine_vae_bias.py","file_url":"https://github.com/xugezheng/bggn/blob/HEAD/engine/engine_vae_bias.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xugezheng/bggn when it was checked","code_sha256":"42b500b9cf00fc46","code_sha256_prefix":"42b500b9cf00fc46","mcp_get_code":{"code_sha256":"42b500b9cf00fc46"}},{"arxiv_id":"2404.11500","arxiv_id_is_arxiv":true,"paper":"/paper/paraphrase-and-solve-exploring-and-exploiting","title":"Paraphrase and Solve: Exploring and Exploiting the Impact of Surface Form on Mathematical Reasoning in Large Language Models","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yue-LLM-Pit/SCoP","path":"utils.py","file_url":"https://github.com/Yue-LLM-Pit/SCoP/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef37703ecc5c8527","code_sha256_prefix":"ef37703ecc5c8527","mcp_get_code":{"code_sha256":"ef37703ecc5c8527"}},{"arxiv_id":"2402.03563","arxiv_id_is_arxiv":true,"paper":"/paper/distinguishing-the-knowable-from-the","title":"Distinguishing the Knowable from the Unknowable with Language Models","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gahdritz/llm_uncertainty","path":"repetition.py","file_url":"https://github.com/gahdritz/llm_uncertainty/blob/HEAD/repetition.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":"625d925ef1efd4f4","code_sha256_prefix":"625d925ef1efd4f4","mcp_get_code":{"code_sha256":"625d925ef1efd4f4"}},{"arxiv_id":"2311.08718","arxiv_id_is_arxiv":true,"paper":"/paper/decomposing-uncertainty-for-large-language","title":"Decomposing Uncertainty for Large Language Models through Input Clarification Ensembling","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsb-nlp-chang/llm_uncertainty","path":"evaluate_uq_qa.py","file_url":"https://github.com/ucsb-nlp-chang/llm_uncertainty/blob/HEAD/evaluate_uq_qa.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, ucsb-nlp-chang/llm_uncertainty when it was checked","code_sha256":"20cdfa5f66a261c8","code_sha256_prefix":"20cdfa5f66a261c8","mcp_get_code":{"code_sha256":"20cdfa5f66a261c8"}},{"arxiv_id":"2309.04662","arxiv_id_is_arxiv":true,"paper":"/paper/madlad-400-a-multilingual-and-document-level","title":"MADLAD-400: A Multilingual And Document-Level Large Audited Dataset","date":"2023-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bramiozo/PubScience","path":"src/pubscience/clean/cleaner.py","file_url":"https://github.com/bramiozo/PubScience/blob/HEAD/src/pubscience/clean/cleaner.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"849de0c8feb5a9d5","code_sha256_prefix":"849de0c8feb5a9d5","mcp_get_code":{"code_sha256":"849de0c8feb5a9d5"}},{"arxiv_id":"2302.09572","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-data-free-quantization-as-a-zero","title":"Rethinking Data-Free Quantization as a Zero-Sum Game","date":"2023-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hfutqian/AdaSG","path":"AdaSG_code/CIFAR/trainer.py","file_url":"https://github.com/hfutqian/AdaSG/blob/HEAD/AdaSG_code/CIFAR/trainer.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":"90726473320040cd","code_sha256_prefix":"90726473320040cd","mcp_get_code":{"code_sha256":"90726473320040cd"}},{"arxiv_id":"2212.07359","arxiv_id_is_arxiv":true,"paper":"/paper/post-hoc-uncertainty-learning-using-a","title":"Post-hoc Uncertainty Learning using a Dirichlet Meta-Model","date":"2022-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maohaos2/PosthocUQ","path":"metrics.py","file_url":"https://github.com/maohaos2/PosthocUQ/blob/HEAD/metrics.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":"ecf2ba21313d2f00","code_sha256_prefix":"ecf2ba21313d2f00","mcp_get_code":{"code_sha256":"ecf2ba21313d2f00"}},{"arxiv_id":"2209.03316","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-complementarity-between-pre-training-1","title":"On the Complementarity between Pre-Training and Random-Initialization for Resource-Rich Machine Translation","date":"2022-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zanchangtong/ptvsri","path":"analysis/lpd.py","file_url":"https://github.com/zanchangtong/ptvsri/blob/HEAD/analysis/lpd.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":"6e072a02b03fd090","code_sha256_prefix":"6e072a02b03fd090","mcp_get_code":{"code_sha256":"6e072a02b03fd090"}},{"arxiv_id":"2207.10002","arxiv_id_is_arxiv":true,"paper":"/paper/overcoming-shortcut-learning-in-a-target","title":"Overcoming Shortcut Learning in a Target Domain by Generalizing Basic Visual Factors from a Source Domain","date":"2022-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/sourcegen","path":"sourcegen/models/sourcegen/models.py","file_url":"https://github.com/boschresearch/sourcegen/blob/HEAD/sourcegen/models/sourcegen/models.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, boschresearch/sourcegen, is not in the permissive set Syntology serves inline","code_sha256":"3a05a13349f6cd51","code_sha256_prefix":"3a05a13349f6cd51","mcp_get_code":{"code_sha256":"3a05a13349f6cd51"}},{"arxiv_id":"2201.10787","arxiv_id_is_arxiv":true,"paper":"/paper/variational-model-inversion-attacks-1","title":"Variational Model Inversion Attacks","date":"2022-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangkua1/vmi","path":"evaluate_samples.py","file_url":"https://github.com/wangkua1/vmi/blob/HEAD/evaluate_samples.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, wangkua1/vmi when it was checked","code_sha256":"44f8073d78252a7a","code_sha256_prefix":"44f8073d78252a7a","mcp_get_code":{"code_sha256":"44f8073d78252a7a"}},{"arxiv_id":"1912.03458","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-convolution-attention-over","title":"Dynamic Convolution: Attention over Convolution Kernels","date":"2019-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TArdelean/DynamicConvolution","path":"inspect_attention.py","file_url":"https://github.com/TArdelean/DynamicConvolution/blob/HEAD/inspect_attention.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":"e36ca5f4167e4e43","code_sha256_prefix":"e36ca5f4167e4e43","mcp_get_code":{"code_sha256":"e36ca5f4167e4e43"}},{"arxiv_id":"1805.09785","arxiv_id_is_arxiv":true,"paper":"/paper/entropy-and-mutual-information-in-models-of","title":"Entropy and mutual information in models of deep neural networks","date":"2018-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sphinxteam/dnner","path":"dnner/compute_entropy.py","file_url":"https://github.com/sphinxteam/dnner/blob/HEAD/dnner/compute_entropy.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sphinxteam/dnner when it was checked","code_sha256":"2df4bae2b5006e05","code_sha256_prefix":"2df4bae2b5006e05","mcp_get_code":{"code_sha256":"2df4bae2b5006e05"}}],"record_sha256":"ff62487a842cdb4c0f309094d064ea983ab5e929986be2c9d807a602f7b3c391","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}