{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ILKP3I5VRVKK7XUVD57UTST6TT","short_pith_number":"pith:ILKP3I5V","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"},"canonical_sha256":"42d4fda3b58d54afde951f7f49ca7e9ce1cbf784d6aca0ca1239eb95f8c5a127","source":{"kind":"arxiv","id":"1611.05839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05839","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05839v1","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05839","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"ILKP3I5VRVKK","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ILKP3I5VRVKK7XUV","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ILKP3I5V","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ILKP3I5VRVKK7XUVD57UTST6TT","target":"record","payload":{"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"},"canonical_sha256":"42d4fda3b58d54afde951f7f49ca7e9ce1cbf784d6aca0ca1239eb95f8c5a127","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"},"source_kind":"arxiv","source_id":"1611.05839","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:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpa+87m5v2G96G4OPXQMcYs7mpbd7cwEpRdlknKXKwlvfr6qS1OMj4IEi/vN2C5kyjSyxxNp2PgdaAqa01z3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:36:36.571797Z"},"content_sha256":"f9034f891c922d9f5d08d68f559368cd524cb49e6e960b88524188378501fb92","schema_version":"1.0","event_id":"sha256:f9034f891c922d9f5d08d68f559368cd524cb49e6e960b88524188378501fb92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ILKP3I5VRVKK7XUVD57UTST6TT","target":"graph","payload":{"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"},"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:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmlFRfvW6ZFjB9VdM1XZZiQm/d+wIUf1QWH/k+zc41v8dsIBcg6JCTokwKRh3eX/dOYw/JqE4N8XcWG/aWj4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:36:36.572137Z"},"content_sha256":"cd0c49d2ce8cbb88947bc94a9df58312165e1069c3c17c9cbc20c61a8b4724ee","schema_version":"1.0","event_id":"sha256:cd0c49d2ce8cbb88947bc94a9df58312165e1069c3c17c9cbc20c61a8b4724ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT/bundle.json","state_url":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILKP3I5VRVKK7XUVD57UTST6TT/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-19T16:36:36Z","links":{"resolver":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT","bundle":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT/bundle.json","state":"https://pith.science/pith/ILKP3I5VRVKK7XUVD57UTST6TT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILKP3I5VRVKK7XUVD57UTST6TT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ILKP3I5VRVKK7XUVD57UTST6TT","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":"6a167faaf2944538a405841605f532e71003aa9fafdd45c824759e7b4cc07bd8","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-17T20:06:03Z","title_canon_sha256":"c2c34638554fce1c198a98f6c3218a79aac04b7123ecbabe31b3c2d758a70dcc"},"schema_version":"1.0","source":{"id":"1611.05839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05839","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05839v1","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05839","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"ILKP3I5VRVKK","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ILKP3I5VRVKK7XUV","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ILKP3I5V","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:cd0c49d2ce8cbb88947bc94a9df58312165e1069c3c17c9cbc20c61a8b4724ee","target":"graph","created_at":"2026-05-18T00:42:39Z","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 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","authors_text":"Erfan Khordad, Meysam Mirzaee, Soroush Akhlaghi","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-17T20:06:03Z","title":"Maximizing the minimum achievable secrecy rate of two-way relay networks using the null space beamforming method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05839","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:f9034f891c922d9f5d08d68f559368cd524cb49e6e960b88524188378501fb92","target":"record","created_at":"2026-05-18T00:42:39Z","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":"6a167faaf2944538a405841605f532e71003aa9fafdd45c824759e7b4cc07bd8","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-17T20:06:03Z","title_canon_sha256":"c2c34638554fce1c198a98f6c3218a79aac04b7123ecbabe31b3c2d758a70dcc"},"schema_version":"1.0","source":{"id":"1611.05839","kind":"arxiv","version":1}},"canonical_sha256":"42d4fda3b58d54afde951f7f49ca7e9ce1cbf784d6aca0ca1239eb95f8c5a127","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42d4fda3b58d54afde951f7f49ca7e9ce1cbf784d6aca0ca1239eb95f8c5a127","first_computed_at":"2026-05-18T00:42:39.255829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:39.255829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"40VnZUwZYq+IvgGBQqJR79x3xQ08EBfDEbpaoJ8Tp9NIZANmUkMT/9fv6qnlr8aLaQYKpBhb3K8kGOs7Gti+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:39.256393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9034f891c922d9f5d08d68f559368cd524cb49e6e960b88524188378501fb92","sha256:cd0c49d2ce8cbb88947bc94a9df58312165e1069c3c17c9cbc20c61a8b4724ee"],"state_sha256":"a48cfda54ee81fee513f93ec046c1332436da80a737012d976b9405fe76e0360"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0TGxyj4iylAuSu0Mhw1WZ743IZ2xlsf7OXKcnOU09wQsFpnl/rOyleJMTLs+N+UVtpmiW3BK66N6zNFX2DEvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T16:36:36.574190Z","bundle_sha256":"d786850aca4daf1ebea1f4649f3bb4802be01972b44aeaac338fd4156a76456c"}}