{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VD7CJUQJG5UFGWMN3FMLLZFJ4U","short_pith_number":"pith:VD7CJUQJ","canonical_record":{"source":{"id":"1701.04371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-01-12T10:45:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"00ff382ba909534583d2ed0e9a92cff6429877ac93d0bffa8f05b726996d11e5","abstract_canon_sha256":"0164778b5ac5264c1ac15fbb2a2f1a2fa0436f605f23f12f46b25e7ba82e5c11"},"schema_version":"1.0"},"canonical_sha256":"a8fe24d209376853598dd958b5e4a9e534c36c8ec29bc24722394422d29207e4","source":{"kind":"arxiv","id":"1701.04371","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04371","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04371v1","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04371","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"pith_short_12","alias_value":"VD7CJUQJG5UF","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VD7CJUQJG5UFGWMN","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VD7CJUQJ","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VD7CJUQJG5UFGWMN3FMLLZFJ4U","target":"record","payload":{"canonical_record":{"source":{"id":"1701.04371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-01-12T10:45:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"00ff382ba909534583d2ed0e9a92cff6429877ac93d0bffa8f05b726996d11e5","abstract_canon_sha256":"0164778b5ac5264c1ac15fbb2a2f1a2fa0436f605f23f12f46b25e7ba82e5c11"},"schema_version":"1.0"},"canonical_sha256":"a8fe24d209376853598dd958b5e4a9e534c36c8ec29bc24722394422d29207e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:44.794590Z","signature_b64":"W+tykqmbM3fS38YYXMn09GeI28MnI+uIRyrb4GVk+0DkurqzL/ASXkD3PijncfkynXjp9V2d9N1uzqXyopFRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8fe24d209376853598dd958b5e4a9e534c36c8ec29bc24722394422d29207e4","last_reissued_at":"2026-05-18T00:52:44.794010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:44.794010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.04371","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:52:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSYgB36PaBba+z5yQmdLGi0AOHQ7LppT3MuioiVRJXnL77s9UzmteG5DUn1pCM8dPHRg6VxegqeKjLVcnFXDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:08:09.775281Z"},"content_sha256":"fc7283a08032de3d2c017de37f76f5a557efde9bbb0e3e0655cc544d065728d4","schema_version":"1.0","event_id":"sha256:fc7283a08032de3d2c017de37f76f5a557efde9bbb0e3e0655cc544d065728d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VD7CJUQJG5UFGWMN3FMLLZFJ4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Achievable Secrecy Diversity of Cooperative Networks with Untrusted Relays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Ali Ghrayeb, Chadi Assi, Mazen O. Hasna, Mohaned Chraiti","submitted_at":"2017-01-12T10:45:05Z","abstract_excerpt":"Cooperative relaying is often deployed to enhance the communication reliability (i.e., diversity order) and consequently the end-to-end achievable rate. However, this raises several security concerns when the relays are untrusted since they may have access to the relayed message. In this paper, we study the achievable secrecy diversity order of cooperative networks with untrusted relays. In particular, we consider a network with an N-antenna transmitter (Alice), K single-antenna relays, and a single-antenna destination (Bob). We consider the general scenario where there is no relation between "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04371","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:52:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WEeCB3wt7oAXWN9jIbjb1YXwJJYUqWHKK4KtH/EXQNOo7GWr2nfGEAHm63b8sdaRryjMHYtURSB/HFnpaA9HBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:08:09.775648Z"},"content_sha256":"eac6d011d0c2281fa218e36770bda8c5a3a76c911c54cfc28b7b7268ed7e6643","schema_version":"1.0","event_id":"sha256:eac6d011d0c2281fa218e36770bda8c5a3a76c911c54cfc28b7b7268ed7e6643"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U/bundle.json","state_url":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U/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-04T11:08:09Z","links":{"resolver":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U","bundle":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U/bundle.json","state":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VD7CJUQJG5UFGWMN3FMLLZFJ4U","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":"0164778b5ac5264c1ac15fbb2a2f1a2fa0436f605f23f12f46b25e7ba82e5c11","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-01-12T10:45:05Z","title_canon_sha256":"00ff382ba909534583d2ed0e9a92cff6429877ac93d0bffa8f05b726996d11e5"},"schema_version":"1.0","source":{"id":"1701.04371","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04371","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04371v1","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04371","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"pith_short_12","alias_value":"VD7CJUQJG5UF","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VD7CJUQJG5UFGWMN","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VD7CJUQJ","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:eac6d011d0c2281fa218e36770bda8c5a3a76c911c54cfc28b7b7268ed7e6643","target":"graph","created_at":"2026-05-18T00:52:44Z","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":"Cooperative relaying is often deployed to enhance the communication reliability (i.e., diversity order) and consequently the end-to-end achievable rate. However, this raises several security concerns when the relays are untrusted since they may have access to the relayed message. In this paper, we study the achievable secrecy diversity order of cooperative networks with untrusted relays. In particular, we consider a network with an N-antenna transmitter (Alice), K single-antenna relays, and a single-antenna destination (Bob). We consider the general scenario where there is no relation between ","authors_text":"Ali Ghrayeb, Chadi Assi, Mazen O. Hasna, Mohaned Chraiti","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-01-12T10:45:05Z","title":"On the Achievable Secrecy Diversity of Cooperative Networks with Untrusted Relays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04371","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:fc7283a08032de3d2c017de37f76f5a557efde9bbb0e3e0655cc544d065728d4","target":"record","created_at":"2026-05-18T00:52:44Z","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":"0164778b5ac5264c1ac15fbb2a2f1a2fa0436f605f23f12f46b25e7ba82e5c11","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-01-12T10:45:05Z","title_canon_sha256":"00ff382ba909534583d2ed0e9a92cff6429877ac93d0bffa8f05b726996d11e5"},"schema_version":"1.0","source":{"id":"1701.04371","kind":"arxiv","version":1}},"canonical_sha256":"a8fe24d209376853598dd958b5e4a9e534c36c8ec29bc24722394422d29207e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8fe24d209376853598dd958b5e4a9e534c36c8ec29bc24722394422d29207e4","first_computed_at":"2026-05-18T00:52:44.794010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:44.794010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W+tykqmbM3fS38YYXMn09GeI28MnI+uIRyrb4GVk+0DkurqzL/ASXkD3PijncfkynXjp9V2d9N1uzqXyopFRCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:44.794590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04371","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc7283a08032de3d2c017de37f76f5a557efde9bbb0e3e0655cc544d065728d4","sha256:eac6d011d0c2281fa218e36770bda8c5a3a76c911c54cfc28b7b7268ed7e6643"],"state_sha256":"a81d382ea2b74da19a0690af23012b85b2be3b118ec9868286465d5a83383509"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I931r4J76tDt3FzagYFAgjx2AWnx7ofpDIm7MnM/o6wdpFYygYXfqW6pMYquZIeBYqZLdgkZkAecEL7dths6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T11:08:09.777657Z","bundle_sha256":"c67ccde229ac53db3196054136fea19a3c87aaff692946ff6b59ef88e490c056"}}