{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:X4IBGVOHARJTLBVXG5EQGXBQGC","short_pith_number":"pith:X4IBGVOH","canonical_record":{"source":{"id":"2401.07141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-13T19:07:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"063b3311dff7a864cff169d85e777968c735f6cb3349643d470f44106c31ba93","abstract_canon_sha256":"603272b635aae62079163680a1801b625f046892e972446a02a4a52d31629853"},"schema_version":"1.0"},"canonical_sha256":"bf101355c704533586b73749035c30308f9377b5edc4dd02489c97c240e3535a","source":{"kind":"arxiv","id":"2401.07141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.07141","created_at":"2026-07-05T07:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"2401.07141v1","created_at":"2026-07-05T07:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07141","created_at":"2026-07-05T07:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"X4IBGVOHARJT","created_at":"2026-07-05T07:33:32Z"},{"alias_kind":"pith_short_16","alias_value":"X4IBGVOHARJTLBVX","created_at":"2026-07-05T07:33:32Z"},{"alias_kind":"pith_short_8","alias_value":"X4IBGVOH","created_at":"2026-07-05T07:33:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:X4IBGVOHARJTLBVXG5EQGXBQGC","target":"record","payload":{"canonical_record":{"source":{"id":"2401.07141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-13T19:07:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"063b3311dff7a864cff169d85e777968c735f6cb3349643d470f44106c31ba93","abstract_canon_sha256":"603272b635aae62079163680a1801b625f046892e972446a02a4a52d31629853"},"schema_version":"1.0"},"canonical_sha256":"bf101355c704533586b73749035c30308f9377b5edc4dd02489c97c240e3535a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:33:32.514826Z","signature_b64":"Fps6XPMMdQaj7HLB0D/6f32uVJRNa/KreYsdQx/EZrZRDsPyZG3catatyN0ggUTy30JUIK31kPULO/YuYOA9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf101355c704533586b73749035c30308f9377b5edc4dd02489c97c240e3535a","last_reissued_at":"2026-07-05T07:33:32.514387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:33:32.514387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.07141","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-07-05T07:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7qnXSaLE2/ZRjW7mkVOv7PfwRDclFB44oo8aDRxdeXniDab2cbaFUwEcE3eyMwim747VPSlHgF/UGLoTELI/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:34:15.844000Z"},"content_sha256":"f449068a1e4727afa1ee4cc0973bd929ef5a7565e9ed78908514461eec433e2e","schema_version":"1.0","event_id":"sha256:f449068a1e4727afa1ee4cc0973bd929ef5a7565e9ed78908514461eec433e2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:X4IBGVOHARJTLBVXG5EQGXBQGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secrecy Coding for the Binary Symmetric Wiretap Channel via Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Nikkhah, Bahareh Akhbari, Morteza Shoushtari, Willie K. Harrison","submitted_at":"2024-01-13T19:07:21Z","abstract_excerpt":"In this paper, we use a linear programming (LP) optimization approach to evaluate the equivocation for a wiretap channel where the main channel is noiseless, and the wiretap channel is a binary symmetric channel (BSC). Using this technique, we present an analytical limit for the achievable secrecy rate in the finite blocklength regime that is tighter than traditional fundamental limits. We also propose a secrecy coding technique that outperforms random binning codes. When there is one overhead bit, this coding technique is optimum and achieves the analytical limit. For cases with additional bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07141","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.07141/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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BMZdC+G+Kf/xeYeyMfa56Pg8BbtAjw1Fwl2SlQ7klbJRzLENHhcE1+pelPv9FpFGgYvkxQ6kBF9nIN/CxqvKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:34:15.844830Z"},"content_sha256":"98e0de766669fa432467ddb9180a5fc1159422d9031a4772f63f9d93209a2657","schema_version":"1.0","event_id":"sha256:98e0de766669fa432467ddb9180a5fc1159422d9031a4772f63f9d93209a2657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X4IBGVOHARJTLBVXG5EQGXBQGC/bundle.json","state_url":"https://pith.science/pith/X4IBGVOHARJTLBVXG5EQGXBQGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X4IBGVOHARJTLBVXG5EQGXBQGC/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-08-04T23:34:15Z","links":{"resolver":"https://pith.science/pith/X4IBGVOHARJTLBVXG5EQGXBQGC","bundle":"https://pith.science/pith/X4IBGVOHARJTLBVXG5EQGXBQGC/bundle.json","state":"https://pith.science/pith/X4IBGVOHARJTLBVXG5EQGXBQGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X4IBGVOHARJTLBVXG5EQGXBQGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:X4IBGVOHARJTLBVXG5EQGXBQGC","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":"603272b635aae62079163680a1801b625f046892e972446a02a4a52d31629853","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-13T19:07:21Z","title_canon_sha256":"063b3311dff7a864cff169d85e777968c735f6cb3349643d470f44106c31ba93"},"schema_version":"1.0","source":{"id":"2401.07141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.07141","created_at":"2026-07-05T07:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"2401.07141v1","created_at":"2026-07-05T07:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07141","created_at":"2026-07-05T07:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"X4IBGVOHARJT","created_at":"2026-07-05T07:33:32Z"},{"alias_kind":"pith_short_16","alias_value":"X4IBGVOHARJTLBVX","created_at":"2026-07-05T07:33:32Z"},{"alias_kind":"pith_short_8","alias_value":"X4IBGVOH","created_at":"2026-07-05T07:33:32Z"}],"graph_snapshots":[{"event_id":"sha256:98e0de766669fa432467ddb9180a5fc1159422d9031a4772f63f9d93209a2657","target":"graph","created_at":"2026-07-05T07:33: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.07141/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we use a linear programming (LP) optimization approach to evaluate the equivocation for a wiretap channel where the main channel is noiseless, and the wiretap channel is a binary symmetric channel (BSC). Using this technique, we present an analytical limit for the achievable secrecy rate in the finite blocklength regime that is tighter than traditional fundamental limits. We also propose a secrecy coding technique that outperforms random binning codes. When there is one overhead bit, this coding technique is optimum and achieves the analytical limit. For cases with additional bi","authors_text":"Ali Nikkhah, Bahareh Akhbari, Morteza Shoushtari, Willie K. Harrison","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-13T19:07:21Z","title":"Secrecy Coding for the Binary Symmetric Wiretap Channel via Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07141","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:f449068a1e4727afa1ee4cc0973bd929ef5a7565e9ed78908514461eec433e2e","target":"record","created_at":"2026-07-05T07:33: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":"603272b635aae62079163680a1801b625f046892e972446a02a4a52d31629853","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-13T19:07:21Z","title_canon_sha256":"063b3311dff7a864cff169d85e777968c735f6cb3349643d470f44106c31ba93"},"schema_version":"1.0","source":{"id":"2401.07141","kind":"arxiv","version":1}},"canonical_sha256":"bf101355c704533586b73749035c30308f9377b5edc4dd02489c97c240e3535a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf101355c704533586b73749035c30308f9377b5edc4dd02489c97c240e3535a","first_computed_at":"2026-07-05T07:33:32.514387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:33:32.514387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fps6XPMMdQaj7HLB0D/6f32uVJRNa/KreYsdQx/EZrZRDsPyZG3catatyN0ggUTy30JUIK31kPULO/YuYOA9Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:33:32.514826Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.07141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f449068a1e4727afa1ee4cc0973bd929ef5a7565e9ed78908514461eec433e2e","sha256:98e0de766669fa432467ddb9180a5fc1159422d9031a4772f63f9d93209a2657"],"state_sha256":"63a290814969e137a5990e6afc6a7e20b1da3c522f658ec9728c31c4f3b9e924"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOVx/5pwRtwA9PcU7Da6qhv30hTceh/H74HsPoUQGHkD/jSLLo+1AnvhWaExMNI9/bdTxNeldcI4JuEVbp5vCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T23:34:15.853294Z","bundle_sha256":"389016552494109621c438863287872bcf9d106656537e2611e0715102b38cb4"}}