{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:DCMV27EYFGGOA3I7NVXWEHAYBR","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":"10770e62effb7e51234214fbdf572eeba7c9d9bb8cdf8d79e03f5deb78ea3a74","cross_cats_sorted":["cs.DS","math.IT","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-07-23T10:41:49Z","title_canon_sha256":"b25ed1060dfa1de1fcee1ae89cef5dd1fb8747660d2e03f821f5717d42ffc739"},"schema_version":"1.0","source":{"id":"2207.11489","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.11489","created_at":"2026-07-05T04:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"2207.11489v2","created_at":"2026-07-05T04:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11489","created_at":"2026-07-05T04:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"DCMV27EYFGGO","created_at":"2026-07-05T04:47:59Z"},{"alias_kind":"pith_short_16","alias_value":"DCMV27EYFGGOA3I7","created_at":"2026-07-05T04:47:59Z"},{"alias_kind":"pith_short_8","alias_value":"DCMV27EY","created_at":"2026-07-05T04:47:59Z"}],"graph_snapshots":[{"event_id":"sha256:f8a9ecc8cb881ea11e2df1a71de259119cc7010f84064145c571ee8d264dc628","target":"graph","created_at":"2026-07-05T04:47:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.11489/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The {\\em insertion-deletion channel} takes as input a binary string $x \\in\\{0, 1\\}^n$, and outputs a string $\\widetilde{x}$ where some of the bits have been deleted and others inserted independently at random. In the {\\em trace reconstruction problem}, one is given many outputs (called {\\em traces}) of the insertion-deletion channel on the same input message $x$, and asked to recover the input message.\n  Nazarov and Peres (STOC 2017), and De, O'Donnell and Servedio (STOC 2017) showed that any string $x$ can be reconstructed from $\\exp(O(n^{1/3}))$ traces. Holden, Pemantle, Peres and Zhai (COLT","authors_text":"Ittai Rubinstein","cross_cats":["cs.DS","math.IT","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-07-23T10:41:49Z","title":"Average-Case to (shifted) Worst-Case Reduction for the Trace Reconstruction Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11489","kind":"arxiv","version":2},"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:64eb3d1d725f7288ad4f5addda7c30c3bf28154dc8d93473278a104002efc0dc","target":"record","created_at":"2026-07-05T04:47:59Z","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":"10770e62effb7e51234214fbdf572eeba7c9d9bb8cdf8d79e03f5deb78ea3a74","cross_cats_sorted":["cs.DS","math.IT","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-07-23T10:41:49Z","title_canon_sha256":"b25ed1060dfa1de1fcee1ae89cef5dd1fb8747660d2e03f821f5717d42ffc739"},"schema_version":"1.0","source":{"id":"2207.11489","kind":"arxiv","version":2}},"canonical_sha256":"18995d7c98298ce06d1f6d6f621c180c5254c355832a72454ea092b0d06e128c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18995d7c98298ce06d1f6d6f621c180c5254c355832a72454ea092b0d06e128c","first_computed_at":"2026-07-05T04:47:59.187386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:47:59.187386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K/l9E+IOTc0sjh92UdtPBCN57kCJcHB8hE6IBa1rovwaFMWnANtGtuxKnCUevQ5BrONcU2kxiPU9/dhVu64cBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:47:59.187769Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.11489","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64eb3d1d725f7288ad4f5addda7c30c3bf28154dc8d93473278a104002efc0dc","sha256:f8a9ecc8cb881ea11e2df1a71de259119cc7010f84064145c571ee8d264dc628"],"state_sha256":"ebad9d9da70b47e02dc09e21311bf4ea47aea0526be63d0db85b659227348b31"}