{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GI5KZV2TYN6H2MN7C7SIGBWX3V","short_pith_number":"pith:GI5KZV2T","schema_version":"1.0","canonical_sha256":"323aacd753c37c7d31bf17e48306d7dd7bc96f23a4f3c3ed0131a7326b3052a4","source":{"kind":"arxiv","id":"1807.06448","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.06448","created_at":"2026-05-18T00:10:32.994184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06448v1","created_at":"2026-05-18T00:10:32.994184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06448","created_at":"2026-05-18T00:10:32.994184+00:00"},{"alias_kind":"pith_short_12","alias_value":"GI5KZV2TYN6H","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GI5KZV2TYN6H2MN7","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GI5KZV2T","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V","json":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V.json","graph_json":"https://pith.science/api/pith-number/GI5KZV2TYN6H2MN7C7SIGBWX3V/graph.json","events_json":"https://pith.science/api/pith-number/GI5KZV2TYN6H2MN7C7SIGBWX3V/events.json","paper":"https://pith.science/paper/GI5KZV2T"},"agent_actions":{"view_html":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V","download_json":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V.json","view_paper":"https://pith.science/paper/GI5KZV2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06448&json=true","fetch_graph":"https://pith.science/api/pith-number/GI5KZV2TYN6H2MN7C7SIGBWX3V/graph.json","fetch_events":"https://pith.science/api/pith-number/GI5KZV2TYN6H2MN7C7SIGBWX3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V/action/storage_attestation","attest_author":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V/action/author_attestation","sign_citation":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V/action/citation_signature","submit_replication":"https://pith.science/pith/GI5KZV2TYN6H2MN7C7SIGBWX3V/action/replication_record"}},"created_at":"2026-05-18T00:10:32.994184+00:00","updated_at":"2026-05-18T00:10:32.994184+00:00"}