{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VHOFYGBOVSRURLUEUXKH7WPPYB","short_pith_number":"pith:VHOFYGBO","schema_version":"1.0","canonical_sha256":"a9dc5c182eaca348ae84a5d47fd9efc075cfbd12da29be5870a90736601edc6f","source":{"kind":"arxiv","id":"2411.18765","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allen Liu, Anders Aamand, Shyam Narayanan","submitted_at":"2024-11-27T21:41:08Z","abstract_excerpt":"In the trace reconstruction problem our goal is to learn an unknown string $x\\in \\{0,1\\}^n$ given independent traces of $x$. A trace is obtained by independently deleting each bit of $x$ with some probability $\\delta$ and concatenating the remaining bits. It is a major open question whether the trace reconstruction problem can be solved with a polynomial number of traces when the deletion probability $\\delta$ is constant. The best known upper bound and lower bounds are respectively $\\exp(\\tilde O(n^{1/5}))$ and $\\tilde \\Omega(n^{3/2})$ both by Chase [Cha21b,Cha21a]. Our main result is that if "},"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":"2411.18765","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T21:41:08Z","cross_cats_sorted":[],"title_canon_sha256":"4cef80a28aa9d9306c98d6e87a301fa51fbd55c6f3a28bde72ef5ebf5bd12069","abstract_canon_sha256":"11ebd6021eb02fcf959326af4da39459c77e363c089682ccc67caedfa7c0676c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:51.237803Z","signature_b64":"a+DSC+8DLXx8E1bL+WRTmxWJTX9VAzbN3cHP7EsZCcj2l2EA/OF/bCHg+OCDQns/GpjTOwSx9k0W8sCkTAwFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9dc5c182eaca348ae84a5d47fd9efc075cfbd12da29be5870a90736601edc6f","last_reissued_at":"2026-07-05T09:41:51.236937Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:51.236937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allen Liu, Anders Aamand, Shyam Narayanan","submitted_at":"2024-11-27T21:41:08Z","abstract_excerpt":"In the trace reconstruction problem our goal is to learn an unknown string $x\\in \\{0,1\\}^n$ given independent traces of $x$. A trace is obtained by independently deleting each bit of $x$ with some probability $\\delta$ and concatenating the remaining bits. It is a major open question whether the trace reconstruction problem can be solved with a polynomial number of traces when the deletion probability $\\delta$ is constant. The best known upper bound and lower bounds are respectively $\\exp(\\tilde O(n^{1/5}))$ and $\\tilde \\Omega(n^{3/2})$ both by Chase [Cha21b,Cha21a]. Our main result is that if "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18765","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/2411.18765/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":"2411.18765","created_at":"2026-07-05T09:41:51.237368+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.18765v1","created_at":"2026-07-05T09:41:51.237368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18765","created_at":"2026-07-05T09:41:51.237368+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHOFYGBOVSRU","created_at":"2026-07-05T09:41:51.237368+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHOFYGBOVSRURLUE","created_at":"2026-07-05T09:41:51.237368+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHOFYGBO","created_at":"2026-07-05T09:41:51.237368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB","json":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB.json","graph_json":"https://pith.science/api/pith-number/VHOFYGBOVSRURLUEUXKH7WPPYB/graph.json","events_json":"https://pith.science/api/pith-number/VHOFYGBOVSRURLUEUXKH7WPPYB/events.json","paper":"https://pith.science/paper/VHOFYGBO"},"agent_actions":{"view_html":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB","download_json":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB.json","view_paper":"https://pith.science/paper/VHOFYGBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.18765&json=true","fetch_graph":"https://pith.science/api/pith-number/VHOFYGBOVSRURLUEUXKH7WPPYB/graph.json","fetch_events":"https://pith.science/api/pith-number/VHOFYGBOVSRURLUEUXKH7WPPYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB/action/storage_attestation","attest_author":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB/action/author_attestation","sign_citation":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB/action/citation_signature","submit_replication":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB/action/replication_record"}},"created_at":"2026-07-05T09:41:51.237368+00:00","updated_at":"2026-07-05T09:41:51.237368+00:00"}