{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LBOGM6PJB4RN7TZMYFOEKUN2KE","short_pith_number":"pith:LBOGM6PJ","schema_version":"1.0","canonical_sha256":"585c6679e90f22dfcf2cc15c4551ba513ae90be385d3c2103fcbcddc6d3779bf","source":{"kind":"arxiv","id":"2507.11297","version":1},"attestation_state":"computed","paper":{"title":"How to rank imputation methods?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ME","authors_text":"Erwan Scornet, Jeffrey N\\\"af, Krystyna Grzesiak","submitted_at":"2025-07-15T13:24:39Z","abstract_excerpt":"Imputation is an attractive tool for dealing with the widespread issue of missing values. Consequently, studying and developing imputation methods has been an active field of research over the last decade. Faced with an imputation task and a large number of methods, how does one find the most suitable imputation? Although model selection in different contexts, such as prediction, has been well studied, this question appears not to have received much attention. In this paper, we follow the concept of Imputation Scores (I-Scores) and develop a new, reliable, and easy-to-implement score to rank m"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.11297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-07-15T13:24:39Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"ba369a11f42602cc946fdd152d859e3785c20180cdc6dbeff5392de6eae9e5bf","abstract_canon_sha256":"bbe7cb4857af9da6c92a5a6f5432a7c4d48f7ad3ba2fb36575549068078d8740"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:36.425779Z","signature_b64":"4NTcThqXu3iNRxbmL96OqsLlu/tAYp72ueU3UqCF6TMPADSUb+n+tvUX3kPf5QFLwoFeAJMLIsIj/GDPzA9GDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"585c6679e90f22dfcf2cc15c4551ba513ae90be385d3c2103fcbcddc6d3779bf","last_reissued_at":"2026-07-05T11:37:36.425276Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:36.425276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to rank imputation methods?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ME","authors_text":"Erwan Scornet, Jeffrey N\\\"af, Krystyna Grzesiak","submitted_at":"2025-07-15T13:24:39Z","abstract_excerpt":"Imputation is an attractive tool for dealing with the widespread issue of missing values. Consequently, studying and developing imputation methods has been an active field of research over the last decade. Faced with an imputation task and a large number of methods, how does one find the most suitable imputation? Although model selection in different contexts, such as prediction, has been well studied, this question appears not to have received much attention. In this paper, we follow the concept of Imputation Scores (I-Scores) and develop a new, reliable, and easy-to-implement score to rank m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11297","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.11297/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.11297","created_at":"2026-07-05T11:37:36.425340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11297v1","created_at":"2026-07-05T11:37:36.425340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11297","created_at":"2026-07-05T11:37:36.425340+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBOGM6PJB4RN","created_at":"2026-07-05T11:37:36.425340+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBOGM6PJB4RN7TZM","created_at":"2026-07-05T11:37:36.425340+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBOGM6PJ","created_at":"2026-07-05T11:37:36.425340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.10113","citing_title":"Asymptotics of Nonparametric Estimation under General Non-monotone MAR Missingness: A Nonparametric Maximum Likelihood Approach","ref_index":95,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LBOGM6PJB4RN7TZMYFOEKUN2KE","json":"https://pith.science/pith/LBOGM6PJB4RN7TZMYFOEKUN2KE.json","graph_json":"https://pith.science/api/pith-number/LBOGM6PJB4RN7TZMYFOEKUN2KE/graph.json","events_json":"https://pith.science/api/pith-number/LBOGM6PJB4RN7TZMYFOEKUN2KE/events.json","paper":"https://pith.science/paper/LBOGM6PJ"},"agent_actions":{"view_html":"https://pith.science/pith/LBOGM6PJB4RN7TZMYFOEKUN2KE","download_json":"https://pith.science/pith/LBOGM6PJB4RN7TZMYFOEKUN2KE.json","view_paper":"https://pith.science/paper/LBOGM6PJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11297&json=true","fetch_graph":"https://pith.science/api/pith-number/LBOGM6PJB4RN7TZMYFOEKUN2KE/graph.json","fetch_events":"https://pith.science/api/pith-number/LBOGM6PJB4RN7TZMYFOEKUN2KE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBOGM6PJB4RN7TZMYFOEKUN2KE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBOGM6PJB4RN7TZMYFOEKUN2KE/action/storage_attestation","attest_author":"https://pith.science/pith/LBOGM6PJB4RN7TZMYFOEKUN2KE/action/author_attestation","sign_citation":"https://pith.science/pith/LBOGM6PJB4RN7TZMYFOEKUN2KE/action/citation_signature","submit_replication":"https://pith.science/pith/LBOGM6PJB4RN7TZMYFOEKUN2KE/action/replication_record"}},"created_at":"2026-07-05T11:37:36.425340+00:00","updated_at":"2026-07-05T11:37:36.425340+00:00"}