{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NYXPMR72UROXQ6ILE37VFK4K4U","short_pith_number":"pith:NYXPMR72","canonical_record":{"source":{"id":"1202.2088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-09T19:42:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b52a0553a608de3cf710596f6a61cac872d76be49d43423a41d3e212b7b1ac05","abstract_canon_sha256":"7beaa723999b6e45b083b6d59127fd39e878461d263334e3a5ed05104e56c92e"},"schema_version":"1.0"},"canonical_sha256":"6e2ef647faa45d78790b26ff52ab8ae527ab5dd61f7cc658b4c7da85e6ec3ca0","source":{"kind":"arxiv","id":"1202.2088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2088","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2088v1","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2088","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"NYXPMR72UROX","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NYXPMR72UROXQ6IL","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NYXPMR72","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NYXPMR72UROXQ6ILE37VFK4K4U","target":"record","payload":{"canonical_record":{"source":{"id":"1202.2088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-09T19:42:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b52a0553a608de3cf710596f6a61cac872d76be49d43423a41d3e212b7b1ac05","abstract_canon_sha256":"7beaa723999b6e45b083b6d59127fd39e878461d263334e3a5ed05104e56c92e"},"schema_version":"1.0"},"canonical_sha256":"6e2ef647faa45d78790b26ff52ab8ae527ab5dd61f7cc658b4c7da85e6ec3ca0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:38.277802Z","signature_b64":"X4E3uenc3fMfqI5IkkAHHnQBkpU5Vm+KzTXO8aVSRgQyDl60R4/DF/qBK//gsqc3UC4W4Euxr+jwPnlUz8X/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e2ef647faa45d78790b26ff52ab8ae527ab5dd61f7cc658b4c7da85e6ec3ca0","last_reissued_at":"2026-05-18T04:02:38.277204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:38.277204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.2088","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:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agt5hUcMZx6zuqlecpD5RxJdy4o3IbLp/8xP930ZOW0ZTKsT+DfiBJ9Dsps6a+5ByUeMWOrBJ1wx5iDgLWkBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:36:26.083846Z"},"content_sha256":"f2e9837792fc974006f18b7b71d4a1df10868cec6c84828d238ec9e5f5118934","schema_version":"1.0","event_id":"sha256:f2e9837792fc974006f18b7b71d4a1df10868cec6c84828d238ec9e5f5118934"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NYXPMR72UROXQ6ILE37VFK4K4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Cooperative Data Exchange Problem for General Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Langberg, Mira Gonen","submitted_at":"2012-02-09T19:42:26Z","abstract_excerpt":"We consider the \"coded cooperative data exchange problem\" for general graphs. In this problem, given a graph G=(V,E) representing clients in a broadcast network, each of which initially hold a (not necessarily disjoint) set of information packets; one wishes to design a communication scheme in which eventually all clients will hold all the packets of the network. Communication is performed in rounds, where in each round a single client broadcasts a single (possibly encoded) information packet to its neighbors in G. The objective is to design a broadcast scheme that satisfies all clients with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2088","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:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HbPQwZxOUh4/yMLf0m0ztUKrYyf9/n+zmbsFegpXn/WuBqXEKZr+su7bAmvvqsfTwCOL5onW+o/0F1AkyuNUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:36:26.084193Z"},"content_sha256":"b8797bd87be0d6d80851363dfe6feab59d1d1a3d1e01ceee5d39db24442a496f","schema_version":"1.0","event_id":"sha256:b8797bd87be0d6d80851363dfe6feab59d1d1a3d1e01ceee5d39db24442a496f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U/bundle.json","state_url":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYXPMR72UROXQ6ILE37VFK4K4U/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-07-04T13:36:26Z","links":{"resolver":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U","bundle":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U/bundle.json","state":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYXPMR72UROXQ6ILE37VFK4K4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NYXPMR72UROXQ6ILE37VFK4K4U","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":"7beaa723999b6e45b083b6d59127fd39e878461d263334e3a5ed05104e56c92e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-09T19:42:26Z","title_canon_sha256":"b52a0553a608de3cf710596f6a61cac872d76be49d43423a41d3e212b7b1ac05"},"schema_version":"1.0","source":{"id":"1202.2088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2088","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2088v1","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2088","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"NYXPMR72UROX","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NYXPMR72UROXQ6IL","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NYXPMR72","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:b8797bd87be0d6d80851363dfe6feab59d1d1a3d1e01ceee5d39db24442a496f","target":"graph","created_at":"2026-05-18T04:02:38Z","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 the \"coded cooperative data exchange problem\" for general graphs. In this problem, given a graph G=(V,E) representing clients in a broadcast network, each of which initially hold a (not necessarily disjoint) set of information packets; one wishes to design a communication scheme in which eventually all clients will hold all the packets of the network. Communication is performed in rounds, where in each round a single client broadcasts a single (possibly encoded) information packet to its neighbors in G. The objective is to design a broadcast scheme that satisfies all clients with t","authors_text":"Michael Langberg, Mira Gonen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-09T19:42:26Z","title":"Coded Cooperative Data Exchange Problem for General Topologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2088","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:f2e9837792fc974006f18b7b71d4a1df10868cec6c84828d238ec9e5f5118934","target":"record","created_at":"2026-05-18T04:02:38Z","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":"7beaa723999b6e45b083b6d59127fd39e878461d263334e3a5ed05104e56c92e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-09T19:42:26Z","title_canon_sha256":"b52a0553a608de3cf710596f6a61cac872d76be49d43423a41d3e212b7b1ac05"},"schema_version":"1.0","source":{"id":"1202.2088","kind":"arxiv","version":1}},"canonical_sha256":"6e2ef647faa45d78790b26ff52ab8ae527ab5dd61f7cc658b4c7da85e6ec3ca0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e2ef647faa45d78790b26ff52ab8ae527ab5dd61f7cc658b4c7da85e6ec3ca0","first_computed_at":"2026-05-18T04:02:38.277204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:38.277204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X4E3uenc3fMfqI5IkkAHHnQBkpU5Vm+KzTXO8aVSRgQyDl60R4/DF/qBK//gsqc3UC4W4Euxr+jwPnlUz8X/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:38.277802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2e9837792fc974006f18b7b71d4a1df10868cec6c84828d238ec9e5f5118934","sha256:b8797bd87be0d6d80851363dfe6feab59d1d1a3d1e01ceee5d39db24442a496f"],"state_sha256":"cdb07af29c41eb932768b8c09f72e6e6fffccd60a5d473749a07ca6ea858b24a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UjGfsiB3Wa8B2FZIp5UXFCkirswvWWxHWnAJlSATtIBfX4jPZ8+5JoKF8voLf6QbEoBmD7TAHm9qRB3ys+WhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T13:36:26.086194Z","bundle_sha256":"3f655aa70368d4b5536c8a48dc8612323cd9c4b98354cb89efbae2ce1d27139e"}}