{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Y62BFDOEGI4HPWIZAKUL2TVFUZ","short_pith_number":"pith:Y62BFDOE","canonical_record":{"source":{"id":"1504.03182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-13T13:48:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"608321bb9e7b4167dbdb992c5bbac2f4a0c5514796d3f634bdd4cb78bafd5c04","abstract_canon_sha256":"9b293b839ba087d8d4523bec2e90be06f255c070dbcc15baaf8e0e5e14d8349a"},"schema_version":"1.0"},"canonical_sha256":"c7b4128dc4323877d91902a8bd4ea5a678e1cf101467ce27e6ed504b06ed2038","source":{"kind":"arxiv","id":"1504.03182","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03182","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03182v2","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03182","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"pith_short_12","alias_value":"Y62BFDOEGI4H","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y62BFDOEGI4HPWIZ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y62BFDOE","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Y62BFDOEGI4HPWIZAKUL2TVFUZ","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-13T13:48:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"608321bb9e7b4167dbdb992c5bbac2f4a0c5514796d3f634bdd4cb78bafd5c04","abstract_canon_sha256":"9b293b839ba087d8d4523bec2e90be06f255c070dbcc15baaf8e0e5e14d8349a"},"schema_version":"1.0"},"canonical_sha256":"c7b4128dc4323877d91902a8bd4ea5a678e1cf101467ce27e6ed504b06ed2038","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:30.929951Z","signature_b64":"Wcm3aG9lhvXxJLAfsdS5Q25suMZxRtUCJa2EEAmRfoEHZxqeywqO8guRG5ruwSBV3SoqsvTn52UECYarbhMmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7b4128dc4323877d91902a8bd4ea5a678e1cf101467ce27e6ed504b06ed2038","last_reissued_at":"2026-05-18T02:18:30.929333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:30.929333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03182","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:18:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ewmq81CgtG8Miyl7oEkSBsqx2voPRepdlVjUp5/2wnSPDwrWErJUzNStooc2eWqAr2TXzMjZOtix2LFtFxOlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:56:28.832489Z"},"content_sha256":"11ee0c22d66d903fc270305e735004fd23e1a21744ed6455db283b06abb041bf","schema_version":"1.0","event_id":"sha256:11ee0c22d66d903fc270305e735004fd23e1a21744ed6455db283b06abb041bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Y62BFDOEGI4HPWIZAKUL2TVFUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Low-Complexity Message Recovery Method for Compute-and-Forward Relaying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amaro Barreal, Camilla Hollanti, David Karpuk, Joonas P\\\"a\\\"akk\\\"onen, Olav Tirkkonen","submitted_at":"2015-04-13T13:48:59Z","abstract_excerpt":"The Compute-and-Forward relaying strategy achieves high computation rates by decoding linear combinations of transmitted messages at intermediate relays. However, if the involved relays independently choose which combinations of the messages to decode, there is no guarantee that the overall system of linear equations is solvable at the destination. In this article it is shown that, for a Gaussian fading channel model with two transmitters and two relays, always choosing the combination that maximizes the computation rate often leads to a case where the original messages cannot be recovered. It"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03182","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:18:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IWeXmQZ3j3TOmN3TLnS9m7aNOKmsyv7A9bT1i4VovByn4/pD40qJamL8Mqb5HM9PYIAvSbXm0Ygv4El4a+J1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:56:28.832829Z"},"content_sha256":"74af9b6c9ed4e5a24b9759db934878f2235583b4c7d40158ce04d4b944cd71e5","schema_version":"1.0","event_id":"sha256:74af9b6c9ed4e5a24b9759db934878f2235583b4c7d40158ce04d4b944cd71e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y62BFDOEGI4HPWIZAKUL2TVFUZ/bundle.json","state_url":"https://pith.science/pith/Y62BFDOEGI4HPWIZAKUL2TVFUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y62BFDOEGI4HPWIZAKUL2TVFUZ/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-07T01:56:28Z","links":{"resolver":"https://pith.science/pith/Y62BFDOEGI4HPWIZAKUL2TVFUZ","bundle":"https://pith.science/pith/Y62BFDOEGI4HPWIZAKUL2TVFUZ/bundle.json","state":"https://pith.science/pith/Y62BFDOEGI4HPWIZAKUL2TVFUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y62BFDOEGI4HPWIZAKUL2TVFUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Y62BFDOEGI4HPWIZAKUL2TVFUZ","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":"9b293b839ba087d8d4523bec2e90be06f255c070dbcc15baaf8e0e5e14d8349a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-13T13:48:59Z","title_canon_sha256":"608321bb9e7b4167dbdb992c5bbac2f4a0c5514796d3f634bdd4cb78bafd5c04"},"schema_version":"1.0","source":{"id":"1504.03182","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03182","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03182v2","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03182","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"pith_short_12","alias_value":"Y62BFDOEGI4H","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y62BFDOEGI4HPWIZ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y62BFDOE","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:74af9b6c9ed4e5a24b9759db934878f2235583b4c7d40158ce04d4b944cd71e5","target":"graph","created_at":"2026-05-18T02:18: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":"The Compute-and-Forward relaying strategy achieves high computation rates by decoding linear combinations of transmitted messages at intermediate relays. However, if the involved relays independently choose which combinations of the messages to decode, there is no guarantee that the overall system of linear equations is solvable at the destination. In this article it is shown that, for a Gaussian fading channel model with two transmitters and two relays, always choosing the combination that maximizes the computation rate often leads to a case where the original messages cannot be recovered. It","authors_text":"Amaro Barreal, Camilla Hollanti, David Karpuk, Joonas P\\\"a\\\"akk\\\"onen, Olav Tirkkonen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-13T13:48:59Z","title":"A Low-Complexity Message Recovery Method for Compute-and-Forward Relaying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03182","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:11ee0c22d66d903fc270305e735004fd23e1a21744ed6455db283b06abb041bf","target":"record","created_at":"2026-05-18T02:18: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":"9b293b839ba087d8d4523bec2e90be06f255c070dbcc15baaf8e0e5e14d8349a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-13T13:48:59Z","title_canon_sha256":"608321bb9e7b4167dbdb992c5bbac2f4a0c5514796d3f634bdd4cb78bafd5c04"},"schema_version":"1.0","source":{"id":"1504.03182","kind":"arxiv","version":2}},"canonical_sha256":"c7b4128dc4323877d91902a8bd4ea5a678e1cf101467ce27e6ed504b06ed2038","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7b4128dc4323877d91902a8bd4ea5a678e1cf101467ce27e6ed504b06ed2038","first_computed_at":"2026-05-18T02:18:30.929333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:30.929333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wcm3aG9lhvXxJLAfsdS5Q25suMZxRtUCJa2EEAmRfoEHZxqeywqO8guRG5ruwSBV3SoqsvTn52UECYarbhMmDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:30.929951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03182","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11ee0c22d66d903fc270305e735004fd23e1a21744ed6455db283b06abb041bf","sha256:74af9b6c9ed4e5a24b9759db934878f2235583b4c7d40158ce04d4b944cd71e5"],"state_sha256":"9b4d838202acf89936bf5f8aef6d0b0263f38df674b2740b00e48a2f162e029b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+HsM6Bogw7DZbVEtExdcZWqzv8TtaXOYJzK7IA+BoeyrUYWZttN1WK+ioLYuAfV5s6pSiZaA8qx7cDKsBM7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:56:28.834654Z","bundle_sha256":"e5a6a8bf4e9bda9740d609198b54d45cf38c0a37a6d878abade2e9afb3366ee3"}}