{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TOY7PG2PF3NVMHVQAQPA2GATD6","short_pith_number":"pith:TOY7PG2P","canonical_record":{"source":{"id":"1610.09782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-31T04:04:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b6bb86227c79814e55160b564542ce0f3bdd6f65680a2e0a6626e3566b52708b","abstract_canon_sha256":"b567db90818b027fe7d7a1cb47e53a5a083c2f675c7253eba1c0fcc2c2051f97"},"schema_version":"1.0"},"canonical_sha256":"9bb1f79b4f2edb561eb0041e0d18131fbff2cb13b3af87864f459676d5e66338","source":{"kind":"arxiv","id":"1610.09782","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09782","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09782v2","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09782","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"TOY7PG2PF3NV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOY7PG2PF3NVMHVQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOY7PG2P","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TOY7PG2PF3NVMHVQAQPA2GATD6","target":"record","payload":{"canonical_record":{"source":{"id":"1610.09782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-31T04:04:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b6bb86227c79814e55160b564542ce0f3bdd6f65680a2e0a6626e3566b52708b","abstract_canon_sha256":"b567db90818b027fe7d7a1cb47e53a5a083c2f675c7253eba1c0fcc2c2051f97"},"schema_version":"1.0"},"canonical_sha256":"9bb1f79b4f2edb561eb0041e0d18131fbff2cb13b3af87864f459676d5e66338","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:58.503089Z","signature_b64":"z7iFeTzsXMgIncVaW10JKJSHQWWgm6xiGx5d+pL7DuGCoLFYvDor6IxmbC3hVH8YDlXOmzXZ8ZUw1nfW8XhWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bb1f79b4f2edb561eb0041e0d18131fbff2cb13b3af87864f459676d5e66338","last_reissued_at":"2026-05-18T00:45:58.502676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:58.502676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.09782","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:45:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vwXzl2OTie5WiKJ89lo/wSJIP7vA4eAjB5p9xtn9Wk5q3ITUohl8NDu+M30gzmMvMOy0vjgUMj+GGgfyGwRLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:42:06.207899Z"},"content_sha256":"d3c36c1d10699bd0c8a385bf16ca430771448580678a934c2de91f471cecb14b","schema_version":"1.0","event_id":"sha256:d3c36c1d10699bd0c8a385bf16ca430771448580678a934c2de91f471cecb14b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TOY7PG2PF3NVMHVQAQPA2GATD6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Construction of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Liping Li, Wei Wang","submitted_at":"2016-10-31T04:04:28Z","abstract_excerpt":"The construction of polar codes for channels other than BECs requires sorting of all bit channels and then selecting the best $K$ of them for a block length $N=2^n$. In this paper, two types of partial orders (PO) of polar codes are incorporated in the construction process to decrease the required computations. Three sets, corresponding to the good bit channels ($\\mathcal{I}$), the frozen bit channels ($\\mathcal{F}$), and the undetermined bit channels ($\\mathcal{U}$), are selected by applying PO relations. The POs are channel independent and are therefore universal for all binary-input discret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09782","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:45:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o36TICcboDTRi4ls04TgGLepE0D9PpC3IBohyt2mVpoV/yTu4HHw5t6axQep9P/+E/FJY6cW2GctbuPfrcv7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:42:06.208398Z"},"content_sha256":"fb38fc3f0ca47c2b81cc6de79a34f138d38d94b79acd10e235b7e70aa72cf660","schema_version":"1.0","event_id":"sha256:fb38fc3f0ca47c2b81cc6de79a34f138d38d94b79acd10e235b7e70aa72cf660"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6/bundle.json","state_url":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOY7PG2PF3NVMHVQAQPA2GATD6/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-05-25T19:42:06Z","links":{"resolver":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6","bundle":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6/bundle.json","state":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOY7PG2PF3NVMHVQAQPA2GATD6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TOY7PG2PF3NVMHVQAQPA2GATD6","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":"b567db90818b027fe7d7a1cb47e53a5a083c2f675c7253eba1c0fcc2c2051f97","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-31T04:04:28Z","title_canon_sha256":"b6bb86227c79814e55160b564542ce0f3bdd6f65680a2e0a6626e3566b52708b"},"schema_version":"1.0","source":{"id":"1610.09782","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09782","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09782v2","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09782","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"TOY7PG2PF3NV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOY7PG2PF3NVMHVQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOY7PG2P","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:fb38fc3f0ca47c2b81cc6de79a34f138d38d94b79acd10e235b7e70aa72cf660","target":"graph","created_at":"2026-05-18T00:45:58Z","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":"The construction of polar codes for channels other than BECs requires sorting of all bit channels and then selecting the best $K$ of them for a block length $N=2^n$. In this paper, two types of partial orders (PO) of polar codes are incorporated in the construction process to decrease the required computations. Three sets, corresponding to the good bit channels ($\\mathcal{I}$), the frozen bit channels ($\\mathcal{F}$), and the undetermined bit channels ($\\mathcal{U}$), are selected by applying PO relations. The POs are channel independent and are therefore universal for all binary-input discret","authors_text":"Liping Li, Wei Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-31T04:04:28Z","title":"Efficient Construction of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09782","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:d3c36c1d10699bd0c8a385bf16ca430771448580678a934c2de91f471cecb14b","target":"record","created_at":"2026-05-18T00:45:58Z","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":"b567db90818b027fe7d7a1cb47e53a5a083c2f675c7253eba1c0fcc2c2051f97","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-31T04:04:28Z","title_canon_sha256":"b6bb86227c79814e55160b564542ce0f3bdd6f65680a2e0a6626e3566b52708b"},"schema_version":"1.0","source":{"id":"1610.09782","kind":"arxiv","version":2}},"canonical_sha256":"9bb1f79b4f2edb561eb0041e0d18131fbff2cb13b3af87864f459676d5e66338","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bb1f79b4f2edb561eb0041e0d18131fbff2cb13b3af87864f459676d5e66338","first_computed_at":"2026-05-18T00:45:58.502676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:58.502676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z7iFeTzsXMgIncVaW10JKJSHQWWgm6xiGx5d+pL7DuGCoLFYvDor6IxmbC3hVH8YDlXOmzXZ8ZUw1nfW8XhWDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:58.503089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09782","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3c36c1d10699bd0c8a385bf16ca430771448580678a934c2de91f471cecb14b","sha256:fb38fc3f0ca47c2b81cc6de79a34f138d38d94b79acd10e235b7e70aa72cf660"],"state_sha256":"e82e40762ad6667d906f8f95c25449256a7ac7acfa1de51decb7dce92f6148d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqqcaoCcld72hrjFErZtLqpOZ0VB6LhcF2HUlFGdpDASlGKkgqaQZgk2rlc+niENU4WsGmG7O1bzxheGpaz/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:42:06.211527Z","bundle_sha256":"e32e87076117dcfbef8810528917d3e446d262a6fbeeb475ceb446fec3df49a2"}}