{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MWQGL3POUIVEUES533DCZJNWKJ","short_pith_number":"pith:MWQGL3PO","canonical_record":{"source":{"id":"1803.03530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-08T02:45:15Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"364e82f9d21fbdc166873745fe6d3dbdbe65b674156183ae27cb00bdc6a9b334","abstract_canon_sha256":"75e40bc1d42ac024590ba3a4492f200348e6cac27cdb6c8ddc8a7f2fa7ee7ccf"},"schema_version":"1.0"},"canonical_sha256":"65a065edeea22a4a125ddec62ca5b6526394a40b234c1c84e5834549fefbcdcd","source":{"kind":"arxiv","id":"1803.03530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03530","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03530v1","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03530","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"pith_short_12","alias_value":"MWQGL3POUIVE","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MWQGL3POUIVEUES5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MWQGL3PO","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MWQGL3POUIVEUES533DCZJNWKJ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-08T02:45:15Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"364e82f9d21fbdc166873745fe6d3dbdbe65b674156183ae27cb00bdc6a9b334","abstract_canon_sha256":"75e40bc1d42ac024590ba3a4492f200348e6cac27cdb6c8ddc8a7f2fa7ee7ccf"},"schema_version":"1.0"},"canonical_sha256":"65a065edeea22a4a125ddec62ca5b6526394a40b234c1c84e5834549fefbcdcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:39.223091Z","signature_b64":"knFweC23NKRcvHXA+ubMblTU46mOyRjUmAnAj/b0oWmPdcsmvQrb6rDdbE2eoOkevqipNP88uMoFDRGtw0uwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65a065edeea22a4a125ddec62ca5b6526394a40b234c1c84e5834549fefbcdcd","last_reissued_at":"2026-05-18T00:21:39.222364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:39.222364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03530","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:21:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDhAb0L0A7KfRboq3UFUgzuhRv2rA4DW7ioz7EoO8P9syHIkD8++FfWdMf8Mkw0yPR+tkmn9IKnZyfPA7nQNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:41:15.094893Z"},"content_sha256":"cf6a77bd71784bda05dc13fdc71637d463a4e9a0a64baae6e0cf87c89d11e8cf","schema_version":"1.0","event_id":"sha256:cf6a77bd71784bda05dc13fdc71637d463a4e9a0a64baae6e0cf87c89d11e8cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MWQGL3POUIVEUES533DCZJNWKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets","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, Ke Wu, Kuan Cheng, Xin Li","submitted_at":"2018-03-08T02:45:15Z","abstract_excerpt":"Synchronization strings are recently introduced by Haeupler and Shahrasbi (STOC 2017) in the study of codes for correcting insertion and deletion errors (insdel codes). They showed that for any parameter $\\varepsilon>0$, synchronization strings of arbitrary length exist over an alphabet whose size depends only on $\\varepsilon$. Specifically, they obtained an alphabet size of $O(\\varepsilon^{-4})$, which left an open question on where the minimal size of such alphabets lies between $\\Omega(\\varepsilon^{-1})$ and $O(\\varepsilon^{-4})$. In this work, we partially bridge this gap by providing an i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03530","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:21:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vF8yUToYgI5kJxQkFWjhefF5Fsvnwsw2sbwUBhVV67wy4z+6OntH7OYFMW5WlouMo0k+g71y1tf0+CVXmctiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:41:15.095235Z"},"content_sha256":"1b67072ad9ee17d784f0a5c3f92571405012695c0f2f45df1924aa64d7b324da","schema_version":"1.0","event_id":"sha256:1b67072ad9ee17d784f0a5c3f92571405012695c0f2f45df1924aa64d7b324da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWQGL3POUIVEUES533DCZJNWKJ/bundle.json","state_url":"https://pith.science/pith/MWQGL3POUIVEUES533DCZJNWKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWQGL3POUIVEUES533DCZJNWKJ/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-20T21:41:15Z","links":{"resolver":"https://pith.science/pith/MWQGL3POUIVEUES533DCZJNWKJ","bundle":"https://pith.science/pith/MWQGL3POUIVEUES533DCZJNWKJ/bundle.json","state":"https://pith.science/pith/MWQGL3POUIVEUES533DCZJNWKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWQGL3POUIVEUES533DCZJNWKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MWQGL3POUIVEUES533DCZJNWKJ","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":"75e40bc1d42ac024590ba3a4492f200348e6cac27cdb6c8ddc8a7f2fa7ee7ccf","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-08T02:45:15Z","title_canon_sha256":"364e82f9d21fbdc166873745fe6d3dbdbe65b674156183ae27cb00bdc6a9b334"},"schema_version":"1.0","source":{"id":"1803.03530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03530","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03530v1","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03530","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"pith_short_12","alias_value":"MWQGL3POUIVE","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MWQGL3POUIVEUES5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MWQGL3PO","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:1b67072ad9ee17d784f0a5c3f92571405012695c0f2f45df1924aa64d7b324da","target":"graph","created_at":"2026-05-18T00:21:39Z","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":"Synchronization strings are recently introduced by Haeupler and Shahrasbi (STOC 2017) in the study of codes for correcting insertion and deletion errors (insdel codes). They showed that for any parameter $\\varepsilon>0$, synchronization strings of arbitrary length exist over an alphabet whose size depends only on $\\varepsilon$. Specifically, they obtained an alphabet size of $O(\\varepsilon^{-4})$, which left an open question on where the minimal size of such alphabets lies between $\\Omega(\\varepsilon^{-1})$ and $O(\\varepsilon^{-4})$. In this work, we partially bridge this gap by providing an i","authors_text":"Amirbehshad Shahrasbi, Bernhard Haeupler, Ke Wu, Kuan Cheng, Xin Li","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-08T02:45:15Z","title":"Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03530","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:cf6a77bd71784bda05dc13fdc71637d463a4e9a0a64baae6e0cf87c89d11e8cf","target":"record","created_at":"2026-05-18T00:21:39Z","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":"75e40bc1d42ac024590ba3a4492f200348e6cac27cdb6c8ddc8a7f2fa7ee7ccf","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-08T02:45:15Z","title_canon_sha256":"364e82f9d21fbdc166873745fe6d3dbdbe65b674156183ae27cb00bdc6a9b334"},"schema_version":"1.0","source":{"id":"1803.03530","kind":"arxiv","version":1}},"canonical_sha256":"65a065edeea22a4a125ddec62ca5b6526394a40b234c1c84e5834549fefbcdcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65a065edeea22a4a125ddec62ca5b6526394a40b234c1c84e5834549fefbcdcd","first_computed_at":"2026-05-18T00:21:39.222364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:39.222364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"knFweC23NKRcvHXA+ubMblTU46mOyRjUmAnAj/b0oWmPdcsmvQrb6rDdbE2eoOkevqipNP88uMoFDRGtw0uwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:39.223091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf6a77bd71784bda05dc13fdc71637d463a4e9a0a64baae6e0cf87c89d11e8cf","sha256:1b67072ad9ee17d784f0a5c3f92571405012695c0f2f45df1924aa64d7b324da"],"state_sha256":"f11c99cad5d6bd9e00fd52dbac57107ce9fcff28a6975b7bec882125807118c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwLzN2Eno4eDgqRBeCNMplyCOPjvgjDMg07RWngx9dvNzIN1NazsIZ6CEZMFu54efEiJKakhThE1aRJi7kc5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T21:41:15.097122Z","bundle_sha256":"c9205cc7c16127978c740dd1117c19d095246f3e37879f63f942b16200f63ba1"}}