{"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/estimator","entry":"Estimator","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":7,"n_papers_ran":3,"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":7,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":4},"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":"2603.04825","paper":"/paper/arxiv-2603-04825","title":"Mitigating Instance Entanglement in Instance-Dependent Partial Label Learning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"RyanZhaoIc/CAD","path":"model.py","file_url":"https://github.com/RyanZhaoIc/CAD/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2c295caa24961e93","mcp_get_code":{"code_sha256":"2c295caa24961e93"}},{"arxiv_id":"2405.14335","paper":"/paper/logarithmic-smoothing-for-pessimistic-off","title":"Logarithmic Smoothing for Pessimistic Off-Policy Evaluation, Selection and Learning","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"otmhi/offpolicy_ls","path":"ope_ops/evaluators.py","file_url":"https://github.com/otmhi/offpolicy_ls/blob/HEAD/ope_ops/evaluators.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"992e74b3c1eaa038","mcp_get_code":{"code_sha256":"992e74b3c1eaa038"}},{"arxiv_id":"2306.14245","paper":"/paper/fedsampling-a-better-sampling-strategy-for","title":"FedSampling: A Better Sampling Strategy for Federated Learning","date":"2023-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taoqi98/FedSampling","path":"Codes/FedSampling.py","file_url":"https://github.com/taoqi98/FedSampling/blob/HEAD/Codes/FedSampling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f8fe920455a3991e","mcp_get_code":{"code_sha256":"f8fe920455a3991e"}},{"arxiv_id":"2210.13210","paper":"/paper/mutual-information-alleviates-hallucinations","title":"Mutual Information Alleviates Hallucinations in Abstractive Summarization","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iinemo/lm-polygraph","path":"src/lm_polygraph/estimators/conditional_pointwise_mutual_information.py","file_url":"https://github.com/iinemo/lm-polygraph/blob/HEAD/src/lm_polygraph/estimators/conditional_pointwise_mutual_information.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"733788d50f9f0f9e","mcp_get_code":{"code_sha256":"733788d50f9f0f9e"}},{"arxiv_id":"2206.11895","paper":"/paper/learning-viewpoint-agnostic-visual","title":"Learning Viewpoint-Agnostic Visual Representations by Recovering Tokens in 3D Space","date":"2022-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elicassion/3dtrl","path":"model/three_d_trl.py","file_url":"https://github.com/elicassion/3dtrl/blob/HEAD/model/three_d_trl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac46b3e1e6b72a84","mcp_get_code":{"code_sha256":"ac46b3e1e6b72a84"}},{"arxiv_id":"2202.07508","paper":"/paper/deep-constrained-least-squares-for-blind","title":"Deep Constrained Least Squares for Blind Image Super-Resolution","date":"2022-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megvii-research/dcls-sr","path":"codes/config/DCLS/models/modules/dcls_arch.py","file_url":"https://github.com/megvii-research/dcls-sr/blob/HEAD/codes/config/DCLS/models/modules/dcls_arch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8fa6861f618410ad","mcp_get_code":{"code_sha256":"8fa6861f618410ad"}},{"arxiv_id":"2010.02631","paper":"/paper/unfolding-the-alternating-optimization-for","title":"Unfolding the Alternating Optimization for Blind Super Resolution","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"greatlog/DAN","path":"codes/config/DANv1/models/modules/dan_arch.py","file_url":"https://github.com/greatlog/DAN/blob/HEAD/codes/config/DANv1/models/modules/dan_arch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f7ef4da8a26e5fac","mcp_get_code":{"code_sha256":"f7ef4da8a26e5fac"}}]}