{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VV5TIEDWGYVVHZTLQLRA4A5DTX","short_pith_number":"pith:VV5TIEDW","schema_version":"1.0","canonical_sha256":"ad7b341076362b53e66b82e20e03a39dfdc3aab5cb511a83d20e325bf9cd8c43","source":{"kind":"arxiv","id":"2410.09436","version":2},"attestation_state":"computed","paper":{"title":"Sum Rate Maximization for Movable Antenna Enhanced Multiuser Covert Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Haobin Mao, Lipeng Zhu, Rui Zhang, Xiang-Gen Xia, Xiangyu Pi, Zhenyu Xiao","submitted_at":"2024-10-12T08:30:00Z","abstract_excerpt":"In this letter, we propose to employ movable antenna (MA) to enhance covert communications with noise uncertainty, where the confidential data is transmitted from an MA-aided access point (AP) to multiple users with a warden attempting to detect the existence of the legal transmission. To maximize the sum rate of users under covertness constraint, we formulate an optimization problem to jointly design the transmit beamforming and the positions of MAs at the AP. To solve the formulated non-convex optimization problem, we develop a block successive upper-bound minimization (BSUM) based algorithm"},"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":"2410.09436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2024-10-12T08:30:00Z","cross_cats_sorted":[],"title_canon_sha256":"f5375e07788f8b55fa863ebd373dbc064c43945c4450bfeb4973b6c61dbff77e","abstract_canon_sha256":"72c1c9edf0cb96ba7f7c85194751e786024f150ea241b0ee194b8fb1374cffb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:37.663307Z","signature_b64":"E/QvlPrz9vXM8rWM9R+RZ4k5ht/z9nHDsW9xhhWQkg1a1p2cqmJmSR44GMR8Vl8kLYZh5DPuY4nOajFirDbkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad7b341076362b53e66b82e20e03a39dfdc3aab5cb511a83d20e325bf9cd8c43","last_reissued_at":"2026-07-05T10:54:37.662833Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:37.662833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sum Rate Maximization for Movable Antenna Enhanced Multiuser Covert Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Haobin Mao, Lipeng Zhu, Rui Zhang, Xiang-Gen Xia, Xiangyu Pi, Zhenyu Xiao","submitted_at":"2024-10-12T08:30:00Z","abstract_excerpt":"In this letter, we propose to employ movable antenna (MA) to enhance covert communications with noise uncertainty, where the confidential data is transmitted from an MA-aided access point (AP) to multiple users with a warden attempting to detect the existence of the legal transmission. To maximize the sum rate of users under covertness constraint, we formulate an optimization problem to jointly design the transmit beamforming and the positions of MAs at the AP. To solve the formulated non-convex optimization problem, we develop a block successive upper-bound minimization (BSUM) based algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.09436","kind":"arxiv","version":2},"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/2410.09436/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":"2410.09436","created_at":"2026-07-05T10:54:37.662884+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.09436v2","created_at":"2026-07-05T10:54:37.662884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.09436","created_at":"2026-07-05T10:54:37.662884+00:00"},{"alias_kind":"pith_short_12","alias_value":"VV5TIEDWGYVV","created_at":"2026-07-05T10:54:37.662884+00:00"},{"alias_kind":"pith_short_16","alias_value":"VV5TIEDWGYVVHZTL","created_at":"2026-07-05T10:54:37.662884+00:00"},{"alias_kind":"pith_short_8","alias_value":"VV5TIEDW","created_at":"2026-07-05T10:54:37.662884+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/VV5TIEDWGYVVHZTLQLRA4A5DTX","json":"https://pith.science/pith/VV5TIEDWGYVVHZTLQLRA4A5DTX.json","graph_json":"https://pith.science/api/pith-number/VV5TIEDWGYVVHZTLQLRA4A5DTX/graph.json","events_json":"https://pith.science/api/pith-number/VV5TIEDWGYVVHZTLQLRA4A5DTX/events.json","paper":"https://pith.science/paper/VV5TIEDW"},"agent_actions":{"view_html":"https://pith.science/pith/VV5TIEDWGYVVHZTLQLRA4A5DTX","download_json":"https://pith.science/pith/VV5TIEDWGYVVHZTLQLRA4A5DTX.json","view_paper":"https://pith.science/paper/VV5TIEDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.09436&json=true","fetch_graph":"https://pith.science/api/pith-number/VV5TIEDWGYVVHZTLQLRA4A5DTX/graph.json","fetch_events":"https://pith.science/api/pith-number/VV5TIEDWGYVVHZTLQLRA4A5DTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VV5TIEDWGYVVHZTLQLRA4A5DTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VV5TIEDWGYVVHZTLQLRA4A5DTX/action/storage_attestation","attest_author":"https://pith.science/pith/VV5TIEDWGYVVHZTLQLRA4A5DTX/action/author_attestation","sign_citation":"https://pith.science/pith/VV5TIEDWGYVVHZTLQLRA4A5DTX/action/citation_signature","submit_replication":"https://pith.science/pith/VV5TIEDWGYVVHZTLQLRA4A5DTX/action/replication_record"}},"created_at":"2026-07-05T10:54:37.662884+00:00","updated_at":"2026-07-05T10:54:37.662884+00:00"}