{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7RWROOPCJLNL7BD2TZ7TW2PRM6","short_pith_number":"pith:7RWROOPC","schema_version":"1.0","canonical_sha256":"fc6d1739e24adabf847a9e7f3b69f167a8acbef9219810dcc380a5926b1cee10","source":{"kind":"arxiv","id":"2312.14958","version":1},"attestation_state":"computed","paper":{"title":"Graph Neural Network-Based Bandwidth Allocation for Secure Wireless Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Changyang She, Phee Lep Yeoh, Xin Hao, Yonghui Li, Yuhong Liu","submitted_at":"2023-12-13T09:34:16Z","abstract_excerpt":"This paper designs a graph neural network (GNN) to improve bandwidth allocations for multiple legitimate wireless users transmitting to a base station in the presence of an eavesdropper. To improve the privacy and prevent eavesdropping attacks, we propose a user scheduling algorithm to schedule users satisfying an instantaneous minimum secrecy rate constraint. Based on this, we optimize the bandwidth allocations with three algorithms namely iterative search (IvS), GNN-based supervised learning (GNN-SL), and GNN-based unsupervised learning (GNN-USL). We present a computational complexity analys"},"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":"2312.14958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-12-13T09:34:16Z","cross_cats_sorted":["cs.CR","cs.LG","math.IT"],"title_canon_sha256":"cd5f1b67bc74cf786e545935cd6879921a43c4338dfbbd966e978231175d4231","abstract_canon_sha256":"20adda6d4beb3eea6e01b2e538a5c97c43beb6150e32eb8f235c8a4c1c5d0c7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:28.786644Z","signature_b64":"2kWjPyiIfXneRHg9+CqcEZiF/bSRpf0wQa5EaoKYjjD//aLO5YHWdxnmXcFVlrCWLeUKgPoLAp0oh3Ld91S1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc6d1739e24adabf847a9e7f3b69f167a8acbef9219810dcc380a5926b1cee10","last_reissued_at":"2026-07-05T07:27:28.786223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:28.786223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Network-Based Bandwidth Allocation for Secure Wireless Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Changyang She, Phee Lep Yeoh, Xin Hao, Yonghui Li, Yuhong Liu","submitted_at":"2023-12-13T09:34:16Z","abstract_excerpt":"This paper designs a graph neural network (GNN) to improve bandwidth allocations for multiple legitimate wireless users transmitting to a base station in the presence of an eavesdropper. To improve the privacy and prevent eavesdropping attacks, we propose a user scheduling algorithm to schedule users satisfying an instantaneous minimum secrecy rate constraint. Based on this, we optimize the bandwidth allocations with three algorithms namely iterative search (IvS), GNN-based supervised learning (GNN-SL), and GNN-based unsupervised learning (GNN-USL). We present a computational complexity analys"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14958","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/2312.14958/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":"2312.14958","created_at":"2026-07-05T07:27:28.786281+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.14958v1","created_at":"2026-07-05T07:27:28.786281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14958","created_at":"2026-07-05T07:27:28.786281+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RWROOPCJLNL","created_at":"2026-07-05T07:27:28.786281+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RWROOPCJLNL7BD2","created_at":"2026-07-05T07:27:28.786281+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RWROOPC","created_at":"2026-07-05T07:27:28.786281+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/7RWROOPCJLNL7BD2TZ7TW2PRM6","json":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6.json","graph_json":"https://pith.science/api/pith-number/7RWROOPCJLNL7BD2TZ7TW2PRM6/graph.json","events_json":"https://pith.science/api/pith-number/7RWROOPCJLNL7BD2TZ7TW2PRM6/events.json","paper":"https://pith.science/paper/7RWROOPC"},"agent_actions":{"view_html":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6","download_json":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6.json","view_paper":"https://pith.science/paper/7RWROOPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.14958&json=true","fetch_graph":"https://pith.science/api/pith-number/7RWROOPCJLNL7BD2TZ7TW2PRM6/graph.json","fetch_events":"https://pith.science/api/pith-number/7RWROOPCJLNL7BD2TZ7TW2PRM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6/action/storage_attestation","attest_author":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6/action/author_attestation","sign_citation":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6/action/citation_signature","submit_replication":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6/action/replication_record"}},"created_at":"2026-07-05T07:27:28.786281+00:00","updated_at":"2026-07-05T07:27:28.786281+00:00"}