{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BUC2VLGUJJNVJHDEGCOGYNF6BQ","short_pith_number":"pith:BUC2VLGU","canonical_record":{"source":{"id":"1405.4522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-18T16:18:27Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"a0431e681790a78f5070a69465f7c2c9aae1acbb561659b03dfd8d1f0d5aa516","abstract_canon_sha256":"cee1c5d1ace4f51ea4f5ce6a4f77e229741ecacf76a50556ec9c90c674dda9b9"},"schema_version":"1.0"},"canonical_sha256":"0d05aaacd44a5b549c64309c6c34be0c1feacd02057c371b553f7cf0222a35a0","source":{"kind":"arxiv","id":"1405.4522","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4522","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4522v1","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4522","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"BUC2VLGUJJNV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BUC2VLGUJJNVJHDE","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BUC2VLGU","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BUC2VLGUJJNVJHDEGCOGYNF6BQ","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-18T16:18:27Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"a0431e681790a78f5070a69465f7c2c9aae1acbb561659b03dfd8d1f0d5aa516","abstract_canon_sha256":"cee1c5d1ace4f51ea4f5ce6a4f77e229741ecacf76a50556ec9c90c674dda9b9"},"schema_version":"1.0"},"canonical_sha256":"0d05aaacd44a5b549c64309c6c34be0c1feacd02057c371b553f7cf0222a35a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:50.112474Z","signature_b64":"+Q0oJznAtMlF8nB50iZWpYnps0TixRES5CI4KZvLmhRhH1lQMwODmIN4s4ID4XfC/U0LJr+LqGYbTbG0R/ZMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d05aaacd44a5b549c64309c6c34be0c1feacd02057c371b553f7cf0222a35a0","last_reissued_at":"2026-05-18T02:50:50.111986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:50.111986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4522","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-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FxtuB307H6aTjhIBua4zWxIHUY+vdZc4xhNQ64P++X7iRHVye89ASAijbjVsPUd6/Tejkum+l/YE73FPSjuMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:01:04.010434Z"},"content_sha256":"815b450ae9c6ff950a734c33909e3fd9b69a7121c66b0485367535f8a6aa8f9a","schema_version":"1.0","event_id":"sha256:815b450ae9c6ff950a734c33909e3fd9b69a7121c66b0485367535f8a6aa8f9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BUC2VLGUJJNVJHDEGCOGYNF6BQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure Transmission in Amplify and Forward Networks for Multiple Degraded Eavesdroppers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Joy Kuri, Samar Agnihotri, Siddhartha Sarma","submitted_at":"2014-05-18T16:18:27Z","abstract_excerpt":"We have evaluated the optimal secrecy rate for Amplify-and-Forward (AF) relay networks with multiple eavesdroppers. Assuming i.i.d. Gaussian noise at the destination and the eavesdroppers, we have devised technique to calculate optimal scaling factor for relay nodes to obtain optimal secrecy rate under both sum power constraint and individual power constraint. Initially, we have considered special channel conditions for both destination and eavesdroppers, which led us to analytical solution of the problem. Contrarily, the general scenario being a non-convex optimization problem, not only lacks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4522","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-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"thiyONmSIIfohSZHpk14OBybtO0rHzdhToATpAu2hwaE2j17bPwBATA9FLI65EKgYhKsYBsdCcvoqzeqM4BcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:01:04.010772Z"},"content_sha256":"d12da88fc1d28d42e1d9e0d4aa5f51ff5d8054c984d578d51a9b86a9c32bbc6f","schema_version":"1.0","event_id":"sha256:d12da88fc1d28d42e1d9e0d4aa5f51ff5d8054c984d578d51a9b86a9c32bbc6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BUC2VLGUJJNVJHDEGCOGYNF6BQ/bundle.json","state_url":"https://pith.science/pith/BUC2VLGUJJNVJHDEGCOGYNF6BQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BUC2VLGUJJNVJHDEGCOGYNF6BQ/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-29T11:01:04Z","links":{"resolver":"https://pith.science/pith/BUC2VLGUJJNVJHDEGCOGYNF6BQ","bundle":"https://pith.science/pith/BUC2VLGUJJNVJHDEGCOGYNF6BQ/bundle.json","state":"https://pith.science/pith/BUC2VLGUJJNVJHDEGCOGYNF6BQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BUC2VLGUJJNVJHDEGCOGYNF6BQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BUC2VLGUJJNVJHDEGCOGYNF6BQ","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":"cee1c5d1ace4f51ea4f5ce6a4f77e229741ecacf76a50556ec9c90c674dda9b9","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-18T16:18:27Z","title_canon_sha256":"a0431e681790a78f5070a69465f7c2c9aae1acbb561659b03dfd8d1f0d5aa516"},"schema_version":"1.0","source":{"id":"1405.4522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4522","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4522v1","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4522","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"BUC2VLGUJJNV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BUC2VLGUJJNVJHDE","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BUC2VLGU","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:d12da88fc1d28d42e1d9e0d4aa5f51ff5d8054c984d578d51a9b86a9c32bbc6f","target":"graph","created_at":"2026-05-18T02:50:50Z","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":"We have evaluated the optimal secrecy rate for Amplify-and-Forward (AF) relay networks with multiple eavesdroppers. Assuming i.i.d. Gaussian noise at the destination and the eavesdroppers, we have devised technique to calculate optimal scaling factor for relay nodes to obtain optimal secrecy rate under both sum power constraint and individual power constraint. Initially, we have considered special channel conditions for both destination and eavesdroppers, which led us to analytical solution of the problem. Contrarily, the general scenario being a non-convex optimization problem, not only lacks","authors_text":"Joy Kuri, Samar Agnihotri, Siddhartha Sarma","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-18T16:18:27Z","title":"Secure Transmission in Amplify and Forward Networks for Multiple Degraded Eavesdroppers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4522","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:815b450ae9c6ff950a734c33909e3fd9b69a7121c66b0485367535f8a6aa8f9a","target":"record","created_at":"2026-05-18T02:50:50Z","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":"cee1c5d1ace4f51ea4f5ce6a4f77e229741ecacf76a50556ec9c90c674dda9b9","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-18T16:18:27Z","title_canon_sha256":"a0431e681790a78f5070a69465f7c2c9aae1acbb561659b03dfd8d1f0d5aa516"},"schema_version":"1.0","source":{"id":"1405.4522","kind":"arxiv","version":1}},"canonical_sha256":"0d05aaacd44a5b549c64309c6c34be0c1feacd02057c371b553f7cf0222a35a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d05aaacd44a5b549c64309c6c34be0c1feacd02057c371b553f7cf0222a35a0","first_computed_at":"2026-05-18T02:50:50.111986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:50.111986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Q0oJznAtMlF8nB50iZWpYnps0TixRES5CI4KZvLmhRhH1lQMwODmIN4s4ID4XfC/U0LJr+LqGYbTbG0R/ZMAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:50.112474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:815b450ae9c6ff950a734c33909e3fd9b69a7121c66b0485367535f8a6aa8f9a","sha256:d12da88fc1d28d42e1d9e0d4aa5f51ff5d8054c984d578d51a9b86a9c32bbc6f"],"state_sha256":"d3b3524c351e21d44cd66760e14a07a7af7835aaa2ea63d4034a2bdb1cf635ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iF1oGzJst3ElPfS+D/81bKviyAyAhLQlsRHxH3cgcLAMD7oJ+8sMaTHsE/Y6qL0eAVplq+0HieO/Mnqe1m8yBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T11:01:04.012766Z","bundle_sha256":"0a767c88bbb2149e4fbafa77b8f34e7be78745702286dea304bc5ac0d037760c"}}