{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IYKEES4MJHI6ASFDWY2L4JSAZ5","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":"59e65a49fe5172580226839cc95b1f01e1d31610eccfd26d5afd526fef48b2a6","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-12T21:39:43Z","title_canon_sha256":"1f4619c4c67506ad17c25b7efada87fbc9575b190d46a349102f153e3745bc1b"},"schema_version":"1.0","source":{"id":"1907.05964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05964","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05964v1","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05964","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"pith_short_12","alias_value":"IYKEES4MJHI6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IYKEES4MJHI6ASFD","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IYKEES4M","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:d089a4b55c3ac64540758e1754b80e67dcbb39e7fc44d7e825e1ddd521a17fea","target":"graph","created_at":"2026-05-17T23:40:42Z","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":"Several recent works have considered the \\emph{trace reconstruction problem}, in which an unknown source string $x\\in\\{0,1\\}^n$ is transmitted through a probabilistic channel which may randomly delete coordinates or insert random bits, resulting in a \\emph{trace} of $x$. The goal is to reconstruct the original string~$x$ from independent traces of $x$. While the best algorithms known for worst-case strings use $\\exp(O(n^{1/3}))$ traces \\cite{DOS17,NazarovPeres17}, highly efficient algorithms are known \\cite{PZ17,HPP18} for the \\emph{average-case} version, in which $x$ is uniformly random. We c","authors_text":"Frank Ban, Rocco A. Servedio, Sandip Sinha, Xi Chen","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-12T21:39:43Z","title":"Efficient average-case population recovery in the presence of insertions and deletions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05964","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:376395561faac6679dbde264b4efc4af4618aded4239d75ea37c903abafbacd8","target":"record","created_at":"2026-05-17T23:40:42Z","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":"59e65a49fe5172580226839cc95b1f01e1d31610eccfd26d5afd526fef48b2a6","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-12T21:39:43Z","title_canon_sha256":"1f4619c4c67506ad17c25b7efada87fbc9575b190d46a349102f153e3745bc1b"},"schema_version":"1.0","source":{"id":"1907.05964","kind":"arxiv","version":1}},"canonical_sha256":"4614424b8c49d1e048a3b634be2640cf5f19ff4d0d9909209de495eff7035b9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4614424b8c49d1e048a3b634be2640cf5f19ff4d0d9909209de495eff7035b9a","first_computed_at":"2026-05-17T23:40:42.832083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:42.832083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"trHyPXZwCIQ6IQFakhD3NZVq1ldZQMkzE4Tai/98+gaH072y5bczoYZan15479uUtWTj76Z0fLzXNkr/n9WkBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:42.832536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.05964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:376395561faac6679dbde264b4efc4af4618aded4239d75ea37c903abafbacd8","sha256:d089a4b55c3ac64540758e1754b80e67dcbb39e7fc44d7e825e1ddd521a17fea"],"state_sha256":"89d57505f1178f87e09f0a9840328ccecf7792c0097d4d58dbd524d52ab5b859"}