{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YJALS4FBLZ5Y7YUJQS5YBLCHT7","short_pith_number":"pith:YJALS4FB","canonical_record":{"source":{"id":"1304.4428","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-16T13:10:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"160cae793849c369892d659f78f31b50edd198b7de035f06c0e7162fee6f2cfd","abstract_canon_sha256":"afead5178d59d00e94636ab8660adfdab8e7f813c9cdc134fa4593462166a660"},"schema_version":"1.0"},"canonical_sha256":"c240b970a15e7b8fe28984bb80ac479fcabf15427f7314e31834b4de62dbb543","source":{"kind":"arxiv","id":"1304.4428","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4428","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4428v2","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4428","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"YJALS4FBLZ5Y","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YJALS4FBLZ5Y7YUJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YJALS4FB","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YJALS4FBLZ5Y7YUJQS5YBLCHT7","target":"record","payload":{"canonical_record":{"source":{"id":"1304.4428","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-16T13:10:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"160cae793849c369892d659f78f31b50edd198b7de035f06c0e7162fee6f2cfd","abstract_canon_sha256":"afead5178d59d00e94636ab8660adfdab8e7f813c9cdc134fa4593462166a660"},"schema_version":"1.0"},"canonical_sha256":"c240b970a15e7b8fe28984bb80ac479fcabf15427f7314e31834b4de62dbb543","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:13.267215Z","signature_b64":"wAI6gVt3/3FE9TwQDGyvxBH1qvug7IiVQPyonfePLYxiYTMPAFesAh7eUxKuh1/svmpXXEvu0go7mjnnGTY2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c240b970a15e7b8fe28984bb80ac479fcabf15427f7314e31834b4de62dbb543","last_reissued_at":"2026-05-18T03:27:13.266690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:13.266690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.4428","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:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8oRCiCZ2Ho8GorPzhmmC/hwkiukiRYC1epXzOltqmXDQ+tYLxvpbA/ymTnz/xQOHD3/VPV5dltqapuQ8I44gDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:04:42.042910Z"},"content_sha256":"36e59d7c4f286e70f92b05cb1bc49946fedf12757380a4ab423775379f35e72b","schema_version":"1.0","event_id":"sha256:36e59d7c4f286e70f92b05cb1bc49946fedf12757380a4ab423775379f35e72b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YJALS4FBLZ5Y7YUJQS5YBLCHT7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simplified Compute-and-Forward and Its Performance Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masoumeh Nasiri-Kenari, Mohsen Hejazi","submitted_at":"2013-04-16T13:10:53Z","abstract_excerpt":"The compute-and-forward (CMF) method has shown a great promise as an innovative approach to exploit interference toward achieving higher network throughput. The CMF was primarily introduced by means of information theory tools. While there have been some recent works discussing different aspects of efficient and practical implementation of CMF, there are still some issues that are not covered. In this paper, we first introduce a method to decrease the implementation complexity of the CMF method. We then evaluate the exact outage probability of our proposed simplified CMF scheme, and hereby pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4428","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:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITpJKHqKyBz5VdfUfer8w6EXFR+3yL9wO1ASUbEb2KSmhtG9M8iWSSJOMzOyozAZ8mjpjXSrhtWrLrnJUmRzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:04:42.043618Z"},"content_sha256":"0efbb061c7b61197dcbce879f96afa4a43affd6a3d8046f86a6fe79c6f6e99ab","schema_version":"1.0","event_id":"sha256:0efbb061c7b61197dcbce879f96afa4a43affd6a3d8046f86a6fe79c6f6e99ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YJALS4FBLZ5Y7YUJQS5YBLCHT7/bundle.json","state_url":"https://pith.science/pith/YJALS4FBLZ5Y7YUJQS5YBLCHT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YJALS4FBLZ5Y7YUJQS5YBLCHT7/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-11T15:04:42Z","links":{"resolver":"https://pith.science/pith/YJALS4FBLZ5Y7YUJQS5YBLCHT7","bundle":"https://pith.science/pith/YJALS4FBLZ5Y7YUJQS5YBLCHT7/bundle.json","state":"https://pith.science/pith/YJALS4FBLZ5Y7YUJQS5YBLCHT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YJALS4FBLZ5Y7YUJQS5YBLCHT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YJALS4FBLZ5Y7YUJQS5YBLCHT7","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":"afead5178d59d00e94636ab8660adfdab8e7f813c9cdc134fa4593462166a660","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-16T13:10:53Z","title_canon_sha256":"160cae793849c369892d659f78f31b50edd198b7de035f06c0e7162fee6f2cfd"},"schema_version":"1.0","source":{"id":"1304.4428","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4428","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4428v2","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4428","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"YJALS4FBLZ5Y","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YJALS4FBLZ5Y7YUJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YJALS4FB","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:0efbb061c7b61197dcbce879f96afa4a43affd6a3d8046f86a6fe79c6f6e99ab","target":"graph","created_at":"2026-05-18T03:27:13Z","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":"The compute-and-forward (CMF) method has shown a great promise as an innovative approach to exploit interference toward achieving higher network throughput. The CMF was primarily introduced by means of information theory tools. While there have been some recent works discussing different aspects of efficient and practical implementation of CMF, there are still some issues that are not covered. In this paper, we first introduce a method to decrease the implementation complexity of the CMF method. We then evaluate the exact outage probability of our proposed simplified CMF scheme, and hereby pro","authors_text":"Masoumeh Nasiri-Kenari, Mohsen Hejazi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-16T13:10:53Z","title":"Simplified Compute-and-Forward and Its Performance Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4428","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:36e59d7c4f286e70f92b05cb1bc49946fedf12757380a4ab423775379f35e72b","target":"record","created_at":"2026-05-18T03:27:13Z","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":"afead5178d59d00e94636ab8660adfdab8e7f813c9cdc134fa4593462166a660","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-16T13:10:53Z","title_canon_sha256":"160cae793849c369892d659f78f31b50edd198b7de035f06c0e7162fee6f2cfd"},"schema_version":"1.0","source":{"id":"1304.4428","kind":"arxiv","version":2}},"canonical_sha256":"c240b970a15e7b8fe28984bb80ac479fcabf15427f7314e31834b4de62dbb543","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c240b970a15e7b8fe28984bb80ac479fcabf15427f7314e31834b4de62dbb543","first_computed_at":"2026-05-18T03:27:13.266690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:13.266690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wAI6gVt3/3FE9TwQDGyvxBH1qvug7IiVQPyonfePLYxiYTMPAFesAh7eUxKuh1/svmpXXEvu0go7mjnnGTY2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:13.267215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4428","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36e59d7c4f286e70f92b05cb1bc49946fedf12757380a4ab423775379f35e72b","sha256:0efbb061c7b61197dcbce879f96afa4a43affd6a3d8046f86a6fe79c6f6e99ab"],"state_sha256":"1732690015fd2b60e8087e3778a71b6f1bb0ef9ccc18dfd43610c9bb6dd9e48f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4f08zuOnif4tT5fWKiXw8SeZ/DkevkU/biJajrfacawzk6R+9mDsd8OCpI5VAwReguuv34+A47N7ZMXhFDVTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:04:42.047580Z","bundle_sha256":"fe49f24bfea76d64f48ad691399589ba6bb12ad51b15ce6cef0c9ccb135093b1"}}