{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:327OB36YUC2B2HHZ6E4AHDLZQV","short_pith_number":"pith:327OB36Y","schema_version":"1.0","canonical_sha256":"debee0efd8a0b41d1cf9f138038d79857449bddd1790d8b6b3532cb6f1ff1c79","source":{"kind":"arxiv","id":"2107.09497","version":1},"attestation_state":"computed","paper":{"title":"Approximate Trace Reconstruction via Median String (in Average-Case)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debarati Das, Diptarka Chakraborty, Robert Krauthgamer","submitted_at":"2021-07-20T13:44:54Z","abstract_excerpt":"We consider an \\emph{approximate} version of the trace reconstruction problem, where the goal is to recover an unknown string $s\\in\\{0,1\\}^n$ from $m$ traces (each trace is generated independently by passing $s$ through a probabilistic insertion-deletion channel with rate $p$). We present a deterministic near-linear time algorithm for the average-case model, where $s$ is random, that uses only \\emph{three} traces. It runs in near-linear time $\\tilde O(n)$ and with high probability reports a string within edit distance $O(\\epsilon p n)$ from $s$ for $\\epsilon=\\tilde O(p)$, which significantly i"},"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.09497","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-07-20T13:44:54Z","cross_cats_sorted":[],"title_canon_sha256":"97b03328e3d8d4c2c03ccb73681bd7f627370adc705919701ea4fba0be50354b","abstract_canon_sha256":"2222a09b9f4225e5ccf5108b68736845cf7d06cd84ce92b713c7963c0354be1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:59:31.661024Z","signature_b64":"F7ykirxLvN+a0C05wikc/3u/d91gGkZhbmE4luC0wCqH2Hntbj4kO8he04wU7BHXTOcn9CugWjuOmtcuswxxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"debee0efd8a0b41d1cf9f138038d79857449bddd1790d8b6b3532cb6f1ff1c79","last_reissued_at":"2026-07-05T02:59:31.660624Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:59:31.660624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Trace Reconstruction via Median String (in Average-Case)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debarati Das, Diptarka Chakraborty, Robert Krauthgamer","submitted_at":"2021-07-20T13:44:54Z","abstract_excerpt":"We consider an \\emph{approximate} version of the trace reconstruction problem, where the goal is to recover an unknown string $s\\in\\{0,1\\}^n$ from $m$ traces (each trace is generated independently by passing $s$ through a probabilistic insertion-deletion channel with rate $p$). We present a deterministic near-linear time algorithm for the average-case model, where $s$ is random, that uses only \\emph{three} traces. It runs in near-linear time $\\tilde O(n)$ and with high probability reports a string within edit distance $O(\\epsilon p n)$ from $s$ for $\\epsilon=\\tilde O(p)$, which significantly i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.09497","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.09497/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.09497","created_at":"2026-07-05T02:59:31.660678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.09497v1","created_at":"2026-07-05T02:59:31.660678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.09497","created_at":"2026-07-05T02:59:31.660678+00:00"},{"alias_kind":"pith_short_12","alias_value":"327OB36YUC2B","created_at":"2026-07-05T02:59:31.660678+00:00"},{"alias_kind":"pith_short_16","alias_value":"327OB36YUC2B2HHZ","created_at":"2026-07-05T02:59:31.660678+00:00"},{"alias_kind":"pith_short_8","alias_value":"327OB36Y","created_at":"2026-07-05T02:59:31.660678+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":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/327OB36YUC2B2HHZ6E4AHDLZQV","json":"https://pith.science/pith/327OB36YUC2B2HHZ6E4AHDLZQV.json","graph_json":"https://pith.science/api/pith-number/327OB36YUC2B2HHZ6E4AHDLZQV/graph.json","events_json":"https://pith.science/api/pith-number/327OB36YUC2B2HHZ6E4AHDLZQV/events.json","paper":"https://pith.science/paper/327OB36Y"},"agent_actions":{"view_html":"https://pith.science/pith/327OB36YUC2B2HHZ6E4AHDLZQV","download_json":"https://pith.science/pith/327OB36YUC2B2HHZ6E4AHDLZQV.json","view_paper":"https://pith.science/paper/327OB36Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.09497&json=true","fetch_graph":"https://pith.science/api/pith-number/327OB36YUC2B2HHZ6E4AHDLZQV/graph.json","fetch_events":"https://pith.science/api/pith-number/327OB36YUC2B2HHZ6E4AHDLZQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/327OB36YUC2B2HHZ6E4AHDLZQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/327OB36YUC2B2HHZ6E4AHDLZQV/action/storage_attestation","attest_author":"https://pith.science/pith/327OB36YUC2B2HHZ6E4AHDLZQV/action/author_attestation","sign_citation":"https://pith.science/pith/327OB36YUC2B2HHZ6E4AHDLZQV/action/citation_signature","submit_replication":"https://pith.science/pith/327OB36YUC2B2HHZ6E4AHDLZQV/action/replication_record"}},"created_at":"2026-07-05T02:59:31.660678+00:00","updated_at":"2026-07-05T02:59:31.660678+00:00"}