{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D6REA5YDZ4I25QX5KBJBSAO7UM","short_pith_number":"pith:D6REA5YD","canonical_record":{"source":{"id":"1506.01966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T16:51:13Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"0d183167e5e275a45d8cc89f45887b752d8fdcb9cd5449acf2df5688890abc84","abstract_canon_sha256":"6b54eaa0bd866ac3be3a13ee71f6211f946f34ef7f4054998af2bafd15affb39"},"schema_version":"1.0"},"canonical_sha256":"1fa2407703cf11aec2fd50521901dfa3344307f4db59a7f1307b4081caf1da4e","source":{"kind":"arxiv","id":"1506.01966","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01966","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01966v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01966","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"D6REA5YDZ4I2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D6REA5YDZ4I25QX5","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D6REA5YD","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D6REA5YDZ4I25QX5KBJBSAO7UM","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T16:51:13Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"0d183167e5e275a45d8cc89f45887b752d8fdcb9cd5449acf2df5688890abc84","abstract_canon_sha256":"6b54eaa0bd866ac3be3a13ee71f6211f946f34ef7f4054998af2bafd15affb39"},"schema_version":"1.0"},"canonical_sha256":"1fa2407703cf11aec2fd50521901dfa3344307f4db59a7f1307b4081caf1da4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:50.605047Z","signature_b64":"u78HlzDSIVuvMIIOGW9/qB91Qm3wiDKD5tZ9OzNGh8oT2PYH7imkyf0/LEpE3DiGEk7Se3JCNVIDT0T4NOEtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fa2407703cf11aec2fd50521901dfa3344307f4db59a7f1307b4081caf1da4e","last_reissued_at":"2026-05-18T00:57:50.604554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:50.604554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01966","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G64kqCxfZ2XHnbl4dAZgNwYhlMc7ZVux0+8pLVheyPmeuJYMrpRSrehwqjbAn7xifZB2WyU8ooLBfswa/H3PDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:40:32.266246Z"},"content_sha256":"484a287ecf52bbdc285ff42dbb59b8277a5068f905c0e41ee6e6d6228fe9fc68","schema_version":"1.0","event_id":"sha256:484a287ecf52bbdc285ff42dbb59b8277a5068f905c0e41ee6e6d6228fe9fc68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D6REA5YDZ4I25QX5KBJBSAO7UM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance assessment and design of finite length LDPC codes for the Gaussian wiretap channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Franco Chiaraluce, Giacomo Ricciutelli, Marco Baldi, Nicola Maturo","submitted_at":"2015-06-05T16:51:13Z","abstract_excerpt":"In this work we study the reliability and secrecy performance achievable by practical LDPC codes over the Gaussian wiretap channel. While several works have already addressed this problem in asymptotic conditions, i.e., under the hypothesis of codewords of infinite length, only a few approaches exist for the finite length regime. We propose an approach to measure the performance of practical codes and compare it with that achievable in asymptotic conditions. Moreover, based on the secrecy metrics we adopt to achieve this target, we propose a code optimization algorithm which allows to design i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01966","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ytQ/L6QMhUQq9IeCLdAERyTmaYcs8kgcpsfdR28E02jz216m4kBkUmg6GerWj9i+rSPDQbclYu05wKs5tyWTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:40:32.266608Z"},"content_sha256":"c69f5d7f784b34d76c1c00bfcc1e443b8aea464172b323bd01d1e4fa414fa2a1","schema_version":"1.0","event_id":"sha256:c69f5d7f784b34d76c1c00bfcc1e443b8aea464172b323bd01d1e4fa414fa2a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6REA5YDZ4I25QX5KBJBSAO7UM/bundle.json","state_url":"https://pith.science/pith/D6REA5YDZ4I25QX5KBJBSAO7UM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6REA5YDZ4I25QX5KBJBSAO7UM/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-05T14:40:32Z","links":{"resolver":"https://pith.science/pith/D6REA5YDZ4I25QX5KBJBSAO7UM","bundle":"https://pith.science/pith/D6REA5YDZ4I25QX5KBJBSAO7UM/bundle.json","state":"https://pith.science/pith/D6REA5YDZ4I25QX5KBJBSAO7UM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6REA5YDZ4I25QX5KBJBSAO7UM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D6REA5YDZ4I25QX5KBJBSAO7UM","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":"6b54eaa0bd866ac3be3a13ee71f6211f946f34ef7f4054998af2bafd15affb39","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T16:51:13Z","title_canon_sha256":"0d183167e5e275a45d8cc89f45887b752d8fdcb9cd5449acf2df5688890abc84"},"schema_version":"1.0","source":{"id":"1506.01966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01966","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01966v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01966","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"D6REA5YDZ4I2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D6REA5YDZ4I25QX5","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D6REA5YD","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:c69f5d7f784b34d76c1c00bfcc1e443b8aea464172b323bd01d1e4fa414fa2a1","target":"graph","created_at":"2026-05-18T00:57: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":"In this work we study the reliability and secrecy performance achievable by practical LDPC codes over the Gaussian wiretap channel. While several works have already addressed this problem in asymptotic conditions, i.e., under the hypothesis of codewords of infinite length, only a few approaches exist for the finite length regime. We propose an approach to measure the performance of practical codes and compare it with that achievable in asymptotic conditions. Moreover, based on the secrecy metrics we adopt to achieve this target, we propose a code optimization algorithm which allows to design i","authors_text":"Franco Chiaraluce, Giacomo Ricciutelli, Marco Baldi, Nicola Maturo","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T16:51:13Z","title":"Performance assessment and design of finite length LDPC codes for the Gaussian wiretap channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01966","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:484a287ecf52bbdc285ff42dbb59b8277a5068f905c0e41ee6e6d6228fe9fc68","target":"record","created_at":"2026-05-18T00:57: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":"6b54eaa0bd866ac3be3a13ee71f6211f946f34ef7f4054998af2bafd15affb39","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-05T16:51:13Z","title_canon_sha256":"0d183167e5e275a45d8cc89f45887b752d8fdcb9cd5449acf2df5688890abc84"},"schema_version":"1.0","source":{"id":"1506.01966","kind":"arxiv","version":1}},"canonical_sha256":"1fa2407703cf11aec2fd50521901dfa3344307f4db59a7f1307b4081caf1da4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fa2407703cf11aec2fd50521901dfa3344307f4db59a7f1307b4081caf1da4e","first_computed_at":"2026-05-18T00:57:50.604554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:50.604554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u78HlzDSIVuvMIIOGW9/qB91Qm3wiDKD5tZ9OzNGh8oT2PYH7imkyf0/LEpE3DiGEk7Se3JCNVIDT0T4NOEtBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:50.605047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:484a287ecf52bbdc285ff42dbb59b8277a5068f905c0e41ee6e6d6228fe9fc68","sha256:c69f5d7f784b34d76c1c00bfcc1e443b8aea464172b323bd01d1e4fa414fa2a1"],"state_sha256":"84599de1a0f396a8c7b5ea691f6ac721c6a092e40514a4367359e501e168fceb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qXyLjtMfxoBUmgTaX7iUBM8wgy2pe5jXBDHJ5fS8CrOIFNeffoB9eRwzQu5GeR2HNGA1RtT6di76YBiR6L0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:40:32.268508Z","bundle_sha256":"ddf27846c8792db0d7c828b7fdd13d64e3ae0a746577adf8513130aa2693b74f"}}