{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OOFTLH66OC5DTV3IQXYJM3ASFI","short_pith_number":"pith:OOFTLH66","canonical_record":{"source":{"id":"1703.00147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-01T06:12:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d81e463e539b3c52ec7340985d4b910b865bc273be303c5a2c718298c6e99e17","abstract_canon_sha256":"9d11ac8fa89f77f10a3d660b0da30f43faf2a2797fb6b9d831b7c37738aef596"},"schema_version":"1.0"},"canonical_sha256":"738b359fde70ba39d76885f0966c122a36a58ea93eee932de7099ff26c201a38","source":{"kind":"arxiv","id":"1703.00147","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00147","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00147v1","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00147","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"OOFTLH66OC5D","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OOFTLH66OC5DTV3I","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OOFTLH66","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OOFTLH66OC5DTV3IQXYJM3ASFI","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-01T06:12:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d81e463e539b3c52ec7340985d4b910b865bc273be303c5a2c718298c6e99e17","abstract_canon_sha256":"9d11ac8fa89f77f10a3d660b0da30f43faf2a2797fb6b9d831b7c37738aef596"},"schema_version":"1.0"},"canonical_sha256":"738b359fde70ba39d76885f0966c122a36a58ea93eee932de7099ff26c201a38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:45.845020Z","signature_b64":"24Ze3GzilThQ5eGKScnasqdt0wEho0ExtZBJGjFNJ01cvioe3uSUAq2Ke0qKkOiIbu8yOYrMUMjzJfDfSoX6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"738b359fde70ba39d76885f0966c122a36a58ea93eee932de7099ff26c201a38","last_reissued_at":"2026-05-18T00:49:45.844509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:45.844509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00147","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:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iw7teqmTwbcohmyWqt2BmAVhIU+55BMpev0CIKhlIWAR1ATLag/zS5b14A46/Om60S12gkos9DwC4Ubw4XLXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:24:45.782828Z"},"content_sha256":"e24a2e45c2552ab170e7273b954906b8929022998a8f2080b216553c287740cc","schema_version":"1.0","event_id":"sha256:e24a2e45c2552ab170e7273b954906b8929022998a8f2080b216553c287740cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OOFTLH66OC5DTV3IQXYJM3ASFI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Beamforming for Secrecy Rate in Cooperative Cognitive Radio Multicast Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arumugam Nallanathan, George K. Karagiannidis, Oh-Soon Shin, Trung Q. Duong, Van-Dinh Nguyen","submitted_at":"2017-03-01T06:12:54Z","abstract_excerpt":"In this paper, we propose a cooperative approach to improve the security of both primary and secondary systems in cognitive radio multicast communications. During their access to the frequency spectrum licensed to the primary users, the secondary unlicensed users assist the primary system in fortifying security by sending a jamming noise to the eavesdroppers, while simultaneously protect themselves from eavesdropping. The main objective of this work is to maximize the secrecy rate of the secondary system, while adhering to all individual primary users' secrecy rate constraints. In the case of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00147","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:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pLo05YXkfEEKWOjDGbspMElC06vZcGw4IQ/L7Frn5+REuPcEUgTOzzWi8IfiQaFY6YLF+Kb5F1j6rZ/Pmj1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:24:45.783298Z"},"content_sha256":"acf48d8378509de77cc0e14b89d487e893ca7666f359612e22296e98c115e93c","schema_version":"1.0","event_id":"sha256:acf48d8378509de77cc0e14b89d487e893ca7666f359612e22296e98c115e93c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOFTLH66OC5DTV3IQXYJM3ASFI/bundle.json","state_url":"https://pith.science/pith/OOFTLH66OC5DTV3IQXYJM3ASFI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOFTLH66OC5DTV3IQXYJM3ASFI/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-19T19:24:45Z","links":{"resolver":"https://pith.science/pith/OOFTLH66OC5DTV3IQXYJM3ASFI","bundle":"https://pith.science/pith/OOFTLH66OC5DTV3IQXYJM3ASFI/bundle.json","state":"https://pith.science/pith/OOFTLH66OC5DTV3IQXYJM3ASFI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOFTLH66OC5DTV3IQXYJM3ASFI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OOFTLH66OC5DTV3IQXYJM3ASFI","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":"9d11ac8fa89f77f10a3d660b0da30f43faf2a2797fb6b9d831b7c37738aef596","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-01T06:12:54Z","title_canon_sha256":"d81e463e539b3c52ec7340985d4b910b865bc273be303c5a2c718298c6e99e17"},"schema_version":"1.0","source":{"id":"1703.00147","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00147","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00147v1","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00147","created_at":"2026-05-18T00:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"OOFTLH66OC5D","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OOFTLH66OC5DTV3I","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OOFTLH66","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:acf48d8378509de77cc0e14b89d487e893ca7666f359612e22296e98c115e93c","target":"graph","created_at":"2026-05-18T00:49:45Z","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":"In this paper, we propose a cooperative approach to improve the security of both primary and secondary systems in cognitive radio multicast communications. During their access to the frequency spectrum licensed to the primary users, the secondary unlicensed users assist the primary system in fortifying security by sending a jamming noise to the eavesdroppers, while simultaneously protect themselves from eavesdropping. The main objective of this work is to maximize the secrecy rate of the secondary system, while adhering to all individual primary users' secrecy rate constraints. In the case of ","authors_text":"Arumugam Nallanathan, George K. Karagiannidis, Oh-Soon Shin, Trung Q. Duong, Van-Dinh Nguyen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-01T06:12:54Z","title":"Robust Beamforming for Secrecy Rate in Cooperative Cognitive Radio Multicast Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00147","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:e24a2e45c2552ab170e7273b954906b8929022998a8f2080b216553c287740cc","target":"record","created_at":"2026-05-18T00:49:45Z","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":"9d11ac8fa89f77f10a3d660b0da30f43faf2a2797fb6b9d831b7c37738aef596","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-01T06:12:54Z","title_canon_sha256":"d81e463e539b3c52ec7340985d4b910b865bc273be303c5a2c718298c6e99e17"},"schema_version":"1.0","source":{"id":"1703.00147","kind":"arxiv","version":1}},"canonical_sha256":"738b359fde70ba39d76885f0966c122a36a58ea93eee932de7099ff26c201a38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"738b359fde70ba39d76885f0966c122a36a58ea93eee932de7099ff26c201a38","first_computed_at":"2026-05-18T00:49:45.844509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:45.844509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"24Ze3GzilThQ5eGKScnasqdt0wEho0ExtZBJGjFNJ01cvioe3uSUAq2Ke0qKkOiIbu8yOYrMUMjzJfDfSoX6AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:45.845020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00147","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e24a2e45c2552ab170e7273b954906b8929022998a8f2080b216553c287740cc","sha256:acf48d8378509de77cc0e14b89d487e893ca7666f359612e22296e98c115e93c"],"state_sha256":"5b95ba845e05f47187cce6e1a235e9fc372b69bb4099ddcf2d2afa29695e118e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KpjAanadHeMEmTnc+qf4rS4hS6vuN9TCM66erNOjHKAyCtD5ITbdD1SOVDPeQ9DRHDodcj0LfAodg4taacTrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:24:45.787926Z","bundle_sha256":"963c8ddbdfd6a32dde839b2e12d9611397453b4d4c022f153f7d992dc2361153"}}