{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:23XGXXTFZUMZL735YYAH2M3OF7","short_pith_number":"pith:23XGXXTF","schema_version":"1.0","canonical_sha256":"d6ee6bde65cd1995ff7dc6007d336e2feae9e4dc34ff0969888a463c30decca3","source":{"kind":"arxiv","id":"1703.05307","version":2},"attestation_state":"computed","paper":{"title":"On decoding algorithms for polar codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ilya Dumer","submitted_at":"2017-03-14T23:33:56Z","abstract_excerpt":"We survey the known list decoding algorithms for polar codes and compare their complexity.\n  Index terms: Polar codes; Reed-Muller codes; successive cancellation decoding."},"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":"1703.05307","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-14T23:33:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00f21e6d46029b9ae9d53eda1856fe9c053f25ec0c1e1879066a1577a79d3568","abstract_canon_sha256":"6a98ea6cce844573dd834d9682e99536fff61bbc19fac778c7b838bfd79b840f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:32.202867Z","signature_b64":"erH0gfFkdKm969Irb9hgJ+gTCaEazQswhoWvSL5rN3IkhAziGrKL8ZLjfim5nKzRgceIQuZa9+7hFTOafoswBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6ee6bde65cd1995ff7dc6007d336e2feae9e4dc34ff0969888a463c30decca3","last_reissued_at":"2026-05-18T00:48:32.202292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:32.202292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On decoding algorithms for polar codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ilya Dumer","submitted_at":"2017-03-14T23:33:56Z","abstract_excerpt":"We survey the known list decoding algorithms for polar codes and compare their complexity.\n  Index terms: Polar codes; Reed-Muller codes; successive cancellation decoding."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05307","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":"1703.05307","created_at":"2026-05-18T00:48:32.202385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05307v2","created_at":"2026-05-18T00:48:32.202385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05307","created_at":"2026-05-18T00:48:32.202385+00:00"},{"alias_kind":"pith_short_12","alias_value":"23XGXXTFZUMZ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"23XGXXTFZUMZL735","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"23XGXXTF","created_at":"2026-05-18T12:30:55.937587+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/23XGXXTFZUMZL735YYAH2M3OF7","json":"https://pith.science/pith/23XGXXTFZUMZL735YYAH2M3OF7.json","graph_json":"https://pith.science/api/pith-number/23XGXXTFZUMZL735YYAH2M3OF7/graph.json","events_json":"https://pith.science/api/pith-number/23XGXXTFZUMZL735YYAH2M3OF7/events.json","paper":"https://pith.science/paper/23XGXXTF"},"agent_actions":{"view_html":"https://pith.science/pith/23XGXXTFZUMZL735YYAH2M3OF7","download_json":"https://pith.science/pith/23XGXXTFZUMZL735YYAH2M3OF7.json","view_paper":"https://pith.science/paper/23XGXXTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05307&json=true","fetch_graph":"https://pith.science/api/pith-number/23XGXXTFZUMZL735YYAH2M3OF7/graph.json","fetch_events":"https://pith.science/api/pith-number/23XGXXTFZUMZL735YYAH2M3OF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23XGXXTFZUMZL735YYAH2M3OF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23XGXXTFZUMZL735YYAH2M3OF7/action/storage_attestation","attest_author":"https://pith.science/pith/23XGXXTFZUMZL735YYAH2M3OF7/action/author_attestation","sign_citation":"https://pith.science/pith/23XGXXTFZUMZL735YYAH2M3OF7/action/citation_signature","submit_replication":"https://pith.science/pith/23XGXXTFZUMZL735YYAH2M3OF7/action/replication_record"}},"created_at":"2026-05-18T00:48:32.202385+00:00","updated_at":"2026-05-18T00:48:32.202385+00:00"}