{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YMGXATR52BQLKYUYRI5H26XMQ4","short_pith_number":"pith:YMGXATR5","schema_version":"1.0","canonical_sha256":"c30d704e3dd060b562988a3a7d7aec870c045d8935be09af52341484bb5ae53d","source":{"kind":"arxiv","id":"1404.4157","version":2},"attestation_state":"computed","paper":{"title":"Phase Precoding for the Compute-and-Forward Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Sakzad, Emanuele Viterbo, Joseph Jean Boutros, Yi Hong","submitted_at":"2014-04-16T07:34:58Z","abstract_excerpt":"The compute-and-forward (CoF) is a relaying protocol, which uses algebraic structured codes to harness the interference and remove the noise in wireless networks. We propose the use of phase precoders at the transmitters of a network, where relays apply CoF strategy. We define the {\\em phase precoded computation rate} and show that it is greater than the original computation rate of CoF protocol. We further give a new low-complexity method for finding network equations. We finally show that the proposed precoding scheme increases the degrees-of-freedom (DoF) of CoF protocol. This overcomes the"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1404.4157","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-16T07:34:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5903ff7ef1412174e1f6b8fbdb72bc2f7b645f559fb438224d6928c296c7407","abstract_canon_sha256":"463bb2b87c240019d41283c54246fc8be1e5b9dde0fa592cabfb3c299b0e5444"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:41.588283Z","signature_b64":"MxzaHGN9cPRMYSovQ/X6Vws9g+ZirxBWeZzy+cK5+ugvEoBSyQZMbmijqA/qRanRkeNv3JSnz5OdxqTixJyAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c30d704e3dd060b562988a3a7d7aec870c045d8935be09af52341484bb5ae53d","last_reissued_at":"2026-05-18T02:41:41.587676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:41.587676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase Precoding for the Compute-and-Forward Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Sakzad, Emanuele Viterbo, Joseph Jean Boutros, Yi Hong","submitted_at":"2014-04-16T07:34:58Z","abstract_excerpt":"The compute-and-forward (CoF) is a relaying protocol, which uses algebraic structured codes to harness the interference and remove the noise in wireless networks. We propose the use of phase precoders at the transmitters of a network, where relays apply CoF strategy. We define the {\\em phase precoded computation rate} and show that it is greater than the original computation rate of CoF protocol. We further give a new low-complexity method for finding network equations. We finally show that the proposed precoding scheme increases the degrees-of-freedom (DoF) of CoF protocol. This overcomes the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4157","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.4157","created_at":"2026-05-18T02:41:41.587760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4157v2","created_at":"2026-05-18T02:41:41.587760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4157","created_at":"2026-05-18T02:41:41.587760+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMGXATR52BQL","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMGXATR52BQLKYUY","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMGXATR5","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YMGXATR52BQLKYUYRI5H26XMQ4","json":"https://pith.science/pith/YMGXATR52BQLKYUYRI5H26XMQ4.json","graph_json":"https://pith.science/api/pith-number/YMGXATR52BQLKYUYRI5H26XMQ4/graph.json","events_json":"https://pith.science/api/pith-number/YMGXATR52BQLKYUYRI5H26XMQ4/events.json","paper":"https://pith.science/paper/YMGXATR5"},"agent_actions":{"view_html":"https://pith.science/pith/YMGXATR52BQLKYUYRI5H26XMQ4","download_json":"https://pith.science/pith/YMGXATR52BQLKYUYRI5H26XMQ4.json","view_paper":"https://pith.science/paper/YMGXATR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4157&json=true","fetch_graph":"https://pith.science/api/pith-number/YMGXATR52BQLKYUYRI5H26XMQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/YMGXATR52BQLKYUYRI5H26XMQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMGXATR52BQLKYUYRI5H26XMQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMGXATR52BQLKYUYRI5H26XMQ4/action/storage_attestation","attest_author":"https://pith.science/pith/YMGXATR52BQLKYUYRI5H26XMQ4/action/author_attestation","sign_citation":"https://pith.science/pith/YMGXATR52BQLKYUYRI5H26XMQ4/action/citation_signature","submit_replication":"https://pith.science/pith/YMGXATR52BQLKYUYRI5H26XMQ4/action/replication_record"}},"created_at":"2026-05-18T02:41:41.587760+00:00","updated_at":"2026-05-18T02:41:41.587760+00:00"}