{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MSRURKBDQYU7SFRVUA2QAN7WZ6","short_pith_number":"pith:MSRURKBD","canonical_record":{"source":{"id":"1209.4818","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-21T13:46:26Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"4ea83ac525c3b717073f64f0b41734e428eddee559ba4b74cda43a7675d7a5ff","abstract_canon_sha256":"c0335afd618e8e95b054a3981d7f25da6567e1e4bf567458cad9d0a5335a9d22"},"schema_version":"1.0"},"canonical_sha256":"64a348a8238629f91635a0350037f6cfba0db72f457f8e769485d43ec2d5ca33","source":{"kind":"arxiv","id":"1209.4818","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4818","created_at":"2026-05-18T01:44:20Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4818v3","created_at":"2026-05-18T01:44:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4818","created_at":"2026-05-18T01:44:20Z"},{"alias_kind":"pith_short_12","alias_value":"MSRURKBDQYU7","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MSRURKBDQYU7SFRV","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MSRURKBD","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MSRURKBDQYU7SFRVUA2QAN7WZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4818","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-21T13:46:26Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"4ea83ac525c3b717073f64f0b41734e428eddee559ba4b74cda43a7675d7a5ff","abstract_canon_sha256":"c0335afd618e8e95b054a3981d7f25da6567e1e4bf567458cad9d0a5335a9d22"},"schema_version":"1.0"},"canonical_sha256":"64a348a8238629f91635a0350037f6cfba0db72f457f8e769485d43ec2d5ca33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:44:20.863408Z","signature_b64":"7QNUE5TLYybOBQEmpBQl44cn1Ns297ogfNMtPlKnTFzqDusIQ6qrKNWzSI2KZCWAG1V6mg9AOuauafMUI31gBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64a348a8238629f91635a0350037f6cfba0db72f457f8e769485d43ec2d5ca33","last_reissued_at":"2026-05-18T01:44:20.862841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:44:20.862841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4818","source_version":3,"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-18T01:44:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C5rbqtIuP8st/IqxERGe9Sf174NMW5kNWS28qN8CLXOJZew4z39/S8M89WZm23ijRtcB9huwX+HuP2SJmsMkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:55:38.717705Z"},"content_sha256":"5f48b1d86d2d149935f732275415803f2969788d6e1fca147da4db43e8b32971","schema_version":"1.0","event_id":"sha256:5f48b1d86d2d149935f732275415803f2969788d6e1fca147da4db43e8b32971"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MSRURKBDQYU7SFRVUA2QAN7WZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive Descriptions of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","math.IT"],"primary_cat":"cs.IT","authors_text":"Noam Presman, Simon Litsyn","submitted_at":"2012-09-21T13:46:26Z","abstract_excerpt":"Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. Using such description allows an easy development of these algorithms for arbitrary polarizing kernels. Hardware architectures for these decoding algorithms are also described in a recursive way, both for Arikan's standard polar codes and for arbitrary polarizing kernels."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4818","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"},"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-18T01:44:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52H4LuuWEbCNUdUzOhcTkYUZAu0bzp5hIAUvRZgBCYbdNWumN9+kR8KiN0GV3sogpskf6mVcuyWSGSflrlWiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:55:38.718100Z"},"content_sha256":"9db806429ff7812f1bb4d4d4c0e93bba225242c6c6c484340aaa64137a585144","schema_version":"1.0","event_id":"sha256:9db806429ff7812f1bb4d4d4c0e93bba225242c6c6c484340aaa64137a585144"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSRURKBDQYU7SFRVUA2QAN7WZ6/bundle.json","state_url":"https://pith.science/pith/MSRURKBDQYU7SFRVUA2QAN7WZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSRURKBDQYU7SFRVUA2QAN7WZ6/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-03T02:55:38Z","links":{"resolver":"https://pith.science/pith/MSRURKBDQYU7SFRVUA2QAN7WZ6","bundle":"https://pith.science/pith/MSRURKBDQYU7SFRVUA2QAN7WZ6/bundle.json","state":"https://pith.science/pith/MSRURKBDQYU7SFRVUA2QAN7WZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSRURKBDQYU7SFRVUA2QAN7WZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MSRURKBDQYU7SFRVUA2QAN7WZ6","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":"c0335afd618e8e95b054a3981d7f25da6567e1e4bf567458cad9d0a5335a9d22","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-21T13:46:26Z","title_canon_sha256":"4ea83ac525c3b717073f64f0b41734e428eddee559ba4b74cda43a7675d7a5ff"},"schema_version":"1.0","source":{"id":"1209.4818","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4818","created_at":"2026-05-18T01:44:20Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4818v3","created_at":"2026-05-18T01:44:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4818","created_at":"2026-05-18T01:44:20Z"},{"alias_kind":"pith_short_12","alias_value":"MSRURKBDQYU7","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MSRURKBDQYU7SFRV","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MSRURKBD","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:9db806429ff7812f1bb4d4d4c0e93bba225242c6c6c484340aaa64137a585144","target":"graph","created_at":"2026-05-18T01:44:20Z","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 are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. Using such description allows an easy development of these algorithms for arbitrary polarizing kernels. Hardware architectures for these decoding algorithms are also described in a recursive way, both for Arikan's standard polar codes and for arbitrary polarizing kernels.","authors_text":"Noam Presman, Simon Litsyn","cross_cats":["cs.AR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-21T13:46:26Z","title":"Recursive Descriptions of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4818","kind":"arxiv","version":3},"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:5f48b1d86d2d149935f732275415803f2969788d6e1fca147da4db43e8b32971","target":"record","created_at":"2026-05-18T01:44:20Z","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":"c0335afd618e8e95b054a3981d7f25da6567e1e4bf567458cad9d0a5335a9d22","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-21T13:46:26Z","title_canon_sha256":"4ea83ac525c3b717073f64f0b41734e428eddee559ba4b74cda43a7675d7a5ff"},"schema_version":"1.0","source":{"id":"1209.4818","kind":"arxiv","version":3}},"canonical_sha256":"64a348a8238629f91635a0350037f6cfba0db72f457f8e769485d43ec2d5ca33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64a348a8238629f91635a0350037f6cfba0db72f457f8e769485d43ec2d5ca33","first_computed_at":"2026-05-18T01:44:20.862841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:44:20.862841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7QNUE5TLYybOBQEmpBQl44cn1Ns297ogfNMtPlKnTFzqDusIQ6qrKNWzSI2KZCWAG1V6mg9AOuauafMUI31gBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:44:20.863408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4818","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f48b1d86d2d149935f732275415803f2969788d6e1fca147da4db43e8b32971","sha256:9db806429ff7812f1bb4d4d4c0e93bba225242c6c6c484340aaa64137a585144"],"state_sha256":"f25b914858476f01d8b47ec3c2427d489d7d822fcec6f8a7d10dab4c7612cf35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xe6S2wxJccTgx0hAVad2BP89eLH50bUzljReS/RtUoEgnOF9fHIZxSejnfawLKV5ubtV2D1Dr1U6b2IFFPA+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:55:38.720188Z","bundle_sha256":"c4e34b38f3da069f971c736ace9affd70dd2b7a5f698b184926ca9b41524bcba"}}