{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7S6RQ5NBEGRJLQ43CV5ITKRADR","short_pith_number":"pith:7S6RQ5NB","schema_version":"1.0","canonical_sha256":"fcbd1875a121a295c39b157a89aa201c7936aece6186715693fe5f24b421f63a","source":{"kind":"arxiv","id":"1410.4278","version":4},"attestation_state":"computed","paper":{"title":"An Efficient Algorithm for Optimally Solving a Shortest Vector Problem in Compute-and-Forward Protocol Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baojian Zhou, Jinming Wen, Wai Ho Mow, Xiao-Wen Chang","submitted_at":"2014-10-16T02:36:53Z","abstract_excerpt":"We consider the problem of finding the optimal coefficient vector that maximizes the computation rate at a relay in the compute-and-forward scheme. Based on the idea of sphere decoding, we propose a highly efficient algorithm that finds the optimal coefficient vector. First, we derive a novel algorithm to transform the original quadratic form optimization problem into a shortest vector problem (SVP) using the Cholesky factorization. Instead of computing the Cholesky factor explicitly, the proposed algorithm realizes the Cholesky factorization with only $\\bigO(n)$ flops by taking advantage of t"},"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.4278","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-16T02:36:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a9a20324933c45dad1a13ca98d4f7254a4387cf4704afd03b7bfa9e1850194f5","abstract_canon_sha256":"c0e1b96f14da72b8cf4fea5170e6f07570b8c431d91531eefcee42b5297eadc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:55.345586Z","signature_b64":"hqFHp2gJ2Y5YKl28l8AFsQlHmgtd9wj+IUOEjIKUi5zB6lZM+wlbWv0FJlInOEKnO8r0bkM65fVobakIDqd1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcbd1875a121a295c39b157a89aa201c7936aece6186715693fe5f24b421f63a","last_reissued_at":"2026-05-18T01:11:55.345198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:55.345198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Optimally Solving a Shortest Vector Problem in Compute-and-Forward Protocol Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baojian Zhou, Jinming Wen, Wai Ho Mow, Xiao-Wen Chang","submitted_at":"2014-10-16T02:36:53Z","abstract_excerpt":"We consider the problem of finding the optimal coefficient vector that maximizes the computation rate at a relay in the compute-and-forward scheme. Based on the idea of sphere decoding, we propose a highly efficient algorithm that finds the optimal coefficient vector. First, we derive a novel algorithm to transform the original quadratic form optimization problem into a shortest vector problem (SVP) using the Cholesky factorization. Instead of computing the Cholesky factor explicitly, the proposed algorithm realizes the Cholesky factorization with only $\\bigO(n)$ flops by taking advantage of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4278","kind":"arxiv","version":4},"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.4278","created_at":"2026-05-18T01:11:55.345266+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4278v4","created_at":"2026-05-18T01:11:55.345266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4278","created_at":"2026-05-18T01:11:55.345266+00:00"},{"alias_kind":"pith_short_12","alias_value":"7S6RQ5NBEGRJ","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7S6RQ5NBEGRJLQ43","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7S6RQ5NB","created_at":"2026-05-18T12:28:19.803747+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/7S6RQ5NBEGRJLQ43CV5ITKRADR","json":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR.json","graph_json":"https://pith.science/api/pith-number/7S6RQ5NBEGRJLQ43CV5ITKRADR/graph.json","events_json":"https://pith.science/api/pith-number/7S6RQ5NBEGRJLQ43CV5ITKRADR/events.json","paper":"https://pith.science/paper/7S6RQ5NB"},"agent_actions":{"view_html":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR","download_json":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR.json","view_paper":"https://pith.science/paper/7S6RQ5NB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4278&json=true","fetch_graph":"https://pith.science/api/pith-number/7S6RQ5NBEGRJLQ43CV5ITKRADR/graph.json","fetch_events":"https://pith.science/api/pith-number/7S6RQ5NBEGRJLQ43CV5ITKRADR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR/action/storage_attestation","attest_author":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR/action/author_attestation","sign_citation":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR/action/citation_signature","submit_replication":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR/action/replication_record"}},"created_at":"2026-05-18T01:11:55.345266+00:00","updated_at":"2026-05-18T01:11:55.345266+00:00"}