{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VRQD4S4IOUEGESDMAIVYLVMLNV","short_pith_number":"pith:VRQD4S4I","canonical_record":{"source":{"id":"1102.3669","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-17T19:38:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5e6aaa76d06daa8f7dae2402c16cc293b98f696bf681d698de3c772bc6d4f12f","abstract_canon_sha256":"870f15d14fdb21ef721d410f29b68ccabaddcf2a90dc6f5e71e1929594ce2de2"},"schema_version":"1.0"},"canonical_sha256":"ac603e4b88750862486c022b85d58b6d5d971eefb93b4578c70cc773f6a0be69","source":{"kind":"arxiv","id":"1102.3669","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3669","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3669v2","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3669","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"VRQD4S4IOUEG","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VRQD4S4IOUEGESDM","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VRQD4S4I","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VRQD4S4IOUEGESDMAIVYLVMLNV","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3669","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-17T19:38:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5e6aaa76d06daa8f7dae2402c16cc293b98f696bf681d698de3c772bc6d4f12f","abstract_canon_sha256":"870f15d14fdb21ef721d410f29b68ccabaddcf2a90dc6f5e71e1929594ce2de2"},"schema_version":"1.0"},"canonical_sha256":"ac603e4b88750862486c022b85d58b6d5d971eefb93b4578c70cc773f6a0be69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.085114Z","signature_b64":"Y3hMh+NV1vG9rYZOEGIzOT7boFq1zmvxovUcS2eOuE+x2aJFr9jKXIdnfx1f/rWRXTN6flMfRJfynVOupDLbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac603e4b88750862486c022b85d58b6d5d971eefb93b4578c70cc773f6a0be69","last_reissued_at":"2026-05-18T00:58:19.084477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.084477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3669","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PbG6Qfuludwrc7I3E/MW47sa8jg0gkCrky4UmCzv46gnCRPZcj/zNkVh/R3I/j+pYn6fisHAbZ6x+lKW2KK7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:20:07.363388Z"},"content_sha256":"5d9b5d9996f7ed6aaace0a80fcc137efe922531a46304ef3f346890cb508c484","schema_version":"1.0","event_id":"sha256:5d9b5d9996f7ed6aaace0a80fcc137efe922531a46304ef3f346890cb508c484"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VRQD4S4IOUEGESDMAIVYLVMLNV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient File Synchronization: a Distributed Source Coding Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Tse, Kannan Ramchandran, Nan Ma","submitted_at":"2011-02-17T19:38:19Z","abstract_excerpt":"The problem of reconstructing a source sequence with the presence of decoder side-information that is mis-synchronized to the source due to deletions is studied in a distributed source coding framework. Motivated by practical applications, the deletion process is assumed to be bursty and is modeled by a Markov chain. The minimum rate needed to reconstruct the source sequence with high probability is characterized in terms of an information theoretic expression, which is interpreted as the amount of information of the deleted content and the locations of deletions, subtracting \"nature's secret\""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3669","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yfphjG5OF/tTsGAcnd4ZoXa+gQsOnpId6afT9akhKD8XTSalIRnemANqunx+rn1rlWRksMhikAja0CcgCOqvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:20:07.364013Z"},"content_sha256":"90628c3d63a7d478906ae02f202c0e3b0ed09e5e1eb3c8da701984f059438604","schema_version":"1.0","event_id":"sha256:90628c3d63a7d478906ae02f202c0e3b0ed09e5e1eb3c8da701984f059438604"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRQD4S4IOUEGESDMAIVYLVMLNV/bundle.json","state_url":"https://pith.science/pith/VRQD4S4IOUEGESDMAIVYLVMLNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRQD4S4IOUEGESDMAIVYLVMLNV/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-05-28T05:20:07Z","links":{"resolver":"https://pith.science/pith/VRQD4S4IOUEGESDMAIVYLVMLNV","bundle":"https://pith.science/pith/VRQD4S4IOUEGESDMAIVYLVMLNV/bundle.json","state":"https://pith.science/pith/VRQD4S4IOUEGESDMAIVYLVMLNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRQD4S4IOUEGESDMAIVYLVMLNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VRQD4S4IOUEGESDMAIVYLVMLNV","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":"870f15d14fdb21ef721d410f29b68ccabaddcf2a90dc6f5e71e1929594ce2de2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-17T19:38:19Z","title_canon_sha256":"5e6aaa76d06daa8f7dae2402c16cc293b98f696bf681d698de3c772bc6d4f12f"},"schema_version":"1.0","source":{"id":"1102.3669","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3669","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3669v2","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3669","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"VRQD4S4IOUEG","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VRQD4S4IOUEGESDM","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VRQD4S4I","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:90628c3d63a7d478906ae02f202c0e3b0ed09e5e1eb3c8da701984f059438604","target":"graph","created_at":"2026-05-18T00:58: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":"The problem of reconstructing a source sequence with the presence of decoder side-information that is mis-synchronized to the source due to deletions is studied in a distributed source coding framework. Motivated by practical applications, the deletion process is assumed to be bursty and is modeled by a Markov chain. The minimum rate needed to reconstruct the source sequence with high probability is characterized in terms of an information theoretic expression, which is interpreted as the amount of information of the deleted content and the locations of deletions, subtracting \"nature's secret\"","authors_text":"David Tse, Kannan Ramchandran, Nan Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-17T19:38:19Z","title":"Efficient File Synchronization: a Distributed Source Coding Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3669","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:5d9b5d9996f7ed6aaace0a80fcc137efe922531a46304ef3f346890cb508c484","target":"record","created_at":"2026-05-18T00:58: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":"870f15d14fdb21ef721d410f29b68ccabaddcf2a90dc6f5e71e1929594ce2de2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-17T19:38:19Z","title_canon_sha256":"5e6aaa76d06daa8f7dae2402c16cc293b98f696bf681d698de3c772bc6d4f12f"},"schema_version":"1.0","source":{"id":"1102.3669","kind":"arxiv","version":2}},"canonical_sha256":"ac603e4b88750862486c022b85d58b6d5d971eefb93b4578c70cc773f6a0be69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac603e4b88750862486c022b85d58b6d5d971eefb93b4578c70cc773f6a0be69","first_computed_at":"2026-05-18T00:58:19.084477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.084477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y3hMh+NV1vG9rYZOEGIzOT7boFq1zmvxovUcS2eOuE+x2aJFr9jKXIdnfx1f/rWRXTN6flMfRJfynVOupDLbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.085114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3669","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d9b5d9996f7ed6aaace0a80fcc137efe922531a46304ef3f346890cb508c484","sha256:90628c3d63a7d478906ae02f202c0e3b0ed09e5e1eb3c8da701984f059438604"],"state_sha256":"2d75abe6fc3e5e18c5a81c6dc172ec6c0f84b746c4f860a849e15ab12dd911a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJ2OHkRNGZqPqL6rDBHfLvLJvn/y3JEnWWz0/kecvYXKf8FShzF/aUwknPM9N3IZeg8Wgf/+ozmiLbfWJvLCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:20:07.367043Z","bundle_sha256":"bd7c9a66dae27dd7a86de45e1e1f5dc406df5bbe1ac643b6a062b11bda2fe241"}}