{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ILKP3I5VRVKK7XUVD57UTST6TT","short_pith_number":"pith:ILKP3I5V","schema_version":"1.0","canonical_sha256":"42d4fda3b58d54afde951f7f49ca7e9ce1cbf784d6aca0ca1239eb95f8c5a127","source":{"kind":"arxiv","id":"1611.05839","version":1},"attestation_state":"computed","paper":{"title":"Maximizing the minimum achievable secrecy rate of two-way relay networks using the null space beamforming method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Erfan Khordad, Meysam Mirzaee, Soroush Akhlaghi","submitted_at":"2016-11-17T20:06:03Z","abstract_excerpt":"This paper concerns maximizing the minimum achievable secrecy rate of a two-way relay network in the presence of an eavesdropper, in which two nodes aim to exchange messages in two hops, using a multi-antenna relay. Throughout the first hop, the two nodes simultaneously transmit their messages to the relay. In the second hop, the relay broadcasts a combination of the received information to the users such that the transmitted signal lies in the null space of the eavesdropper's channel; this is called null space beamforming (NSBF). The best NSBF matrix for maximizing the minimum achievable secr"},"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":"1611.05839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-17T20:06:03Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"c2c34638554fce1c198a98f6c3218a79aac04b7123ecbabe31b3c2d758a70dcc","abstract_canon_sha256":"6a167faaf2944538a405841605f532e71003aa9fafdd45c824759e7b4cc07bd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:39.256393Z","signature_b64":"40VnZUwZYq+IvgGBQqJR79x3xQ08EBfDEbpaoJ8Tp9NIZANmUkMT/9fv6qnlr8aLaQYKpBhb3K8kGOs7Gti+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42d4fda3b58d54afde951f7f49ca7e9ce1cbf784d6aca0ca1239eb95f8c5a127","last_reissued_at":"2026-05-18T00:42:39.255829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:39.255829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing the minimum achievable secrecy rate of two-way relay networks using the null space beamforming method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Erfan Khordad, Meysam Mirzaee, Soroush Akhlaghi","submitted_at":"2016-11-17T20:06:03Z","abstract_excerpt":"This paper concerns maximizing the minimum achievable secrecy rate of a two-way relay network in the presence of an eavesdropper, in which two nodes aim to exchange messages in two hops, using a multi-antenna relay. Throughout the first hop, the two nodes simultaneously transmit their messages to the relay. In the second hop, the relay broadcasts a combination of the received information to the users such that the transmitted signal lies in the null space of the eavesdropper's channel; this is called null space beamforming (NSBF). The best NSBF matrix for maximizing the minimum achievable secr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05839","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":"1611.05839","created_at":"2026-05-18T00:42:39.255920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05839v1","created_at":"2026-05-18T00:42:39.255920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05839","created_at":"2026-05-18T00:42:39.255920+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILKP3I5VRVKK","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILKP3I5VRVKK7XUV","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILKP3I5V","created_at":"2026-05-18T12:30:22.444734+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/ILKP3I5VRVKK7XUVD57UTST6TT","json":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT.json","graph_json":"https://pith.science/api/pith-number/ILKP3I5VRVKK7XUVD57UTST6TT/graph.json","events_json":"https://pith.science/api/pith-number/ILKP3I5VRVKK7XUVD57UTST6TT/events.json","paper":"https://pith.science/paper/ILKP3I5V"},"agent_actions":{"view_html":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT","download_json":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT.json","view_paper":"https://pith.science/paper/ILKP3I5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05839&json=true","fetch_graph":"https://pith.science/api/pith-number/ILKP3I5VRVKK7XUVD57UTST6TT/graph.json","fetch_events":"https://pith.science/api/pith-number/ILKP3I5VRVKK7XUVD57UTST6TT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT/action/storage_attestation","attest_author":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT/action/author_attestation","sign_citation":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT/action/citation_signature","submit_replication":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT/action/replication_record"}},"created_at":"2026-05-18T00:42:39.255920+00:00","updated_at":"2026-05-18T00:42:39.255920+00:00"}