{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OIHHYZEWXTAFRJVRGB4V3OAB7G","short_pith_number":"pith:OIHHYZEW","schema_version":"1.0","canonical_sha256":"720e7c6496bcc058a6b130795db801f986c5c19500c858408fff08c9738a4724","source":{"kind":"arxiv","id":"1901.08186","version":3},"attestation_state":"computed","paper":{"title":"Explicit Polar Codes with Small Scaling Exponent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Arman Fazeli, Hanwen Yao","submitted_at":"2019-01-24T01:22:27Z","abstract_excerpt":"Herein, we focus on explicit constructions of $\\ell\\times\\ell$ binary kernels with small scaling exponent for $\\ell \\le 64$. In particular, we exhibit a sequence of binary linear codes that approaches capacity on the BEC with quasi-linear complexity and scaling exponent $\\mu < 3$. To the best of our knowledge, such a sequence of codes was not previously known to exist. The principal challenges in establishing our results are twofold: how to construct such kernels and how to evaluate their scaling exponent.\n  In a single polarization step, an $\\ell\\times\\ell$ kernel $K_\\ell$ transforms an under"},"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":"1901.08186","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-24T01:22:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41f8dd09d7865c261689d76df1af835c578d02aff5df0b7c679306f6ea1b045e","abstract_canon_sha256":"b8a77e1ba75c358c6d6d87514640dbfd1672c9711bb25713983c2137e89b139b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:38.175013Z","signature_b64":"z1K0Db9gCjnwx0x3ceFvPO1twvZXXqdufGSWiApoX67uUxg3TVfCFzhvXISCYUdjJ1LJJZArqqUVvPBrvJzkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"720e7c6496bcc058a6b130795db801f986c5c19500c858408fff08c9738a4724","last_reissued_at":"2026-05-17T23:52:38.174251Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:38.174251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit Polar Codes with Small Scaling Exponent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Arman Fazeli, Hanwen Yao","submitted_at":"2019-01-24T01:22:27Z","abstract_excerpt":"Herein, we focus on explicit constructions of $\\ell\\times\\ell$ binary kernels with small scaling exponent for $\\ell \\le 64$. In particular, we exhibit a sequence of binary linear codes that approaches capacity on the BEC with quasi-linear complexity and scaling exponent $\\mu < 3$. To the best of our knowledge, such a sequence of codes was not previously known to exist. The principal challenges in establishing our results are twofold: how to construct such kernels and how to evaluate their scaling exponent.\n  In a single polarization step, an $\\ell\\times\\ell$ kernel $K_\\ell$ transforms an under"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08186","kind":"arxiv","version":3},"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":"1901.08186","created_at":"2026-05-17T23:52:38.174385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.08186v3","created_at":"2026-05-17T23:52:38.174385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08186","created_at":"2026-05-17T23:52:38.174385+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIHHYZEWXTAF","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIHHYZEWXTAFRJVR","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIHHYZEW","created_at":"2026-05-18T12:33:24.271573+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/OIHHYZEWXTAFRJVRGB4V3OAB7G","json":"https://pith.science/pith/OIHHYZEWXTAFRJVRGB4V3OAB7G.json","graph_json":"https://pith.science/api/pith-number/OIHHYZEWXTAFRJVRGB4V3OAB7G/graph.json","events_json":"https://pith.science/api/pith-number/OIHHYZEWXTAFRJVRGB4V3OAB7G/events.json","paper":"https://pith.science/paper/OIHHYZEW"},"agent_actions":{"view_html":"https://pith.science/pith/OIHHYZEWXTAFRJVRGB4V3OAB7G","download_json":"https://pith.science/pith/OIHHYZEWXTAFRJVRGB4V3OAB7G.json","view_paper":"https://pith.science/paper/OIHHYZEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.08186&json=true","fetch_graph":"https://pith.science/api/pith-number/OIHHYZEWXTAFRJVRGB4V3OAB7G/graph.json","fetch_events":"https://pith.science/api/pith-number/OIHHYZEWXTAFRJVRGB4V3OAB7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIHHYZEWXTAFRJVRGB4V3OAB7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIHHYZEWXTAFRJVRGB4V3OAB7G/action/storage_attestation","attest_author":"https://pith.science/pith/OIHHYZEWXTAFRJVRGB4V3OAB7G/action/author_attestation","sign_citation":"https://pith.science/pith/OIHHYZEWXTAFRJVRGB4V3OAB7G/action/citation_signature","submit_replication":"https://pith.science/pith/OIHHYZEWXTAFRJVRGB4V3OAB7G/action/replication_record"}},"created_at":"2026-05-17T23:52:38.174385+00:00","updated_at":"2026-05-17T23:52:38.174385+00:00"}