{"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-distribution","entry":"get_distribution","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":8,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":8,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":3,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"unverified":4},"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":"2503.23913","arxiv_id_is_arxiv":true,"paper":"/paper/entropy-based-adaptive-weighting-for-self","title":"Entropy-Based Adaptive Weighting for Self-Training","date":"2025-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mandyyyyii/east","path":"data_generation/util.py","file_url":"https://github.com/mandyyyyii/east/blob/HEAD/data_generation/util.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":"152f1e617a3f1d49","code_sha256_prefix":"152f1e617a3f1d49","mcp_get_code":{"code_sha256":"152f1e617a3f1d49"}},{"arxiv_id":"2410.17215","arxiv_id_is_arxiv":true,"paper":"/paper/miniplm-knowledge-distillation-for-pre","title":"MiniPLM: Knowledge Distillation for Pre-Training Language Models","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-coai/MiniPLM","path":"utils.py","file_url":"https://github.com/thu-coai/MiniPLM/blob/HEAD/utils.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":"ae64ae2a98def56a","code_sha256_prefix":"ae64ae2a98def56a","mcp_get_code":{"code_sha256":"ae64ae2a98def56a"}},{"arxiv_id":"2404.16308","arxiv_id_is_arxiv":true,"paper":"/paper/worldvaluesbench-a-large-scale-benchmark","title":"WorldValuesBench: A Large-Scale Benchmark Dataset for Multi-Cultural Value Awareness of Language Models","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"demon702/worldvaluesbench","path":"evaluation/evaluate.py","file_url":"https://github.com/demon702/worldvaluesbench/blob/HEAD/evaluation/evaluate.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, demon702/worldvaluesbench when it was checked","code_sha256":"22780e9551a219c1","code_sha256_prefix":"22780e9551a219c1","mcp_get_code":{"code_sha256":"22780e9551a219c1"}},{"arxiv_id":"2402.17886","arxiv_id_is_arxiv":true,"paper":"/paper/zeroth-order-sampling-methods-for-non-log","title":"Zeroth-Order Sampling Methods for Non-Log-Concave Distributions: Alleviating Metastability by Denoising Diffusion","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevinrojas1499/zod-mc","path":"utils/densities.py","file_url":"https://github.com/kevinrojas1499/zod-mc/blob/HEAD/utils/densities.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, kevinrojas1499/zod-mc when it was checked","code_sha256":"4b8fa182d48a8eec","code_sha256_prefix":"4b8fa182d48a8eec","mcp_get_code":{"code_sha256":"4b8fa182d48a8eec"}},{"arxiv_id":"2308.16527","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-recognition-of-unknown-objects","title":"Unsupervised Recognition of Unknown Objects for Open-World Object Detection","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frh23333/mepu-owod","path":"mepu/model/rew/distribution_fitter.py","file_url":"https://github.com/frh23333/mepu-owod/blob/HEAD/mepu/model/rew/distribution_fitter.py","status":"ran","verification_level":1,"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, frh23333/mepu-owod when it was checked","code_sha256":"efd0c03d56883505","code_sha256_prefix":"efd0c03d56883505","mcp_get_code":{"code_sha256":"efd0c03d56883505"}},{"arxiv_id":"2206.10311","arxiv_id_is_arxiv":true,"paper":"/paper/marginal-tail-adaptive-normalizing-flows-1","title":"Marginal Tail-Adaptive Normalizing Flows","date":"2022-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mikelasz/marginaltailadaptiveflow","path":"utils/tail_estimation.py","file_url":"https://github.com/mikelasz/marginaltailadaptiveflow/blob/HEAD/utils/tail_estimation.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":"04c1ee9e55c9b428","code_sha256_prefix":"04c1ee9e55c9b428","mcp_get_code":{"code_sha256":"04c1ee9e55c9b428"}},{"arxiv_id":"2111.04706","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-framework-for-gradient-leakage-1","title":"Bayesian Framework for Gradient Leakage","date":"2021-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/bayes-framework-leakage","path":"bayes_optimal_attack/datasets/distributions.py","file_url":"https://github.com/eth-sri/bayes-framework-leakage/blob/HEAD/bayes_optimal_attack/datasets/distributions.py","status":"unverified","verification_level":0,"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":"1983fcb2f9da6520","code_sha256_prefix":"1983fcb2f9da6520","mcp_get_code":{"code_sha256":"1983fcb2f9da6520"}},{"arxiv_id":"1902.04043","arxiv_id_is_arxiv":true,"paper":"/paper/the-starcraft-multi-agent-challenge","title":"The StarCraft Multi-Agent Challenge","date":"2019-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oxwhirl/smacv2","path":"smacv2/env/starcraft2/distributions.py","file_url":"https://github.com/oxwhirl/smacv2/blob/HEAD/smacv2/env/starcraft2/distributions.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":"931274a62c01dbc3","code_sha256_prefix":"931274a62c01dbc3","mcp_get_code":{"code_sha256":"931274a62c01dbc3"}}],"record_sha256":"44f4d4702a22089754b96f7827d2b55615fdf122488eacb6eb7c6bc2c2b5f151","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}