{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MGIGQID3QVNP3I5STIN4ZTZ36X","short_pith_number":"pith:MGIGQID3","schema_version":"1.0","canonical_sha256":"619068207b855afda3b29a1bcccf3bf5e1a4d538fec115c39456874202befbff","source":{"kind":"arxiv","id":"1304.5220","version":4},"attestation_state":"computed","paper":{"title":"Scaling Exponent of List Decoders with Applications to Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marco Mondelli, R\\\"udiger Urbanke, S. Hamed Hassani","submitted_at":"2013-04-18T18:47:39Z","abstract_excerpt":"Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed and the trade-off between block length and back-off from capacity is analyzed. A lower bound is provided on the error probability under $\\rm MAP$ decoding with list size $L$ for any binary-input memoryless output-symmetric channel and for any class of linear codes such that their minimum distance is unbounded as the block length grows large. Then, it is shown that "},"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":"1304.5220","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-18T18:47:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9b578914b99e55c3adf5e0aee3bf2a435c802025fa294224d951d6deb9028c98","abstract_canon_sha256":"c9c3efdf2b42f43cf8bcb6f59eaa34426ceee38c1eaa3e4d04cc647bc0217513"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:15.055270Z","signature_b64":"qlA3hWjvj0K08DtROHa0VOBAiB8vOKp9QB1X7Xi4YNPoCXqIUeJrCMwa0yinxpbDNqmwVRX35FhQ6ipCRBV9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"619068207b855afda3b29a1bcccf3bf5e1a4d538fec115c39456874202befbff","last_reissued_at":"2026-05-18T02:42:15.054523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:15.054523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Exponent of List Decoders with Applications to Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marco Mondelli, R\\\"udiger Urbanke, S. Hamed Hassani","submitted_at":"2013-04-18T18:47:39Z","abstract_excerpt":"Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed and the trade-off between block length and back-off from capacity is analyzed. A lower bound is provided on the error probability under $\\rm MAP$ decoding with list size $L$ for any binary-input memoryless output-symmetric channel and for any class of linear codes such that their minimum distance is unbounded as the block length grows large. Then, it is shown that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5220","kind":"arxiv","version":4},"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":"1304.5220","created_at":"2026-05-18T02:42:15.054644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5220v4","created_at":"2026-05-18T02:42:15.054644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5220","created_at":"2026-05-18T02:42:15.054644+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGIGQID3QVNP","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGIGQID3QVNP3I5S","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGIGQID3","created_at":"2026-05-18T12:27:52.871228+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/MGIGQID3QVNP3I5STIN4ZTZ36X","json":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X.json","graph_json":"https://pith.science/api/pith-number/MGIGQID3QVNP3I5STIN4ZTZ36X/graph.json","events_json":"https://pith.science/api/pith-number/MGIGQID3QVNP3I5STIN4ZTZ36X/events.json","paper":"https://pith.science/paper/MGIGQID3"},"agent_actions":{"view_html":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X","download_json":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X.json","view_paper":"https://pith.science/paper/MGIGQID3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5220&json=true","fetch_graph":"https://pith.science/api/pith-number/MGIGQID3QVNP3I5STIN4ZTZ36X/graph.json","fetch_events":"https://pith.science/api/pith-number/MGIGQID3QVNP3I5STIN4ZTZ36X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X/action/storage_attestation","attest_author":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X/action/author_attestation","sign_citation":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X/action/citation_signature","submit_replication":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X/action/replication_record"}},"created_at":"2026-05-18T02:42:15.054644+00:00","updated_at":"2026-05-18T02:42:15.054644+00:00"}