{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7S6RQ5NBEGRJLQ43CV5ITKRADR","short_pith_number":"pith:7S6RQ5NB","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"},"canonical_sha256":"fcbd1875a121a295c39b157a89aa201c7936aece6186715693fe5f24b421f63a","source":{"kind":"arxiv","id":"1410.4278","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4278","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4278v4","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4278","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"7S6RQ5NBEGRJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7S6RQ5NBEGRJLQ43","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7S6RQ5NB","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7S6RQ5NBEGRJLQ43CV5ITKRADR","target":"record","payload":{"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"},"canonical_sha256":"fcbd1875a121a295c39b157a89aa201c7936aece6186715693fe5f24b421f63a","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"},"source_kind":"arxiv","source_id":"1410.4278","source_version":4,"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-18T01:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eKVWQs7eR0c4oCxxINUF3zIEtWZnt42WAyUQZr5P1WYwKVp96fJ/4H8SNW85yIYauVT/2OQpzN2uhMcMLasjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:40:00.224533Z"},"content_sha256":"8f641b2bd2ce1ea4bea9db021b79a1589c525339fb38aff8fed5944b162bbe5a","schema_version":"1.0","event_id":"sha256:8f641b2bd2ce1ea4bea9db021b79a1589c525339fb38aff8fed5944b162bbe5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7S6RQ5NBEGRJLQ43CV5ITKRADR","target":"graph","payload":{"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"},"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-18T01:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0U/Yb37ne1ClAgCfrHEMKs8bD7eoqGbZiS/wUBpHkc48X4502ajVwM1ZUuOwNkToF5s/JFWxKG55SuhzBpJ4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:40:00.224878Z"},"content_sha256":"76205ec5740017eaa8635c55cee6cdf306d57f871d530b11147818e084cb8ebb","schema_version":"1.0","event_id":"sha256:76205ec5740017eaa8635c55cee6cdf306d57f871d530b11147818e084cb8ebb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR/bundle.json","state_url":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR/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-01T23:40:00Z","links":{"resolver":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR","bundle":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR/bundle.json","state":"https://pith.science/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7S6RQ5NBEGRJLQ43CV5ITKRADR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7S6RQ5NBEGRJLQ43CV5ITKRADR","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":"c0e1b96f14da72b8cf4fea5170e6f07570b8c431d91531eefcee42b5297eadc9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-16T02:36:53Z","title_canon_sha256":"a9a20324933c45dad1a13ca98d4f7254a4387cf4704afd03b7bfa9e1850194f5"},"schema_version":"1.0","source":{"id":"1410.4278","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4278","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4278v4","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4278","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"7S6RQ5NBEGRJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7S6RQ5NBEGRJLQ43","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7S6RQ5NB","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:76205ec5740017eaa8635c55cee6cdf306d57f871d530b11147818e084cb8ebb","target":"graph","created_at":"2026-05-18T01:11:55Z","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":"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","authors_text":"Baojian Zhou, Jinming Wen, Wai Ho Mow, Xiao-Wen Chang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-16T02:36:53Z","title":"An Efficient Algorithm for Optimally Solving a Shortest Vector Problem in Compute-and-Forward Protocol Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4278","kind":"arxiv","version":4},"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:8f641b2bd2ce1ea4bea9db021b79a1589c525339fb38aff8fed5944b162bbe5a","target":"record","created_at":"2026-05-18T01:11:55Z","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":"c0e1b96f14da72b8cf4fea5170e6f07570b8c431d91531eefcee42b5297eadc9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-16T02:36:53Z","title_canon_sha256":"a9a20324933c45dad1a13ca98d4f7254a4387cf4704afd03b7bfa9e1850194f5"},"schema_version":"1.0","source":{"id":"1410.4278","kind":"arxiv","version":4}},"canonical_sha256":"fcbd1875a121a295c39b157a89aa201c7936aece6186715693fe5f24b421f63a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcbd1875a121a295c39b157a89aa201c7936aece6186715693fe5f24b421f63a","first_computed_at":"2026-05-18T01:11:55.345198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:55.345198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hqFHp2gJ2Y5YKl28l8AFsQlHmgtd9wj+IUOEjIKUi5zB6lZM+wlbWv0FJlInOEKnO8r0bkM65fVobakIDqd1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:55.345586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4278","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f641b2bd2ce1ea4bea9db021b79a1589c525339fb38aff8fed5944b162bbe5a","sha256:76205ec5740017eaa8635c55cee6cdf306d57f871d530b11147818e084cb8ebb"],"state_sha256":"05b808f233433a3ab7a132e6df41e5dab8825d5ffa6b225ac5d1d180eac579a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uA1RifdEw3bbCW8kImnJ1XZzUvYwLvVXyxjB0I4Y1PlLLFlfKflGH2dPYFQAcq+knBZJeeLEj8Rbb0JDDG7jDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:40:00.226848Z","bundle_sha256":"894643f813ed7d807f0f3eb71cf33a0a5284faab09d3f6ab525053c6feed5d0b"}}