{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IJA3WCJYLPYYUD673OOAGRGZKJ","short_pith_number":"pith:IJA3WCJY","schema_version":"1.0","canonical_sha256":"4241bb09385bf18a0fdfdb9c0344d95269d99b1e46da014c1e5f6b515406132c","source":{"kind":"arxiv","id":"1707.06724","version":3},"attestation_state":"computed","paper":{"title":"On the Design of Secure Full-Duplex Multiuser Systems under User Grouping Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hieu V. Nguyen, Octavia A. Dobre, Oh-Soon Shin, Van-Dinh Nguyen","submitted_at":"2017-07-21T00:15:51Z","abstract_excerpt":"Consider a full-duplex (FD) multiuser system where an FD base station (BS) is designed to simultaneously serve both downlink users and uplink users in the presence of half-duplex eavesdroppers (Eves). Our problem is to maximize the minimum secrecy rate (SR) among all legitimate users by proposing a novel user grouping method, where information signals at the FD-BS are accompanied with artificial noise to degrade the Eves' channel. The SR problem has a highly nonconcave and nonsmooth objective, subject to nonconvex constraints due to coupling between the optimization variables. Nevertheless, we"},"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":"1707.06724","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-21T00:15:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51aeeb2884d17187f006a3a07b8ca517593c86d9c47cbf10d0ece0a8b794f8d6","abstract_canon_sha256":"5f9e6ffae5c3d8492cbbf2f5b2cd3d9a5c346051a8f3ce4156ac23bda7142299"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:50.691421Z","signature_b64":"Pf6Qto/0174Tzea4NOBYx6pkpvEU3W3DsD5fgOxGmDJAblJM/t6cV/u1795KMBfvowael4YL5Nn20Twioo32BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4241bb09385bf18a0fdfdb9c0344d95269d99b1e46da014c1e5f6b515406132c","last_reissued_at":"2026-05-18T00:31:50.690944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:50.690944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Design of Secure Full-Duplex Multiuser Systems under User Grouping Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hieu V. Nguyen, Octavia A. Dobre, Oh-Soon Shin, Van-Dinh Nguyen","submitted_at":"2017-07-21T00:15:51Z","abstract_excerpt":"Consider a full-duplex (FD) multiuser system where an FD base station (BS) is designed to simultaneously serve both downlink users and uplink users in the presence of half-duplex eavesdroppers (Eves). Our problem is to maximize the minimum secrecy rate (SR) among all legitimate users by proposing a novel user grouping method, where information signals at the FD-BS are accompanied with artificial noise to degrade the Eves' channel. The SR problem has a highly nonconcave and nonsmooth objective, subject to nonconvex constraints due to coupling between the optimization variables. Nevertheless, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06724","kind":"arxiv","version":3},"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":"1707.06724","created_at":"2026-05-18T00:31:50.691011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06724v3","created_at":"2026-05-18T00:31:50.691011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06724","created_at":"2026-05-18T00:31:50.691011+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJA3WCJYLPYY","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJA3WCJYLPYYUD67","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJA3WCJY","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/IJA3WCJYLPYYUD673OOAGRGZKJ","json":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ.json","graph_json":"https://pith.science/api/pith-number/IJA3WCJYLPYYUD673OOAGRGZKJ/graph.json","events_json":"https://pith.science/api/pith-number/IJA3WCJYLPYYUD673OOAGRGZKJ/events.json","paper":"https://pith.science/paper/IJA3WCJY"},"agent_actions":{"view_html":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ","download_json":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ.json","view_paper":"https://pith.science/paper/IJA3WCJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06724&json=true","fetch_graph":"https://pith.science/api/pith-number/IJA3WCJYLPYYUD673OOAGRGZKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/IJA3WCJYLPYYUD673OOAGRGZKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ/action/storage_attestation","attest_author":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ/action/author_attestation","sign_citation":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ/action/citation_signature","submit_replication":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ/action/replication_record"}},"created_at":"2026-05-18T00:31:50.691011+00:00","updated_at":"2026-05-18T00:31:50.691011+00:00"}