{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ERB6M4QFDUWSGQNJZB745VXM54","short_pith_number":"pith:ERB6M4QF","canonical_record":{"source":{"id":"1202.1801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-08T19:42:29Z","cross_cats_sorted":["cs.DC","cs.DS","math.IT"],"title_canon_sha256":"9376f08a421bd855b9182b166fc7f5287e39bd77be116865d8fef851b193b7b5","abstract_canon_sha256":"f1701ff1f310ffcb4b9007ec1a316391a9dcd87b4a5e2c8d5756b714903e2ec0"},"schema_version":"1.0"},"canonical_sha256":"2443e672051d2d2341a9c87fced6ecef0b281ce2bfdbc3933a1eccff8923bfb2","source":{"kind":"arxiv","id":"1202.1801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1801","created_at":"2026-05-18T04:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1801v1","created_at":"2026-05-18T04:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1801","created_at":"2026-05-18T04:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"ERB6M4QFDUWS","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"ERB6M4QFDUWSGQNJ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"ERB6M4QF","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ERB6M4QFDUWSGQNJZB745VXM54","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-08T19:42:29Z","cross_cats_sorted":["cs.DC","cs.DS","math.IT"],"title_canon_sha256":"9376f08a421bd855b9182b166fc7f5287e39bd77be116865d8fef851b193b7b5","abstract_canon_sha256":"f1701ff1f310ffcb4b9007ec1a316391a9dcd87b4a5e2c8d5756b714903e2ec0"},"schema_version":"1.0"},"canonical_sha256":"2443e672051d2d2341a9c87fced6ecef0b281ce2bfdbc3933a1eccff8923bfb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:51.050557Z","signature_b64":"UpLxybegkBuUmQgP9rWNmzohdUkwzVtI0uzYRqMCdSyK93F3oDJT633k5hzHWv11ZF/EhmxGOX+FI7H2MfMXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2443e672051d2d2341a9c87fced6ecef0b281ce2bfdbc3933a1eccff8923bfb2","last_reissued_at":"2026-05-18T04:02:51.049648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:51.049648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1801","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-18T04:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vznq8mI6SrDTptWWJfSNY4b8szgYUCIkuvZ2TPWJtGgWOJZGz9F7gsye2DHjf4Sh45E48YtCFP76OwETFsfaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:52.238070Z"},"content_sha256":"27595ed264701de2cbe6681d09741f171d182b9afd194db7b2e4267f66120178","schema_version":"1.0","event_id":"sha256:27595ed264701de2cbe6681d09741f171d182b9afd194db7b2e4267f66120178"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ERB6M4QFDUWSGQNJZB745VXM54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Coded Gossip with Correlated Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Bernhard Haeupler, Chen Avin, Muriel M\\'edard","submitted_at":"2012-02-08T19:42:29Z","abstract_excerpt":"We design and analyze gossip algorithms for networks with correlated data. In these networks, either the data to be distributed, the data already available at the nodes, or both, are correlated. This model is applicable for a variety of modern networks, such as sensor, peer-to-peer and content distribution networks.\n  Although coding schemes for correlated data have been studied extensively, the focus has been on characterizing the rate region in static memory-free networks. In a gossip-based scheme, however, nodes communicate among each other by continuously exchanging packets according to so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1801","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-18T04:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ic4KpcTeAcknIofkMJWBLgNb0hBJIRbh7DWRYgqrFby6M9U96cquSX653msVprEn0ejQJVS3QEwZSp5aewjRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:52.238718Z"},"content_sha256":"92998b459348a3ead1c373988d9fc3c97153bf855b9cc564b6077bea4f1a465d","schema_version":"1.0","event_id":"sha256:92998b459348a3ead1c373988d9fc3c97153bf855b9cc564b6077bea4f1a465d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERB6M4QFDUWSGQNJZB745VXM54/bundle.json","state_url":"https://pith.science/pith/ERB6M4QFDUWSGQNJZB745VXM54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERB6M4QFDUWSGQNJZB745VXM54/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-30T09:21:52Z","links":{"resolver":"https://pith.science/pith/ERB6M4QFDUWSGQNJZB745VXM54","bundle":"https://pith.science/pith/ERB6M4QFDUWSGQNJZB745VXM54/bundle.json","state":"https://pith.science/pith/ERB6M4QFDUWSGQNJZB745VXM54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERB6M4QFDUWSGQNJZB745VXM54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ERB6M4QFDUWSGQNJZB745VXM54","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":"f1701ff1f310ffcb4b9007ec1a316391a9dcd87b4a5e2c8d5756b714903e2ec0","cross_cats_sorted":["cs.DC","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-08T19:42:29Z","title_canon_sha256":"9376f08a421bd855b9182b166fc7f5287e39bd77be116865d8fef851b193b7b5"},"schema_version":"1.0","source":{"id":"1202.1801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1801","created_at":"2026-05-18T04:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1801v1","created_at":"2026-05-18T04:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1801","created_at":"2026-05-18T04:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"ERB6M4QFDUWS","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"ERB6M4QFDUWSGQNJ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"ERB6M4QF","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:92998b459348a3ead1c373988d9fc3c97153bf855b9cc564b6077bea4f1a465d","target":"graph","created_at":"2026-05-18T04:02:51Z","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 design and analyze gossip algorithms for networks with correlated data. In these networks, either the data to be distributed, the data already available at the nodes, or both, are correlated. This model is applicable for a variety of modern networks, such as sensor, peer-to-peer and content distribution networks.\n  Although coding schemes for correlated data have been studied extensively, the focus has been on characterizing the rate region in static memory-free networks. In a gossip-based scheme, however, nodes communicate among each other by continuously exchanging packets according to so","authors_text":"Asaf Cohen, Bernhard Haeupler, Chen Avin, Muriel M\\'edard","cross_cats":["cs.DC","cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-08T19:42:29Z","title":"Network Coded Gossip with Correlated Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1801","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:27595ed264701de2cbe6681d09741f171d182b9afd194db7b2e4267f66120178","target":"record","created_at":"2026-05-18T04:02:51Z","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":"f1701ff1f310ffcb4b9007ec1a316391a9dcd87b4a5e2c8d5756b714903e2ec0","cross_cats_sorted":["cs.DC","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-08T19:42:29Z","title_canon_sha256":"9376f08a421bd855b9182b166fc7f5287e39bd77be116865d8fef851b193b7b5"},"schema_version":"1.0","source":{"id":"1202.1801","kind":"arxiv","version":1}},"canonical_sha256":"2443e672051d2d2341a9c87fced6ecef0b281ce2bfdbc3933a1eccff8923bfb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2443e672051d2d2341a9c87fced6ecef0b281ce2bfdbc3933a1eccff8923bfb2","first_computed_at":"2026-05-18T04:02:51.049648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:51.049648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UpLxybegkBuUmQgP9rWNmzohdUkwzVtI0uzYRqMCdSyK93F3oDJT633k5hzHWv11ZF/EhmxGOX+FI7H2MfMXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:51.050557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27595ed264701de2cbe6681d09741f171d182b9afd194db7b2e4267f66120178","sha256:92998b459348a3ead1c373988d9fc3c97153bf855b9cc564b6077bea4f1a465d"],"state_sha256":"79b8e078236064d7614c1ee45c789f25a74a3ddc83580f1b2d3407f8629c5fa9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4ctI5ySQWuoiy0YEBTr4DyyGz8AfgMHG/fLXoK46Kx/eM9A3HCIOadunCo8wj9Sl0eYcqOnT02BbwRd59BYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:21:52.241856Z","bundle_sha256":"1b5ef1893fbafab784d5117fe4b7d0d5468f91e44fded9166619cce215e9a0c3"}}