{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MGIGQID3QVNP3I5STIN4ZTZ36X","short_pith_number":"pith:MGIGQID3","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"},"canonical_sha256":"619068207b855afda3b29a1bcccf3bf5e1a4d538fec115c39456874202befbff","source":{"kind":"arxiv","id":"1304.5220","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5220","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5220v4","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5220","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"MGIGQID3QVNP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MGIGQID3QVNP3I5S","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MGIGQID3","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MGIGQID3QVNP3I5STIN4ZTZ36X","target":"record","payload":{"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"},"canonical_sha256":"619068207b855afda3b29a1bcccf3bf5e1a4d538fec115c39456874202befbff","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"},"source_kind":"arxiv","source_id":"1304.5220","source_version":4,"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-18T02:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILo0jSdBu8KH8z4jqEtJQE+o+Jp0iPSy1xkeoIqRGPShfndxZjo4dn0XLn/x2gpdENB4PkwDepJBu4nB7OjgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T12:30:06.927583Z"},"content_sha256":"bab8e2432aefae54bae77b485fcdea52f6bad3402f4fe32071fd4a34489da26e","schema_version":"1.0","event_id":"sha256:bab8e2432aefae54bae77b485fcdea52f6bad3402f4fe32071fd4a34489da26e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MGIGQID3QVNP3I5STIN4ZTZ36X","target":"graph","payload":{"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"},"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-18T02:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvA83FNHNL3PhvRzb6DicKsJH009hxv8FXdEQRazVS8+VWGbv/MWAu86Y8obeq6uertgdmKuRsbrf0BWC1/GBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T12:30:06.928095Z"},"content_sha256":"5911461de8b541f92c03b44b31e94938ad7f5aa5a2d39608617ca5ca2b884747","schema_version":"1.0","event_id":"sha256:5911461de8b541f92c03b44b31e94938ad7f5aa5a2d39608617ca5ca2b884747"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X/bundle.json","state_url":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGIGQID3QVNP3I5STIN4ZTZ36X/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-22T12:30:06Z","links":{"resolver":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X","bundle":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X/bundle.json","state":"https://pith.science/pith/MGIGQID3QVNP3I5STIN4ZTZ36X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGIGQID3QVNP3I5STIN4ZTZ36X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MGIGQID3QVNP3I5STIN4ZTZ36X","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":"c9c3efdf2b42f43cf8bcb6f59eaa34426ceee38c1eaa3e4d04cc647bc0217513","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-18T18:47:39Z","title_canon_sha256":"9b578914b99e55c3adf5e0aee3bf2a435c802025fa294224d951d6deb9028c98"},"schema_version":"1.0","source":{"id":"1304.5220","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5220","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5220v4","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5220","created_at":"2026-05-18T02:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"MGIGQID3QVNP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MGIGQID3QVNP3I5S","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MGIGQID3","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:5911461de8b541f92c03b44b31e94938ad7f5aa5a2d39608617ca5ca2b884747","target":"graph","created_at":"2026-05-18T02:42:15Z","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":"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 ","authors_text":"Marco Mondelli, R\\\"udiger Urbanke, S. Hamed Hassani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-18T18:47:39Z","title":"Scaling Exponent of List Decoders with Applications to Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5220","kind":"arxiv","version":4},"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:bab8e2432aefae54bae77b485fcdea52f6bad3402f4fe32071fd4a34489da26e","target":"record","created_at":"2026-05-18T02:42:15Z","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":"c9c3efdf2b42f43cf8bcb6f59eaa34426ceee38c1eaa3e4d04cc647bc0217513","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-18T18:47:39Z","title_canon_sha256":"9b578914b99e55c3adf5e0aee3bf2a435c802025fa294224d951d6deb9028c98"},"schema_version":"1.0","source":{"id":"1304.5220","kind":"arxiv","version":4}},"canonical_sha256":"619068207b855afda3b29a1bcccf3bf5e1a4d538fec115c39456874202befbff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"619068207b855afda3b29a1bcccf3bf5e1a4d538fec115c39456874202befbff","first_computed_at":"2026-05-18T02:42:15.054523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:15.054523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qlA3hWjvj0K08DtROHa0VOBAiB8vOKp9QB1X7Xi4YNPoCXqIUeJrCMwa0yinxpbDNqmwVRX35FhQ6ipCRBV9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:15.055270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5220","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bab8e2432aefae54bae77b485fcdea52f6bad3402f4fe32071fd4a34489da26e","sha256:5911461de8b541f92c03b44b31e94938ad7f5aa5a2d39608617ca5ca2b884747"],"state_sha256":"9469de9a28f9c1870b4944cf838e2b3c55d4db8082e8c44bcfc8aae45d85646c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJdemAurDtbp9xiSn4FoM9tdEZQxXFanzP80n6VAhnsZ2wa+ucPXkUJB5wDJ+zQ/Dftj1kpcRA9mPDY2DayaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T12:30:06.931159Z","bundle_sha256":"a124e1ce2d0581e77d2939e729663591814f445b583569455e71215e8b9ac392"}}