{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q2JJYXEV3IREPWBFIEKSPWDVCC","short_pith_number":"pith:Q2JJYXEV","schema_version":"1.0","canonical_sha256":"86929c5c95da2247d825411527d87510aa5a3cdcecec45a21987c2baaee4cd3e","source":{"kind":"arxiv","id":"1703.06592","version":2},"attestation_state":"computed","paper":{"title":"Fast Sequential Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Peter Trifonov, Ruslan Morozov, Vera Miloslavskaya","submitted_at":"2017-03-20T04:35:45Z","abstract_excerpt":"A new score function is proposed for stack decoding of polar codes, which enables one to accurately compare paths of different lengths. The proposed score function includes bias, which reflects the average behaviour of the correct path. This enables significant complexity reduction with respect to the original stack algorithm at the expense of a negligible performance loss."},"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.06592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-20T04:35:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df9faa00695a6daacc3a58d215f92e7f31d3a47c85047ceb202feb9ad7a7ad1d","abstract_canon_sha256":"d120d075d804533fdf7dc2119fb7ef7ccc91063cd689795b5f661a5490d662ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:08.259127Z","signature_b64":"5msIaY7MwZHnUdzxm55Nu+tWjni173u6wsWFMg7gbgMtMlRia9Pg287Te58p3l1ts9gW+lCYDeq0/smSNfojAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86929c5c95da2247d825411527d87510aa5a3cdcecec45a21987c2baaee4cd3e","last_reissued_at":"2026-05-18T00:26:08.258404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:08.258404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Sequential Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Peter Trifonov, Ruslan Morozov, Vera Miloslavskaya","submitted_at":"2017-03-20T04:35:45Z","abstract_excerpt":"A new score function is proposed for stack decoding of polar codes, which enables one to accurately compare paths of different lengths. The proposed score function includes bias, which reflects the average behaviour of the correct path. This enables significant complexity reduction with respect to the original stack algorithm at the expense of a negligible performance loss."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06592","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.06592","created_at":"2026-05-18T00:26:08.258530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06592v2","created_at":"2026-05-18T00:26:08.258530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06592","created_at":"2026-05-18T00:26:08.258530+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2JJYXEV3IRE","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2JJYXEV3IREPWBF","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2JJYXEV","created_at":"2026-05-18T12:31:37.085036+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/Q2JJYXEV3IREPWBFIEKSPWDVCC","json":"https://pith.science/pith/Q2JJYXEV3IREPWBFIEKSPWDVCC.json","graph_json":"https://pith.science/api/pith-number/Q2JJYXEV3IREPWBFIEKSPWDVCC/graph.json","events_json":"https://pith.science/api/pith-number/Q2JJYXEV3IREPWBFIEKSPWDVCC/events.json","paper":"https://pith.science/paper/Q2JJYXEV"},"agent_actions":{"view_html":"https://pith.science/pith/Q2JJYXEV3IREPWBFIEKSPWDVCC","download_json":"https://pith.science/pith/Q2JJYXEV3IREPWBFIEKSPWDVCC.json","view_paper":"https://pith.science/paper/Q2JJYXEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06592&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2JJYXEV3IREPWBFIEKSPWDVCC/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2JJYXEV3IREPWBFIEKSPWDVCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2JJYXEV3IREPWBFIEKSPWDVCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2JJYXEV3IREPWBFIEKSPWDVCC/action/storage_attestation","attest_author":"https://pith.science/pith/Q2JJYXEV3IREPWBFIEKSPWDVCC/action/author_attestation","sign_citation":"https://pith.science/pith/Q2JJYXEV3IREPWBFIEKSPWDVCC/action/citation_signature","submit_replication":"https://pith.science/pith/Q2JJYXEV3IREPWBFIEKSPWDVCC/action/replication_record"}},"created_at":"2026-05-18T00:26:08.258530+00:00","updated_at":"2026-05-18T00:26:08.258530+00:00"}