{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QN2T2K564EQJZH27WEBYRQCDZI","short_pith_number":"pith:QN2T2K56","schema_version":"1.0","canonical_sha256":"83753d2bbee1209c9f5fb10388c043ca0329393eab47ddc858f91b1d721c0ab6","source":{"kind":"arxiv","id":"1604.03000","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.03000","created_at":"2026-05-18T00:49:06.803304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03000v2","created_at":"2026-05-18T00:49:06.803304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03000","created_at":"2026-05-18T00:49:06.803304+00:00"},{"alias_kind":"pith_short_12","alias_value":"QN2T2K564EQJ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QN2T2K564EQJZH27","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QN2T2K56","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI","json":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI.json","graph_json":"https://pith.science/api/pith-number/QN2T2K564EQJZH27WEBYRQCDZI/graph.json","events_json":"https://pith.science/api/pith-number/QN2T2K564EQJZH27WEBYRQCDZI/events.json","paper":"https://pith.science/paper/QN2T2K56"},"agent_actions":{"view_html":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI","download_json":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI.json","view_paper":"https://pith.science/paper/QN2T2K56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03000&json=true","fetch_graph":"https://pith.science/api/pith-number/QN2T2K564EQJZH27WEBYRQCDZI/graph.json","fetch_events":"https://pith.science/api/pith-number/QN2T2K564EQJZH27WEBYRQCDZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI/action/storage_attestation","attest_author":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI/action/author_attestation","sign_citation":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI/action/citation_signature","submit_replication":"https://pith.science/pith/QN2T2K564EQJZH27WEBYRQCDZI/action/replication_record"}},"created_at":"2026-05-18T00:49:06.803304+00:00","updated_at":"2026-05-18T00:49:06.803304+00:00"}