{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TOY7PG2PF3NVMHVQAQPA2GATD6","short_pith_number":"pith:TOY7PG2P","schema_version":"1.0","canonical_sha256":"9bb1f79b4f2edb561eb0041e0d18131fbff2cb13b3af87864f459676d5e66338","source":{"kind":"arxiv","id":"1610.09782","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.09782","created_at":"2026-05-18T00:45:58.502745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09782v2","created_at":"2026-05-18T00:45:58.502745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09782","created_at":"2026-05-18T00:45:58.502745+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOY7PG2PF3NV","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOY7PG2PF3NVMHVQ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOY7PG2P","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6","json":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6.json","graph_json":"https://pith.science/api/pith-number/TOY7PG2PF3NVMHVQAQPA2GATD6/graph.json","events_json":"https://pith.science/api/pith-number/TOY7PG2PF3NVMHVQAQPA2GATD6/events.json","paper":"https://pith.science/paper/TOY7PG2P"},"agent_actions":{"view_html":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6","download_json":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6.json","view_paper":"https://pith.science/paper/TOY7PG2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09782&json=true","fetch_graph":"https://pith.science/api/pith-number/TOY7PG2PF3NVMHVQAQPA2GATD6/graph.json","fetch_events":"https://pith.science/api/pith-number/TOY7PG2PF3NVMHVQAQPA2GATD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6/action/storage_attestation","attest_author":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6/action/author_attestation","sign_citation":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6/action/citation_signature","submit_replication":"https://pith.science/pith/TOY7PG2PF3NVMHVQAQPA2GATD6/action/replication_record"}},"created_at":"2026-05-18T00:45:58.502745+00:00","updated_at":"2026-05-18T00:45:58.502745+00:00"}