{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IWB47FVQ6RZSXCZCLFGBM3FG3Y","short_pith_number":"pith:IWB47FVQ","schema_version":"1.0","canonical_sha256":"4583cf96b0f4732b8b22594c166ca6de127d34b80925eb55d6b3f7c550bc275a","source":{"kind":"arxiv","id":"1503.03165","version":2},"attestation_state":"computed","paper":{"title":"Iterative Merging Algorithm for Cooperative Data Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Ni Ding, Parastoo Sadeghi, Rodney A. Kennedy","submitted_at":"2015-03-11T04:00:13Z","abstract_excerpt":"We consider the problem of finding the minimum sum-rate strategy in cooperative data exchange systems that do not allow packet-splitting (NPS-CDE). In an NPS-CDE system, there are a number of geographically close cooperative clients who send packets to help the others recover a packet set. A minimum sum-rate strategy is the strategy that achieves universal recovery (the situation when all the clients recover the whole packet set) with the the minimal sum-rate (the total number of transmissions). We propose an iterative merging (IM) algorithm that recursively merges client sets based on a lower"},"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":"1503.03165","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-11T04:00:13Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d6d5320bbd8a995564edad6608848837e90c979be6e618b45333d257186796fe","abstract_canon_sha256":"f57a21bac97009deae5f87d7714a932007a8cc71a98ee6490b010027d94804dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:02.113884Z","signature_b64":"AePNBOV/BPc3Js9za6KzJGbPU7UbDjj7WrSLHyE44iQs6d48wQrdU6nlWOLpydX3UoSoWLdLJYkJ3Y9r4VHWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4583cf96b0f4732b8b22594c166ca6de127d34b80925eb55d6b3f7c550bc275a","last_reissued_at":"2026-05-18T02:00:02.113343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:02.113343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Merging Algorithm for Cooperative Data Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Ni Ding, Parastoo Sadeghi, Rodney A. Kennedy","submitted_at":"2015-03-11T04:00:13Z","abstract_excerpt":"We consider the problem of finding the minimum sum-rate strategy in cooperative data exchange systems that do not allow packet-splitting (NPS-CDE). In an NPS-CDE system, there are a number of geographically close cooperative clients who send packets to help the others recover a packet set. A minimum sum-rate strategy is the strategy that achieves universal recovery (the situation when all the clients recover the whole packet set) with the the minimal sum-rate (the total number of transmissions). We propose an iterative merging (IM) algorithm that recursively merges client sets based on a lower"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03165","kind":"arxiv","version":2},"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":"1503.03165","created_at":"2026-05-18T02:00:02.113429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03165v2","created_at":"2026-05-18T02:00:02.113429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03165","created_at":"2026-05-18T02:00:02.113429+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWB47FVQ6RZS","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWB47FVQ6RZSXCZC","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWB47FVQ","created_at":"2026-05-18T12:29:27.538025+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/IWB47FVQ6RZSXCZCLFGBM3FG3Y","json":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y.json","graph_json":"https://pith.science/api/pith-number/IWB47FVQ6RZSXCZCLFGBM3FG3Y/graph.json","events_json":"https://pith.science/api/pith-number/IWB47FVQ6RZSXCZCLFGBM3FG3Y/events.json","paper":"https://pith.science/paper/IWB47FVQ"},"agent_actions":{"view_html":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y","download_json":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y.json","view_paper":"https://pith.science/paper/IWB47FVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03165&json=true","fetch_graph":"https://pith.science/api/pith-number/IWB47FVQ6RZSXCZCLFGBM3FG3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/IWB47FVQ6RZSXCZCLFGBM3FG3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y/action/storage_attestation","attest_author":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y/action/author_attestation","sign_citation":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y/action/citation_signature","submit_replication":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y/action/replication_record"}},"created_at":"2026-05-18T02:00:02.113429+00:00","updated_at":"2026-05-18T02:00:02.113429+00:00"}