{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NG23NRPGTHGGNLHTYP5EYXADSZ","short_pith_number":"pith:NG23NRPG","canonical_record":{"source":{"id":"1504.03149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-13T12:28:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1fa6d5746cb46f3603092bce45a490306482040b2303643205f86eba4736725f","abstract_canon_sha256":"6ef5f4ab44d9084271b84384e5654be736971b01a21310edae175c333831e1f4"},"schema_version":"1.0"},"canonical_sha256":"69b5b6c5e699cc66acf3c3fa4c5c03964ca8f2006f322ccd1379f5d6877c1e1d","source":{"kind":"arxiv","id":"1504.03149","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03149","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03149v2","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03149","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"pith_short_12","alias_value":"NG23NRPGTHGG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NG23NRPGTHGGNLHT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NG23NRPG","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NG23NRPGTHGGNLHTYP5EYXADSZ","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-13T12:28:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1fa6d5746cb46f3603092bce45a490306482040b2303643205f86eba4736725f","abstract_canon_sha256":"6ef5f4ab44d9084271b84384e5654be736971b01a21310edae175c333831e1f4"},"schema_version":"1.0"},"canonical_sha256":"69b5b6c5e699cc66acf3c3fa4c5c03964ca8f2006f322ccd1379f5d6877c1e1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:30.936508Z","signature_b64":"GCoSS9Yxd2O7FQpe6gzzScWXY8jznC0YhJcbEgCW4Jcb6qSbCgOfjNEg62iu25QyzpaBgN8i/qvy0evt8tp7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69b5b6c5e699cc66acf3c3fa4c5c03964ca8f2006f322ccd1379f5d6877c1e1d","last_reissued_at":"2026-05-18T02:18:30.936041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:30.936041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03149","source_version":2,"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-18T02:18:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGHRfLkkKvSHb1d4IJzG1Z8q3Gcln/pw7H/mWal6hgGJ/bO1mgQfjlZEqOWJDBZUlN7VNk4QFm3CO6Zsg/nnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:03:41.132898Z"},"content_sha256":"8e4e0b15d520c52d9aaecf217f960697cb3f5ec7aa7aa365c3c91a4e30911f74","schema_version":"1.0","event_id":"sha256:8e4e0b15d520c52d9aaecf217f960697cb3f5ec7aa7aa365c3c91a4e30911f74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NG23NRPGTHGGNLHTYP5EYXADSZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure Transmission in Amplify-and-Forward Diamond Networks with a Single Eavesdropper","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joy Kuri, Samar Agnihotri, Siddhartha Sarma","submitted_at":"2015-04-13T12:28:37Z","abstract_excerpt":"Unicast communication over a network of $M$-parallel relays in the presence of an eavesdropper is considered. The relay nodes, operating under individual power constraints, amplify and forward the signals received at their inputs. The problem of the maximum secrecy rate achievable with AF relaying is addressed. Previous work on this problem provides iterative algorithms based on semidefinite relaxation. However, those algorithms result in suboptimal performance without any performance and convergence guarantees. We address this problem for three specific network models, with real-valued channe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03149","kind":"arxiv","version":2},"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-18T02:18:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdeeMlRexC3UxZE+VhHbDL8XzEZ1sN6i0Nwj9FxkOe/oUHnN/NMqSmzaymtM/xv1KnW849UqEslbJVrfVFTfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:03:41.133237Z"},"content_sha256":"fd5aff7aa73453b4ce6f402183752696531248cba8326f2b10c0372a183e0d8d","schema_version":"1.0","event_id":"sha256:fd5aff7aa73453b4ce6f402183752696531248cba8326f2b10c0372a183e0d8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NG23NRPGTHGGNLHTYP5EYXADSZ/bundle.json","state_url":"https://pith.science/pith/NG23NRPGTHGGNLHTYP5EYXADSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NG23NRPGTHGGNLHTYP5EYXADSZ/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-06-29T13:03:41Z","links":{"resolver":"https://pith.science/pith/NG23NRPGTHGGNLHTYP5EYXADSZ","bundle":"https://pith.science/pith/NG23NRPGTHGGNLHTYP5EYXADSZ/bundle.json","state":"https://pith.science/pith/NG23NRPGTHGGNLHTYP5EYXADSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NG23NRPGTHGGNLHTYP5EYXADSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NG23NRPGTHGGNLHTYP5EYXADSZ","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":"6ef5f4ab44d9084271b84384e5654be736971b01a21310edae175c333831e1f4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-13T12:28:37Z","title_canon_sha256":"1fa6d5746cb46f3603092bce45a490306482040b2303643205f86eba4736725f"},"schema_version":"1.0","source":{"id":"1504.03149","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03149","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03149v2","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03149","created_at":"2026-05-18T02:18:30Z"},{"alias_kind":"pith_short_12","alias_value":"NG23NRPGTHGG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NG23NRPGTHGGNLHT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NG23NRPG","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:fd5aff7aa73453b4ce6f402183752696531248cba8326f2b10c0372a183e0d8d","target":"graph","created_at":"2026-05-18T02:18:30Z","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":"Unicast communication over a network of $M$-parallel relays in the presence of an eavesdropper is considered. The relay nodes, operating under individual power constraints, amplify and forward the signals received at their inputs. The problem of the maximum secrecy rate achievable with AF relaying is addressed. Previous work on this problem provides iterative algorithms based on semidefinite relaxation. However, those algorithms result in suboptimal performance without any performance and convergence guarantees. We address this problem for three specific network models, with real-valued channe","authors_text":"Joy Kuri, Samar Agnihotri, Siddhartha Sarma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-13T12:28:37Z","title":"Secure Transmission in Amplify-and-Forward Diamond Networks with a Single Eavesdropper"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03149","kind":"arxiv","version":2},"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:8e4e0b15d520c52d9aaecf217f960697cb3f5ec7aa7aa365c3c91a4e30911f74","target":"record","created_at":"2026-05-18T02:18:30Z","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":"6ef5f4ab44d9084271b84384e5654be736971b01a21310edae175c333831e1f4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-13T12:28:37Z","title_canon_sha256":"1fa6d5746cb46f3603092bce45a490306482040b2303643205f86eba4736725f"},"schema_version":"1.0","source":{"id":"1504.03149","kind":"arxiv","version":2}},"canonical_sha256":"69b5b6c5e699cc66acf3c3fa4c5c03964ca8f2006f322ccd1379f5d6877c1e1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69b5b6c5e699cc66acf3c3fa4c5c03964ca8f2006f322ccd1379f5d6877c1e1d","first_computed_at":"2026-05-18T02:18:30.936041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:30.936041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GCoSS9Yxd2O7FQpe6gzzScWXY8jznC0YhJcbEgCW4Jcb6qSbCgOfjNEg62iu25QyzpaBgN8i/qvy0evt8tp7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:30.936508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03149","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e4e0b15d520c52d9aaecf217f960697cb3f5ec7aa7aa365c3c91a4e30911f74","sha256:fd5aff7aa73453b4ce6f402183752696531248cba8326f2b10c0372a183e0d8d"],"state_sha256":"950d8c3eb88c4ea1c02089d38fa71b8cecc674b9750f684b23d46d20cf6750e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GdXTCcuA05xzjitu2OUp/d0rwlzIdYi55HUCLyo0p7F5U+u/kxS7JnU//7GepeLmzZOBnfWZMvXk5TccgWgdBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:03:41.135125Z","bundle_sha256":"deb0506cc4e4d1b29cf1e65cdd96540e3ed0477b83ce1d635c77d5a723ed1891"}}