{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5HKEHMSNDTODLNI66AJL4LXP7G","short_pith_number":"pith:5HKEHMSN","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"},"canonical_sha256":"e9d443b24d1cdc35b51ef012be2eeff988cab09145a025936f0396b3eca52f25","source":{"kind":"arxiv","id":"1502.03518","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03518","created_at":"2026-05-18T01:36:38Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03518v4","created_at":"2026-05-18T01:36:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03518","created_at":"2026-05-18T01:36:38Z"},{"alias_kind":"pith_short_12","alias_value":"5HKEHMSNDTOD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5HKEHMSNDTODLNI6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5HKEHMSN","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5HKEHMSNDTODLNI66AJL4LXP7G","target":"record","payload":{"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"},"canonical_sha256":"e9d443b24d1cdc35b51ef012be2eeff988cab09145a025936f0396b3eca52f25","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"},"source_kind":"arxiv","source_id":"1502.03518","source_version":4,"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-18T01:36:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaCg+70IWYD340QOxPE4zLY+EbOs52pgttaWUQX24GjjtbMsvQ+mpHGGszzFyliGu3I2oEhyqubNddwgGeQ/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T00:25:50.157793Z"},"content_sha256":"9e2b4c3503ecd5957e458cb6572439bfc482704ce7216b52944f8136f825c15a","schema_version":"1.0","event_id":"sha256:9e2b4c3503ecd5957e458cb6572439bfc482704ce7216b52944f8136f825c15a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5HKEHMSNDTODLNI66AJL4LXP7G","target":"graph","payload":{"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"},"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-18T01:36:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H5woQLB3WFoODF5yWcCH+i8uaKhvp+Uu7F0OEZDazQhr7tEGyMDCBaRPnPCJ56RUJF+A7MW9gq/EX6hwr1q/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T00:25:50.158133Z"},"content_sha256":"c63ef8965d26939bd86fdf81308f7944a98e9e33d07840a50cc080c98f5d22ce","schema_version":"1.0","event_id":"sha256:c63ef8965d26939bd86fdf81308f7944a98e9e33d07840a50cc080c98f5d22ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G/bundle.json","state_url":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HKEHMSNDTODLNI66AJL4LXP7G/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-03T00:25:50Z","links":{"resolver":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G","bundle":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G/bundle.json","state":"https://pith.science/pith/5HKEHMSNDTODLNI66AJL4LXP7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HKEHMSNDTODLNI66AJL4LXP7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5HKEHMSNDTODLNI66AJL4LXP7G","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":"60e59579f74eaf3729849c8b6bf4924e9f9fb8562ff6643f5966e63a814ae561","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-12T02:29:00Z","title_canon_sha256":"c296f74782efa10c98300a85bc50b2da16ff00badcdac424e3e7f88dff4b9735"},"schema_version":"1.0","source":{"id":"1502.03518","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03518","created_at":"2026-05-18T01:36:38Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03518v4","created_at":"2026-05-18T01:36:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03518","created_at":"2026-05-18T01:36:38Z"},{"alias_kind":"pith_short_12","alias_value":"5HKEHMSNDTOD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5HKEHMSNDTODLNI6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5HKEHMSN","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:c63ef8965d26939bd86fdf81308f7944a98e9e33d07840a50cc080c98f5d22ce","target":"graph","created_at":"2026-05-18T01:36: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":"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 ","authors_text":"Ni Ding, Parastoo Sadeghi, Rodney A. Kennedy","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-12T02:29:00Z","title":"Estimating Minimum Sum-rate for Cooperative Data Exchange"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03518","kind":"arxiv","version":4},"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:9e2b4c3503ecd5957e458cb6572439bfc482704ce7216b52944f8136f825c15a","target":"record","created_at":"2026-05-18T01:36: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":"60e59579f74eaf3729849c8b6bf4924e9f9fb8562ff6643f5966e63a814ae561","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-12T02:29:00Z","title_canon_sha256":"c296f74782efa10c98300a85bc50b2da16ff00badcdac424e3e7f88dff4b9735"},"schema_version":"1.0","source":{"id":"1502.03518","kind":"arxiv","version":4}},"canonical_sha256":"e9d443b24d1cdc35b51ef012be2eeff988cab09145a025936f0396b3eca52f25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9d443b24d1cdc35b51ef012be2eeff988cab09145a025936f0396b3eca52f25","first_computed_at":"2026-05-18T01:36:38.464103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:38.464103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4X5/SjE67wjjlpye/WK008T9pTvIQr/z70lR/ljb27MuFor8uftQOSQ988A/dUb5ZOXeKs9g4dsc8musyOsoAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:38.464850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03518","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e2b4c3503ecd5957e458cb6572439bfc482704ce7216b52944f8136f825c15a","sha256:c63ef8965d26939bd86fdf81308f7944a98e9e33d07840a50cc080c98f5d22ce"],"state_sha256":"cb5f06b85dacfde6174faee663ad8342da006168444d9e443f66a98519c779a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBqmUGh7z6EHwj+Lkuqn98DgmOrRdIPJqWtvLMFH0VXzzGIVl5NrMFerkwx4aibtzCNJaw1h43N1P+Xgm6c0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T00:25:50.160114Z","bundle_sha256":"426379915a189d80f71bc6090d7d76b40ff6c7c40770fbe51d2390a1bf3c4cf2"}}