{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QN2T2K564EQJZH27WEBYRQCDZI","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":"da8e643cb2068f193b3b544841a792741dce1ec2dea845196c9bec5ae9262622","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-11T15:37:25Z","title_canon_sha256":"3240cceceaf87d5d0bc8d49647ae71d7103a1f2db37bd4b9abd0f35f5b6ab018"},"schema_version":"1.0","source":{"id":"1604.03000","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03000","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03000v2","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03000","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"QN2T2K564EQJ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QN2T2K564EQJZH27","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QN2T2K56","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:10d10c75bebf3090a9a28bcb51559c9cd2f929e43aa0bf0b6e34db33c1543171","target":"graph","created_at":"2026-05-18T00:49:06Z","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":"This work studies problems in data reconstruction, an important area with numerous applications. In particular, we examine the reconstruction of binary and non-binary sequences from synchronization (insertion/deletion-correcting) codes. These sequences have been corrupted by a fixed number of symbol insertions (larger than the minimum edit distance of the code), yielding a number of distinct traces to be used for reconstruction. We wish to know the minimum number of traces needed for exact reconstruction. This is a general version of a problem tackled by Levenshtein for uncoded sequences.\n  We","authors_text":"Clayton Schoeny, Frederic Sala, Lara Dolecek, Ryan Gabrys","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-11T15:37:25Z","title":"Exact Reconstruction from Insertions in Synchronization Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03000","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:8c1a9c38b48f8852332208cf00198186f7465bfef3c0be76126bbe926fc3f352","target":"record","created_at":"2026-05-18T00:49:06Z","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":"da8e643cb2068f193b3b544841a792741dce1ec2dea845196c9bec5ae9262622","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-11T15:37:25Z","title_canon_sha256":"3240cceceaf87d5d0bc8d49647ae71d7103a1f2db37bd4b9abd0f35f5b6ab018"},"schema_version":"1.0","source":{"id":"1604.03000","kind":"arxiv","version":2}},"canonical_sha256":"83753d2bbee1209c9f5fb10388c043ca0329393eab47ddc858f91b1d721c0ab6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83753d2bbee1209c9f5fb10388c043ca0329393eab47ddc858f91b1d721c0ab6","first_computed_at":"2026-05-18T00:49:06.803218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:06.803218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+bo33BYD7l/qZfGIv3mN9LK3wT4NJAnO6LAzxvwVF2VdEu9UkWpyAgX9/1afebT2gIcXlu4bLVIG7bG79t0RBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:06.803810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03000","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c1a9c38b48f8852332208cf00198186f7465bfef3c0be76126bbe926fc3f352","sha256:10d10c75bebf3090a9a28bcb51559c9cd2f929e43aa0bf0b6e34db33c1543171"],"state_sha256":"52997391bd384daae9d9f6d0f4773840222cd4f5e24ad70355c8a26e9f4a9874"}