{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7VL7WVXHEVNK5V67BVB5D6YPFK","short_pith_number":"pith:7VL7WVXH","schema_version":"1.0","canonical_sha256":"fd57fb56e7255aaed7df0d43d1fb0f2aa6e18fd8cb619d72ecd39e8b5177a584","source":{"kind":"arxiv","id":"1708.02216","version":1},"attestation_state":"computed","paper":{"title":"Trace reconstruction with varying deletion probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Lisa Hartung, Nina Holden, Yuval Peres","submitted_at":"2017-08-07T17:35:40Z","abstract_excerpt":"In the trace reconstruction problem an unknown string ${\\bf x}=(x_0,\\dots,x_{n-1})\\in\\{0,1,...,m-1\\}^n$ is observed through the deletion channel, which deletes each $x_k$ with a certain probability, yielding a contracted string $\\widetilde{\\bf X}$. Earlier works have proved that if each $x_k$ is deleted with the same probability $q\\in[0,1)$, then $\\exp(O(n^{1/3}))$ independent copies of the contracted string $\\widetilde{\\bf X}$ suffice to reconstruct $\\bf x$ with high probability. We extend this upper bound to the setting where the deletion probabilities vary, assuming certain regularity condi"},"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":"1708.02216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-08-07T17:35:40Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"bce17b6ee78c1be5302e0cc0bcfba0ae689f1b8c5ab4fd9dacba0cdeaa246c82","abstract_canon_sha256":"ad8d750a940ac5ab5791faf105e2b479f8a5e2ba948893c7e9592ea4c6e223ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:31.760976Z","signature_b64":"K2drLOCgUl1JNN9MqU2ABi/n9EDoq0+523i/rgxRQS3PQRYU2XhxKswZsaiLtmgDwlg8fNldMstoRNnSpODUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd57fb56e7255aaed7df0d43d1fb0f2aa6e18fd8cb619d72ecd39e8b5177a584","last_reissued_at":"2026-05-18T00:38:31.760551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:31.760551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trace reconstruction with varying deletion probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Lisa Hartung, Nina Holden, Yuval Peres","submitted_at":"2017-08-07T17:35:40Z","abstract_excerpt":"In the trace reconstruction problem an unknown string ${\\bf x}=(x_0,\\dots,x_{n-1})\\in\\{0,1,...,m-1\\}^n$ is observed through the deletion channel, which deletes each $x_k$ with a certain probability, yielding a contracted string $\\widetilde{\\bf X}$. Earlier works have proved that if each $x_k$ is deleted with the same probability $q\\in[0,1)$, then $\\exp(O(n^{1/3}))$ independent copies of the contracted string $\\widetilde{\\bf X}$ suffice to reconstruct $\\bf x$ with high probability. We extend this upper bound to the setting where the deletion probabilities vary, assuming certain regularity condi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02216","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":"1708.02216","created_at":"2026-05-18T00:38:31.760608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02216v1","created_at":"2026-05-18T00:38:31.760608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02216","created_at":"2026-05-18T00:38:31.760608+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VL7WVXHEVNK","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VL7WVXHEVNK5V67","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VL7WVXH","created_at":"2026-05-18T12:31:05.417338+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/7VL7WVXHEVNK5V67BVB5D6YPFK","json":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK.json","graph_json":"https://pith.science/api/pith-number/7VL7WVXHEVNK5V67BVB5D6YPFK/graph.json","events_json":"https://pith.science/api/pith-number/7VL7WVXHEVNK5V67BVB5D6YPFK/events.json","paper":"https://pith.science/paper/7VL7WVXH"},"agent_actions":{"view_html":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK","download_json":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK.json","view_paper":"https://pith.science/paper/7VL7WVXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02216&json=true","fetch_graph":"https://pith.science/api/pith-number/7VL7WVXHEVNK5V67BVB5D6YPFK/graph.json","fetch_events":"https://pith.science/api/pith-number/7VL7WVXHEVNK5V67BVB5D6YPFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK/action/storage_attestation","attest_author":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK/action/author_attestation","sign_citation":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK/action/citation_signature","submit_replication":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK/action/replication_record"}},"created_at":"2026-05-18T00:38:31.760608+00:00","updated_at":"2026-05-18T00:38:31.760608+00:00"}