{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:DCMV27EYFGGOA3I7NVXWEHAYBR","short_pith_number":"pith:DCMV27EY","schema_version":"1.0","canonical_sha256":"18995d7c98298ce06d1f6d6f621c180c5254c355832a72454ea092b0d06e128c","source":{"kind":"arxiv","id":"2207.11489","version":2},"attestation_state":"computed","paper":{"title":"Average-Case to (shifted) Worst-Case Reduction for the Trace Reconstruction Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Ittai Rubinstein","submitted_at":"2022-07-23T10:41:49Z","abstract_excerpt":"The {\\em insertion-deletion channel} takes as input a binary string $x \\in\\{0, 1\\}^n$, and outputs a string $\\widetilde{x}$ where some of the bits have been deleted and others inserted independently at random. In the {\\em trace reconstruction problem}, one is given many outputs (called {\\em traces}) of the insertion-deletion channel on the same input message $x$, and asked to recover the input message.\n  Nazarov and Peres (STOC 2017), and De, O'Donnell and Servedio (STOC 2017) showed that any string $x$ can be reconstructed from $\\exp(O(n^{1/3}))$ traces. Holden, Pemantle, Peres and Zhai (COLT"},"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":"2207.11489","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-07-23T10:41:49Z","cross_cats_sorted":["cs.DS","math.IT","math.PR"],"title_canon_sha256":"b25ed1060dfa1de1fcee1ae89cef5dd1fb8747660d2e03f821f5717d42ffc739","abstract_canon_sha256":"10770e62effb7e51234214fbdf572eeba7c9d9bb8cdf8d79e03f5deb78ea3a74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:59.187769Z","signature_b64":"K/l9E+IOTc0sjh92UdtPBCN57kCJcHB8hE6IBa1rovwaFMWnANtGtuxKnCUevQ5BrONcU2kxiPU9/dhVu64cBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18995d7c98298ce06d1f6d6f621c180c5254c355832a72454ea092b0d06e128c","last_reissued_at":"2026-07-05T04:47:59.187386Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:59.187386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average-Case to (shifted) Worst-Case Reduction for the Trace Reconstruction Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Ittai Rubinstein","submitted_at":"2022-07-23T10:41:49Z","abstract_excerpt":"The {\\em insertion-deletion channel} takes as input a binary string $x \\in\\{0, 1\\}^n$, and outputs a string $\\widetilde{x}$ where some of the bits have been deleted and others inserted independently at random. In the {\\em trace reconstruction problem}, one is given many outputs (called {\\em traces}) of the insertion-deletion channel on the same input message $x$, and asked to recover the input message.\n  Nazarov and Peres (STOC 2017), and De, O'Donnell and Servedio (STOC 2017) showed that any string $x$ can be reconstructed from $\\exp(O(n^{1/3}))$ traces. Holden, Pemantle, Peres and Zhai (COLT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11489","kind":"arxiv","version":2},"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/2207.11489/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":"2207.11489","created_at":"2026-07-05T04:47:59.187443+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.11489v2","created_at":"2026-07-05T04:47:59.187443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11489","created_at":"2026-07-05T04:47:59.187443+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCMV27EYFGGO","created_at":"2026-07-05T04:47:59.187443+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCMV27EYFGGOA3I7","created_at":"2026-07-05T04:47:59.187443+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCMV27EY","created_at":"2026-07-05T04:47:59.187443+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":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DCMV27EYFGGOA3I7NVXWEHAYBR","json":"https://pith.science/pith/DCMV27EYFGGOA3I7NVXWEHAYBR.json","graph_json":"https://pith.science/api/pith-number/DCMV27EYFGGOA3I7NVXWEHAYBR/graph.json","events_json":"https://pith.science/api/pith-number/DCMV27EYFGGOA3I7NVXWEHAYBR/events.json","paper":"https://pith.science/paper/DCMV27EY"},"agent_actions":{"view_html":"https://pith.science/pith/DCMV27EYFGGOA3I7NVXWEHAYBR","download_json":"https://pith.science/pith/DCMV27EYFGGOA3I7NVXWEHAYBR.json","view_paper":"https://pith.science/paper/DCMV27EY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.11489&json=true","fetch_graph":"https://pith.science/api/pith-number/DCMV27EYFGGOA3I7NVXWEHAYBR/graph.json","fetch_events":"https://pith.science/api/pith-number/DCMV27EYFGGOA3I7NVXWEHAYBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCMV27EYFGGOA3I7NVXWEHAYBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCMV27EYFGGOA3I7NVXWEHAYBR/action/storage_attestation","attest_author":"https://pith.science/pith/DCMV27EYFGGOA3I7NVXWEHAYBR/action/author_attestation","sign_citation":"https://pith.science/pith/DCMV27EYFGGOA3I7NVXWEHAYBR/action/citation_signature","submit_replication":"https://pith.science/pith/DCMV27EYFGGOA3I7NVXWEHAYBR/action/replication_record"}},"created_at":"2026-07-05T04:47:59.187443+00:00","updated_at":"2026-07-05T04:47:59.187443+00:00"}