{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3FQAZXSEVSMT3U2CZRNPABKOEP","short_pith_number":"pith:3FQAZXSE","canonical_record":{"source":{"id":"2107.06454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-07-14T02:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"8d46389b56bbe0caa0028c61dd7fa87cafdf2715b27c1f96d58241fc90dd09b7","abstract_canon_sha256":"94285359ba63fe226751eed3bbf1a83f6e4afe7615f088dc7fc8c4bc286184d3"},"schema_version":"1.0"},"canonical_sha256":"d9600cde44ac993dd342cc5af0054e23f406d6d6f2592dfdeb0b551a33fd87de","source":{"kind":"arxiv","id":"2107.06454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06454","created_at":"2026-07-05T02:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06454v1","created_at":"2026-07-05T02:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06454","created_at":"2026-07-05T02:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"3FQAZXSEVSMT","created_at":"2026-07-05T02:57:58Z"},{"alias_kind":"pith_short_16","alias_value":"3FQAZXSEVSMT3U2C","created_at":"2026-07-05T02:57:58Z"},{"alias_kind":"pith_short_8","alias_value":"3FQAZXSE","created_at":"2026-07-05T02:57:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3FQAZXSEVSMT3U2CZRNPABKOEP","target":"record","payload":{"canonical_record":{"source":{"id":"2107.06454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-07-14T02:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"8d46389b56bbe0caa0028c61dd7fa87cafdf2715b27c1f96d58241fc90dd09b7","abstract_canon_sha256":"94285359ba63fe226751eed3bbf1a83f6e4afe7615f088dc7fc8c4bc286184d3"},"schema_version":"1.0"},"canonical_sha256":"d9600cde44ac993dd342cc5af0054e23f406d6d6f2592dfdeb0b551a33fd87de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:57:58.224562Z","signature_b64":"sApf/RKK3MxiyR5qEPnb/C7ool2WqS9sEYLVl9i+WZrz+Z9z1MApv75Mb5BBx09ilPtqTzDVTXQMsH4yVb5UDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9600cde44ac993dd342cc5af0054e23f406d6d6f2592dfdeb0b551a33fd87de","last_reissued_at":"2026-07-05T02:57:58.224180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:57:58.224180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.06454","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-07-05T02:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d06WBZ4M4TQFxW3EVBuj6xzLh32H0LABabzZcqWJ3Kl0CvPoRiTpJTWssYHrUaZXSCF6HytUak1Ry95Kk65PBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:13:33.615292Z"},"content_sha256":"f8d0d58d8d9062ef886b7657b02fbcf221c4de91fe47de3b324ef3e888363b57","schema_version":"1.0","event_id":"sha256:f8d0d58d8d9062ef886b7657b02fbcf221c4de91fe47de3b324ef3e888363b57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3FQAZXSEVSMT3U2CZRNPABKOEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate trace reconstruction of random strings from a constant number of traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Yuval Peres, Zachary Chase","submitted_at":"2021-07-14T02:21:35Z","abstract_excerpt":"In the trace reconstruction problem, the goal is to reconstruct an unknown string $x$ of length $n$ from multiple traces obtained by passing $x$ through the deletion channel. In the relaxed problem of $approximate$ trace reconstruction, the goal is to reconstruct an approximation $\\widehat{x}$ of $x$ which is close (within $\\epsilon n$) to $x$ in edit distance. We show that for most strings $x$, this is possible with high probability using only a constant number of traces. Crucially, this constant does not grow with $n$, and only depends on the deletion probability and $\\epsilon$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06454","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.06454/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+D8v7OSiFLaNRfhN+30UHJ3zwjHkYHU2U4VnHUelTZ1yjeFu1/Tg6UA/jTGNB5LQjdDzO8IBxuO6q6hcuoWsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:13:33.615920Z"},"content_sha256":"a9f113adb46585d3c336e5d2e1418ab0821d11e723446b14fbaf096d8ef108de","schema_version":"1.0","event_id":"sha256:a9f113adb46585d3c336e5d2e1418ab0821d11e723446b14fbaf096d8ef108de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP/bundle.json","state_url":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FQAZXSEVSMT3U2CZRNPABKOEP/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-08-13T08:13:33Z","links":{"resolver":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP","bundle":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP/bundle.json","state":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FQAZXSEVSMT3U2CZRNPABKOEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3FQAZXSEVSMT3U2CZRNPABKOEP","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":"94285359ba63fe226751eed3bbf1a83f6e4afe7615f088dc7fc8c4bc286184d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-07-14T02:21:35Z","title_canon_sha256":"8d46389b56bbe0caa0028c61dd7fa87cafdf2715b27c1f96d58241fc90dd09b7"},"schema_version":"1.0","source":{"id":"2107.06454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06454","created_at":"2026-07-05T02:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06454v1","created_at":"2026-07-05T02:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06454","created_at":"2026-07-05T02:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"3FQAZXSEVSMT","created_at":"2026-07-05T02:57:58Z"},{"alias_kind":"pith_short_16","alias_value":"3FQAZXSEVSMT3U2C","created_at":"2026-07-05T02:57:58Z"},{"alias_kind":"pith_short_8","alias_value":"3FQAZXSE","created_at":"2026-07-05T02:57:58Z"}],"graph_snapshots":[{"event_id":"sha256:a9f113adb46585d3c336e5d2e1418ab0821d11e723446b14fbaf096d8ef108de","target":"graph","created_at":"2026-07-05T02:57:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2107.06454/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the trace reconstruction problem, the goal is to reconstruct an unknown string $x$ of length $n$ from multiple traces obtained by passing $x$ through the deletion channel. In the relaxed problem of $approximate$ trace reconstruction, the goal is to reconstruct an approximation $\\widehat{x}$ of $x$ which is close (within $\\epsilon n$) to $x$ in edit distance. We show that for most strings $x$, this is possible with high probability using only a constant number of traces. Crucially, this constant does not grow with $n$, and only depends on the deletion probability and $\\epsilon$.","authors_text":"Yuval Peres, Zachary Chase","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-07-14T02:21:35Z","title":"Approximate trace reconstruction of random strings from a constant number of traces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06454","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:f8d0d58d8d9062ef886b7657b02fbcf221c4de91fe47de3b324ef3e888363b57","target":"record","created_at":"2026-07-05T02:57:58Z","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":"94285359ba63fe226751eed3bbf1a83f6e4afe7615f088dc7fc8c4bc286184d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-07-14T02:21:35Z","title_canon_sha256":"8d46389b56bbe0caa0028c61dd7fa87cafdf2715b27c1f96d58241fc90dd09b7"},"schema_version":"1.0","source":{"id":"2107.06454","kind":"arxiv","version":1}},"canonical_sha256":"d9600cde44ac993dd342cc5af0054e23f406d6d6f2592dfdeb0b551a33fd87de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9600cde44ac993dd342cc5af0054e23f406d6d6f2592dfdeb0b551a33fd87de","first_computed_at":"2026-07-05T02:57:58.224180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:57:58.224180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sApf/RKK3MxiyR5qEPnb/C7ool2WqS9sEYLVl9i+WZrz+Z9z1MApv75Mb5BBx09ilPtqTzDVTXQMsH4yVb5UDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:57:58.224562Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.06454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8d0d58d8d9062ef886b7657b02fbcf221c4de91fe47de3b324ef3e888363b57","sha256:a9f113adb46585d3c336e5d2e1418ab0821d11e723446b14fbaf096d8ef108de"],"state_sha256":"714ff41c7cac42a68769c573bd284fa8b40a2de914fe54c382f4561319362039"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"02yArn+zJGOwmyx4LC7jkE1f47wPUNSabQ7RKLDzx4bvjMPtIcSYoUJRgu+Pk7kDmEDwf7IF1XSPh6SyrGD1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:13:33.618850Z","bundle_sha256":"675539b03e16b17e73ab0e67e314014040124153e780f63cc0ec6f2a2d43e4eb"}}