{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OGUNPBKA4YHH6JAG6UUBPEJSOZ","short_pith_number":"pith:OGUNPBKA","canonical_record":{"source":{"id":"2501.07561","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-13T18:51:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"af6c7bbf4bee8c953b0ee704932ebbc9d00d392ffac8a30d06d04019e5cd57b8","abstract_canon_sha256":"a084f9413157da5c0f274acb8fadddd94c8e3c568c6cebe6e7f6ac2cc68636c2"},"schema_version":"1.0"},"canonical_sha256":"71a8d78540e60e7f2406f528179132764ab3d1faf2d2f9933733173ae5109909","source":{"kind":"arxiv","id":"2501.07561","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07561","created_at":"2026-06-10T01:08:26Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07561v5","created_at":"2026-06-10T01:08:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07561","created_at":"2026-06-10T01:08:26Z"},{"alias_kind":"pith_short_12","alias_value":"OGUNPBKA4YHH","created_at":"2026-06-10T01:08:26Z"},{"alias_kind":"pith_short_16","alias_value":"OGUNPBKA4YHH6JAG","created_at":"2026-06-10T01:08:26Z"},{"alias_kind":"pith_short_8","alias_value":"OGUNPBKA","created_at":"2026-06-10T01:08:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OGUNPBKA4YHH6JAG6UUBPEJSOZ","target":"record","payload":{"canonical_record":{"source":{"id":"2501.07561","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-13T18:51:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"af6c7bbf4bee8c953b0ee704932ebbc9d00d392ffac8a30d06d04019e5cd57b8","abstract_canon_sha256":"a084f9413157da5c0f274acb8fadddd94c8e3c568c6cebe6e7f6ac2cc68636c2"},"schema_version":"1.0"},"canonical_sha256":"71a8d78540e60e7f2406f528179132764ab3d1faf2d2f9933733173ae5109909","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:08:26.912954Z","signature_b64":"6LTWGk/GQ7xmETjqdUDGgsjaJvSgKA4CQsi5IDn2vqtBeYJya9jUKK3nUETboZ4WH2TE96ArdFIJw8bqyyYdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71a8d78540e60e7f2406f528179132764ab3d1faf2d2f9933733173ae5109909","last_reissued_at":"2026-06-10T01:08:26.911861Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:08:26.911861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.07561","source_version":5,"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-06-10T01:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VirXNzO7aa0tYWKsVbKtKwLPb2rBAi5E95YHEAIIpuR2PHPtcHjfAQUKKSRDLpNCqmpRzYibA2MRcdBFk7idBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:43:36.534599Z"},"content_sha256":"f42a9c7207b1700ca9d7781edfd87cdb1ee58901a59ec2573297a142b04d4b5c","schema_version":"1.0","event_id":"sha256:f42a9c7207b1700ca9d7781edfd87cdb1ee58901a59ec2573297a142b04d4b5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OGUNPBKA4YHH6JAG6UUBPEJSOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design and Analysis of a Concatenated Code for Intersymbol Interference Wiretap Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A concatenated LDPC-trellis scheme achieves tight lower bounds on secrecy capacity for ISI wiretap channels while driving the leakage upper bound to zero.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aria Nouri, Jun Chen, Reza Asvadi","submitted_at":"2025-01-13T18:51:46Z","abstract_excerpt":"We propose a two-stage concatenated coding scheme for reliable and secure communication over intersymbol interference wiretap channels. We first establish the secrecy capacity. Then, motivated by the theoretical codes that achieve the secrecy capacity, our scheme integrates low-density parity-check (LDPC) codes in the outer stage, forming a nested structure of wiretap codes, with trellis codes in the inner stage to improve achievable secure rates. The trellis code is specifically designed to transform the uniformly distributed codewords produced by the LDPC code stage into a Markov process, ac"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The proposed concatenated coding scheme achieves tight lower bounds on the secrecy capacity of ISI wiretap channels and drives the estimated upper bound on the information leakage rate to zero by optimizing degree distributions of the irregular LDPC codes at the outer stage.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The trellis code can be designed to transform uniformly distributed LDPC codewords into a Markov process that achieves tight lower bounds on secrecy capacity without introducing additional rate loss or secrecy degradation, as motivated by the theoretical codes that achieve secrecy capacity.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A concatenated LDPC-trellis coding scheme is proposed for ISI wiretap channels that establishes secrecy capacity, achieves tight lower bounds via Markov transformation, and optimizes LDPC degrees to drive leakage upper bound to zero.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A concatenated LDPC-trellis scheme achieves tight lower bounds on secrecy capacity for ISI wiretap channels while driving the leakage upper bound to zero.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1ebd6ecc5a646c51e2cf704de9781cb4feddc9c8dff56d43559150e71f5944c6"},"source":{"id":"2501.07561","kind":"arxiv","version":5},"verdict":{"id":"4ee9b7f8-8c0b-4217-9d69-ee9664765d47","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-23T05:09:28.832385Z","strongest_claim":"The proposed concatenated coding scheme achieves tight lower bounds on the secrecy capacity of ISI wiretap channels and drives the estimated upper bound on the information leakage rate to zero by optimizing degree distributions of the irregular LDPC codes at the outer stage.","one_line_summary":"A concatenated LDPC-trellis coding scheme is proposed for ISI wiretap channels that establishes secrecy capacity, achieves tight lower bounds via Markov transformation, and optimizes LDPC degrees to drive leakage upper bound to zero.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The trellis code can be designed to transform uniformly distributed LDPC codewords into a Markov process that achieves tight lower bounds on secrecy capacity without introducing additional rate loss or secrecy degradation, as motivated by the theoretical codes that achieve secrecy capacity.","pith_extraction_headline":"A concatenated LDPC-trellis scheme achieves tight lower bounds on secrecy capacity for ISI wiretap channels while driving the leakage upper bound to zero."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.07561/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"4ee9b7f8-8c0b-4217-9d69-ee9664765d47"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-10T01:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lv3nupGNvEZzmw1xuDBgHr2iPQ23MRgPEIU+3NNltCufcwrLoBhNWxOasSGhsfDLfB/ybNZ0s0sjNwf5U9PQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:43:36.535058Z"},"content_sha256":"e5f0d313de5ef0ae1d3f23f51415b1d0ed43526596601245cacc7cab69154d52","schema_version":"1.0","event_id":"sha256:e5f0d313de5ef0ae1d3f23f51415b1d0ed43526596601245cacc7cab69154d52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGUNPBKA4YHH6JAG6UUBPEJSOZ/bundle.json","state_url":"https://pith.science/pith/OGUNPBKA4YHH6JAG6UUBPEJSOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGUNPBKA4YHH6JAG6UUBPEJSOZ/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-20T03:43:36Z","links":{"resolver":"https://pith.science/pith/OGUNPBKA4YHH6JAG6UUBPEJSOZ","bundle":"https://pith.science/pith/OGUNPBKA4YHH6JAG6UUBPEJSOZ/bundle.json","state":"https://pith.science/pith/OGUNPBKA4YHH6JAG6UUBPEJSOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGUNPBKA4YHH6JAG6UUBPEJSOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OGUNPBKA4YHH6JAG6UUBPEJSOZ","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":"a084f9413157da5c0f274acb8fadddd94c8e3c568c6cebe6e7f6ac2cc68636c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-13T18:51:46Z","title_canon_sha256":"af6c7bbf4bee8c953b0ee704932ebbc9d00d392ffac8a30d06d04019e5cd57b8"},"schema_version":"1.0","source":{"id":"2501.07561","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07561","created_at":"2026-06-10T01:08:26Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07561v5","created_at":"2026-06-10T01:08:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07561","created_at":"2026-06-10T01:08:26Z"},{"alias_kind":"pith_short_12","alias_value":"OGUNPBKA4YHH","created_at":"2026-06-10T01:08:26Z"},{"alias_kind":"pith_short_16","alias_value":"OGUNPBKA4YHH6JAG","created_at":"2026-06-10T01:08:26Z"},{"alias_kind":"pith_short_8","alias_value":"OGUNPBKA","created_at":"2026-06-10T01:08:26Z"}],"graph_snapshots":[{"event_id":"sha256:e5f0d313de5ef0ae1d3f23f51415b1d0ed43526596601245cacc7cab69154d52","target":"graph","created_at":"2026-06-10T01:08:26Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The proposed concatenated coding scheme achieves tight lower bounds on the secrecy capacity of ISI wiretap channels and drives the estimated upper bound on the information leakage rate to zero by optimizing degree distributions of the irregular LDPC codes at the outer stage."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The trellis code can be designed to transform uniformly distributed LDPC codewords into a Markov process that achieves tight lower bounds on secrecy capacity without introducing additional rate loss or secrecy degradation, as motivated by the theoretical codes that achieve secrecy capacity."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A concatenated LDPC-trellis coding scheme is proposed for ISI wiretap channels that establishes secrecy capacity, achieves tight lower bounds via Markov transformation, and optimizes LDPC degrees to drive leakage upper bound to zero."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A concatenated LDPC-trellis scheme achieves tight lower bounds on secrecy capacity for ISI wiretap channels while driving the leakage upper bound to zero."}],"snapshot_sha256":"1ebd6ecc5a646c51e2cf704de9781cb4feddc9c8dff56d43559150e71f5944c6"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.07561/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a two-stage concatenated coding scheme for reliable and secure communication over intersymbol interference wiretap channels. We first establish the secrecy capacity. Then, motivated by the theoretical codes that achieve the secrecy capacity, our scheme integrates low-density parity-check (LDPC) codes in the outer stage, forming a nested structure of wiretap codes, with trellis codes in the inner stage to improve achievable secure rates. The trellis code is specifically designed to transform the uniformly distributed codewords produced by the LDPC code stage into a Markov process, ac","authors_text":"Aria Nouri, Jun Chen, Reza Asvadi","cross_cats":["math.IT"],"headline":"A concatenated LDPC-trellis scheme achieves tight lower bounds on secrecy capacity for ISI wiretap channels while driving the leakage upper bound to zero.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-13T18:51:46Z","title":"Design and Analysis of a Concatenated Code for Intersymbol Interference Wiretap Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07561","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-23T05:09:28.832385Z","id":"4ee9b7f8-8c0b-4217-9d69-ee9664765d47","model_set":{"reader":"grok-4.3"},"one_line_summary":"A concatenated LDPC-trellis coding scheme is proposed for ISI wiretap channels that establishes secrecy capacity, achieves tight lower bounds via Markov transformation, and optimizes LDPC degrees to drive leakage upper bound to zero.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A concatenated LDPC-trellis scheme achieves tight lower bounds on secrecy capacity for ISI wiretap channels while driving the leakage upper bound to zero.","strongest_claim":"The proposed concatenated coding scheme achieves tight lower bounds on the secrecy capacity of ISI wiretap channels and drives the estimated upper bound on the information leakage rate to zero by optimizing degree distributions of the irregular LDPC codes at the outer stage.","weakest_assumption":"The trellis code can be designed to transform uniformly distributed LDPC codewords into a Markov process that achieves tight lower bounds on secrecy capacity without introducing additional rate loss or secrecy degradation, as motivated by the theoretical codes that achieve secrecy capacity."}},"verdict_id":"4ee9b7f8-8c0b-4217-9d69-ee9664765d47"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f42a9c7207b1700ca9d7781edfd87cdb1ee58901a59ec2573297a142b04d4b5c","target":"record","created_at":"2026-06-10T01:08:26Z","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":"a084f9413157da5c0f274acb8fadddd94c8e3c568c6cebe6e7f6ac2cc68636c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-13T18:51:46Z","title_canon_sha256":"af6c7bbf4bee8c953b0ee704932ebbc9d00d392ffac8a30d06d04019e5cd57b8"},"schema_version":"1.0","source":{"id":"2501.07561","kind":"arxiv","version":5}},"canonical_sha256":"71a8d78540e60e7f2406f528179132764ab3d1faf2d2f9933733173ae5109909","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71a8d78540e60e7f2406f528179132764ab3d1faf2d2f9933733173ae5109909","first_computed_at":"2026-06-10T01:08:26.911861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:08:26.911861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6LTWGk/GQ7xmETjqdUDGgsjaJvSgKA4CQsi5IDn2vqtBeYJya9jUKK3nUETboZ4WH2TE96ArdFIJw8bqyyYdBQ==","signature_status":"signed_v1","signed_at":"2026-06-10T01:08:26.912954Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.07561","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f42a9c7207b1700ca9d7781edfd87cdb1ee58901a59ec2573297a142b04d4b5c","sha256:e5f0d313de5ef0ae1d3f23f51415b1d0ed43526596601245cacc7cab69154d52"],"state_sha256":"0b3e2214b6a1c44c3d711a029e8346b072a20256ac90adc7b99dfdb8f075fce4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvFZUykXx94cZcfHxXcseZX9lLMU5ix9wMDI9WKtShP01DN90jImcPGRYyLO59E5M5UDg6z11Of29zK3X5oiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T03:43:36.538849Z","bundle_sha256":"b5b9e4bb846293c1a91245042d480ecad55d5a4b7fa3d58b5ed3498a05f45eec"}}