{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:E7I4WJC3XCYJIHNYFOHBM75VNK","short_pith_number":"pith:E7I4WJC3","canonical_record":{"source":{"id":"1406.1081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-04T15:45:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2244e3c0918c79ab623c0b56f7b3bb9c9f57473db479bc2535c6b15141cbebc2","abstract_canon_sha256":"f302fc1535371d7b1f34973349db464eeb381d3610a4b40a2fcabf025186b6e8"},"schema_version":"1.0"},"canonical_sha256":"27d1cb245bb8b0941db82b8e167fb56ab9e2ce7c299409e88c5234f634d08430","source":{"kind":"arxiv","id":"1406.1081","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1081","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1081v1","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1081","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"E7I4WJC3XCYJ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E7I4WJC3XCYJIHNY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E7I4WJC3","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:E7I4WJC3XCYJIHNYFOHBM75VNK","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-04T15:45:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2244e3c0918c79ab623c0b56f7b3bb9c9f57473db479bc2535c6b15141cbebc2","abstract_canon_sha256":"f302fc1535371d7b1f34973349db464eeb381d3610a4b40a2fcabf025186b6e8"},"schema_version":"1.0"},"canonical_sha256":"27d1cb245bb8b0941db82b8e167fb56ab9e2ce7c299409e88c5234f634d08430","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:30.391028Z","signature_b64":"oILXcCejJBrCLfNcU1AmU8/RJXGOs+AJQjox2EnqP8d6z085sfQQ8iZc+WIh6gk7U8iWU0Z+gyi2kfkT1P/DAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d1cb245bb8b0941db82b8e167fb56ab9e2ce7c299409e88c5234f634d08430","last_reissued_at":"2026-05-18T02:50:30.390527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:30.390527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1081","source_version":1,"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:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wp6tIpt5lYp5thZ7kumZ3Zi9qxUewx6MFYl+nB21TM/pqYWGOATpAuL8rxbTwr5AozBJiRkvh1wLh4lY9qbVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:31:26.260518Z"},"content_sha256":"0618a382bdf70fd47808676c1d46416f893869f71fdee1f23e7c5a13acab071e","schema_version":"1.0","event_id":"sha256:0618a382bdf70fd47808676c1d46416f893869f71fdee1f23e7c5a13acab071e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:E7I4WJC3XCYJIHNYFOHBM75VNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput Optimized Multi-Source Cooperative Networks With Compute-and-Forward","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"K. B. Letaief, P. Fan, Z. Chen","submitted_at":"2014-06-04T15:45:03Z","abstract_excerpt":"In this work, we investigate a multi-source multi-cast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal common multicast throughput of all source nodes if resource allocations are available. A transmission protocol employing the relaying strategy, namely, compute-and-forward (CPF), is proposed. {We also adjust the methods in the literature to obtain the integer network-constructed coefficient matrix (a naive method, a local optimal method as well as a global opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1081","kind":"arxiv","version":1},"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:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6IkF+RwPU6D0WZcnWllgpT5y1PQcH/XdFfR8pqIQcB4ztlW0ns2iFUs+n9rMqaK1S/sLUuirxljEPVcV3jKwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:31:26.261162Z"},"content_sha256":"e326410efeef4ad28249cce412698e282cd792669af22fefd628c7ebd6d51e9c","schema_version":"1.0","event_id":"sha256:e326410efeef4ad28249cce412698e282cd792669af22fefd628c7ebd6d51e9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7I4WJC3XCYJIHNYFOHBM75VNK/bundle.json","state_url":"https://pith.science/pith/E7I4WJC3XCYJIHNYFOHBM75VNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7I4WJC3XCYJIHNYFOHBM75VNK/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-08T02:31:26Z","links":{"resolver":"https://pith.science/pith/E7I4WJC3XCYJIHNYFOHBM75VNK","bundle":"https://pith.science/pith/E7I4WJC3XCYJIHNYFOHBM75VNK/bundle.json","state":"https://pith.science/pith/E7I4WJC3XCYJIHNYFOHBM75VNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7I4WJC3XCYJIHNYFOHBM75VNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:E7I4WJC3XCYJIHNYFOHBM75VNK","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":"f302fc1535371d7b1f34973349db464eeb381d3610a4b40a2fcabf025186b6e8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-04T15:45:03Z","title_canon_sha256":"2244e3c0918c79ab623c0b56f7b3bb9c9f57473db479bc2535c6b15141cbebc2"},"schema_version":"1.0","source":{"id":"1406.1081","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1081","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1081v1","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1081","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"E7I4WJC3XCYJ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E7I4WJC3XCYJIHNY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E7I4WJC3","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:e326410efeef4ad28249cce412698e282cd792669af22fefd628c7ebd6d51e9c","target":"graph","created_at":"2026-05-18T02:50:30Z","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 work, we investigate a multi-source multi-cast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal common multicast throughput of all source nodes if resource allocations are available. A transmission protocol employing the relaying strategy, namely, compute-and-forward (CPF), is proposed. {We also adjust the methods in the literature to obtain the integer network-constructed coefficient matrix (a naive method, a local optimal method as well as a global opti","authors_text":"K. B. Letaief, P. Fan, Z. Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-04T15:45:03Z","title":"Throughput Optimized Multi-Source Cooperative Networks With Compute-and-Forward"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1081","kind":"arxiv","version":1},"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:0618a382bdf70fd47808676c1d46416f893869f71fdee1f23e7c5a13acab071e","target":"record","created_at":"2026-05-18T02:50:30Z","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":"f302fc1535371d7b1f34973349db464eeb381d3610a4b40a2fcabf025186b6e8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-04T15:45:03Z","title_canon_sha256":"2244e3c0918c79ab623c0b56f7b3bb9c9f57473db479bc2535c6b15141cbebc2"},"schema_version":"1.0","source":{"id":"1406.1081","kind":"arxiv","version":1}},"canonical_sha256":"27d1cb245bb8b0941db82b8e167fb56ab9e2ce7c299409e88c5234f634d08430","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d1cb245bb8b0941db82b8e167fb56ab9e2ce7c299409e88c5234f634d08430","first_computed_at":"2026-05-18T02:50:30.390527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:30.390527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oILXcCejJBrCLfNcU1AmU8/RJXGOs+AJQjox2EnqP8d6z085sfQQ8iZc+WIh6gk7U8iWU0Z+gyi2kfkT1P/DAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:30.391028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1081","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0618a382bdf70fd47808676c1d46416f893869f71fdee1f23e7c5a13acab071e","sha256:e326410efeef4ad28249cce412698e282cd792669af22fefd628c7ebd6d51e9c"],"state_sha256":"4b294c3a39736a2ffb3069127a83dd30ca438b21c936cf222948ec5763cb5400"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLv36DLRh8l2L7QL5rYs2hNDjXCjP9BuHBKhHPt6HJcbw7RuIZs2Lfgq1IqZAn4OjxaJimdNDi5IguXc/qXrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:31:26.265052Z","bundle_sha256":"4f1a74ce9f4df31ef038379d1ce9469655471a05c6e53691208fa48457c1e463"}}