{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HXGOFR7ORHX2A5DZ4G6F6DFQ3V","short_pith_number":"pith:HXGOFR7O","canonical_record":{"source":{"id":"1705.06113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-17T12:13:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"90761574f2bae75059d7ef0fdc878b25fc2ad3749d8a52cbd8353f4c5c8800bd","abstract_canon_sha256":"2dc3dd673f072c36ba73c91d5fb3b2af5464704103d881427a3fc8f6dd1e94bc"},"schema_version":"1.0"},"canonical_sha256":"3dcce2c7ee89efa07479e1bc5f0cb0dd4a20dc22a8663e959e4d49696b89bbd6","source":{"kind":"arxiv","id":"1705.06113","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06113","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06113v1","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06113","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"HXGOFR7ORHX2","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HXGOFR7ORHX2A5DZ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HXGOFR7O","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HXGOFR7ORHX2A5DZ4G6F6DFQ3V","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-17T12:13:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"90761574f2bae75059d7ef0fdc878b25fc2ad3749d8a52cbd8353f4c5c8800bd","abstract_canon_sha256":"2dc3dd673f072c36ba73c91d5fb3b2af5464704103d881427a3fc8f6dd1e94bc"},"schema_version":"1.0"},"canonical_sha256":"3dcce2c7ee89efa07479e1bc5f0cb0dd4a20dc22a8663e959e4d49696b89bbd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:18.979808Z","signature_b64":"Cyo0+zNLRH4ppSJkUwy1jinLIDXSDZP3RE2k05o1WFr/huS7PI8rjAxwA9MjE+kGFk3QYTDA5iFGXwcRVmqRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dcce2c7ee89efa07479e1bc5f0cb0dd4a20dc22a8663e959e4d49696b89bbd6","last_reissued_at":"2026-05-18T00:44:18.979334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:18.979334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06113","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-05-18T00:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hxVfNM9W7E4ava4QQve4U1tq8/QbftJIR25jNpS2gAdz199+/aIUW+P5sQobzPc3/2WHU8aU+SsseANkCPQVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:41:57.373880Z"},"content_sha256":"c3a9f2e445e7deaf1ecba2b1c3a578a0dffd7296c6463e41d01b9c3d27f03cc8","schema_version":"1.0","event_id":"sha256:c3a9f2e445e7deaf1ecba2b1c3a578a0dffd7296c6463e41d01b9c3d27f03cc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HXGOFR7ORHX2A5DZ4G6F6DFQ3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Sum Secrecy Rate Optimization for MIMO Two-way Full Duplex Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arumugam Nallanathan, Huan X. Nguyen, Mehmet Karamanoglu, Tuan Anh Le, Zheng Chu","submitted_at":"2017-05-17T12:13:04Z","abstract_excerpt":"This paper considers multiple-input multiple-output (MIMO) full-duplex (FD) two-way secrecy systems. Specifically, both multi-antenna FD legitimate nodes exchange their own confidential message in the presence of an eavesdropper. Taking into account the imperfect channel state information (CSI) of the eavesdropper, we formulate a robust sum secrecy rate maximization (RSSRM) problem subject to the outage probability constraint of the achievable sum secrecy rate and the transmit power constraint. Unlike other existing channel uncertainty models, e.g., norm-bounded and Gaussian-distribution, we e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06113","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"},"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:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAeMMaz6J4ofN52qo2uLmiHaWdTkYY5khHIOc+3+y5cHcrlph/widWVZ5YmYCefQU9oTOGitXittH6rsBVCgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:41:57.374225Z"},"content_sha256":"293a19c64ebbca425d989f5745a69c5f46a0e4b1e3da8fabbd1022b9db94f1ca","schema_version":"1.0","event_id":"sha256:293a19c64ebbca425d989f5745a69c5f46a0e4b1e3da8fabbd1022b9db94f1ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXGOFR7ORHX2A5DZ4G6F6DFQ3V/bundle.json","state_url":"https://pith.science/pith/HXGOFR7ORHX2A5DZ4G6F6DFQ3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXGOFR7ORHX2A5DZ4G6F6DFQ3V/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-05-28T08:41:57Z","links":{"resolver":"https://pith.science/pith/HXGOFR7ORHX2A5DZ4G6F6DFQ3V","bundle":"https://pith.science/pith/HXGOFR7ORHX2A5DZ4G6F6DFQ3V/bundle.json","state":"https://pith.science/pith/HXGOFR7ORHX2A5DZ4G6F6DFQ3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXGOFR7ORHX2A5DZ4G6F6DFQ3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HXGOFR7ORHX2A5DZ4G6F6DFQ3V","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":"2dc3dd673f072c36ba73c91d5fb3b2af5464704103d881427a3fc8f6dd1e94bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-17T12:13:04Z","title_canon_sha256":"90761574f2bae75059d7ef0fdc878b25fc2ad3749d8a52cbd8353f4c5c8800bd"},"schema_version":"1.0","source":{"id":"1705.06113","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06113","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06113v1","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06113","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"HXGOFR7ORHX2","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HXGOFR7ORHX2A5DZ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HXGOFR7O","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:293a19c64ebbca425d989f5745a69c5f46a0e4b1e3da8fabbd1022b9db94f1ca","target":"graph","created_at":"2026-05-18T00:44:18Z","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":"This paper considers multiple-input multiple-output (MIMO) full-duplex (FD) two-way secrecy systems. Specifically, both multi-antenna FD legitimate nodes exchange their own confidential message in the presence of an eavesdropper. Taking into account the imperfect channel state information (CSI) of the eavesdropper, we formulate a robust sum secrecy rate maximization (RSSRM) problem subject to the outage probability constraint of the achievable sum secrecy rate and the transmit power constraint. Unlike other existing channel uncertainty models, e.g., norm-bounded and Gaussian-distribution, we e","authors_text":"Arumugam Nallanathan, Huan X. Nguyen, Mehmet Karamanoglu, Tuan Anh Le, Zheng Chu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-17T12:13:04Z","title":"Robust Sum Secrecy Rate Optimization for MIMO Two-way Full Duplex Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06113","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:c3a9f2e445e7deaf1ecba2b1c3a578a0dffd7296c6463e41d01b9c3d27f03cc8","target":"record","created_at":"2026-05-18T00:44:18Z","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":"2dc3dd673f072c36ba73c91d5fb3b2af5464704103d881427a3fc8f6dd1e94bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-17T12:13:04Z","title_canon_sha256":"90761574f2bae75059d7ef0fdc878b25fc2ad3749d8a52cbd8353f4c5c8800bd"},"schema_version":"1.0","source":{"id":"1705.06113","kind":"arxiv","version":1}},"canonical_sha256":"3dcce2c7ee89efa07479e1bc5f0cb0dd4a20dc22a8663e959e4d49696b89bbd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dcce2c7ee89efa07479e1bc5f0cb0dd4a20dc22a8663e959e4d49696b89bbd6","first_computed_at":"2026-05-18T00:44:18.979334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:18.979334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cyo0+zNLRH4ppSJkUwy1jinLIDXSDZP3RE2k05o1WFr/huS7PI8rjAxwA9MjE+kGFk3QYTDA5iFGXwcRVmqRBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:18.979808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06113","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3a9f2e445e7deaf1ecba2b1c3a578a0dffd7296c6463e41d01b9c3d27f03cc8","sha256:293a19c64ebbca425d989f5745a69c5f46a0e4b1e3da8fabbd1022b9db94f1ca"],"state_sha256":"5063bf8700cebee737c32e1bc458f3147ac449361390c19cabb1519ae3919fb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pcSIMEIt2EyCFE4zNQolDCFgJq+L70CrxIEbASEdw33MQugRObtJQqYjEOVgx/cGz7Yzon2Uevm/d4OQZXmwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:41:57.376250Z","bundle_sha256":"88e79ddf60255e2bc8c42f0211226cf332a36fe9eac0fc41b8aac69c1a56cf26"}}