{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NKP7S6FJIGA22EMFJKVGBYVDH6","short_pith_number":"pith:NKP7S6FJ","canonical_record":{"source":{"id":"1708.00854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-01T17:46:06Z","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"title_canon_sha256":"e8fcc0da09f98ce6329502411971ca2618b4f3f7b22cd8c8baba3d35d382a76b","abstract_canon_sha256":"45674e9d6c8d8592974afe0a9a0af4755c1e542bcb8b16932cc1c4f70d57a96c"},"schema_version":"1.0"},"canonical_sha256":"6a9ff978a94181ad11854aaa60e2a33fb21f2e378c1b93009b9321e99943a4fe","source":{"kind":"arxiv","id":"1708.00854","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00854","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00854v1","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00854","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"NKP7S6FJIGA2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NKP7S6FJIGA22EMF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NKP7S6FJ","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NKP7S6FJIGA22EMFJKVGBYVDH6","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-01T17:46:06Z","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"title_canon_sha256":"e8fcc0da09f98ce6329502411971ca2618b4f3f7b22cd8c8baba3d35d382a76b","abstract_canon_sha256":"45674e9d6c8d8592974afe0a9a0af4755c1e542bcb8b16932cc1c4f70d57a96c"},"schema_version":"1.0"},"canonical_sha256":"6a9ff978a94181ad11854aaa60e2a33fb21f2e378c1b93009b9321e99943a4fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:44.438872Z","signature_b64":"+8gMR2TD0jsT7BSrOQCjKxXflrE/WzU2VF+WxyHL9C8ZoIvivPq+8HXvTiVtm+bGXrM3+tDh6pL00TGaeKYPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a9ff978a94181ad11854aaa60e2a33fb21f2e378c1b93009b9321e99943a4fe","last_reissued_at":"2026-05-18T00:38:44.438338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:44.438338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00854","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ETPmXgoxf9+b5T5FM1UBw1T3sN2ActJ6PmG9o3Fbp0J7lS7nDWqS+pcU2qV/VsK2SwwDTW57DYoV5oRn34IBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:40:20.292818Z"},"content_sha256":"c257aadca308c22bc5b5a7bfa1dd8aabb616f19250fa0fd4fee269493031c385","schema_version":"1.0","event_id":"sha256:c257aadca308c22bc5b5a7bfa1dd8aabb616f19250fa0fd4fee269493031c385"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NKP7S6FJIGA22EMFJKVGBYVDH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average-case reconstruction for the deletion channel: subpolynomially many traces suffice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"cs.DS","authors_text":"Alex Zhai, Yuval Peres","submitted_at":"2017-08-01T17:46:06Z","abstract_excerpt":"The deletion channel takes as input a bit string $\\mathbf{x} \\in \\{0,1\\}^n$, and deletes each bit independently with probability $q$, yielding a shorter string. The trace reconstruction problem is to recover an unknown string $\\mathbf{x}$ from many independent outputs (called \"traces\") of the deletion channel applied to $\\mathbf{x}$. We show that if $\\mathbf{x}$ is drawn uniformly at random and $q < 1/2$, then $e^{O(\\log^{1/2} n)}$ traces suffice to reconstruct $\\mathbf{x}$ with high probability. The previous best bound, established in 2008 by Holenstein-Mitzenmacher-Panigrahy-Wieder, uses $n^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00854","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BljP1b8V+wDR1slRBdHJ70PYgci+44yyssA2oj2HdhxNIHjTZTWdzfAlVSNF3fCEeC9UDg27LslNAODk88TtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:40:20.293229Z"},"content_sha256":"2d39910ce9a4cda50fdd8d09b3c81af2ae81e4279665d1101993865333faf689","schema_version":"1.0","event_id":"sha256:2d39910ce9a4cda50fdd8d09b3c81af2ae81e4279665d1101993865333faf689"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKP7S6FJIGA22EMFJKVGBYVDH6/bundle.json","state_url":"https://pith.science/pith/NKP7S6FJIGA22EMFJKVGBYVDH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKP7S6FJIGA22EMFJKVGBYVDH6/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-06-09T11:40:20Z","links":{"resolver":"https://pith.science/pith/NKP7S6FJIGA22EMFJKVGBYVDH6","bundle":"https://pith.science/pith/NKP7S6FJIGA22EMFJKVGBYVDH6/bundle.json","state":"https://pith.science/pith/NKP7S6FJIGA22EMFJKVGBYVDH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKP7S6FJIGA22EMFJKVGBYVDH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NKP7S6FJIGA22EMFJKVGBYVDH6","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":"45674e9d6c8d8592974afe0a9a0af4755c1e542bcb8b16932cc1c4f70d57a96c","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-01T17:46:06Z","title_canon_sha256":"e8fcc0da09f98ce6329502411971ca2618b4f3f7b22cd8c8baba3d35d382a76b"},"schema_version":"1.0","source":{"id":"1708.00854","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00854","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00854v1","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00854","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"NKP7S6FJIGA2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NKP7S6FJIGA22EMF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NKP7S6FJ","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:2d39910ce9a4cda50fdd8d09b3c81af2ae81e4279665d1101993865333faf689","target":"graph","created_at":"2026-05-18T00:38:44Z","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":"The deletion channel takes as input a bit string $\\mathbf{x} \\in \\{0,1\\}^n$, and deletes each bit independently with probability $q$, yielding a shorter string. The trace reconstruction problem is to recover an unknown string $\\mathbf{x}$ from many independent outputs (called \"traces\") of the deletion channel applied to $\\mathbf{x}$. We show that if $\\mathbf{x}$ is drawn uniformly at random and $q < 1/2$, then $e^{O(\\log^{1/2} n)}$ traces suffice to reconstruct $\\mathbf{x}$ with high probability. The previous best bound, established in 2008 by Holenstein-Mitzenmacher-Panigrahy-Wieder, uses $n^","authors_text":"Alex Zhai, Yuval Peres","cross_cats":["cs.IT","math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-01T17:46:06Z","title":"Average-case reconstruction for the deletion channel: subpolynomially many traces suffice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00854","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:c257aadca308c22bc5b5a7bfa1dd8aabb616f19250fa0fd4fee269493031c385","target":"record","created_at":"2026-05-18T00:38:44Z","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":"45674e9d6c8d8592974afe0a9a0af4755c1e542bcb8b16932cc1c4f70d57a96c","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-01T17:46:06Z","title_canon_sha256":"e8fcc0da09f98ce6329502411971ca2618b4f3f7b22cd8c8baba3d35d382a76b"},"schema_version":"1.0","source":{"id":"1708.00854","kind":"arxiv","version":1}},"canonical_sha256":"6a9ff978a94181ad11854aaa60e2a33fb21f2e378c1b93009b9321e99943a4fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a9ff978a94181ad11854aaa60e2a33fb21f2e378c1b93009b9321e99943a4fe","first_computed_at":"2026-05-18T00:38:44.438338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:44.438338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+8gMR2TD0jsT7BSrOQCjKxXflrE/WzU2VF+WxyHL9C8ZoIvivPq+8HXvTiVtm+bGXrM3+tDh6pL00TGaeKYPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:44.438872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00854","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c257aadca308c22bc5b5a7bfa1dd8aabb616f19250fa0fd4fee269493031c385","sha256:2d39910ce9a4cda50fdd8d09b3c81af2ae81e4279665d1101993865333faf689"],"state_sha256":"9805876a2606a661db69485419c4eb08d9c271308e6cd5d5523d22e991a44a77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tu9mkSWo3Azecdven7I/MyEn65dCnDQLrmajg2zJ57DrrSYcBj2JN5Vg7eGvpFNF4f0BlTgLXa7/4jqQ5Vg1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:40:20.296198Z","bundle_sha256":"79a216d2af818592f783be73f6321963d4caf4c89c5c82f07d51cf24516aa329"}}