{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5HKEHMSNDTODLNI66AJL4LXP7G","short_pith_number":"pith:5HKEHMSN","schema_version":"1.0","canonical_sha256":"e9d443b24d1cdc35b51ef012be2eeff988cab09145a025936f0396b3eca52f25","source":{"kind":"arxiv","id":"1502.03518","version":4},"attestation_state":"computed","paper":{"title":"Estimating Minimum Sum-rate for Cooperative Data Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Ni Ding, Parastoo Sadeghi, Rodney A. Kennedy","submitted_at":"2015-02-12T02:29:00Z","abstract_excerpt":"This paper considers how to accurately estimate the minimum sum-rate so as to reduce the complexity of solving cooperative data exchange (CDE) problems. The CDE system contains a number of geographically close clients who send packets to help the others recover an entire packet set. The minimum sum-rate is the minimum value of total number of transmissions that achieves universal recovery (the situation when all the clients recover the whole packet set). Based on a necessary and sufficient condition for a supermodular base polyhedron to be nonempty, we show that the minimum sum-rate for a CDE "},"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":"1502.03518","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-12T02:29:00Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"c296f74782efa10c98300a85bc50b2da16ff00badcdac424e3e7f88dff4b9735","abstract_canon_sha256":"60e59579f74eaf3729849c8b6bf4924e9f9fb8562ff6643f5966e63a814ae561"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:38.464850Z","signature_b64":"4X5/SjE67wjjlpye/WK008T9pTvIQr/z70lR/ljb27MuFor8uftQOSQ988A/dUb5ZOXeKs9g4dsc8musyOsoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9d443b24d1cdc35b51ef012be2eeff988cab09145a025936f0396b3eca52f25","last_reissued_at":"2026-05-18T01:36:38.464103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:38.464103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating Minimum Sum-rate for Cooperative Data Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Ni Ding, Parastoo Sadeghi, Rodney A. Kennedy","submitted_at":"2015-02-12T02:29:00Z","abstract_excerpt":"This paper considers how to accurately estimate the minimum sum-rate so as to reduce the complexity of solving cooperative data exchange (CDE) problems. The CDE system contains a number of geographically close clients who send packets to help the others recover an entire packet set. The minimum sum-rate is the minimum value of total number of transmissions that achieves universal recovery (the situation when all the clients recover the whole packet set). Based on a necessary and sufficient condition for a supermodular base polyhedron to be nonempty, we show that the minimum sum-rate for a CDE "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03518","kind":"arxiv","version":4},"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":"1502.03518","created_at":"2026-05-18T01:36:38.464240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03518v4","created_at":"2026-05-18T01:36:38.464240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03518","created_at":"2026-05-18T01:36:38.464240+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HKEHMSNDTOD","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HKEHMSNDTODLNI6","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HKEHMSN","created_at":"2026-05-18T12:29:05.191682+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/5HKEHMSNDTODLNI66AJL4LXP7G","json":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G.json","graph_json":"https://pith.science/api/pith-number/5HKEHMSNDTODLNI66AJL4LXP7G/graph.json","events_json":"https://pith.science/api/pith-number/5HKEHMSNDTODLNI66AJL4LXP7G/events.json","paper":"https://pith.science/paper/5HKEHMSN"},"agent_actions":{"view_html":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G","download_json":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G.json","view_paper":"https://pith.science/paper/5HKEHMSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03518&json=true","fetch_graph":"https://pith.science/api/pith-number/5HKEHMSNDTODLNI66AJL4LXP7G/graph.json","fetch_events":"https://pith.science/api/pith-number/5HKEHMSNDTODLNI66AJL4LXP7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G/action/storage_attestation","attest_author":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G/action/author_attestation","sign_citation":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G/action/citation_signature","submit_replication":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G/action/replication_record"}},"created_at":"2026-05-18T01:36:38.464240+00:00","updated_at":"2026-05-18T01:36:38.464240+00:00"}