{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VATFCI2DG5TOY5YYIV2CL2NSV3","short_pith_number":"pith:VATFCI2D","canonical_record":{"source":{"id":"1305.3055","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-14T08:25:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0aee53617fdc696f2ce9d49452da2af5304242c6c3418de5a21795cd617e7c1f","abstract_canon_sha256":"5771b2f3182733755f7b7a48199dd682184c977c8c7a2015cb31205a6823d1e4"},"schema_version":"1.0"},"canonical_sha256":"a8265123433766ec7718457425e9b2aed0f68b27cef859ec4b7e4143430a0fdb","source":{"kind":"arxiv","id":"1305.3055","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3055","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3055v3","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3055","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"VATFCI2DG5TO","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VATFCI2DG5TOY5YY","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VATFCI2D","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VATFCI2DG5TOY5YYIV2CL2NSV3","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3055","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-14T08:25:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0aee53617fdc696f2ce9d49452da2af5304242c6c3418de5a21795cd617e7c1f","abstract_canon_sha256":"5771b2f3182733755f7b7a48199dd682184c977c8c7a2015cb31205a6823d1e4"},"schema_version":"1.0"},"canonical_sha256":"a8265123433766ec7718457425e9b2aed0f68b27cef859ec4b7e4143430a0fdb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:24.165797Z","signature_b64":"zK/q6KVpuQHwTjDVsYntFHOp6/t9VIvjUdUP6Qki+7sncapLdxj9h9m8cFDNtpfTcsG3ul/ZJHRwbcGhMKgiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8265123433766ec7718457425e9b2aed0f68b27cef859ec4b7e4143430a0fdb","last_reissued_at":"2026-05-18T02:39:24.165340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:24.165340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3055","source_version":3,"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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DdKfQDgFRC27gjcmyTNwZFcFf9t/zFxW5UsAUc0yVbYKyPeEOrhaIgdet8gG6EzsAoH55yNS5cPAaQvA1dzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T08:01:01.020706Z"},"content_sha256":"5c31e00a454c257de717960e895f2de642b059d4afb2f58a6fd4f8097e219ee7","schema_version":"1.0","event_id":"sha256:5c31e00a454c257de717960e895f2de642b059d4afb2f58a6fd4f8097e219ee7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VATFCI2DG5TOY5YYIV2CL2NSV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secrecy Transmission on Block Fading Channels: Theoretical Limits and Performance of Practical Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Francesco Renna, Franco Chiaraluce, Marco Baldi, Marco Bianchi, Nicola Laurenti, Stefano Tomasin","submitted_at":"2013-05-14T08:25:13Z","abstract_excerpt":"We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that Alice perfectly knows the set of channels with respect to Bob, but she has only a statistical knowledge of the channels with respect to Eve. We derive bounds on the achievable outage secrecy rates, by considering coding either within each channel or across all parallel channels. Transmit power is adapted to the channel conditions, with a constraint on the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3055","kind":"arxiv","version":3},"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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAbRtbomdCi4fweqC268d3+tbWlvbvp37qQSp9Y99rDtlutV6JOxyEfmRk1GaMncfUpkt3rz0pO/NIfYoYnABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T08:01:01.021400Z"},"content_sha256":"7032825489708052e830ed92f4c6991d2a728f7b3de714a4eddf77adee5b8534","schema_version":"1.0","event_id":"sha256:7032825489708052e830ed92f4c6991d2a728f7b3de714a4eddf77adee5b8534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VATFCI2DG5TOY5YYIV2CL2NSV3/bundle.json","state_url":"https://pith.science/pith/VATFCI2DG5TOY5YYIV2CL2NSV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VATFCI2DG5TOY5YYIV2CL2NSV3/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-24T08:01:01Z","links":{"resolver":"https://pith.science/pith/VATFCI2DG5TOY5YYIV2CL2NSV3","bundle":"https://pith.science/pith/VATFCI2DG5TOY5YYIV2CL2NSV3/bundle.json","state":"https://pith.science/pith/VATFCI2DG5TOY5YYIV2CL2NSV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VATFCI2DG5TOY5YYIV2CL2NSV3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VATFCI2DG5TOY5YYIV2CL2NSV3","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":"5771b2f3182733755f7b7a48199dd682184c977c8c7a2015cb31205a6823d1e4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-14T08:25:13Z","title_canon_sha256":"0aee53617fdc696f2ce9d49452da2af5304242c6c3418de5a21795cd617e7c1f"},"schema_version":"1.0","source":{"id":"1305.3055","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3055","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3055v3","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3055","created_at":"2026-05-18T02:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"VATFCI2DG5TO","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VATFCI2DG5TOY5YY","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VATFCI2D","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:7032825489708052e830ed92f4c6991d2a728f7b3de714a4eddf77adee5b8534","target":"graph","created_at":"2026-05-18T02:39:24Z","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 consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that Alice perfectly knows the set of channels with respect to Bob, but she has only a statistical knowledge of the channels with respect to Eve. We derive bounds on the achievable outage secrecy rates, by considering coding either within each channel or across all parallel channels. Transmit power is adapted to the channel conditions, with a constraint on the a","authors_text":"Francesco Renna, Franco Chiaraluce, Marco Baldi, Marco Bianchi, Nicola Laurenti, Stefano Tomasin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-14T08:25:13Z","title":"Secrecy Transmission on Block Fading Channels: Theoretical Limits and Performance of Practical Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3055","kind":"arxiv","version":3},"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:5c31e00a454c257de717960e895f2de642b059d4afb2f58a6fd4f8097e219ee7","target":"record","created_at":"2026-05-18T02:39:24Z","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":"5771b2f3182733755f7b7a48199dd682184c977c8c7a2015cb31205a6823d1e4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-14T08:25:13Z","title_canon_sha256":"0aee53617fdc696f2ce9d49452da2af5304242c6c3418de5a21795cd617e7c1f"},"schema_version":"1.0","source":{"id":"1305.3055","kind":"arxiv","version":3}},"canonical_sha256":"a8265123433766ec7718457425e9b2aed0f68b27cef859ec4b7e4143430a0fdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8265123433766ec7718457425e9b2aed0f68b27cef859ec4b7e4143430a0fdb","first_computed_at":"2026-05-18T02:39:24.165340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:24.165340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zK/q6KVpuQHwTjDVsYntFHOp6/t9VIvjUdUP6Qki+7sncapLdxj9h9m8cFDNtpfTcsG3ul/ZJHRwbcGhMKgiBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:24.165797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3055","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c31e00a454c257de717960e895f2de642b059d4afb2f58a6fd4f8097e219ee7","sha256:7032825489708052e830ed92f4c6991d2a728f7b3de714a4eddf77adee5b8534"],"state_sha256":"da54dc85eac55fb13a9979c56f05c87fde875afb972c3f0660437235b1779cf0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3tuDSNjCZs6B9t/TivmuXEf92UZL3+fG2b/uDDLt32rmk0qHOL92DzFUoDdWi5rZgcaSJTwuAP2vPGuquZPYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T08:01:01.025249Z","bundle_sha256":"413c38f4bce2a4a62e9e0669bbf9f94eeff1d2e61a52a637ffe69d32cad59ef5"}}