{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6W7BZT473W5TBDQTNDH6YAJHUE","short_pith_number":"pith:6W7BZT47","schema_version":"1.0","canonical_sha256":"f5be1ccf9fddbb308e1368cfec0127a1279b82b0b5b619146fe36d0cd3195aad","source":{"kind":"arxiv","id":"1306.6311","version":2},"attestation_state":"computed","paper":{"title":"Fast Software Polar Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Claude Thibeault, Gabi Sarkis, Pascal Giard, Warren J. Gross","submitted_at":"2013-06-26T18:36:26Z","abstract_excerpt":"Among error-correcting codes, polar codes are the first to provably achieve channel capacity with an explicit construction. In this work, we present software implementations of a polar decoder that leverage the capabilities of modern general-purpose processors to achieve an information throughput in excess of 200 Mbps, a throughput well suited for software-defined-radio applications. We also show that, for a similar error-correction performance, the throughput of polar decoders both surpasses that of LDPC decoders targeting general-purpose processors and is competitive with that of state-of-th"},"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":"1306.6311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T18:36:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9178c7dcca6177fcc607c8551badb379a1546a8729d30ac1f268cfaad9eab055","abstract_canon_sha256":"d8f9f8eb4a7ed330167cc4be7937e0d20e8c200ccb0edb5d490bc784b1588245"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:24.697217Z","signature_b64":"2ImK6zWXvNa24fMbJbj565NLYOPbQlKCc8jWVeXTXnQfvqLIHJ9KDKcKtqelkqhqa2rHFt4sPr7F7etS6KmCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5be1ccf9fddbb308e1368cfec0127a1279b82b0b5b619146fe36d0cd3195aad","last_reissued_at":"2026-05-18T02:05:24.696715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:24.696715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Software Polar Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Claude Thibeault, Gabi Sarkis, Pascal Giard, Warren J. Gross","submitted_at":"2013-06-26T18:36:26Z","abstract_excerpt":"Among error-correcting codes, polar codes are the first to provably achieve channel capacity with an explicit construction. In this work, we present software implementations of a polar decoder that leverage the capabilities of modern general-purpose processors to achieve an information throughput in excess of 200 Mbps, a throughput well suited for software-defined-radio applications. We also show that, for a similar error-correction performance, the throughput of polar decoders both surpasses that of LDPC decoders targeting general-purpose processors and is competitive with that of state-of-th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6311","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":"1306.6311","created_at":"2026-05-18T02:05:24.696790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6311v2","created_at":"2026-05-18T02:05:24.696790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6311","created_at":"2026-05-18T02:05:24.696790+00:00"},{"alias_kind":"pith_short_12","alias_value":"6W7BZT473W5T","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6W7BZT473W5TBDQT","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6W7BZT47","created_at":"2026-05-18T12:27:36.564083+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/6W7BZT473W5TBDQTNDH6YAJHUE","json":"https://pith.science/pith/6W7BZT473W5TBDQTNDH6YAJHUE.json","graph_json":"https://pith.science/api/pith-number/6W7BZT473W5TBDQTNDH6YAJHUE/graph.json","events_json":"https://pith.science/api/pith-number/6W7BZT473W5TBDQTNDH6YAJHUE/events.json","paper":"https://pith.science/paper/6W7BZT47"},"agent_actions":{"view_html":"https://pith.science/pith/6W7BZT473W5TBDQTNDH6YAJHUE","download_json":"https://pith.science/pith/6W7BZT473W5TBDQTNDH6YAJHUE.json","view_paper":"https://pith.science/paper/6W7BZT47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6311&json=true","fetch_graph":"https://pith.science/api/pith-number/6W7BZT473W5TBDQTNDH6YAJHUE/graph.json","fetch_events":"https://pith.science/api/pith-number/6W7BZT473W5TBDQTNDH6YAJHUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6W7BZT473W5TBDQTNDH6YAJHUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6W7BZT473W5TBDQTNDH6YAJHUE/action/storage_attestation","attest_author":"https://pith.science/pith/6W7BZT473W5TBDQTNDH6YAJHUE/action/author_attestation","sign_citation":"https://pith.science/pith/6W7BZT473W5TBDQTNDH6YAJHUE/action/citation_signature","submit_replication":"https://pith.science/pith/6W7BZT473W5TBDQTNDH6YAJHUE/action/replication_record"}},"created_at":"2026-05-18T02:05:24.696790+00:00","updated_at":"2026-05-18T02:05:24.696790+00:00"}