{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HBIHL5EFWTHG4YI5IPLNW4FWEC","short_pith_number":"pith:HBIHL5EF","schema_version":"1.0","canonical_sha256":"385075f485b4ce6e611d43d6db70b62097cef5a39b4d84f85a35a2a7bcaf4f02","source":{"kind":"arxiv","id":"1207.4661","version":1},"attestation_state":"computed","paper":{"title":"A variant of list plus CRC concatenated polar code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gregory Bonik, Nickolai Zamarashkin, Sergei Goreinov","submitted_at":"2012-07-19T13:31:18Z","abstract_excerpt":"A new family of codes based on polar codes, soft concatenation and list+CRC decoding is proposed. Numerical experiments show the performance competitive with industry standards and Tal, Vardy approach."},"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":"1207.4661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-19T13:31:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"49e8f61e0ddb00b9814da0e651ad149e893793f77aeeca401b7615c55fe05cda","abstract_canon_sha256":"f80ffb988d0a9cdc6223ad19de30f3a9e209c80dc384f5fad8ca8597554cce5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:36.213344Z","signature_b64":"mzclsD8k5ETDEijSe+fSa8YhsSVnIYImXuY3P40t3OTpjlsxkUAUMfR0nTUULflltH1ZjBjJj/m0/12Bnv8xCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"385075f485b4ce6e611d43d6db70b62097cef5a39b4d84f85a35a2a7bcaf4f02","last_reissued_at":"2026-05-18T03:50:36.212495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:36.212495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A variant of list plus CRC concatenated polar code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gregory Bonik, Nickolai Zamarashkin, Sergei Goreinov","submitted_at":"2012-07-19T13:31:18Z","abstract_excerpt":"A new family of codes based on polar codes, soft concatenation and list+CRC decoding is proposed. Numerical experiments show the performance competitive with industry standards and Tal, Vardy approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4661","kind":"arxiv","version":1},"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":"1207.4661","created_at":"2026-05-18T03:50:36.212639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4661v1","created_at":"2026-05-18T03:50:36.212639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4661","created_at":"2026-05-18T03:50:36.212639+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBIHL5EFWTHG","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBIHL5EFWTHG4YI5","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBIHL5EF","created_at":"2026-05-18T12:27:09.501522+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/HBIHL5EFWTHG4YI5IPLNW4FWEC","json":"https://pith.science/pith/HBIHL5EFWTHG4YI5IPLNW4FWEC.json","graph_json":"https://pith.science/api/pith-number/HBIHL5EFWTHG4YI5IPLNW4FWEC/graph.json","events_json":"https://pith.science/api/pith-number/HBIHL5EFWTHG4YI5IPLNW4FWEC/events.json","paper":"https://pith.science/paper/HBIHL5EF"},"agent_actions":{"view_html":"https://pith.science/pith/HBIHL5EFWTHG4YI5IPLNW4FWEC","download_json":"https://pith.science/pith/HBIHL5EFWTHG4YI5IPLNW4FWEC.json","view_paper":"https://pith.science/paper/HBIHL5EF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4661&json=true","fetch_graph":"https://pith.science/api/pith-number/HBIHL5EFWTHG4YI5IPLNW4FWEC/graph.json","fetch_events":"https://pith.science/api/pith-number/HBIHL5EFWTHG4YI5IPLNW4FWEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBIHL5EFWTHG4YI5IPLNW4FWEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBIHL5EFWTHG4YI5IPLNW4FWEC/action/storage_attestation","attest_author":"https://pith.science/pith/HBIHL5EFWTHG4YI5IPLNW4FWEC/action/author_attestation","sign_citation":"https://pith.science/pith/HBIHL5EFWTHG4YI5IPLNW4FWEC/action/citation_signature","submit_replication":"https://pith.science/pith/HBIHL5EFWTHG4YI5IPLNW4FWEC/action/replication_record"}},"created_at":"2026-05-18T03:50:36.212639+00:00","updated_at":"2026-05-18T03:50:36.212639+00:00"}