{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GCY7FMK6BKBKULQGX2A62RDZIJ","short_pith_number":"pith:GCY7FMK6","canonical_record":{"source":{"id":"1307.7223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-27T07:12:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1e481bf3189c09782e305efc79714ff577d3aee2f3be463bd7746c57c0392499","abstract_canon_sha256":"22684f7b18fb1c48f32fdfcbac7fdb518e2ea4fac8456e443f1847608f0fa3d0"},"schema_version":"1.0"},"canonical_sha256":"30b1f2b15e0a82aa2e06be81ed44794246daaef9039da7866699c84a7c7d9c3b","source":{"kind":"arxiv","id":"1307.7223","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7223","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7223v2","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7223","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"GCY7FMK6BKBK","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GCY7FMK6BKBKULQG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GCY7FMK6","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GCY7FMK6BKBKULQGX2A62RDZIJ","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-27T07:12:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1e481bf3189c09782e305efc79714ff577d3aee2f3be463bd7746c57c0392499","abstract_canon_sha256":"22684f7b18fb1c48f32fdfcbac7fdb518e2ea4fac8456e443f1847608f0fa3d0"},"schema_version":"1.0"},"canonical_sha256":"30b1f2b15e0a82aa2e06be81ed44794246daaef9039da7866699c84a7c7d9c3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:48.974888Z","signature_b64":"oeLo3PrhnebTNxIYkvPsazUQJu7GvrvETbU09dauv7/g7CPPbST1keUBcnnTI/VVXk4aTGbQPfKxzDXDDhZcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30b1f2b15e0a82aa2e06be81ed44794246daaef9039da7866699c84a7c7d9c3b","last_reissued_at":"2026-05-18T03:04:48.974158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:48.974158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7223","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mxhSp1BKLGh6E8Gfw/urdgc3/VcKcQgQ4wUELsQ14UjH5sLehkLOGpehr0eB5CQVDEPAQRDqQ/hOJsObTQJACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:50:04.296977Z"},"content_sha256":"48581468888e3a8fdf12a2a708142881c6ee39300b4f8c0a65a15ecc405c2ef6","schema_version":"1.0","event_id":"sha256:48581468888e3a8fdf12a2a708142881c6ee39300b4f8c0a65a15ecc405c2ef6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GCY7FMK6BKBKULQGX2A62RDZIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rudiger Urbanke, S. Hamed Hassani","submitted_at":"2013-07-27T07:12:39Z","abstract_excerpt":"Polar codes, invented by Arikan in 2009, are known to achieve the capacity of any binary-input memoryless output-symmetric channel. One of the few drawbacks of the original polar code construction is that it is not universal. This means that the code has to be tailored to the channel if we want to transmit close to capacity.\n  We present two \"polar-like\" schemes which are capable of achieving the compound capacity of the whole class of binary-input memoryless output-symmetric channels with low complexity.\n  Roughly speaking, for the first scheme we stack up $N$ polar blocks of length $N$ on to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7223","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRp4TzsvdXQsUo2PVGHGmQxFhea2o84VMh+003YFADmrdCxATII56g3ISDcAW+Ad64Ch9PF8h2/sxI/fmLdKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:50:04.297330Z"},"content_sha256":"fef27c669a92930b3fa986aea0d01959859c424feb9cfd434809cb866e0ec4b9","schema_version":"1.0","event_id":"sha256:fef27c669a92930b3fa986aea0d01959859c424feb9cfd434809cb866e0ec4b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCY7FMK6BKBKULQGX2A62RDZIJ/bundle.json","state_url":"https://pith.science/pith/GCY7FMK6BKBKULQGX2A62RDZIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCY7FMK6BKBKULQGX2A62RDZIJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T00:50:04Z","links":{"resolver":"https://pith.science/pith/GCY7FMK6BKBKULQGX2A62RDZIJ","bundle":"https://pith.science/pith/GCY7FMK6BKBKULQGX2A62RDZIJ/bundle.json","state":"https://pith.science/pith/GCY7FMK6BKBKULQGX2A62RDZIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCY7FMK6BKBKULQGX2A62RDZIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GCY7FMK6BKBKULQGX2A62RDZIJ","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":"22684f7b18fb1c48f32fdfcbac7fdb518e2ea4fac8456e443f1847608f0fa3d0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-27T07:12:39Z","title_canon_sha256":"1e481bf3189c09782e305efc79714ff577d3aee2f3be463bd7746c57c0392499"},"schema_version":"1.0","source":{"id":"1307.7223","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7223","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7223v2","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7223","created_at":"2026-05-18T03:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"GCY7FMK6BKBK","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GCY7FMK6BKBKULQG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GCY7FMK6","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:fef27c669a92930b3fa986aea0d01959859c424feb9cfd434809cb866e0ec4b9","target":"graph","created_at":"2026-05-18T03:04:48Z","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, invented by Arikan in 2009, are known to achieve the capacity of any binary-input memoryless output-symmetric channel. One of the few drawbacks of the original polar code construction is that it is not universal. This means that the code has to be tailored to the channel if we want to transmit close to capacity.\n  We present two \"polar-like\" schemes which are capable of achieving the compound capacity of the whole class of binary-input memoryless output-symmetric channels with low complexity.\n  Roughly speaking, for the first scheme we stack up $N$ polar blocks of length $N$ on to","authors_text":"Rudiger Urbanke, S. Hamed Hassani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-27T07:12:39Z","title":"Universal Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7223","kind":"arxiv","version":2},"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:48581468888e3a8fdf12a2a708142881c6ee39300b4f8c0a65a15ecc405c2ef6","target":"record","created_at":"2026-05-18T03:04:48Z","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":"22684f7b18fb1c48f32fdfcbac7fdb518e2ea4fac8456e443f1847608f0fa3d0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-27T07:12:39Z","title_canon_sha256":"1e481bf3189c09782e305efc79714ff577d3aee2f3be463bd7746c57c0392499"},"schema_version":"1.0","source":{"id":"1307.7223","kind":"arxiv","version":2}},"canonical_sha256":"30b1f2b15e0a82aa2e06be81ed44794246daaef9039da7866699c84a7c7d9c3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30b1f2b15e0a82aa2e06be81ed44794246daaef9039da7866699c84a7c7d9c3b","first_computed_at":"2026-05-18T03:04:48.974158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:48.974158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oeLo3PrhnebTNxIYkvPsazUQJu7GvrvETbU09dauv7/g7CPPbST1keUBcnnTI/VVXk4aTGbQPfKxzDXDDhZcCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:48.974888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7223","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48581468888e3a8fdf12a2a708142881c6ee39300b4f8c0a65a15ecc405c2ef6","sha256:fef27c669a92930b3fa986aea0d01959859c424feb9cfd434809cb866e0ec4b9"],"state_sha256":"cfd056291a7e3e5d139a0822fadb5e7020ff00fa4e1d21c72329442b3a2cfa09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h4qb0k/RKKkw5z5gA3y8TsA5Oy1m9jbi2WfUTjt45SVtErzVQBXV2T0JORgc3e4/iUk4seYqeTWH5rpU2lgdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:50:04.299327Z","bundle_sha256":"eb4db67fac9b9ddf616c882ac56f8aa67539357151728f1554f194acaefb929c"}}