{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WNEI75U5HDEKP35KTSWN6IMSVE","short_pith_number":"pith:WNEI75U5","schema_version":"1.0","canonical_sha256":"b3488ff69d38c8a7efaa9cacdf2192a91707203014a10153330ab1f77e60b641","source":{"kind":"arxiv","id":"1410.3656","version":1},"attestation_state":"computed","paper":{"title":"Compute-and-Forward: Finding the Best Equation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Gastpar, Saeid Sahraei","submitted_at":"2014-10-14T11:49:48Z","abstract_excerpt":"Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optimizing these coefficients is a Shortest Lattice Vector (SLV) problem. In general, the SLV problem is known to be prohibitively complex. In this paper, we show that the particular SLV instance resulting from the Compute-and-Forward problem can be solved in low polynomial complexity and give an explicit deterministic algorithm that is guaranteed"},"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":"1410.3656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-14T11:49:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7bc813bc35167d468198f6abdb54ca8cca909e742cf1974d852787009c6fdf4","abstract_canon_sha256":"a79b2071af1026a60d66be3f6c1ab06a09771b27866ba9ca04a5055f89f80a1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:09.257217Z","signature_b64":"M9FDmJPimWS2c93zQ06zt8CFO0un2DQgy+/Cqowh9D/Gq+iIfsWycwAzVhn5TEzKbO3m1sPCJhRq6Y18/acSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3488ff69d38c8a7efaa9cacdf2192a91707203014a10153330ab1f77e60b641","last_reissued_at":"2026-05-18T02:40:09.256772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:09.256772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compute-and-Forward: Finding the Best Equation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Gastpar, Saeid Sahraei","submitted_at":"2014-10-14T11:49:48Z","abstract_excerpt":"Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optimizing these coefficients is a Shortest Lattice Vector (SLV) problem. In general, the SLV problem is known to be prohibitively complex. In this paper, we show that the particular SLV instance resulting from the Compute-and-Forward problem can be solved in low polynomial complexity and give an explicit deterministic algorithm that is guaranteed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3656","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.3656","created_at":"2026-05-18T02:40:09.256832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3656v1","created_at":"2026-05-18T02:40:09.256832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3656","created_at":"2026-05-18T02:40:09.256832+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNEI75U5HDEK","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNEI75U5HDEKP35K","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNEI75U5","created_at":"2026-05-18T12:28:54.890064+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/WNEI75U5HDEKP35KTSWN6IMSVE","json":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE.json","graph_json":"https://pith.science/api/pith-number/WNEI75U5HDEKP35KTSWN6IMSVE/graph.json","events_json":"https://pith.science/api/pith-number/WNEI75U5HDEKP35KTSWN6IMSVE/events.json","paper":"https://pith.science/paper/WNEI75U5"},"agent_actions":{"view_html":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE","download_json":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE.json","view_paper":"https://pith.science/paper/WNEI75U5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3656&json=true","fetch_graph":"https://pith.science/api/pith-number/WNEI75U5HDEKP35KTSWN6IMSVE/graph.json","fetch_events":"https://pith.science/api/pith-number/WNEI75U5HDEKP35KTSWN6IMSVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE/action/storage_attestation","attest_author":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE/action/author_attestation","sign_citation":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE/action/citation_signature","submit_replication":"https://pith.science/pith/WNEI75U5HDEKP35KTSWN6IMSVE/action/replication_record"}},"created_at":"2026-05-18T02:40:09.256832+00:00","updated_at":"2026-05-18T02:40:09.256832+00:00"}