{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QN2T2K564EQJZH27WEBYRQCDZI","short_pith_number":"pith:QN2T2K56","canonical_record":{"source":{"id":"1604.03000","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-11T15:37:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3240cceceaf87d5d0bc8d49647ae71d7103a1f2db37bd4b9abd0f35f5b6ab018","abstract_canon_sha256":"da8e643cb2068f193b3b544841a792741dce1ec2dea845196c9bec5ae9262622"},"schema_version":"1.0"},"canonical_sha256":"83753d2bbee1209c9f5fb10388c043ca0329393eab47ddc858f91b1d721c0ab6","source":{"kind":"arxiv","id":"1604.03000","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QN2T2K564EQJZH27WEBYRQCDZI","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03000","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-11T15:37:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3240cceceaf87d5d0bc8d49647ae71d7103a1f2db37bd4b9abd0f35f5b6ab018","abstract_canon_sha256":"da8e643cb2068f193b3b544841a792741dce1ec2dea845196c9bec5ae9262622"},"schema_version":"1.0"},"canonical_sha256":"83753d2bbee1209c9f5fb10388c043ca0329393eab47ddc858f91b1d721c0ab6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:06.803810Z","signature_b64":"+bo33BYD7l/qZfGIv3mN9LK3wT4NJAnO6LAzxvwVF2VdEu9UkWpyAgX9/1afebT2gIcXlu4bLVIG7bG79t0RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83753d2bbee1209c9f5fb10388c043ca0329393eab47ddc858f91b1d721c0ab6","last_reissued_at":"2026-05-18T00:49:06.803218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:06.803218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03000","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LxDZOpoLyrfP+2ZIGBdCCQPk/o2SyQn/uwMllXBzs8APYTFZbs6xXth86YjU+zxAhLObTYKoKEgoUdB6uGKmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:34:31.984669Z"},"content_sha256":"8c1a9c38b48f8852332208cf00198186f7465bfef3c0be76126bbe926fc3f352","schema_version":"1.0","event_id":"sha256:8c1a9c38b48f8852332208cf00198186f7465bfef3c0be76126bbe926fc3f352"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QN2T2K564EQJZH27WEBYRQCDZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Reconstruction from Insertions in Synchronization Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Clayton Schoeny, Frederic Sala, Lara Dolecek, Ryan Gabrys","submitted_at":"2016-04-11T15:37:25Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03000","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kk54/Cxxe21wAD9mlhQDXFCoJUc5QQNa2AYO3+eTTrHrzVGHsG0yCoLw9DYEftM7vIh6cOFZ7JmntbFiLsV7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:34:31.985397Z"},"content_sha256":"10d10c75bebf3090a9a28bcb51559c9cd2f929e43aa0bf0b6e34db33c1543171","schema_version":"1.0","event_id":"sha256:10d10c75bebf3090a9a28bcb51559c9cd2f929e43aa0bf0b6e34db33c1543171"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI/bundle.json","state_url":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QN2T2K564EQJZH27WEBYRQCDZI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T21:34:31Z","links":{"resolver":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI","bundle":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI/bundle.json","state":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QN2T2K564EQJZH27WEBYRQCDZI/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlsasnW0ciJoQm3xQZ9G/4uTTwRdJ3b6W6BVY3XKvF0O8Cq1zKNtPo4xF2nw7t+PbabYfkq9u9fMX+ahmTQHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:34:31.989177Z","bundle_sha256":"240cddf771b6b8fb2a1d84556a3845487c2e73fdb06c786e99613f7fed2cc153"}}