{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GI5KZV2TYN6H2MN7C7SIGBWX3V","short_pith_number":"pith:GI5KZV2T","canonical_record":{"source":{"id":"1807.06448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-17T14:05:15Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"cccaf626d971316bb2e8f0b32d14eb4afa9f1ea17c5960733b796d60269f3c17","abstract_canon_sha256":"1a1095576e8a60dafc830ffafc33624785473dce2b25e9c93643d71920bdfb16"},"schema_version":"1.0"},"canonical_sha256":"323aacd753c37c7d31bf17e48306d7dd7bc96f23a4f3c3ed0131a7326b3052a4","source":{"kind":"arxiv","id":"1807.06448","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06448","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06448v1","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06448","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"pith_short_12","alias_value":"GI5KZV2TYN6H","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GI5KZV2TYN6H2MN7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GI5KZV2T","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GI5KZV2TYN6H2MN7C7SIGBWX3V","target":"record","payload":{"canonical_record":{"source":{"id":"1807.06448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-17T14:05:15Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"cccaf626d971316bb2e8f0b32d14eb4afa9f1ea17c5960733b796d60269f3c17","abstract_canon_sha256":"1a1095576e8a60dafc830ffafc33624785473dce2b25e9c93643d71920bdfb16"},"schema_version":"1.0"},"canonical_sha256":"323aacd753c37c7d31bf17e48306d7dd7bc96f23a4f3c3ed0131a7326b3052a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:32.994792Z","signature_b64":"gEUZ182Dnly0D5sAI1Ved0HI7EaiFmbrf+xvhvLBs99pTSbCVGfrMIiZrl9VrtggELe+fhL5yAyv6cBXyxMGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"323aacd753c37c7d31bf17e48306d7dd7bc96f23a4f3c3ed0131a7326b3052a4","last_reissued_at":"2026-05-18T00:10:32.994084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:32.994084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.06448","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:10:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EPeh+7aPO9hTODOGwA4RoUtSO4v7E5qFa/ey7SvDixi8mbt8QwUE5+uZ9zHYUK4/SDpeSqYtnBiMZD7Rn16AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:26:45.846101Z"},"content_sha256":"c3fdb798fd781f42004b0fbaea9b40b68f0a87f854516a1da54cbf713d7e19a0","schema_version":"1.0","event_id":"sha256:c3fdb798fd781f42004b0fbaea9b40b68f0a87f854516a1da54cbf713d7e19a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GI5KZV2TYN6H2MN7C7SIGBWX3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Allocation for Secure Gaussian Parallel Relay Channels with Finite-Length Coding and Discrete Constellations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Linda Senigagliesi, Marco Baldi, Stefano Tomasin","submitted_at":"2018-07-17T14:05:15Z","abstract_excerpt":"We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal frequency division multiplexing transmission. We consider the impact of discrete constellations and finite-length coding, defining an achievable secrecy rate under a constraint on the equivocation rate at Eve. Then we propose a power and channel allocation algorithm that maximizes the achievable secrecy rate by resorting to two coupled Gale-Shapley algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06448","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:10:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N9ezK5FnH9cCu/WwSUlWKt7ZPIuI2TK31USvNmjxXo9fc6GQLwT8ZUBhmdNMRsQKI2NUpJKcUs5tf6ptLkvUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:26:45.846811Z"},"content_sha256":"440a5f31cd9554769fea7ca568f81b29f964e0bd9f58b71973db1fce2b1f57a6","schema_version":"1.0","event_id":"sha256:440a5f31cd9554769fea7ca568f81b29f964e0bd9f58b71973db1fce2b1f57a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V/bundle.json","state_url":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V/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-31T00:26:45Z","links":{"resolver":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V","bundle":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V/bundle.json","state":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GI5KZV2TYN6H2MN7C7SIGBWX3V","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":"1a1095576e8a60dafc830ffafc33624785473dce2b25e9c93643d71920bdfb16","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-17T14:05:15Z","title_canon_sha256":"cccaf626d971316bb2e8f0b32d14eb4afa9f1ea17c5960733b796d60269f3c17"},"schema_version":"1.0","source":{"id":"1807.06448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06448","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06448v1","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06448","created_at":"2026-05-18T00:10:32Z"},{"alias_kind":"pith_short_12","alias_value":"GI5KZV2TYN6H","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GI5KZV2TYN6H2MN7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GI5KZV2T","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:440a5f31cd9554769fea7ca568f81b29f964e0bd9f58b71973db1fce2b1f57a6","target":"graph","created_at":"2026-05-18T00:10:32Z","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 investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal frequency division multiplexing transmission. We consider the impact of discrete constellations and finite-length coding, defining an achievable secrecy rate under a constraint on the equivocation rate at Eve. Then we propose a power and channel allocation algorithm that maximizes the achievable secrecy rate by resorting to two coupled Gale-Shapley algorithms ","authors_text":"Linda Senigagliesi, Marco Baldi, Stefano Tomasin","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-17T14:05:15Z","title":"Resource Allocation for Secure Gaussian Parallel Relay Channels with Finite-Length Coding and Discrete Constellations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06448","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:c3fdb798fd781f42004b0fbaea9b40b68f0a87f854516a1da54cbf713d7e19a0","target":"record","created_at":"2026-05-18T00:10:32Z","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":"1a1095576e8a60dafc830ffafc33624785473dce2b25e9c93643d71920bdfb16","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-17T14:05:15Z","title_canon_sha256":"cccaf626d971316bb2e8f0b32d14eb4afa9f1ea17c5960733b796d60269f3c17"},"schema_version":"1.0","source":{"id":"1807.06448","kind":"arxiv","version":1}},"canonical_sha256":"323aacd753c37c7d31bf17e48306d7dd7bc96f23a4f3c3ed0131a7326b3052a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"323aacd753c37c7d31bf17e48306d7dd7bc96f23a4f3c3ed0131a7326b3052a4","first_computed_at":"2026-05-18T00:10:32.994084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:32.994084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gEUZ182Dnly0D5sAI1Ved0HI7EaiFmbrf+xvhvLBs99pTSbCVGfrMIiZrl9VrtggELe+fhL5yAyv6cBXyxMGCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:32.994792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3fdb798fd781f42004b0fbaea9b40b68f0a87f854516a1da54cbf713d7e19a0","sha256:440a5f31cd9554769fea7ca568f81b29f964e0bd9f58b71973db1fce2b1f57a6"],"state_sha256":"053bae59667629c5a1134c9ea2735d773cd3dfae11f8647ae8621351f2f4404a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKhofaW+Z2HXMqLM1pNI6cEUKcOJHgEthS+MAeMlq/GynROARMVUkza8JwkQY2YdEZOP8gHY9XhADXRbZ5o5BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:26:45.852711Z","bundle_sha256":"1cc6856b0cda9055f8efea9fed3f2e2b874c9caa88f12483fd7c9674acd7d11c"}}