{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IJA3WCJYLPYYUD673OOAGRGZKJ","short_pith_number":"pith:IJA3WCJY","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"},"canonical_sha256":"4241bb09385bf18a0fdfdb9c0344d95269d99b1e46da014c1e5f6b515406132c","source":{"kind":"arxiv","id":"1707.06724","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06724","created_at":"2026-05-18T00:31:50Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06724v3","created_at":"2026-05-18T00:31:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06724","created_at":"2026-05-18T00:31:50Z"},{"alias_kind":"pith_short_12","alias_value":"IJA3WCJYLPYY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IJA3WCJYLPYYUD67","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IJA3WCJY","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IJA3WCJYLPYYUD673OOAGRGZKJ","target":"record","payload":{"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"},"canonical_sha256":"4241bb09385bf18a0fdfdb9c0344d95269d99b1e46da014c1e5f6b515406132c","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"},"source_kind":"arxiv","source_id":"1707.06724","source_version":3,"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-05-18T00:31:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOJeLhzvCMneP3cHK2ikzh2+Q7H9PcXiiinHFSVYKn0ugPs3gA9iJ2Ms0oI8VFF6GxINASMPQOPdaPlltEIJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:07:02.032965Z"},"content_sha256":"1a19d2af4889b0a38568a617097bdeb092c6c58b010430382eb6d1a621510a9e","schema_version":"1.0","event_id":"sha256:1a19d2af4889b0a38568a617097bdeb092c6c58b010430382eb6d1a621510a9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IJA3WCJYLPYYUD673OOAGRGZKJ","target":"graph","payload":{"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"},"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-05-18T00:31:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ny2/+51yZdm/gGd0n7bphvjxFP2ilYOId8nfnCXDZoxskFBYHnW2NaDpyh0nFEpEz+AZOi/mZzmEMQs/y1w8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:07:02.033323Z"},"content_sha256":"87bc51987549b9806f4a9fe0c5c1104d7ff9f57762c2b253ef1024a3b977161d","schema_version":"1.0","event_id":"sha256:87bc51987549b9806f4a9fe0c5c1104d7ff9f57762c2b253ef1024a3b977161d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ/bundle.json","state_url":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJA3WCJYLPYYUD673OOAGRGZKJ/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-07-01T21:07:02Z","links":{"resolver":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ","bundle":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ/bundle.json","state":"https://pith.science/pith/IJA3WCJYLPYYUD673OOAGRGZKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJA3WCJYLPYYUD673OOAGRGZKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IJA3WCJYLPYYUD673OOAGRGZKJ","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":"5f9e6ffae5c3d8492cbbf2f5b2cd3d9a5c346051a8f3ce4156ac23bda7142299","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-21T00:15:51Z","title_canon_sha256":"51aeeb2884d17187f006a3a07b8ca517593c86d9c47cbf10d0ece0a8b794f8d6"},"schema_version":"1.0","source":{"id":"1707.06724","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06724","created_at":"2026-05-18T00:31:50Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06724v3","created_at":"2026-05-18T00:31:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06724","created_at":"2026-05-18T00:31:50Z"},{"alias_kind":"pith_short_12","alias_value":"IJA3WCJYLPYY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IJA3WCJYLPYYUD67","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IJA3WCJY","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:87bc51987549b9806f4a9fe0c5c1104d7ff9f57762c2b253ef1024a3b977161d","target":"graph","created_at":"2026-05-18T00:31:50Z","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"},"paper":{"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","authors_text":"Hieu V. Nguyen, Octavia A. Dobre, Oh-Soon Shin, Van-Dinh Nguyen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-21T00:15:51Z","title":"On the Design of Secure Full-Duplex Multiuser Systems under User Grouping Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06724","kind":"arxiv","version":3},"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:1a19d2af4889b0a38568a617097bdeb092c6c58b010430382eb6d1a621510a9e","target":"record","created_at":"2026-05-18T00:31:50Z","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":"5f9e6ffae5c3d8492cbbf2f5b2cd3d9a5c346051a8f3ce4156ac23bda7142299","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-21T00:15:51Z","title_canon_sha256":"51aeeb2884d17187f006a3a07b8ca517593c86d9c47cbf10d0ece0a8b794f8d6"},"schema_version":"1.0","source":{"id":"1707.06724","kind":"arxiv","version":3}},"canonical_sha256":"4241bb09385bf18a0fdfdb9c0344d95269d99b1e46da014c1e5f6b515406132c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4241bb09385bf18a0fdfdb9c0344d95269d99b1e46da014c1e5f6b515406132c","first_computed_at":"2026-05-18T00:31:50.690944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:50.690944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pf6Qto/0174Tzea4NOBYx6pkpvEU3W3DsD5fgOxGmDJAblJM/t6cV/u1795KMBfvowael4YL5Nn20Twioo32BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:50.691421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06724","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a19d2af4889b0a38568a617097bdeb092c6c58b010430382eb6d1a621510a9e","sha256:87bc51987549b9806f4a9fe0c5c1104d7ff9f57762c2b253ef1024a3b977161d"],"state_sha256":"4a995ced3dbdb574fbee8fd1982c45e7ade1fea2f5c99ee0d8cd921f2ec53279"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tusHRiwLXb0+yJ7HsWzdmAeKc/kiqSAYjwlF3+rPc2qn0iB4YTAYW1yJGSjoT5qAETZSclxXB0qyLwLUit+dBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T21:07:02.035246Z","bundle_sha256":"0922eb93d0b8bfaadcd4a535822d7d369b2d30d75d9214a42ee4eecab8eecc97"}}