{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6OW42EF5ZITP2R4SFIJMQIYDMK","short_pith_number":"pith:6OW42EF5","schema_version":"1.0","canonical_sha256":"f3adcd10bdca26fd47922a12c82303629c9dbb6df1d4d8369021dd5b4baf8005","source":{"kind":"arxiv","id":"2505.08267","version":1},"attestation_state":"computed","paper":{"title":"Sparsity-Aware Near-Field Beam Training via Multi-Beam Combination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Chien-Hua Chen, Jinesh Nair, Rama Kiran, Rui Zhang, Shawn Tsai, Tzu-Han Chou, Zijun Wang","submitted_at":"2025-05-13T06:32:24Z","abstract_excerpt":"This paper proposes an adaptive near-field beam training method to enhance performance in multi-user and multipath environments. The approach identifies multiple strongest beams through beam sweeping and linearly combines their received signals - capturing both amplitude and phase - for improved channel estimation. Two codebooks are considered: the conventional DFT codebook and a near-field codebook that samples both angular and distance domains. As the near-field basis functions are generally non-orthogonal and often over-complete, we exploit sparsity in the solution using LASSO-based linear "},"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":"2505.08267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-05-13T06:32:24Z","cross_cats_sorted":[],"title_canon_sha256":"b529a84f25f6ec90b429b4624f1e8b07da67ce075caf42c1fad9e8fddbc0a3cb","abstract_canon_sha256":"8f6a7cf010054959c41dcd262b9fd034a0a3cb9a8b228c5afd9d89c6f51763af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:27.476882Z","signature_b64":"eXOXUydbqgOgjgVzNYrzpYM1VTf4byIE3H5LBOzE15xUjNPsQ1c6/mjQTuLkAfSAKY4wnwJ4LmUU5MYfRSrECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3adcd10bdca26fd47922a12c82303629c9dbb6df1d4d8369021dd5b4baf8005","last_reissued_at":"2026-07-05T11:02:27.476298Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:27.476298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsity-Aware Near-Field Beam Training via Multi-Beam Combination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Chien-Hua Chen, Jinesh Nair, Rama Kiran, Rui Zhang, Shawn Tsai, Tzu-Han Chou, Zijun Wang","submitted_at":"2025-05-13T06:32:24Z","abstract_excerpt":"This paper proposes an adaptive near-field beam training method to enhance performance in multi-user and multipath environments. The approach identifies multiple strongest beams through beam sweeping and linearly combines their received signals - capturing both amplitude and phase - for improved channel estimation. Two codebooks are considered: the conventional DFT codebook and a near-field codebook that samples both angular and distance domains. As the near-field basis functions are generally non-orthogonal and often over-complete, we exploit sparsity in the solution using LASSO-based linear "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08267","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.08267/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.08267","created_at":"2026-07-05T11:02:27.476371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.08267v1","created_at":"2026-07-05T11:02:27.476371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08267","created_at":"2026-07-05T11:02:27.476371+00:00"},{"alias_kind":"pith_short_12","alias_value":"6OW42EF5ZITP","created_at":"2026-07-05T11:02:27.476371+00:00"},{"alias_kind":"pith_short_16","alias_value":"6OW42EF5ZITP2R4S","created_at":"2026-07-05T11:02:27.476371+00:00"},{"alias_kind":"pith_short_8","alias_value":"6OW42EF5","created_at":"2026-07-05T11:02:27.476371+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/6OW42EF5ZITP2R4SFIJMQIYDMK","json":"https://pith.science/pith/6OW42EF5ZITP2R4SFIJMQIYDMK.json","graph_json":"https://pith.science/api/pith-number/6OW42EF5ZITP2R4SFIJMQIYDMK/graph.json","events_json":"https://pith.science/api/pith-number/6OW42EF5ZITP2R4SFIJMQIYDMK/events.json","paper":"https://pith.science/paper/6OW42EF5"},"agent_actions":{"view_html":"https://pith.science/pith/6OW42EF5ZITP2R4SFIJMQIYDMK","download_json":"https://pith.science/pith/6OW42EF5ZITP2R4SFIJMQIYDMK.json","view_paper":"https://pith.science/paper/6OW42EF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.08267&json=true","fetch_graph":"https://pith.science/api/pith-number/6OW42EF5ZITP2R4SFIJMQIYDMK/graph.json","fetch_events":"https://pith.science/api/pith-number/6OW42EF5ZITP2R4SFIJMQIYDMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6OW42EF5ZITP2R4SFIJMQIYDMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6OW42EF5ZITP2R4SFIJMQIYDMK/action/storage_attestation","attest_author":"https://pith.science/pith/6OW42EF5ZITP2R4SFIJMQIYDMK/action/author_attestation","sign_citation":"https://pith.science/pith/6OW42EF5ZITP2R4SFIJMQIYDMK/action/citation_signature","submit_replication":"https://pith.science/pith/6OW42EF5ZITP2R4SFIJMQIYDMK/action/replication_record"}},"created_at":"2026-07-05T11:02:27.476371+00:00","updated_at":"2026-07-05T11:02:27.476371+00:00"}