{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JA372A6STPYTEY7F6KUGTOXGCU","short_pith_number":"pith:JA372A6S","schema_version":"1.0","canonical_sha256":"4837fd03d29bf13263e5f2a869bae6150f4b93d6744a3de954e79d3e2cc32cb3","source":{"kind":"arxiv","id":"1705.02215","version":1},"attestation_state":"computed","paper":{"title":"Resource Allocation for Secure Full-Duplex OFDMA Radio Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Derrick Wing Kwan Ng, Robert Schober, Yan Sun","submitted_at":"2017-05-05T13:36:10Z","abstract_excerpt":"In this paper, we study the resource allocation for an orthogonal frequency division multiple access (OFDMA) radio system employing a full-duplex base station for serving multiple half-duplex downlink and uplink users simultaneously. The resource allocation design objective is the maximization of the weighted system throughput while limiting the information leakage to guarantee secure simultaneous downlink and uplink transmission in the presence of potential eavesdroppers. The algorithm design leads to a mixed combinatorial non-convex optimization problem and obtaining the globally optimal sol"},"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":"1705.02215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-05T13:36:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4910ead6de5e0d7aba9d9afc0ac947ce18a020a87bcf361e1aae4217c13591e8","abstract_canon_sha256":"5df390476ff06a3f7179dcb69d4411ee82568afe41a9b72e641776e9e6162f68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:00.380959Z","signature_b64":"YSUNKhRhvlVr+HdMzvzqCkxRdtqmw29i3KREtJ+Q+Bxs6kysZEGCW45ifVMvg44eBKaW8c0Us4zNa4PMacYDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4837fd03d29bf13263e5f2a869bae6150f4b93d6744a3de954e79d3e2cc32cb3","last_reissued_at":"2026-05-18T00:45:00.380466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:00.380466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource Allocation for Secure Full-Duplex OFDMA Radio Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Derrick Wing Kwan Ng, Robert Schober, Yan Sun","submitted_at":"2017-05-05T13:36:10Z","abstract_excerpt":"In this paper, we study the resource allocation for an orthogonal frequency division multiple access (OFDMA) radio system employing a full-duplex base station for serving multiple half-duplex downlink and uplink users simultaneously. The resource allocation design objective is the maximization of the weighted system throughput while limiting the information leakage to guarantee secure simultaneous downlink and uplink transmission in the presence of potential eavesdroppers. The algorithm design leads to a mixed combinatorial non-convex optimization problem and obtaining the globally optimal sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02215","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.02215","created_at":"2026-05-18T00:45:00.380540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02215v1","created_at":"2026-05-18T00:45:00.380540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02215","created_at":"2026-05-18T00:45:00.380540+00:00"},{"alias_kind":"pith_short_12","alias_value":"JA372A6STPYT","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"JA372A6STPYTEY7F","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"JA372A6S","created_at":"2026-05-18T12:31:21.493067+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/JA372A6STPYTEY7F6KUGTOXGCU","json":"https://pith.science/pith/JA372A6STPYTEY7F6KUGTOXGCU.json","graph_json":"https://pith.science/api/pith-number/JA372A6STPYTEY7F6KUGTOXGCU/graph.json","events_json":"https://pith.science/api/pith-number/JA372A6STPYTEY7F6KUGTOXGCU/events.json","paper":"https://pith.science/paper/JA372A6S"},"agent_actions":{"view_html":"https://pith.science/pith/JA372A6STPYTEY7F6KUGTOXGCU","download_json":"https://pith.science/pith/JA372A6STPYTEY7F6KUGTOXGCU.json","view_paper":"https://pith.science/paper/JA372A6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02215&json=true","fetch_graph":"https://pith.science/api/pith-number/JA372A6STPYTEY7F6KUGTOXGCU/graph.json","fetch_events":"https://pith.science/api/pith-number/JA372A6STPYTEY7F6KUGTOXGCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JA372A6STPYTEY7F6KUGTOXGCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JA372A6STPYTEY7F6KUGTOXGCU/action/storage_attestation","attest_author":"https://pith.science/pith/JA372A6STPYTEY7F6KUGTOXGCU/action/author_attestation","sign_citation":"https://pith.science/pith/JA372A6STPYTEY7F6KUGTOXGCU/action/citation_signature","submit_replication":"https://pith.science/pith/JA372A6STPYTEY7F6KUGTOXGCU/action/replication_record"}},"created_at":"2026-05-18T00:45:00.380540+00:00","updated_at":"2026-05-18T00:45:00.380540+00:00"}