{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RPEXSSTUOS34YEN7GCFFIHUB3V","short_pith_number":"pith:RPEXSSTU","schema_version":"1.0","canonical_sha256":"8bc9794a7474b7cc11bf308a541e81dd56111e9bfde89ca0ac809cd8f8867d48","source":{"kind":"arxiv","id":"1904.05532","version":1},"attestation_state":"computed","paper":{"title":"Beyond trace reconstruction: Population recovery from the deletion channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Freilich, Frank Ban, Rocco A. Servedio, Sandip Sinha, Xi Chen","submitted_at":"2019-04-11T04:54:59Z","abstract_excerpt":"\\emph{Population recovery} is the problem of learning an unknown distribution over an unknown set of $n$-bit strings, given access to independent draws from the distribution that have been independently corrupted according to some noise channel. Recent work has intensively studied such problems both for the bit-flip and erasure noise channels.\n  We initiate the study of population recovery under the \\emph{deletion channel}, in which each bit is independently \\emph{deleted} with some fixed probability and the surviving bits are concatenated and transmitted. This is a far more challenging noise "},"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":"1904.05532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-11T04:54:59Z","cross_cats_sorted":[],"title_canon_sha256":"7c2d96e0fcfd4d8c26d0c7f66f85ea08e188b3d76c9a25e7f4222d52d8fd5f09","abstract_canon_sha256":"7486df428bd077ce5f69e45abd98d9eee44a86e8ed55840bf02289201df99cc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:49.244716Z","signature_b64":"99QhkK7tpPhLH4Ay4elC7hePBFOG9TCJ8eUiBm7ooBiYqwgkaAlqO5C8k+zbiTh6BPJskE/GVBOWMfCBzVx/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc9794a7474b7cc11bf308a541e81dd56111e9bfde89ca0ac809cd8f8867d48","last_reissued_at":"2026-05-17T23:48:49.244107Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:49.244107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond trace reconstruction: Population recovery from the deletion channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Freilich, Frank Ban, Rocco A. Servedio, Sandip Sinha, Xi Chen","submitted_at":"2019-04-11T04:54:59Z","abstract_excerpt":"\\emph{Population recovery} is the problem of learning an unknown distribution over an unknown set of $n$-bit strings, given access to independent draws from the distribution that have been independently corrupted according to some noise channel. Recent work has intensively studied such problems both for the bit-flip and erasure noise channels.\n  We initiate the study of population recovery under the \\emph{deletion channel}, in which each bit is independently \\emph{deleted} with some fixed probability and the surviving bits are concatenated and transmitted. This is a far more challenging noise "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05532","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":""},"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":"1904.05532","created_at":"2026-05-17T23:48:49.244200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05532v1","created_at":"2026-05-17T23:48:49.244200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05532","created_at":"2026-05-17T23:48:49.244200+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPEXSSTUOS34","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPEXSSTUOS34YEN7","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPEXSSTU","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPEXSSTUOS34YEN7GCFFIHUB3V","json":"https://pith.science/pith/RPEXSSTUOS34YEN7GCFFIHUB3V.json","graph_json":"https://pith.science/api/pith-number/RPEXSSTUOS34YEN7GCFFIHUB3V/graph.json","events_json":"https://pith.science/api/pith-number/RPEXSSTUOS34YEN7GCFFIHUB3V/events.json","paper":"https://pith.science/paper/RPEXSSTU"},"agent_actions":{"view_html":"https://pith.science/pith/RPEXSSTUOS34YEN7GCFFIHUB3V","download_json":"https://pith.science/pith/RPEXSSTUOS34YEN7GCFFIHUB3V.json","view_paper":"https://pith.science/paper/RPEXSSTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05532&json=true","fetch_graph":"https://pith.science/api/pith-number/RPEXSSTUOS34YEN7GCFFIHUB3V/graph.json","fetch_events":"https://pith.science/api/pith-number/RPEXSSTUOS34YEN7GCFFIHUB3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPEXSSTUOS34YEN7GCFFIHUB3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPEXSSTUOS34YEN7GCFFIHUB3V/action/storage_attestation","attest_author":"https://pith.science/pith/RPEXSSTUOS34YEN7GCFFIHUB3V/action/author_attestation","sign_citation":"https://pith.science/pith/RPEXSSTUOS34YEN7GCFFIHUB3V/action/citation_signature","submit_replication":"https://pith.science/pith/RPEXSSTUOS34YEN7GCFFIHUB3V/action/replication_record"}},"created_at":"2026-05-17T23:48:49.244200+00:00","updated_at":"2026-05-17T23:48:49.244200+00:00"}