{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XCGL7XSQN5FOVOICCUSHSKLWAR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1f606761ea16ae54b4b10d95631ea907c7e89139dbddbe6aeb338d50fa004e3f","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-09T20:05:19Z","title_canon_sha256":"7f52c29d4c249ad8d0549fe574ff6e23e807e59016fabdef0e4f39ab89aa481d"},"schema_version":"1.0","source":{"id":"1612.03148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03148","created_at":"2026-05-18T00:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03148v1","created_at":"2026-05-18T00:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03148","created_at":"2026-05-18T00:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"XCGL7XSQN5FO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XCGL7XSQN5FOVOIC","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XCGL7XSQ","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:2e5f5a6792222bdbab13dae664a6509ae6f76e7d31155696b5cd79a8df8bd2bc","target":"graph","created_at":"2026-05-18T00:55:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anindya De, Rocco Servedio, Ryan O'Donnell","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-09T20:05:19Z","title":"Optimal mean-based algorithms for trace reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03148","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:56853c9a4378d047c8ef4bad57b1279362c46cb8e9396790388d62a300301cc9","target":"record","created_at":"2026-05-18T00:55:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1f606761ea16ae54b4b10d95631ea907c7e89139dbddbe6aeb338d50fa004e3f","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-09T20:05:19Z","title_canon_sha256":"7f52c29d4c249ad8d0549fe574ff6e23e807e59016fabdef0e4f39ab89aa481d"},"schema_version":"1.0","source":{"id":"1612.03148","kind":"arxiv","version":1}},"canonical_sha256":"b88cbfde506f4aeab9021524792976047ca7fcebb6253bb40518a0f9fa651a03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b88cbfde506f4aeab9021524792976047ca7fcebb6253bb40518a0f9fa651a03","first_computed_at":"2026-05-18T00:55:26.283274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:26.283274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OY5Iay27Leq/g7cfBTaPTbMbgOPEc0xKdIQuLPgnbIzwM94Z8Hm3Zgu9ih88qKJkbqk2IY8ALQYWcG8nl3CmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:26.284107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56853c9a4378d047c8ef4bad57b1279362c46cb8e9396790388d62a300301cc9","sha256:2e5f5a6792222bdbab13dae664a6509ae6f76e7d31155696b5cd79a8df8bd2bc"],"state_sha256":"74386be4bfcea90ff64375d8136782a12e8b03a24f96906d4b35b93f9bc7fb6f"}