{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NYXPMR72UROXQ6ILE37VFK4K4U","short_pith_number":"pith:NYXPMR72","schema_version":"1.0","canonical_sha256":"6e2ef647faa45d78790b26ff52ab8ae527ab5dd61f7cc658b4c7da85e6ec3ca0","source":{"kind":"arxiv","id":"1202.2088","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.2088","created_at":"2026-05-18T04:02:38.277302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2088v1","created_at":"2026-05-18T04:02:38.277302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2088","created_at":"2026-05-18T04:02:38.277302+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYXPMR72UROX","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYXPMR72UROXQ6IL","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYXPMR72","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U","json":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U.json","graph_json":"https://pith.science/api/pith-number/NYXPMR72UROXQ6ILE37VFK4K4U/graph.json","events_json":"https://pith.science/api/pith-number/NYXPMR72UROXQ6ILE37VFK4K4U/events.json","paper":"https://pith.science/paper/NYXPMR72"},"agent_actions":{"view_html":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U","download_json":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U.json","view_paper":"https://pith.science/paper/NYXPMR72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2088&json=true","fetch_graph":"https://pith.science/api/pith-number/NYXPMR72UROXQ6ILE37VFK4K4U/graph.json","fetch_events":"https://pith.science/api/pith-number/NYXPMR72UROXQ6ILE37VFK4K4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U/action/storage_attestation","attest_author":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U/action/author_attestation","sign_citation":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U/action/citation_signature","submit_replication":"https://pith.science/pith/NYXPMR72UROXQ6ILE37VFK4K4U/action/replication_record"}},"created_at":"2026-05-18T04:02:38.277302+00:00","updated_at":"2026-05-18T04:02:38.277302+00:00"}