{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4YKM37VHUW2CHMIR7BLRHVEEFN","short_pith_number":"pith:4YKM37VH","schema_version":"1.0","canonical_sha256":"e614cdfea7a5b423b111f85713d4842b6d82b4b3d3c7b9ef36b5eb795aa581ec","source":{"kind":"arxiv","id":"1705.02111","version":3},"attestation_state":"computed","paper":{"title":"Blind Detection of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Pascal Giard","submitted_at":"2017-05-05T07:43:52Z","abstract_excerpt":"Polar codes were recently chosen to protect the control channel information in the next-generation mobile communication standard (5G) defined by the 3GPP. As a result, receivers will have to implement blind detection of polar coded frames in order to keep complexity, latency, and power consumption tractable. As a newly proposed class of block codes, the problem of polar-code blind detection has received very little attention. In this work, we propose a low-complexity blind-detection algorithm for polar-encoded frames. We base this algorithm on a novel detection metric with update rules that le"},"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":"1705.02111","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-05T07:43:52Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"2275c3c77d6a9c28d5686b75ae652899ce700fa36329788da4def4b344a418a9","abstract_canon_sha256":"65860cbf010f96d863b583ac216d9d752899f5ea48541898c99d649350363f4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:16.507275Z","signature_b64":"37rosxDZ2zNgCKnKPXG6FW44N2K8+9DDbRVCU2iuAjl9iIpbPKQYR/46TjybdyZXY80WMD003Otebi1K3/QcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e614cdfea7a5b423b111f85713d4842b6d82b4b3d3c7b9ef36b5eb795aa581ec","last_reissued_at":"2026-05-18T00:14:16.506755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:16.506755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blind Detection of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Pascal Giard","submitted_at":"2017-05-05T07:43:52Z","abstract_excerpt":"Polar codes were recently chosen to protect the control channel information in the next-generation mobile communication standard (5G) defined by the 3GPP. As a result, receivers will have to implement blind detection of polar coded frames in order to keep complexity, latency, and power consumption tractable. As a newly proposed class of block codes, the problem of polar-code blind detection has received very little attention. In this work, we propose a low-complexity blind-detection algorithm for polar-encoded frames. We base this algorithm on a novel detection metric with update rules that le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02111","kind":"arxiv","version":3},"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":"1705.02111","created_at":"2026-05-18T00:14:16.506837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02111v3","created_at":"2026-05-18T00:14:16.506837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02111","created_at":"2026-05-18T00:14:16.506837+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YKM37VHUW2C","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YKM37VHUW2CHMIR","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YKM37VH","created_at":"2026-05-18T12:31:00.734936+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/4YKM37VHUW2CHMIR7BLRHVEEFN","json":"https://pith.science/pith/4YKM37VHUW2CHMIR7BLRHVEEFN.json","graph_json":"https://pith.science/api/pith-number/4YKM37VHUW2CHMIR7BLRHVEEFN/graph.json","events_json":"https://pith.science/api/pith-number/4YKM37VHUW2CHMIR7BLRHVEEFN/events.json","paper":"https://pith.science/paper/4YKM37VH"},"agent_actions":{"view_html":"https://pith.science/pith/4YKM37VHUW2CHMIR7BLRHVEEFN","download_json":"https://pith.science/pith/4YKM37VHUW2CHMIR7BLRHVEEFN.json","view_paper":"https://pith.science/paper/4YKM37VH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02111&json=true","fetch_graph":"https://pith.science/api/pith-number/4YKM37VHUW2CHMIR7BLRHVEEFN/graph.json","fetch_events":"https://pith.science/api/pith-number/4YKM37VHUW2CHMIR7BLRHVEEFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YKM37VHUW2CHMIR7BLRHVEEFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YKM37VHUW2CHMIR7BLRHVEEFN/action/storage_attestation","attest_author":"https://pith.science/pith/4YKM37VHUW2CHMIR7BLRHVEEFN/action/author_attestation","sign_citation":"https://pith.science/pith/4YKM37VHUW2CHMIR7BLRHVEEFN/action/citation_signature","submit_replication":"https://pith.science/pith/4YKM37VHUW2CHMIR7BLRHVEEFN/action/replication_record"}},"created_at":"2026-05-18T00:14:16.506837+00:00","updated_at":"2026-05-18T00:14:16.506837+00:00"}