{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2B3DQPC6RKQ536TBNWIBASZHID","short_pith_number":"pith:2B3DQPC6","schema_version":"1.0","canonical_sha256":"d076383c5e8aa1ddfa616d90104b2740f95e639137d5aca0feec65e7224b3960","source":{"kind":"arxiv","id":"1612.03599","version":1},"attestation_state":"computed","paper":{"title":"Trace reconstruction with $\\exp( O( n^{1/3} ) )$ samples","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":"Fedor Nazarov, Yuval Peres","submitted_at":"2016-12-12T10:30:13Z","abstract_excerpt":"In the trace reconstruction problem, an unknown bit string $x \\in \\{0,1\\}^n$ is observed through the deletion channel, which deletes each bit of $x$ with some constant probability $q$, yielding a contracted string $\\widetilde{x}$. How many independent copies of $\\widetilde{x}$ are needed to reconstruct $x$ with high probability? Prior to this work, the best upper bound, due to Holenstein, Mitzenmacher, Panigrahy, and Wieder (2008), was $\\exp(\\widetilde{O}(n^{1/2}))$. We improve this bound to $\\exp(O(n^{1/3}))$ using statistics of individual bits in the output and show that this bound is sharp "},"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":"1612.03599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-12T10:30:13Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"8f1ab172031dc3cd320dc7478296edb3195740879393b49e202c96efd0a22243","abstract_canon_sha256":"a19f4b436a61de6931b5d306cebe0b9816c8c2d6c58775e412baef9db3f583ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:18.813872Z","signature_b64":"GeH99c2KDe/pvuXTG7iq4UfV6EwMLJ70v7jTqnezqQotTFfCw3fRVL2dE8zz5/o4NVHVNi15NrcYk2i4ail4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d076383c5e8aa1ddfa616d90104b2740f95e639137d5aca0feec65e7224b3960","last_reissued_at":"2026-05-18T00:55:18.813336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:18.813336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trace reconstruction with $\\exp( O( n^{1/3} ) )$ samples","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":"Fedor Nazarov, Yuval Peres","submitted_at":"2016-12-12T10:30:13Z","abstract_excerpt":"In the trace reconstruction problem, an unknown bit string $x \\in \\{0,1\\}^n$ is observed through the deletion channel, which deletes each bit of $x$ with some constant probability $q$, yielding a contracted string $\\widetilde{x}$. How many independent copies of $\\widetilde{x}$ are needed to reconstruct $x$ with high probability? Prior to this work, the best upper bound, due to Holenstein, Mitzenmacher, Panigrahy, and Wieder (2008), was $\\exp(\\widetilde{O}(n^{1/2}))$. We improve this bound to $\\exp(O(n^{1/3}))$ using statistics of individual bits in the output and show that this bound is sharp "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03599","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":"1612.03599","created_at":"2026-05-18T00:55:18.813420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.03599v1","created_at":"2026-05-18T00:55:18.813420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03599","created_at":"2026-05-18T00:55:18.813420+00:00"},{"alias_kind":"pith_short_12","alias_value":"2B3DQPC6RKQ5","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"2B3DQPC6RKQ536TB","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"2B3DQPC6","created_at":"2026-05-18T12:29:52.810259+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/2B3DQPC6RKQ536TBNWIBASZHID","json":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID.json","graph_json":"https://pith.science/api/pith-number/2B3DQPC6RKQ536TBNWIBASZHID/graph.json","events_json":"https://pith.science/api/pith-number/2B3DQPC6RKQ536TBNWIBASZHID/events.json","paper":"https://pith.science/paper/2B3DQPC6"},"agent_actions":{"view_html":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID","download_json":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID.json","view_paper":"https://pith.science/paper/2B3DQPC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.03599&json=true","fetch_graph":"https://pith.science/api/pith-number/2B3DQPC6RKQ536TBNWIBASZHID/graph.json","fetch_events":"https://pith.science/api/pith-number/2B3DQPC6RKQ536TBNWIBASZHID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID/action/storage_attestation","attest_author":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID/action/author_attestation","sign_citation":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID/action/citation_signature","submit_replication":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID/action/replication_record"}},"created_at":"2026-05-18T00:55:18.813420+00:00","updated_at":"2026-05-18T00:55:18.813420+00:00"}