{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IWB47FVQ6RZSXCZCLFGBM3FG3Y","short_pith_number":"pith:IWB47FVQ","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"},"canonical_sha256":"4583cf96b0f4732b8b22594c166ca6de127d34b80925eb55d6b3f7c550bc275a","source":{"kind":"arxiv","id":"1503.03165","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03165","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03165v2","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03165","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"IWB47FVQ6RZS","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IWB47FVQ6RZSXCZC","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IWB47FVQ","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IWB47FVQ6RZSXCZCLFGBM3FG3Y","target":"record","payload":{"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"},"canonical_sha256":"4583cf96b0f4732b8b22594c166ca6de127d34b80925eb55d6b3f7c550bc275a","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"},"source_kind":"arxiv","source_id":"1503.03165","source_version":2,"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-18T02:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccI8zmvn6lwRfcmRfHBWRRDAwIlmdSU9pGriMB1eq08J5o/vr/CaROxN9U3Y87Np2qzbeWdL9GZLprtv2bkoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T08:02:58.055054Z"},"content_sha256":"1bdc9f8281a190169b11006c20165a44ec272976dcf8ef3df2d7d19b1dc26542","schema_version":"1.0","event_id":"sha256:1bdc9f8281a190169b11006c20165a44ec272976dcf8ef3df2d7d19b1dc26542"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IWB47FVQ6RZSXCZCLFGBM3FG3Y","target":"graph","payload":{"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"},"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-18T02:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvQ07sQtvs5VoT9QkFVmlFav0BcoIRQ3Ohemr5YvxdSHm1vgRsIiVHLTbg1BLO6SPli247oNwXHvnuysgV0KCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T08:02:58.055437Z"},"content_sha256":"88d706c8ab1fbfca01f8d3ffbbf1c0e0929089d84d6cbb0bb9590cf5b2530200","schema_version":"1.0","event_id":"sha256:88d706c8ab1fbfca01f8d3ffbbf1c0e0929089d84d6cbb0bb9590cf5b2530200"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y/bundle.json","state_url":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y/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-03T08:02:58Z","links":{"resolver":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y","bundle":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y/bundle.json","state":"https://pith.science/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWB47FVQ6RZSXCZCLFGBM3FG3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IWB47FVQ6RZSXCZCLFGBM3FG3Y","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":"f57a21bac97009deae5f87d7714a932007a8cc71a98ee6490b010027d94804dc","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-11T04:00:13Z","title_canon_sha256":"d6d5320bbd8a995564edad6608848837e90c979be6e618b45333d257186796fe"},"schema_version":"1.0","source":{"id":"1503.03165","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03165","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03165v2","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03165","created_at":"2026-05-18T02:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"IWB47FVQ6RZS","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IWB47FVQ6RZSXCZC","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IWB47FVQ","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:88d706c8ab1fbfca01f8d3ffbbf1c0e0929089d84d6cbb0bb9590cf5b2530200","target":"graph","created_at":"2026-05-18T02:00:02Z","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 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","authors_text":"Ni Ding, Parastoo Sadeghi, Rodney A. Kennedy","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-11T04:00:13Z","title":"Iterative Merging Algorithm for Cooperative Data Exchange"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03165","kind":"arxiv","version":2},"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:1bdc9f8281a190169b11006c20165a44ec272976dcf8ef3df2d7d19b1dc26542","target":"record","created_at":"2026-05-18T02:00:02Z","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":"f57a21bac97009deae5f87d7714a932007a8cc71a98ee6490b010027d94804dc","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-11T04:00:13Z","title_canon_sha256":"d6d5320bbd8a995564edad6608848837e90c979be6e618b45333d257186796fe"},"schema_version":"1.0","source":{"id":"1503.03165","kind":"arxiv","version":2}},"canonical_sha256":"4583cf96b0f4732b8b22594c166ca6de127d34b80925eb55d6b3f7c550bc275a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4583cf96b0f4732b8b22594c166ca6de127d34b80925eb55d6b3f7c550bc275a","first_computed_at":"2026-05-18T02:00:02.113343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:02.113343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AePNBOV/BPc3Js9za6KzJGbPU7UbDjj7WrSLHyE44iQs6d48wQrdU6nlWOLpydX3UoSoWLdLJYkJ3Y9r4VHWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:02.113884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03165","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bdc9f8281a190169b11006c20165a44ec272976dcf8ef3df2d7d19b1dc26542","sha256:88d706c8ab1fbfca01f8d3ffbbf1c0e0929089d84d6cbb0bb9590cf5b2530200"],"state_sha256":"520e42ce1897142bcb9772f7687709a17ba77ff72f5938a6e03c3f5017e74c82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2haQ3DhXEaKnmMMXXlWE0r6WqMfKTr8lEXxrJ8clEDHAvJw8i4U6GJSWBISLzpScEV/RtLPs6Cxn/MsVjTVODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T08:02:58.057705Z","bundle_sha256":"8782de32a444f80cdbc5d125b71443404d17499494eefb47bf42b804e76d5df2"}}