{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QLQW6EJQ2YQJGCNBFL76PKI73V","short_pith_number":"pith:QLQW6EJQ","canonical_record":{"source":{"id":"1302.2702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-12T05:21:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c3bcc7f4877e4ddfbc694dc5f3039a878ca38bb15c261c8418285dcbf4998eb","abstract_canon_sha256":"bc47819e082ba3fb3d23722ead337df7e9a6f7eedb7c2ac9da0623f25b620568"},"schema_version":"1.0"},"canonical_sha256":"82e16f1130d6209309a12affe7a91fdd57452363a919de89af6c17ebecfb126c","source":{"kind":"arxiv","id":"1302.2702","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2702","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2702v2","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2702","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"QLQW6EJQ2YQJ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QLQW6EJQ2YQJGCNB","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QLQW6EJQ","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QLQW6EJQ2YQJGCNBFL76PKI73V","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-12T05:21:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c3bcc7f4877e4ddfbc694dc5f3039a878ca38bb15c261c8418285dcbf4998eb","abstract_canon_sha256":"bc47819e082ba3fb3d23722ead337df7e9a6f7eedb7c2ac9da0623f25b620568"},"schema_version":"1.0"},"canonical_sha256":"82e16f1130d6209309a12affe7a91fdd57452363a919de89af6c17ebecfb126c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.611158Z","signature_b64":"1OU2/7NvM9bbN4DaDF927fWcWs39Hi0YUWBr2VcgSCqjpKiQNimcG0gArqmryQE+QR7XULNJzKgnMk2XZK15Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82e16f1130d6209309a12affe7a91fdd57452363a919de89af6c17ebecfb126c","last_reissued_at":"2026-05-18T00:58:42.610633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.610633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2702","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:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgtXaumOqoP1IlVRrXmfXNteRnYCBRQQG+nEqGc2kAkkCsef9QlyQBWO2p1ktruwkWNN76uuo8nyehyHkVJeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:24:59.176454Z"},"content_sha256":"cd1feef7bf05eba6115a494ae625ebe26137cb0eeec8e6815aa2ad8bf8db13f7","schema_version":"1.0","event_id":"sha256:cd1feef7bf05eba6115a494ae625ebe26137cb0eeec8e6815aa2ad8bf8db13f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QLQW6EJQ2YQJGCNBFL76PKI73V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of Channels with Timing Synchronization Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aravind R. Iyengar, Jack K. Wolf, Paul H. Siegel","submitted_at":"2013-02-12T05:21:26Z","abstract_excerpt":"We consider a new formulation of a class of synchronization error channels and derive analytical bounds and numerical estimates for the capacity of these channels. For the binary channel with only deletions, we obtain an expression for the symmetric information rate in terms of subsequence weights which reduces to a tight lower bound for small deletion probabilities. We are also able to exactly characterize the Markov-1 rate for the binary channel with only replications. For a channel that introduces deletions as well as replications of input symbols, we design approximating channels that para"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2702","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:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hECkqnCdrjLw7JRk/yVidRIimtVfzdF41qzt1u83Yg1EkGqNI4yYxwBFiTSnaPERrJI09Ph7N02d4zpugYHyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:24:59.176805Z"},"content_sha256":"3ea4da0b29b577ab22dbebac4038f6eba96d60555c87105a7fb169e762e1ee8f","schema_version":"1.0","event_id":"sha256:3ea4da0b29b577ab22dbebac4038f6eba96d60555c87105a7fb169e762e1ee8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLQW6EJQ2YQJGCNBFL76PKI73V/bundle.json","state_url":"https://pith.science/pith/QLQW6EJQ2YQJGCNBFL76PKI73V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLQW6EJQ2YQJGCNBFL76PKI73V/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-04T20:24:59Z","links":{"resolver":"https://pith.science/pith/QLQW6EJQ2YQJGCNBFL76PKI73V","bundle":"https://pith.science/pith/QLQW6EJQ2YQJGCNBFL76PKI73V/bundle.json","state":"https://pith.science/pith/QLQW6EJQ2YQJGCNBFL76PKI73V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLQW6EJQ2YQJGCNBFL76PKI73V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QLQW6EJQ2YQJGCNBFL76PKI73V","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":"bc47819e082ba3fb3d23722ead337df7e9a6f7eedb7c2ac9da0623f25b620568","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-12T05:21:26Z","title_canon_sha256":"3c3bcc7f4877e4ddfbc694dc5f3039a878ca38bb15c261c8418285dcbf4998eb"},"schema_version":"1.0","source":{"id":"1302.2702","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2702","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2702v2","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2702","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"QLQW6EJQ2YQJ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QLQW6EJQ2YQJGCNB","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QLQW6EJQ","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:3ea4da0b29b577ab22dbebac4038f6eba96d60555c87105a7fb169e762e1ee8f","target":"graph","created_at":"2026-05-18T00:58:42Z","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 consider a new formulation of a class of synchronization error channels and derive analytical bounds and numerical estimates for the capacity of these channels. For the binary channel with only deletions, we obtain an expression for the symmetric information rate in terms of subsequence weights which reduces to a tight lower bound for small deletion probabilities. We are also able to exactly characterize the Markov-1 rate for the binary channel with only replications. For a channel that introduces deletions as well as replications of input symbols, we design approximating channels that para","authors_text":"Aravind R. Iyengar, Jack K. Wolf, Paul H. Siegel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-12T05:21:26Z","title":"On the Capacity of Channels with Timing Synchronization Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2702","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:cd1feef7bf05eba6115a494ae625ebe26137cb0eeec8e6815aa2ad8bf8db13f7","target":"record","created_at":"2026-05-18T00:58:42Z","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":"bc47819e082ba3fb3d23722ead337df7e9a6f7eedb7c2ac9da0623f25b620568","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-12T05:21:26Z","title_canon_sha256":"3c3bcc7f4877e4ddfbc694dc5f3039a878ca38bb15c261c8418285dcbf4998eb"},"schema_version":"1.0","source":{"id":"1302.2702","kind":"arxiv","version":2}},"canonical_sha256":"82e16f1130d6209309a12affe7a91fdd57452363a919de89af6c17ebecfb126c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82e16f1130d6209309a12affe7a91fdd57452363a919de89af6c17ebecfb126c","first_computed_at":"2026-05-18T00:58:42.610633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.610633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1OU2/7NvM9bbN4DaDF927fWcWs39Hi0YUWBr2VcgSCqjpKiQNimcG0gArqmryQE+QR7XULNJzKgnMk2XZK15Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.611158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2702","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd1feef7bf05eba6115a494ae625ebe26137cb0eeec8e6815aa2ad8bf8db13f7","sha256:3ea4da0b29b577ab22dbebac4038f6eba96d60555c87105a7fb169e762e1ee8f"],"state_sha256":"a73463f5580d136dca762bb0999d37ece2cf6202e7929387381c696894ba4ff4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dg38lHk8Y1DOr6MJuY1ybL9dbvu8DdQj7cQViNihy/2W0j8cuFr4Tt39h3UR2tIO9ybkPK5BwBGO3S0ti2YiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:24:59.178738Z","bundle_sha256":"2ea66d255c0a371828241e8eb3854de3a4303a1420a81dbcb45aa2147945de37"}}