{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3FQAZXSEVSMT3U2CZRNPABKOEP","short_pith_number":"pith:3FQAZXSE","schema_version":"1.0","canonical_sha256":"d9600cde44ac993dd342cc5af0054e23f406d6d6f2592dfdeb0b551a33fd87de","source":{"kind":"arxiv","id":"2107.06454","version":1},"attestation_state":"computed","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$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2107.06454","created_at":"2026-07-05T02:57:58.224238+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.06454v1","created_at":"2026-07-05T02:57:58.224238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06454","created_at":"2026-07-05T02:57:58.224238+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FQAZXSEVSMT","created_at":"2026-07-05T02:57:58.224238+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FQAZXSEVSMT3U2C","created_at":"2026-07-05T02:57:58.224238+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FQAZXSE","created_at":"2026-07-05T02:57:58.224238+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.00674","citing_title":"A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP","json":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP.json","graph_json":"https://pith.science/api/pith-number/3FQAZXSEVSMT3U2CZRNPABKOEP/graph.json","events_json":"https://pith.science/api/pith-number/3FQAZXSEVSMT3U2CZRNPABKOEP/events.json","paper":"https://pith.science/paper/3FQAZXSE"},"agent_actions":{"view_html":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP","download_json":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP.json","view_paper":"https://pith.science/paper/3FQAZXSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.06454&json=true","fetch_graph":"https://pith.science/api/pith-number/3FQAZXSEVSMT3U2CZRNPABKOEP/graph.json","fetch_events":"https://pith.science/api/pith-number/3FQAZXSEVSMT3U2CZRNPABKOEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP/action/storage_attestation","attest_author":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP/action/author_attestation","sign_citation":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP/action/citation_signature","submit_replication":"https://pith.science/pith/3FQAZXSEVSMT3U2CZRNPABKOEP/action/replication_record"}},"created_at":"2026-07-05T02:57:58.224238+00:00","updated_at":"2026-07-05T02:57:58.224238+00:00"}