{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XCGL7XSQN5FOVOICCUSHSKLWAR","short_pith_number":"pith:XCGL7XSQ","schema_version":"1.0","canonical_sha256":"b88cbfde506f4aeab9021524792976047ca7fcebb6253bb40518a0f9fa651a03","source":{"kind":"arxiv","id":"1612.03148","version":1},"attestation_state":"computed","paper":{"title":"Optimal mean-based algorithms for trace reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Anindya De, Rocco Servedio, Ryan O'Donnell","submitted_at":"2016-12-09T20:05:19Z","abstract_excerpt":"In the (deletion-channel) trace reconstruction problem, there is an unknown $n$-bit source string $x$. An algorithm is given access to independent traces of $x$, where a trace is formed by deleting each bit of~$x$ independently with probability~$\\delta$. The goal of the algorithm is to recover~$x$ exactly (with high probability), while minimizing samples (number of traces) and running time.\n  Previously, the best known algorithm for the trace reconstruction problem was due to Holenstein~et~al.; it uses $\\exp(\\tilde{O}(n^{1/2}))$ samples and running time for any fixed $0 < \\delta < 1$. It is al"},"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":"1612.03148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-09T20:05:19Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"7f52c29d4c249ad8d0549fe574ff6e23e807e59016fabdef0e4f39ab89aa481d","abstract_canon_sha256":"1f606761ea16ae54b4b10d95631ea907c7e89139dbddbe6aeb338d50fa004e3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:26.284107Z","signature_b64":"OY5Iay27Leq/g7cfBTaPTbMbgOPEc0xKdIQuLPgnbIzwM94Z8Hm3Zgu9ih88qKJkbqk2IY8ALQYWcG8nl3CmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b88cbfde506f4aeab9021524792976047ca7fcebb6253bb40518a0f9fa651a03","last_reissued_at":"2026-05-18T00:55:26.283274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:26.283274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal mean-based algorithms for trace reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Anindya De, Rocco Servedio, Ryan O'Donnell","submitted_at":"2016-12-09T20:05:19Z","abstract_excerpt":"In the (deletion-channel) trace reconstruction problem, there is an unknown $n$-bit source string $x$. An algorithm is given access to independent traces of $x$, where a trace is formed by deleting each bit of~$x$ independently with probability~$\\delta$. The goal of the algorithm is to recover~$x$ exactly (with high probability), while minimizing samples (number of traces) and running time.\n  Previously, the best known algorithm for the trace reconstruction problem was due to Holenstein~et~al.; it uses $\\exp(\\tilde{O}(n^{1/2}))$ samples and running time for any fixed $0 < \\delta < 1$. It is al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03148","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":""},"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":"1612.03148","created_at":"2026-05-18T00:55:26.283431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.03148v1","created_at":"2026-05-18T00:55:26.283431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03148","created_at":"2026-05-18T00:55:26.283431+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCGL7XSQN5FO","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCGL7XSQN5FOVOIC","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCGL7XSQ","created_at":"2026-05-18T12:30:51.357362+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/XCGL7XSQN5FOVOICCUSHSKLWAR","json":"https://pith.science/pith/XCGL7XSQN5FOVOICCUSHSKLWAR.json","graph_json":"https://pith.science/api/pith-number/XCGL7XSQN5FOVOICCUSHSKLWAR/graph.json","events_json":"https://pith.science/api/pith-number/XCGL7XSQN5FOVOICCUSHSKLWAR/events.json","paper":"https://pith.science/paper/XCGL7XSQ"},"agent_actions":{"view_html":"https://pith.science/pith/XCGL7XSQN5FOVOICCUSHSKLWAR","download_json":"https://pith.science/pith/XCGL7XSQN5FOVOICCUSHSKLWAR.json","view_paper":"https://pith.science/paper/XCGL7XSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.03148&json=true","fetch_graph":"https://pith.science/api/pith-number/XCGL7XSQN5FOVOICCUSHSKLWAR/graph.json","fetch_events":"https://pith.science/api/pith-number/XCGL7XSQN5FOVOICCUSHSKLWAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCGL7XSQN5FOVOICCUSHSKLWAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCGL7XSQN5FOVOICCUSHSKLWAR/action/storage_attestation","attest_author":"https://pith.science/pith/XCGL7XSQN5FOVOICCUSHSKLWAR/action/author_attestation","sign_citation":"https://pith.science/pith/XCGL7XSQN5FOVOICCUSHSKLWAR/action/citation_signature","submit_replication":"https://pith.science/pith/XCGL7XSQN5FOVOICCUSHSKLWAR/action/replication_record"}},"created_at":"2026-05-18T00:55:26.283431+00:00","updated_at":"2026-05-18T00:55:26.283431+00:00"}