{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5AK7E7SVX2S3PP6IWSNEB6DV7Y","short_pith_number":"pith:5AK7E7SV","canonical_record":{"source":{"id":"1203.3445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-15T19:11:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9654e3f5ab2dbad4097a2981b8757231e6ce3d9f2b2870ee9eaa52932b2b4eb0","abstract_canon_sha256":"fc647f70cdc707fffba80a5de4ab7bc085d3ebcabf3e93d76e10b07ad49484a2"},"schema_version":"1.0"},"canonical_sha256":"e815f27e55bea5b7bfc8b49a40f875fe081aec9ae8737a5413671d8f185d1d3d","source":{"kind":"arxiv","id":"1203.3445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3445","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3445v1","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3445","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"5AK7E7SVX2S3","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5AK7E7SVX2S3PP6I","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5AK7E7SV","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5AK7E7SVX2S3PP6IWSNEB6DV7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-15T19:11:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9654e3f5ab2dbad4097a2981b8757231e6ce3d9f2b2870ee9eaa52932b2b4eb0","abstract_canon_sha256":"fc647f70cdc707fffba80a5de4ab7bc085d3ebcabf3e93d76e10b07ad49484a2"},"schema_version":"1.0"},"canonical_sha256":"e815f27e55bea5b7bfc8b49a40f875fe081aec9ae8737a5413671d8f185d1d3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:01.631007Z","signature_b64":"extMeguj/LJa9Vy8LtQSdTEbu55J0Vp+46w/dwoKw2ZbxwHsaKqfeLNozn7WoQ1TvTX86/AQ/UqNj3twcHS+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e815f27e55bea5b7bfc8b49a40f875fe081aec9ae8737a5413671d8f185d1d3d","last_reissued_at":"2026-05-18T04:00:01.630282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:01.630282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3445","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:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PE3iID44UVmqkFTFb6YCuz1tcF8dfiAn4qniQMnSvELGHeWxza7T0tp24j19IjqR+MoPDntsb6dBW1ZfoZugCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:44:08.638378Z"},"content_sha256":"ca4b55f45ce968083b718fb6c230d679ccbc4e62eb85f067f6dc44d754c467d5","schema_version":"1.0","event_id":"sha256:ca4b55f45ce968083b718fb6c230d679ccbc4e62eb85f067f6dc44d754c467d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5AK7E7SVX2S3PP6IWSNEB6DV7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Cooperative Data Exchange in Multihop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Richard D. Wesel, Thomas A. Courtade","submitted_at":"2012-03-15T19:11:12Z","abstract_excerpt":"Consider a connected network of n nodes that all wish to recover k desired packets. Each node begins with a subset of the desired packets and exchanges coded packets with its neighbors. This paper provides necessary and sufficient conditions which characterize the set of all transmission schemes that permit every node to ultimately learn (recover) all k packets. When the network satisfies certain regularity conditions and packets are randomly distributed, this paper provides tight concentration results on the number of transmissions required to achieve universal recovery. For the case of a ful"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3445","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:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wqKFOqHHQNmMEYd8qtJJiMWpOLSCPPO9WT8gM6gwIcVOl9BOii5BhDzhH3RPp1JVqnU7xGiwChsUdSCxH+6XBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:44:08.639063Z"},"content_sha256":"e58cc76cf4c017e95fc5ab3e615f9ee337f80bd23ce3e381dcf7129c69d98790","schema_version":"1.0","event_id":"sha256:e58cc76cf4c017e95fc5ab3e615f9ee337f80bd23ce3e381dcf7129c69d98790"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AK7E7SVX2S3PP6IWSNEB6DV7Y/bundle.json","state_url":"https://pith.science/pith/5AK7E7SVX2S3PP6IWSNEB6DV7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AK7E7SVX2S3PP6IWSNEB6DV7Y/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-27T00:44:08Z","links":{"resolver":"https://pith.science/pith/5AK7E7SVX2S3PP6IWSNEB6DV7Y","bundle":"https://pith.science/pith/5AK7E7SVX2S3PP6IWSNEB6DV7Y/bundle.json","state":"https://pith.science/pith/5AK7E7SVX2S3PP6IWSNEB6DV7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AK7E7SVX2S3PP6IWSNEB6DV7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5AK7E7SVX2S3PP6IWSNEB6DV7Y","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":"fc647f70cdc707fffba80a5de4ab7bc085d3ebcabf3e93d76e10b07ad49484a2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-15T19:11:12Z","title_canon_sha256":"9654e3f5ab2dbad4097a2981b8757231e6ce3d9f2b2870ee9eaa52932b2b4eb0"},"schema_version":"1.0","source":{"id":"1203.3445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3445","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3445v1","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3445","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"5AK7E7SVX2S3","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5AK7E7SVX2S3PP6I","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5AK7E7SV","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:e58cc76cf4c017e95fc5ab3e615f9ee337f80bd23ce3e381dcf7129c69d98790","target":"graph","created_at":"2026-05-18T04:00:01Z","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":"Consider a connected network of n nodes that all wish to recover k desired packets. Each node begins with a subset of the desired packets and exchanges coded packets with its neighbors. This paper provides necessary and sufficient conditions which characterize the set of all transmission schemes that permit every node to ultimately learn (recover) all k packets. When the network satisfies certain regularity conditions and packets are randomly distributed, this paper provides tight concentration results on the number of transmissions required to achieve universal recovery. For the case of a ful","authors_text":"Richard D. Wesel, Thomas A. Courtade","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-15T19:11:12Z","title":"Coded Cooperative Data Exchange in Multihop Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3445","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:ca4b55f45ce968083b718fb6c230d679ccbc4e62eb85f067f6dc44d754c467d5","target":"record","created_at":"2026-05-18T04:00:01Z","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":"fc647f70cdc707fffba80a5de4ab7bc085d3ebcabf3e93d76e10b07ad49484a2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-15T19:11:12Z","title_canon_sha256":"9654e3f5ab2dbad4097a2981b8757231e6ce3d9f2b2870ee9eaa52932b2b4eb0"},"schema_version":"1.0","source":{"id":"1203.3445","kind":"arxiv","version":1}},"canonical_sha256":"e815f27e55bea5b7bfc8b49a40f875fe081aec9ae8737a5413671d8f185d1d3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e815f27e55bea5b7bfc8b49a40f875fe081aec9ae8737a5413671d8f185d1d3d","first_computed_at":"2026-05-18T04:00:01.630282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:01.630282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"extMeguj/LJa9Vy8LtQSdTEbu55J0Vp+46w/dwoKw2ZbxwHsaKqfeLNozn7WoQ1TvTX86/AQ/UqNj3twcHS+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:01.631007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca4b55f45ce968083b718fb6c230d679ccbc4e62eb85f067f6dc44d754c467d5","sha256:e58cc76cf4c017e95fc5ab3e615f9ee337f80bd23ce3e381dcf7129c69d98790"],"state_sha256":"5fb287128caaa20bb9e4a2349dc515a30b2dcdb4b5c3fa40c7410284f3be3405"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wXQGB2iuFHrlcSFdA29ZPiEgWwqLrxtt+uyIM/rgcS2JspCYXk1ctvViaggWoLNYyVJvqfcsAamVBVvcwJ/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:44:08.642953Z","bundle_sha256":"185dad98aa554c4fd58767e8c173ce591eba27d20950c8710d06a2d84956d9f1"}}