{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7VL7WVXHEVNK5V67BVB5D6YPFK","short_pith_number":"pith:7VL7WVXH","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"},"canonical_sha256":"fd57fb56e7255aaed7df0d43d1fb0f2aa6e18fd8cb619d72ecd39e8b5177a584","source":{"kind":"arxiv","id":"1708.02216","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02216","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02216v1","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02216","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"pith_short_12","alias_value":"7VL7WVXHEVNK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7VL7WVXHEVNK5V67","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7VL7WVXH","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7VL7WVXHEVNK5V67BVB5D6YPFK","target":"record","payload":{"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"},"canonical_sha256":"fd57fb56e7255aaed7df0d43d1fb0f2aa6e18fd8cb619d72ecd39e8b5177a584","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"},"source_kind":"arxiv","source_id":"1708.02216","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:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjYwVZZc3Y2cIVC9KvRNir/se8KkD2DfMcRFdrL5UYUNuCQYjgIWS91USO1Tasa2abq9Ru1KXyrV6sVsXH4VDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:52:50.636841Z"},"content_sha256":"1f1315b34b8959c2ff6617031ab19726107486e27d128f6b3efeeac03027f4b3","schema_version":"1.0","event_id":"sha256:1f1315b34b8959c2ff6617031ab19726107486e27d128f6b3efeeac03027f4b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7VL7WVXHEVNK5V67BVB5D6YPFK","target":"graph","payload":{"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"},"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:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZX/vD77SQiCB5uLx6lAFBxihfXQq5VFAoNRUKVmQfTCZqsvbgmn2em7AFBznapIQ/C0ui1aL2EfIUnUbPGPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:52:50.637206Z"},"content_sha256":"b3045adc9ec048e43867fb325b359b0d649e950c0f907e47fc35505b591d0b18","schema_version":"1.0","event_id":"sha256:b3045adc9ec048e43867fb325b359b0d649e950c0f907e47fc35505b591d0b18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK/bundle.json","state_url":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VL7WVXHEVNK5V67BVB5D6YPFK/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-01T05:52:50Z","links":{"resolver":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK","bundle":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK/bundle.json","state":"https://pith.science/pith/7VL7WVXHEVNK5V67BVB5D6YPFK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VL7WVXHEVNK5V67BVB5D6YPFK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7VL7WVXHEVNK5V67BVB5D6YPFK","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":"ad8d750a940ac5ab5791faf105e2b479f8a5e2ba948893c7e9592ea4c6e223ca","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":"2017-08-07T17:35:40Z","title_canon_sha256":"bce17b6ee78c1be5302e0cc0bcfba0ae689f1b8c5ab4fd9dacba0cdeaa246c82"},"schema_version":"1.0","source":{"id":"1708.02216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02216","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02216v1","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02216","created_at":"2026-05-18T00:38:31Z"},{"alias_kind":"pith_short_12","alias_value":"7VL7WVXHEVNK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7VL7WVXHEVNK5V67","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7VL7WVXH","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:b3045adc9ec048e43867fb325b359b0d649e950c0f907e47fc35505b591d0b18","target":"graph","created_at":"2026-05-18T00:38:31Z","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 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","authors_text":"Lisa Hartung, Nina Holden, 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":"2017-08-07T17:35:40Z","title":"Trace reconstruction with varying deletion probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02216","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:1f1315b34b8959c2ff6617031ab19726107486e27d128f6b3efeeac03027f4b3","target":"record","created_at":"2026-05-18T00:38:31Z","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":"ad8d750a940ac5ab5791faf105e2b479f8a5e2ba948893c7e9592ea4c6e223ca","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":"2017-08-07T17:35:40Z","title_canon_sha256":"bce17b6ee78c1be5302e0cc0bcfba0ae689f1b8c5ab4fd9dacba0cdeaa246c82"},"schema_version":"1.0","source":{"id":"1708.02216","kind":"arxiv","version":1}},"canonical_sha256":"fd57fb56e7255aaed7df0d43d1fb0f2aa6e18fd8cb619d72ecd39e8b5177a584","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd57fb56e7255aaed7df0d43d1fb0f2aa6e18fd8cb619d72ecd39e8b5177a584","first_computed_at":"2026-05-18T00:38:31.760551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:31.760551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K2drLOCgUl1JNN9MqU2ABi/n9EDoq0+523i/rgxRQS3PQRYU2XhxKswZsaiLtmgDwlg8fNldMstoRNnSpODUCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:31.760976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f1315b34b8959c2ff6617031ab19726107486e27d128f6b3efeeac03027f4b3","sha256:b3045adc9ec048e43867fb325b359b0d649e950c0f907e47fc35505b591d0b18"],"state_sha256":"f913eeb912ff38fb51a058ed1d579fc4058d6ec676dd3b72c34ba2410d88ddf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GrADrojMQJIWR+8P5WgYs3XnGvWs5dzZGs1nnQfnJcuMKxXYwrTPys72AfInkhdEI84gpkiSNmy3xdO1mdRxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:52:50.639841Z","bundle_sha256":"b71b30250d45d0fb43477a6d43c09abed8147afd517047d751124f28fcd44036"}}