{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2B3DQPC6RKQ536TBNWIBASZHID","short_pith_number":"pith:2B3DQPC6","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"},"canonical_sha256":"d076383c5e8aa1ddfa616d90104b2740f95e639137d5aca0feec65e7224b3960","source":{"kind":"arxiv","id":"1612.03599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03599","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03599v1","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03599","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"2B3DQPC6RKQ5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2B3DQPC6RKQ536TB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2B3DQPC6","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2B3DQPC6RKQ536TBNWIBASZHID","target":"record","payload":{"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"},"canonical_sha256":"d076383c5e8aa1ddfa616d90104b2740f95e639137d5aca0feec65e7224b3960","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"},"source_kind":"arxiv","source_id":"1612.03599","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7CJpkWap5UjniKxsAq5EDu001p90TCzYZYlr0Nn1OT9G2QwJEz/ud4v9TcHfJEYwDGUYXw/dKll2a/DD/qrsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:55.414123Z"},"content_sha256":"8ea817ac6f8007521b81bc26f8c343ddbc87a242281e2d2d042273836c57a04a","schema_version":"1.0","event_id":"sha256:8ea817ac6f8007521b81bc26f8c343ddbc87a242281e2d2d042273836c57a04a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2B3DQPC6RKQ536TBNWIBASZHID","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvyspL0gHinmIgFQOUPa0a4nYCuXtoJy4oyCwAogCdD99/Ubxmlj0a0/1a7I6oXeVctGY7lP/Jz1DAv/eq7eAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:55.414932Z"},"content_sha256":"4d5d6a72bb9fa505e97d2a29d86a092e7908d05f66bdafa694735a6073537642","schema_version":"1.0","event_id":"sha256:4d5d6a72bb9fa505e97d2a29d86a092e7908d05f66bdafa694735a6073537642"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID/bundle.json","state_url":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2B3DQPC6RKQ536TBNWIBASZHID/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T23:51:55Z","links":{"resolver":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID","bundle":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID/bundle.json","state":"https://pith.science/pith/2B3DQPC6RKQ536TBNWIBASZHID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2B3DQPC6RKQ536TBNWIBASZHID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2B3DQPC6RKQ536TBNWIBASZHID","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a19f4b436a61de6931b5d306cebe0b9816c8c2d6c58775e412baef9db3f583ba","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-12T10:30:13Z","title_canon_sha256":"8f1ab172031dc3cd320dc7478296edb3195740879393b49e202c96efd0a22243"},"schema_version":"1.0","source":{"id":"1612.03599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03599","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03599v1","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03599","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"2B3DQPC6RKQ5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2B3DQPC6RKQ536TB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2B3DQPC6","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:4d5d6a72bb9fa505e97d2a29d86a092e7908d05f66bdafa694735a6073537642","target":"graph","created_at":"2026-05-18T00:55:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Fedor Nazarov, Yuval Peres","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-12T10:30:13Z","title":"Trace reconstruction with $\\exp( O( n^{1/3} ) )$ samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03599","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8ea817ac6f8007521b81bc26f8c343ddbc87a242281e2d2d042273836c57a04a","target":"record","created_at":"2026-05-18T00:55:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a19f4b436a61de6931b5d306cebe0b9816c8c2d6c58775e412baef9db3f583ba","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-12T10:30:13Z","title_canon_sha256":"8f1ab172031dc3cd320dc7478296edb3195740879393b49e202c96efd0a22243"},"schema_version":"1.0","source":{"id":"1612.03599","kind":"arxiv","version":1}},"canonical_sha256":"d076383c5e8aa1ddfa616d90104b2740f95e639137d5aca0feec65e7224b3960","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d076383c5e8aa1ddfa616d90104b2740f95e639137d5aca0feec65e7224b3960","first_computed_at":"2026-05-18T00:55:18.813336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:18.813336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GeH99c2KDe/pvuXTG7iq4UfV6EwMLJ70v7jTqnezqQotTFfCw3fRVL2dE8zz5/o4NVHVNi15NrcYk2i4ail4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:18.813872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ea817ac6f8007521b81bc26f8c343ddbc87a242281e2d2d042273836c57a04a","sha256:4d5d6a72bb9fa505e97d2a29d86a092e7908d05f66bdafa694735a6073537642"],"state_sha256":"4514e1615f31219743b3e861c9e5936fa62c78dea3166859537daf1578640b34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgEr5VwYzrW8w7ETzYB1Uxe6sm0o749ipDIFeQ6KaQKHidMFC0sWgvmHsemLE/cReR7axHopY0YLScsoUPHtDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:51:55.419038Z","bundle_sha256":"06f4f9a402683ebdae972b743741342db0c752b219818ca48197271179a0bcac"}}