{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OQ2VEAEWUFUVS3MJ7HFRVCPQU3","short_pith_number":"pith:OQ2VEAEW","canonical_record":{"source":{"id":"1707.04233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T17:31:06Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"d0e6d47e7dcda2ae7a9590270753d0256b14bb62171c857102a4b3393cf2a565","abstract_canon_sha256":"6bd46fa8dd2c4512c1bf187cc799c89974bd4f3c1d7b9b31fe1194db515cf735"},"schema_version":"1.0"},"canonical_sha256":"7435520096a169596d89f9cb1a89f0a6ee5117c1d7fd014b3f889c2e22b7fe6d","source":{"kind":"arxiv","id":"1707.04233","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04233","created_at":"2026-05-18T00:20:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04233v2","created_at":"2026-05-18T00:20:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04233","created_at":"2026-05-18T00:20:30Z"},{"alias_kind":"pith_short_12","alias_value":"OQ2VEAEWUFUV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OQ2VEAEWUFUVS3MJ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OQ2VEAEW","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OQ2VEAEWUFUVS3MJ7HFRVCPQU3","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T17:31:06Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"d0e6d47e7dcda2ae7a9590270753d0256b14bb62171c857102a4b3393cf2a565","abstract_canon_sha256":"6bd46fa8dd2c4512c1bf187cc799c89974bd4f3c1d7b9b31fe1194db515cf735"},"schema_version":"1.0"},"canonical_sha256":"7435520096a169596d89f9cb1a89f0a6ee5117c1d7fd014b3f889c2e22b7fe6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:30.247321Z","signature_b64":"TPUbvSgQD5+quIoKX9Mvn3h4PfepASWjmvjL9MpUs5Hu2mrJRoqNrWRZZkRfm6CV1WHnaWf3okN5Q2WS7NORDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7435520096a169596d89f9cb1a89f0a6ee5117c1d7fd014b3f889c2e22b7fe6d","last_reissued_at":"2026-05-18T00:20:30.246898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:30.246898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04233","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:20:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Y5b6GvVUgAOC1PsTcoK5WMOXNmOeHBHtBT16NQ9aV8WCxh/6EHZFIrMNyrzN+4xWvHiJodNjqeoqiw3cN6cDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:13:33.766439Z"},"content_sha256":"31fcf6e9fb247918ac63572b95a90570d84ca100dc96246351e70dda990349f2","schema_version":"1.0","event_id":"sha256:31fcf6e9fb247918ac63572b95a90570d84ca100dc96246351e70dda990349f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OQ2VEAEWUFUVS3MJ7HFRVCPQU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions","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, Ellen Vitercik","submitted_at":"2017-07-13T17:31:06Z","abstract_excerpt":"We present many new results related to reliable (interactive) communication over insertion-deletion channels. Synchronization errors, such as insertions and deletions, strictly generalize the usual symbol corruption errors and are much harder to protect against.\n  We show how to hide the complications of synchronization errors in many applications by introducing very general channel simulations which efficiently transform an insertion-deletion channel into a regular symbol corruption channel with an error rate larger by a constant factor and a slightly smaller alphabet. We generalize synchroni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04233","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:20:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VjaKubWlP0O7x8MVhKXuFOBN6DQXIEVS9t0Qpl2QwZSOsNSrrOJjdVLC2ihuzf8br/lN//Smb/OX0cAK0e2TAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:13:33.767139Z"},"content_sha256":"1195418cc50f629581738998088c5c41d6f7d0f82f92065084ffb8aac95130b2","schema_version":"1.0","event_id":"sha256:1195418cc50f629581738998088c5c41d6f7d0f82f92065084ffb8aac95130b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQ2VEAEWUFUVS3MJ7HFRVCPQU3/bundle.json","state_url":"https://pith.science/pith/OQ2VEAEWUFUVS3MJ7HFRVCPQU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQ2VEAEWUFUVS3MJ7HFRVCPQU3/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-05T20:13:33Z","links":{"resolver":"https://pith.science/pith/OQ2VEAEWUFUVS3MJ7HFRVCPQU3","bundle":"https://pith.science/pith/OQ2VEAEWUFUVS3MJ7HFRVCPQU3/bundle.json","state":"https://pith.science/pith/OQ2VEAEWUFUVS3MJ7HFRVCPQU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQ2VEAEWUFUVS3MJ7HFRVCPQU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OQ2VEAEWUFUVS3MJ7HFRVCPQU3","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":"6bd46fa8dd2c4512c1bf187cc799c89974bd4f3c1d7b9b31fe1194db515cf735","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T17:31:06Z","title_canon_sha256":"d0e6d47e7dcda2ae7a9590270753d0256b14bb62171c857102a4b3393cf2a565"},"schema_version":"1.0","source":{"id":"1707.04233","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04233","created_at":"2026-05-18T00:20:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04233v2","created_at":"2026-05-18T00:20:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04233","created_at":"2026-05-18T00:20:30Z"},{"alias_kind":"pith_short_12","alias_value":"OQ2VEAEWUFUV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OQ2VEAEWUFUVS3MJ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OQ2VEAEW","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:1195418cc50f629581738998088c5c41d6f7d0f82f92065084ffb8aac95130b2","target":"graph","created_at":"2026-05-18T00:20:30Z","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 present many new results related to reliable (interactive) communication over insertion-deletion channels. Synchronization errors, such as insertions and deletions, strictly generalize the usual symbol corruption errors and are much harder to protect against.\n  We show how to hide the complications of synchronization errors in many applications by introducing very general channel simulations which efficiently transform an insertion-deletion channel into a regular symbol corruption channel with an error rate larger by a constant factor and a slightly smaller alphabet. We generalize synchroni","authors_text":"Amirbehshad Shahrasbi, Bernhard Haeupler, Ellen Vitercik","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T17:31:06Z","title":"Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04233","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:31fcf6e9fb247918ac63572b95a90570d84ca100dc96246351e70dda990349f2","target":"record","created_at":"2026-05-18T00:20:30Z","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":"6bd46fa8dd2c4512c1bf187cc799c89974bd4f3c1d7b9b31fe1194db515cf735","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T17:31:06Z","title_canon_sha256":"d0e6d47e7dcda2ae7a9590270753d0256b14bb62171c857102a4b3393cf2a565"},"schema_version":"1.0","source":{"id":"1707.04233","kind":"arxiv","version":2}},"canonical_sha256":"7435520096a169596d89f9cb1a89f0a6ee5117c1d7fd014b3f889c2e22b7fe6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7435520096a169596d89f9cb1a89f0a6ee5117c1d7fd014b3f889c2e22b7fe6d","first_computed_at":"2026-05-18T00:20:30.246898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:30.246898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TPUbvSgQD5+quIoKX9Mvn3h4PfepASWjmvjL9MpUs5Hu2mrJRoqNrWRZZkRfm6CV1WHnaWf3okN5Q2WS7NORDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:30.247321Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04233","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31fcf6e9fb247918ac63572b95a90570d84ca100dc96246351e70dda990349f2","sha256:1195418cc50f629581738998088c5c41d6f7d0f82f92065084ffb8aac95130b2"],"state_sha256":"0412002e6a75a1f726843d05349bb673d620a2953d2840ae870f2b485fa331cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ec+wACoWAFnr5ChZgZHDb5kAxAAXm+sg8n3VH33BPFFk3aT8exLIlMlbZYdTlUNJWLFJ7Y90Sa38RPzKbmepDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:13:33.771208Z","bundle_sha256":"a59dfc4bd15fa443e4ed7dd2d8b116fd53acff1ed2f29307246ddbdf3c1279d2"}}