{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JA5X3RMG3QG7VSHOIGVDHYHHO2","short_pith_number":"pith:JA5X3RMG","canonical_record":{"source":{"id":"1207.0877","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T02:05:53Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"2e4a053497e3f6ed264ed895ea8773673d9216d81047cf0bbd7d57bb64f90a6a","abstract_canon_sha256":"f64879afed952abc588ac17ffe7989cd8983a601afae87d8bc15c8b46d8d5ccf"},"schema_version":"1.0"},"canonical_sha256":"483b7dc586dc0dfac8ee41aa33e0e7768075486d42e58870499401d001942173","source":{"kind":"arxiv","id":"1207.0877","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0877","created_at":"2026-05-18T03:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0877v2","created_at":"2026-05-18T03:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0877","created_at":"2026-05-18T03:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"JA5X3RMG3QG7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JA5X3RMG3QG7VSHO","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JA5X3RMG","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JA5X3RMG3QG7VSHOIGVDHYHHO2","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0877","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T02:05:53Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"2e4a053497e3f6ed264ed895ea8773673d9216d81047cf0bbd7d57bb64f90a6a","abstract_canon_sha256":"f64879afed952abc588ac17ffe7989cd8983a601afae87d8bc15c8b46d8d5ccf"},"schema_version":"1.0"},"canonical_sha256":"483b7dc586dc0dfac8ee41aa33e0e7768075486d42e58870499401d001942173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:15.413454Z","signature_b64":"2j5At2za5o33J5e3hJ+9Kz0pQSuxKiMlp7203bA4grKvgB66Z14QSwNuIS+VxMtGQV3kbKeBQ6Qqzd+7CyYhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"483b7dc586dc0dfac8ee41aa33e0e7768075486d42e58870499401d001942173","last_reissued_at":"2026-05-18T03:51:15.412923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:15.412923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0877","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-18T03:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNVZhv/X3oAlQdMTPZKRu4TGW5I9OzwrbCqUHePorPcbd5WW7m+d8wSN2WuxEWBKZ5sqnEDseR7C8vRif370AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:12:00.380036Z"},"content_sha256":"5774756476d04460b322e5ecac9e0817b21674a9bd0a5cfdd602825d176378d9","schema_version":"1.0","event_id":"sha256:5774756476d04460b322e5ecac9e0817b21674a9bd0a5cfdd602825d176378d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JA5X3RMG3QG7VSHOIGVDHYHHO2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exchanging Third-Party Information with Minimum Transmission Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Jing Li (Tiffany), Wentu Song, Xiumin Wang","submitted_at":"2012-07-04T02:05:53Z","abstract_excerpt":"In this paper, we consider the problem of minimizing the total transmission cost for exchanging channel state information. We proposed a network coded cooperative data exchange scheme, such that the total transmission cost is minimized while each client can decode all the channel information held by all other clients. In this paper, we first derive a necessary and sufficient condition for a feasible transmission. Based on the derived condition, there exists a feasible code design to guarantee that each client can decode the complete information. We further formulate the problem of minimizing t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0877","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-18T03:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3A0fj1RcT6SMdBSiVvVpeYNA9WF/NDt9SbAWkNYBZpopE62V0SXM6UWx67bjC9vau+XL8CkA/qR1G6QyEZn3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:12:00.380589Z"},"content_sha256":"85827cb3f50a0f3614af91ae68169bf5c61c9ae71c4edcfc01e5cb2646e2db30","schema_version":"1.0","event_id":"sha256:85827cb3f50a0f3614af91ae68169bf5c61c9ae71c4edcfc01e5cb2646e2db30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JA5X3RMG3QG7VSHOIGVDHYHHO2/bundle.json","state_url":"https://pith.science/pith/JA5X3RMG3QG7VSHOIGVDHYHHO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JA5X3RMG3QG7VSHOIGVDHYHHO2/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-06-03T23:12:00Z","links":{"resolver":"https://pith.science/pith/JA5X3RMG3QG7VSHOIGVDHYHHO2","bundle":"https://pith.science/pith/JA5X3RMG3QG7VSHOIGVDHYHHO2/bundle.json","state":"https://pith.science/pith/JA5X3RMG3QG7VSHOIGVDHYHHO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JA5X3RMG3QG7VSHOIGVDHYHHO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JA5X3RMG3QG7VSHOIGVDHYHHO2","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":"f64879afed952abc588ac17ffe7989cd8983a601afae87d8bc15c8b46d8d5ccf","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T02:05:53Z","title_canon_sha256":"2e4a053497e3f6ed264ed895ea8773673d9216d81047cf0bbd7d57bb64f90a6a"},"schema_version":"1.0","source":{"id":"1207.0877","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0877","created_at":"2026-05-18T03:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0877v2","created_at":"2026-05-18T03:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0877","created_at":"2026-05-18T03:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"JA5X3RMG3QG7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JA5X3RMG3QG7VSHO","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JA5X3RMG","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:85827cb3f50a0f3614af91ae68169bf5c61c9ae71c4edcfc01e5cb2646e2db30","target":"graph","created_at":"2026-05-18T03:51:15Z","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":"In this paper, we consider the problem of minimizing the total transmission cost for exchanging channel state information. We proposed a network coded cooperative data exchange scheme, such that the total transmission cost is minimized while each client can decode all the channel information held by all other clients. In this paper, we first derive a necessary and sufficient condition for a feasible transmission. Based on the derived condition, there exists a feasible code design to guarantee that each client can decode the complete information. We further formulate the problem of minimizing t","authors_text":"Chau Yuen, Jing Li (Tiffany), Wentu Song, Xiumin Wang","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T02:05:53Z","title":"Exchanging Third-Party Information with Minimum Transmission Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0877","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:5774756476d04460b322e5ecac9e0817b21674a9bd0a5cfdd602825d176378d9","target":"record","created_at":"2026-05-18T03:51:15Z","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":"f64879afed952abc588ac17ffe7989cd8983a601afae87d8bc15c8b46d8d5ccf","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-04T02:05:53Z","title_canon_sha256":"2e4a053497e3f6ed264ed895ea8773673d9216d81047cf0bbd7d57bb64f90a6a"},"schema_version":"1.0","source":{"id":"1207.0877","kind":"arxiv","version":2}},"canonical_sha256":"483b7dc586dc0dfac8ee41aa33e0e7768075486d42e58870499401d001942173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"483b7dc586dc0dfac8ee41aa33e0e7768075486d42e58870499401d001942173","first_computed_at":"2026-05-18T03:51:15.412923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:15.412923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2j5At2za5o33J5e3hJ+9Kz0pQSuxKiMlp7203bA4grKvgB66Z14QSwNuIS+VxMtGQV3kbKeBQ6Qqzd+7CyYhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:15.413454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0877","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5774756476d04460b322e5ecac9e0817b21674a9bd0a5cfdd602825d176378d9","sha256:85827cb3f50a0f3614af91ae68169bf5c61c9ae71c4edcfc01e5cb2646e2db30"],"state_sha256":"6800c9bd4fe7aab9dad7ea9ab5dbac7985f5f4457e8c87169a6547321e63c477"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/YjWSvSp2lfCWZxbhO86j9Ji3sPWSEVN2K6gC7Wet5azLS9mpC2S3zNVEmlIKdQ3upUIyS2GyTwxzyRqKwHeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:12:00.383251Z","bundle_sha256":"74ff06821f43bade7461d460c3c9ebfffd2634620feb396b22d359f85e8ea334"}}