{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:62YKFZEKSAXEBQQDRXYTP2RSFF","short_pith_number":"pith:62YKFZEK","canonical_record":{"source":{"id":"1704.00807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-03T20:56:55Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"a72d97b82526cb6a572d87901ab2a0d9aeb9f1c61dca29ac0503f495554aec3f","abstract_canon_sha256":"2e4a5f274e5fa7f88e586e6bad3e4ab40419345cd37526f6c18278a5673bec67"},"schema_version":"1.0"},"canonical_sha256":"f6b0a2e48a902e40c2038df137ea3229711e1ff4c8da335ff11fc102a8150027","source":{"kind":"arxiv","id":"1704.00807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00807","created_at":"2026-05-18T00:47:19Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00807v1","created_at":"2026-05-18T00:47:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00807","created_at":"2026-05-18T00:47:19Z"},{"alias_kind":"pith_short_12","alias_value":"62YKFZEKSAXE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"62YKFZEKSAXEBQQD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"62YKFZEK","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:62YKFZEKSAXEBQQDRXYTP2RSFF","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-03T20:56:55Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"a72d97b82526cb6a572d87901ab2a0d9aeb9f1c61dca29ac0503f495554aec3f","abstract_canon_sha256":"2e4a5f274e5fa7f88e586e6bad3e4ab40419345cd37526f6c18278a5673bec67"},"schema_version":"1.0"},"canonical_sha256":"f6b0a2e48a902e40c2038df137ea3229711e1ff4c8da335ff11fc102a8150027","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:19.193438Z","signature_b64":"81rcArEqOXaq9yEnzYmC5FuVvs2FftiUW7AlR3lyzX/XVzlpoDdhJdHJchOyUXRLexoWaYV6uv1AS5MFF5EcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6b0a2e48a902e40c2038df137ea3229711e1ff4c8da335ff11fc102a8150027","last_reissued_at":"2026-05-18T00:47:19.192915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:19.192915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00807","source_version":1,"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:47:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nxVu5IwGHicLAMjP3jeRZPIKSHb/IFrIJivGqro7m87XLhpQWDFCe4SRmGts08BQae8UvvGqxXqJaLa+kJ4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:02:49.606420Z"},"content_sha256":"638a161af37966b46c04e24f3395b99c1444d7614efe9676786ad95db5859277","schema_version":"1.0","event_id":"sha256:638a161af37966b46c04e24f3395b99c1444d7614efe9676786ad95db5859277"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:62YKFZEKSAXEBQQDRXYTP2RSFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Amirbehshad Shahrasbi, Bernhard Haeupler","submitted_at":"2017-04-03T20:56:55Z","abstract_excerpt":"We introduce synchronization strings as a novel way of efficiently dealing with synchronization errors, i.e., insertions and deletions. Synchronization errors are strictly more general and much harder to deal with than commonly considered half-errors, i.e., symbol corruptions and erasures. For every $\\epsilon >0$, synchronization strings allow to index a sequence with an $\\epsilon^{-O(1)}$ size alphabet such that one can efficiently transform $k$ synchronization errors into $(1+\\epsilon)k$ half-errors. This powerful new technique has many applications. In this paper, we focus on designing insd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00807","kind":"arxiv","version":1},"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:47:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yLCgvp5M+DT4MyhOvrfP31Fa08GEBNoKlMjCvQWI1cdYxucuIDHr6Nv406XwhTqhFhTTSB9RtXY3HL/KhgqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:02:49.606776Z"},"content_sha256":"28e89ecc9e4a26541af5b4802fd3334c4298fa8f19ed0adc1a26faa8a86d542d","schema_version":"1.0","event_id":"sha256:28e89ecc9e4a26541af5b4802fd3334c4298fa8f19ed0adc1a26faa8a86d542d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62YKFZEKSAXEBQQDRXYTP2RSFF/bundle.json","state_url":"https://pith.science/pith/62YKFZEKSAXEBQQDRXYTP2RSFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62YKFZEKSAXEBQQDRXYTP2RSFF/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-05T14:02:49Z","links":{"resolver":"https://pith.science/pith/62YKFZEKSAXEBQQDRXYTP2RSFF","bundle":"https://pith.science/pith/62YKFZEKSAXEBQQDRXYTP2RSFF/bundle.json","state":"https://pith.science/pith/62YKFZEKSAXEBQQDRXYTP2RSFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62YKFZEKSAXEBQQDRXYTP2RSFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:62YKFZEKSAXEBQQDRXYTP2RSFF","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":"2e4a5f274e5fa7f88e586e6bad3e4ab40419345cd37526f6c18278a5673bec67","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-03T20:56:55Z","title_canon_sha256":"a72d97b82526cb6a572d87901ab2a0d9aeb9f1c61dca29ac0503f495554aec3f"},"schema_version":"1.0","source":{"id":"1704.00807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00807","created_at":"2026-05-18T00:47:19Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00807v1","created_at":"2026-05-18T00:47:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00807","created_at":"2026-05-18T00:47:19Z"},{"alias_kind":"pith_short_12","alias_value":"62YKFZEKSAXE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"62YKFZEKSAXEBQQD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"62YKFZEK","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:28e89ecc9e4a26541af5b4802fd3334c4298fa8f19ed0adc1a26faa8a86d542d","target":"graph","created_at":"2026-05-18T00:47:19Z","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":"We introduce synchronization strings as a novel way of efficiently dealing with synchronization errors, i.e., insertions and deletions. Synchronization errors are strictly more general and much harder to deal with than commonly considered half-errors, i.e., symbol corruptions and erasures. For every $\\epsilon >0$, synchronization strings allow to index a sequence with an $\\epsilon^{-O(1)}$ size alphabet such that one can efficiently transform $k$ synchronization errors into $(1+\\epsilon)k$ half-errors. This powerful new technique has many applications. In this paper, we focus on designing insd","authors_text":"Amirbehshad Shahrasbi, Bernhard Haeupler","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-03T20:56:55Z","title":"Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00807","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:638a161af37966b46c04e24f3395b99c1444d7614efe9676786ad95db5859277","target":"record","created_at":"2026-05-18T00:47:19Z","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":"2e4a5f274e5fa7f88e586e6bad3e4ab40419345cd37526f6c18278a5673bec67","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-03T20:56:55Z","title_canon_sha256":"a72d97b82526cb6a572d87901ab2a0d9aeb9f1c61dca29ac0503f495554aec3f"},"schema_version":"1.0","source":{"id":"1704.00807","kind":"arxiv","version":1}},"canonical_sha256":"f6b0a2e48a902e40c2038df137ea3229711e1ff4c8da335ff11fc102a8150027","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6b0a2e48a902e40c2038df137ea3229711e1ff4c8da335ff11fc102a8150027","first_computed_at":"2026-05-18T00:47:19.192915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:19.192915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"81rcArEqOXaq9yEnzYmC5FuVvs2FftiUW7AlR3lyzX/XVzlpoDdhJdHJchOyUXRLexoWaYV6uv1AS5MFF5EcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:19.193438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:638a161af37966b46c04e24f3395b99c1444d7614efe9676786ad95db5859277","sha256:28e89ecc9e4a26541af5b4802fd3334c4298fa8f19ed0adc1a26faa8a86d542d"],"state_sha256":"e38d1cefd90018b10acce2e76701316926ed78ebcfcfea39123b5cc7bec77d39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lAN2C4Gsr+BzktahD7fUhUZ0Dp3hrN6/FPreOkeHu8hBcfvqKOip11wpGxguST31jUaVBOL8xWySYhMicnApCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:02:49.608762Z","bundle_sha256":"6514482c6932807f02dca650c2d334df1d54671432d544c6b65fe5d116b070d4"}}