{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JCTPYQ2Y3MEIXJR6YXYC6KFM4G","short_pith_number":"pith:JCTPYQ2Y","canonical_record":{"source":{"id":"1701.05955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T00:32:34Z","cross_cats_sorted":["cs.CC","cs.CR","math.IT"],"title_canon_sha256":"80210348da2b570a9da7a4b2089cdd9843d4f7890d7cc245538087be3080abb1","abstract_canon_sha256":"b3e86a669b1067a2fe805f27a2cec539bbecf26d1478fb4c196e4126e05ed5c2"},"schema_version":"1.0"},"canonical_sha256":"48a6fc4358db088ba63ec5f02f28ace1834b80898d81b415191f3b3ae1df0a37","source":{"kind":"arxiv","id":"1701.05955","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05955","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05955v2","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05955","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"JCTPYQ2Y3MEI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JCTPYQ2Y3MEIXJR6","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JCTPYQ2Y","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JCTPYQ2Y3MEIXJR6YXYC6KFM4G","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T00:32:34Z","cross_cats_sorted":["cs.CC","cs.CR","math.IT"],"title_canon_sha256":"80210348da2b570a9da7a4b2089cdd9843d4f7890d7cc245538087be3080abb1","abstract_canon_sha256":"b3e86a669b1067a2fe805f27a2cec539bbecf26d1478fb4c196e4126e05ed5c2"},"schema_version":"1.0"},"canonical_sha256":"48a6fc4358db088ba63ec5f02f28ace1834b80898d81b415191f3b3ae1df0a37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:47.951830Z","signature_b64":"klNvgIeNDN949RJLJ+IyPT3o6022e2p0OQqycCwMKnHtuiirTbFJNQ2EYkFnIXbIqXHI/MDQjrdZ82Rh8yL9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48a6fc4358db088ba63ec5f02f28ace1834b80898d81b415191f3b3ae1df0a37","last_reissued_at":"2026-05-18T00:43:47.951253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:47.951253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05955","source_version":2,"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:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbxFZ7tDKVrbMvAUqnHZYvci1i+FuRDifipKtr69QozZzSIAz/lYqLjWh1Z+9F1jmNNQT+ELArXoa4D03jfmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:04:54.866698Z"},"content_sha256":"d7b8dcba93ff8cffafeeabe8b8d25b6bc4e464bca0a8fdc0377867eb9c8480b8","schema_version":"1.0","event_id":"sha256:d7b8dcba93ff8cffafeeabe8b8d25b6bc4e464bca0a8fdc0377867eb9c8480b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JCTPYQ2Y3MEIXJR6YXYC6KFM4G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polar Coding for Achieving the Capacity of Marginal Channels in Nonbinary-Input Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Amirsina Torfi, Hadi Kazemi, Rouzbeh Asghari Shirvani, Seyed Mehdi Iranmanesh, Sobhan Soleymani, Vahid Tabataba Vakili","submitted_at":"2017-01-21T00:32:34Z","abstract_excerpt":"Achieving information-theoretic security using explicit coding scheme in which unlimited computational power for eavesdropper is assumed, is one of the main topics is security consideration. It is shown that polar codes are capacity achieving codes and have a low complexity in encoding and decoding. It has been proven that polar codes reach to secrecy capacity in the binary-input wiretap channels in symmetric settings for which the wiretapper's channel is degraded with respect to the main channel. The first task of this paper is to propose a coding scheme to achieve secrecy capacity in asymmet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05955","kind":"arxiv","version":2},"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:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmTksAEbVrWatVov1IoBfisoUQ8dzI2onDOjrPBzLZ81G3pwbPSRqKns6YYjD8dIf5Pyf71aGgNwwkRUV1wTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:04:54.867045Z"},"content_sha256":"0db30bd7a3afcbdab88ba3a07a908f33790bae4c80f9ca1c10e836c38b2d19c3","schema_version":"1.0","event_id":"sha256:0db30bd7a3afcbdab88ba3a07a908f33790bae4c80f9ca1c10e836c38b2d19c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCTPYQ2Y3MEIXJR6YXYC6KFM4G/bundle.json","state_url":"https://pith.science/pith/JCTPYQ2Y3MEIXJR6YXYC6KFM4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCTPYQ2Y3MEIXJR6YXYC6KFM4G/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-03T06:04:54Z","links":{"resolver":"https://pith.science/pith/JCTPYQ2Y3MEIXJR6YXYC6KFM4G","bundle":"https://pith.science/pith/JCTPYQ2Y3MEIXJR6YXYC6KFM4G/bundle.json","state":"https://pith.science/pith/JCTPYQ2Y3MEIXJR6YXYC6KFM4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCTPYQ2Y3MEIXJR6YXYC6KFM4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JCTPYQ2Y3MEIXJR6YXYC6KFM4G","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":"b3e86a669b1067a2fe805f27a2cec539bbecf26d1478fb4c196e4126e05ed5c2","cross_cats_sorted":["cs.CC","cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T00:32:34Z","title_canon_sha256":"80210348da2b570a9da7a4b2089cdd9843d4f7890d7cc245538087be3080abb1"},"schema_version":"1.0","source":{"id":"1701.05955","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05955","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05955v2","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05955","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"JCTPYQ2Y3MEI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JCTPYQ2Y3MEIXJR6","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JCTPYQ2Y","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:0db30bd7a3afcbdab88ba3a07a908f33790bae4c80f9ca1c10e836c38b2d19c3","target":"graph","created_at":"2026-05-18T00:43:47Z","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":"Achieving information-theoretic security using explicit coding scheme in which unlimited computational power for eavesdropper is assumed, is one of the main topics is security consideration. It is shown that polar codes are capacity achieving codes and have a low complexity in encoding and decoding. It has been proven that polar codes reach to secrecy capacity in the binary-input wiretap channels in symmetric settings for which the wiretapper's channel is degraded with respect to the main channel. The first task of this paper is to propose a coding scheme to achieve secrecy capacity in asymmet","authors_text":"Amirsina Torfi, Hadi Kazemi, Rouzbeh Asghari Shirvani, Seyed Mehdi Iranmanesh, Sobhan Soleymani, Vahid Tabataba Vakili","cross_cats":["cs.CC","cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T00:32:34Z","title":"Polar Coding for Achieving the Capacity of Marginal Channels in Nonbinary-Input Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05955","kind":"arxiv","version":2},"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:d7b8dcba93ff8cffafeeabe8b8d25b6bc4e464bca0a8fdc0377867eb9c8480b8","target":"record","created_at":"2026-05-18T00:43:47Z","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":"b3e86a669b1067a2fe805f27a2cec539bbecf26d1478fb4c196e4126e05ed5c2","cross_cats_sorted":["cs.CC","cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-21T00:32:34Z","title_canon_sha256":"80210348da2b570a9da7a4b2089cdd9843d4f7890d7cc245538087be3080abb1"},"schema_version":"1.0","source":{"id":"1701.05955","kind":"arxiv","version":2}},"canonical_sha256":"48a6fc4358db088ba63ec5f02f28ace1834b80898d81b415191f3b3ae1df0a37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48a6fc4358db088ba63ec5f02f28ace1834b80898d81b415191f3b3ae1df0a37","first_computed_at":"2026-05-18T00:43:47.951253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:47.951253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"klNvgIeNDN949RJLJ+IyPT3o6022e2p0OQqycCwMKnHtuiirTbFJNQ2EYkFnIXbIqXHI/MDQjrdZ82Rh8yL9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:47.951830Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05955","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7b8dcba93ff8cffafeeabe8b8d25b6bc4e464bca0a8fdc0377867eb9c8480b8","sha256:0db30bd7a3afcbdab88ba3a07a908f33790bae4c80f9ca1c10e836c38b2d19c3"],"state_sha256":"b6ed9e6a198bcabc6a14533895509ba3f57e9939c4f8434491203d36af06b504"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IKk28bx/t61m3uo0atNjXrIvoe0ElxA8gx5ihBd7zOm6pCaW2qVUqYQa6n//zdYG541zXXLfSqX7SI9hWxdMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:04:54.868983Z","bundle_sha256":"bb23be078b3a30b715ca2aa3807d28ef09c0ef1672c8a4384710379f99f84742"}}