{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ERBRZMD2PMUBNE2OBB2RKPWBZI","short_pith_number":"pith:ERBRZMD2","canonical_record":{"source":{"id":"1304.7095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-26T08:47:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cf4eccb0d105a4a730c1855c1206c21f05e22ca2dc7210dbe4f325c3a397f86d","abstract_canon_sha256":"63f19b03306f6c44d6e0692830b284754a138d1da1e721e1490d6aef4492128a"},"schema_version":"1.0"},"canonical_sha256":"24431cb07a7b2816934e0875153ec1ca3a33aec9da961c1d9cb3ea910b8d6df2","source":{"kind":"arxiv","id":"1304.7095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7095","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7095v1","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7095","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"ERBRZMD2PMUB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ERBRZMD2PMUBNE2O","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ERBRZMD2","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ERBRZMD2PMUBNE2OBB2RKPWBZI","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-26T08:47:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cf4eccb0d105a4a730c1855c1206c21f05e22ca2dc7210dbe4f325c3a397f86d","abstract_canon_sha256":"63f19b03306f6c44d6e0692830b284754a138d1da1e721e1490d6aef4492128a"},"schema_version":"1.0"},"canonical_sha256":"24431cb07a7b2816934e0875153ec1ca3a33aec9da961c1d9cb3ea910b8d6df2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:02.569616Z","signature_b64":"03rK9v/E0ZLVB48gxHAPTtkE+GEmfX7H+jLpaKPThjsPjrv4CzkKQSs1yKEO3OpT9bM9WihsffmhAXCa5OIVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24431cb07a7b2816934e0875153ec1ca3a33aec9da961c1d9cb3ea910b8d6df2","last_reissued_at":"2026-05-18T03:27:02.569226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:02.569226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7095","source_version":1,"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-18T03:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Qtm1JzkDs1F4bNY+PE4aMMBlX4eMxTUipNukY4Sbn75TV7IQvpTJqZ4VBoCq2LJlg50rmonnfFokgxxxL5bCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:30:49.309166Z"},"content_sha256":"6d1508e3537193af80a1046793f110ff386e232d224ba7ff1ee85bde806a63a5","schema_version":"1.0","event_id":"sha256:6d1508e3537193af80a1046793f110ff386e232d224ba7ff1ee85bde806a63a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ERBRZMD2PMUBNE2OBB2RKPWBZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximity Factors of Lattice Reduction-Aided Precoding for Multiantenna Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Shuiyin Liu, Xiaofu Wu","submitted_at":"2013-04-26T08:47:37Z","abstract_excerpt":"Lattice precoding is an effective strategy for multiantenna broadcast. In this paper, we show that approximate lattice precoding in multiantenna broadcast is a variant of the closest vector problem (CVP) known as $\\eta$-CVP. The proximity factors of lattice reduction-aided precoding are defined, and their bounds are derived, which measure the worst-case loss in power efficiency compared to sphere precoding. Unlike decoding applications, this analysis does not suffer from the boundary effect of a finite constellation, since the underlying lattice in multiantenna broadcast is indeed infinite."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7095","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"},"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-18T03:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2f8T37U7J4osRpKhwRSkRchkMeI9gdRkVqdeiIza44N995j3p+2NPShNh+aEQIdWY4AHeQB3Yp/3q5SoqfvABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:30:49.309521Z"},"content_sha256":"1fa0b910681aad21fd8484e173689e765eaed926f7af23212995a5f46a98835b","schema_version":"1.0","event_id":"sha256:1fa0b910681aad21fd8484e173689e765eaed926f7af23212995a5f46a98835b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERBRZMD2PMUBNE2OBB2RKPWBZI/bundle.json","state_url":"https://pith.science/pith/ERBRZMD2PMUBNE2OBB2RKPWBZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERBRZMD2PMUBNE2OBB2RKPWBZI/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-01T07:30:49Z","links":{"resolver":"https://pith.science/pith/ERBRZMD2PMUBNE2OBB2RKPWBZI","bundle":"https://pith.science/pith/ERBRZMD2PMUBNE2OBB2RKPWBZI/bundle.json","state":"https://pith.science/pith/ERBRZMD2PMUBNE2OBB2RKPWBZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERBRZMD2PMUBNE2OBB2RKPWBZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ERBRZMD2PMUBNE2OBB2RKPWBZI","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":"63f19b03306f6c44d6e0692830b284754a138d1da1e721e1490d6aef4492128a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-26T08:47:37Z","title_canon_sha256":"cf4eccb0d105a4a730c1855c1206c21f05e22ca2dc7210dbe4f325c3a397f86d"},"schema_version":"1.0","source":{"id":"1304.7095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7095","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7095v1","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7095","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"ERBRZMD2PMUB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ERBRZMD2PMUBNE2O","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ERBRZMD2","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:1fa0b910681aad21fd8484e173689e765eaed926f7af23212995a5f46a98835b","target":"graph","created_at":"2026-05-18T03:27:02Z","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":"Lattice precoding is an effective strategy for multiantenna broadcast. In this paper, we show that approximate lattice precoding in multiantenna broadcast is a variant of the closest vector problem (CVP) known as $\\eta$-CVP. The proximity factors of lattice reduction-aided precoding are defined, and their bounds are derived, which measure the worst-case loss in power efficiency compared to sphere precoding. Unlike decoding applications, this analysis does not suffer from the boundary effect of a finite constellation, since the underlying lattice in multiantenna broadcast is indeed infinite.","authors_text":"Cong Ling, Shuiyin Liu, Xiaofu Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-26T08:47:37Z","title":"Proximity Factors of Lattice Reduction-Aided Precoding for Multiantenna Broadcast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7095","kind":"arxiv","version":1},"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:6d1508e3537193af80a1046793f110ff386e232d224ba7ff1ee85bde806a63a5","target":"record","created_at":"2026-05-18T03:27:02Z","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":"63f19b03306f6c44d6e0692830b284754a138d1da1e721e1490d6aef4492128a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-26T08:47:37Z","title_canon_sha256":"cf4eccb0d105a4a730c1855c1206c21f05e22ca2dc7210dbe4f325c3a397f86d"},"schema_version":"1.0","source":{"id":"1304.7095","kind":"arxiv","version":1}},"canonical_sha256":"24431cb07a7b2816934e0875153ec1ca3a33aec9da961c1d9cb3ea910b8d6df2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24431cb07a7b2816934e0875153ec1ca3a33aec9da961c1d9cb3ea910b8d6df2","first_computed_at":"2026-05-18T03:27:02.569226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:02.569226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"03rK9v/E0ZLVB48gxHAPTtkE+GEmfX7H+jLpaKPThjsPjrv4CzkKQSs1yKEO3OpT9bM9WihsffmhAXCa5OIVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:02.569616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d1508e3537193af80a1046793f110ff386e232d224ba7ff1ee85bde806a63a5","sha256:1fa0b910681aad21fd8484e173689e765eaed926f7af23212995a5f46a98835b"],"state_sha256":"252c6e490bd7b1076cbe9acc3223edfacabba7e2d203f77b05c9996e129526d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3nZbYf2Ip9UQImco/XFK60P0+2UQhVBLT/sJb9csk/nWuFTkqsp8D5Z0+I18c2lSc2/EAOjawmZc1ICh8YvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:30:49.311605Z","bundle_sha256":"89c4d15518f8c5d6a49f194e2ab2d3bdb1468568d4172f2e8ab74b59e8c02260"}}