{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:7RWROOPCJLNL7BD2TZ7TW2PRM6","short_pith_number":"pith:7RWROOPC","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"},"canonical_sha256":"fc6d1739e24adabf847a9e7f3b69f167a8acbef9219810dcc380a5926b1cee10","source":{"kind":"arxiv","id":"2312.14958","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14958","created_at":"2026-07-05T07:27:28Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14958v1","created_at":"2026-07-05T07:27:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14958","created_at":"2026-07-05T07:27:28Z"},{"alias_kind":"pith_short_12","alias_value":"7RWROOPCJLNL","created_at":"2026-07-05T07:27:28Z"},{"alias_kind":"pith_short_16","alias_value":"7RWROOPCJLNL7BD2","created_at":"2026-07-05T07:27:28Z"},{"alias_kind":"pith_short_8","alias_value":"7RWROOPC","created_at":"2026-07-05T07:27:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:7RWROOPCJLNL7BD2TZ7TW2PRM6","target":"record","payload":{"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"},"canonical_sha256":"fc6d1739e24adabf847a9e7f3b69f167a8acbef9219810dcc380a5926b1cee10","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"},"source_kind":"arxiv","source_id":"2312.14958","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-07-05T07:27:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0FDpRhDwnnwFHR+uOIKxgOalgsiRrsZnHmEg2C7/rpIOYpsOI9CuxEgrN10FSaIbQcEXatH37EkjRNSR9nnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T19:01:31.686595Z"},"content_sha256":"0e12ed7addaefffda88edd8511a0371b14b46964496136073cc72ac1a69510d9","schema_version":"1.0","event_id":"sha256:0e12ed7addaefffda88edd8511a0371b14b46964496136073cc72ac1a69510d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:7RWROOPCJLNL7BD2TZ7TW2PRM6","target":"graph","payload":{"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"},"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-07-05T07:27:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LIocGsmeaiHi8QVWLuxXG+73DZrwTA5RfH6IYRcVDBTbfGiAUlwjMXUJq6bS/fXXRqsBgrozWER7HgqfTbd4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T19:01:31.687173Z"},"content_sha256":"99a69ff6e2375e2b66320ec11ad739903ba50f12d02615bc82f75207eb561dde","schema_version":"1.0","event_id":"sha256:99a69ff6e2375e2b66320ec11ad739903ba50f12d02615bc82f75207eb561dde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6/bundle.json","state_url":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6/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-08-12T19:01:31Z","links":{"resolver":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6","bundle":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6/bundle.json","state":"https://pith.science/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RWROOPCJLNL7BD2TZ7TW2PRM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7RWROOPCJLNL7BD2TZ7TW2PRM6","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":"20adda6d4beb3eea6e01b2e538a5c97c43beb6150e32eb8f235c8a4c1c5d0c7f","cross_cats_sorted":["cs.CR","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-12-13T09:34:16Z","title_canon_sha256":"cd5f1b67bc74cf786e545935cd6879921a43c4338dfbbd966e978231175d4231"},"schema_version":"1.0","source":{"id":"2312.14958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14958","created_at":"2026-07-05T07:27:28Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14958v1","created_at":"2026-07-05T07:27:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14958","created_at":"2026-07-05T07:27:28Z"},{"alias_kind":"pith_short_12","alias_value":"7RWROOPCJLNL","created_at":"2026-07-05T07:27:28Z"},{"alias_kind":"pith_short_16","alias_value":"7RWROOPCJLNL7BD2","created_at":"2026-07-05T07:27:28Z"},{"alias_kind":"pith_short_8","alias_value":"7RWROOPC","created_at":"2026-07-05T07:27:28Z"}],"graph_snapshots":[{"event_id":"sha256:99a69ff6e2375e2b66320ec11ad739903ba50f12d02615bc82f75207eb561dde","target":"graph","created_at":"2026-07-05T07:27:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.14958/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Branka Vucetic, Changyang She, Phee Lep Yeoh, Xin Hao, Yonghui Li, Yuhong Liu","cross_cats":["cs.CR","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-12-13T09:34:16Z","title":"Graph Neural Network-Based Bandwidth Allocation for Secure Wireless Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14958","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:0e12ed7addaefffda88edd8511a0371b14b46964496136073cc72ac1a69510d9","target":"record","created_at":"2026-07-05T07:27:28Z","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":"20adda6d4beb3eea6e01b2e538a5c97c43beb6150e32eb8f235c8a4c1c5d0c7f","cross_cats_sorted":["cs.CR","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-12-13T09:34:16Z","title_canon_sha256":"cd5f1b67bc74cf786e545935cd6879921a43c4338dfbbd966e978231175d4231"},"schema_version":"1.0","source":{"id":"2312.14958","kind":"arxiv","version":1}},"canonical_sha256":"fc6d1739e24adabf847a9e7f3b69f167a8acbef9219810dcc380a5926b1cee10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc6d1739e24adabf847a9e7f3b69f167a8acbef9219810dcc380a5926b1cee10","first_computed_at":"2026-07-05T07:27:28.786223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:27:28.786223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2kWjPyiIfXneRHg9+CqcEZiF/bSRpf0wQa5EaoKYjjD//aLO5YHWdxnmXcFVlrCWLeUKgPoLAp0oh3Ld91S1Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:27:28.786644Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.14958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e12ed7addaefffda88edd8511a0371b14b46964496136073cc72ac1a69510d9","sha256:99a69ff6e2375e2b66320ec11ad739903ba50f12d02615bc82f75207eb561dde"],"state_sha256":"e992a1ead4127ae753ff1348c1a9ce8922fcbd3827c71239fd645dc64d5cfec2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IV4mzsA+lYRGcoUQYbkup7XdhBN3eQ1BMI2F1TL/5qr8mvIeaBjkoCsg2hRLqn/tx7DLGWlxxlt2N0mZinPyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T19:01:31.695297Z","bundle_sha256":"d5ca5f16cfcab080a3cea6a5fffc50606275f63bb08202a8851dafacc8f34445"}}