{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:APCZ77IBJMYC4D5MM2RHO4LOCE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"36ad5445092f5959f9a12ba1d579618a30cd2f132dbc9a811c751fd6a1fced5f","cross_cats_sorted":["math.AG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-27T04:39:09Z","title_canon_sha256":"7fffb42c63566498418a886b2a6eb943cb6bda83627c3ee10c5e2ecfb5803caa"},"schema_version":"1.0","source":{"id":"1310.7159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7159","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7159v1","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7159","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"pith_short_12","alias_value":"APCZ77IBJMYC","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"APCZ77IBJMYC4D5M","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"APCZ77IB","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:9b19786e6840b171e4a88054f71c8575168fa5be05ec2328b7656111116a1905","target":"graph","created_at":"2026-05-18T03:07:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Polar codes were introduced by Arikan in 2008 and are the first family of error-correcting codes achieving the symmetric capacity of an arbitrary binary-input discrete memoryless channel under low complexity encoding and using an efficient successive cancellation decoding strategy. Recently, non-binary polar codes have been studied, in which one can use different algebraic geometry codes to achieve better error decoding probability. In this paper, we study the performance of binary polar codes that are obtained from non-binary algebraic geometry codes using concatenation. For binary polar code","authors_text":"Abdulla Eid, Iwan Duursma","cross_cats":["math.AG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-27T04:39:09Z","title":"Using concatenated algebraic geometry codes in channel polarization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7159","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aaf2bf35cdbf92d467e9ed9f80fbee1c70c713ff22d48f69f1631b5de99394e9","target":"record","created_at":"2026-05-18T03:07:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"36ad5445092f5959f9a12ba1d579618a30cd2f132dbc9a811c751fd6a1fced5f","cross_cats_sorted":["math.AG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-27T04:39:09Z","title_canon_sha256":"7fffb42c63566498418a886b2a6eb943cb6bda83627c3ee10c5e2ecfb5803caa"},"schema_version":"1.0","source":{"id":"1310.7159","kind":"arxiv","version":1}},"canonical_sha256":"03c59ffd014b302e0fac66a277716e110a5b043e2248caf05aabb162d097f87b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03c59ffd014b302e0fac66a277716e110a5b043e2248caf05aabb162d097f87b","first_computed_at":"2026-05-18T03:07:42.058293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:42.058293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ghDsj+f94lhC+nEBkQn+adMzJFyzPcVKtYbClJ1M9EEcGzS3VlO3PzMDMaBdkPaRnAcVy3SUGeZ/8lW4pXckBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:42.058981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaf2bf35cdbf92d467e9ed9f80fbee1c70c713ff22d48f69f1631b5de99394e9","sha256:9b19786e6840b171e4a88054f71c8575168fa5be05ec2328b7656111116a1905"],"state_sha256":"80a7056350b89b4c69661957fe2f5fbbf65e38af32cfc86ad8967cc743844198"}