{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KINVQ26TV5M3JVRV56YYD52EWE","short_pith_number":"pith:KINVQ26T","canonical_record":{"source":{"id":"1711.11093","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-29T20:29:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5396aacbe35da32b92632e600e8c832139dbcae5271bb4fa4a2fa7da11d4f48","abstract_canon_sha256":"73159fbd546cff1fbabfeaee3621e609f9e0496edb650a718253543691cfb60e"},"schema_version":"1.0"},"canonical_sha256":"521b586bd3af59b4d635efb181f744b11f463bdc48cf1b60c8b4ffcecaf6eb7f","source":{"kind":"arxiv","id":"1711.11093","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11093","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11093v4","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11093","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"KINVQ26TV5M3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KINVQ26TV5M3JVRV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KINVQ26T","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KINVQ26TV5M3JVRV56YYD52EWE","target":"record","payload":{"canonical_record":{"source":{"id":"1711.11093","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-29T20:29:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5396aacbe35da32b92632e600e8c832139dbcae5271bb4fa4a2fa7da11d4f48","abstract_canon_sha256":"73159fbd546cff1fbabfeaee3621e609f9e0496edb650a718253543691cfb60e"},"schema_version":"1.0"},"canonical_sha256":"521b586bd3af59b4d635efb181f744b11f463bdc48cf1b60c8b4ffcecaf6eb7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.685805Z","signature_b64":"HN4L9XIlHErUe+tfc7YMYbUR4oAkAMH7ZN3UW/3mRAZviFfAjVJzaaFkhsWofKKvCahp5yWtFT6UoGuWuCFRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"521b586bd3af59b4d635efb181f744b11f463bdc48cf1b60c8b4ffcecaf6eb7f","last_reissued_at":"2026-05-18T00:03:56.685087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.685087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.11093","source_version":4,"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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMoPDnDKaM25TSjstDhyQy/mGhWr/4ZBFGyeKB1KeD/O+45OawOnhHB4aVB/0IYrZVz/7eO6Fjb0Utka/ujTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:06:53.396117Z"},"content_sha256":"7a30c194742956446ae8fe18b28e64c92e42ff881bd9247825912dab2be9a49d","schema_version":"1.0","event_id":"sha256:7a30c194742956446ae8fe18b28e64c92e42ff881bd9247825912dab2be9a49d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KINVQ26TV5M3JVRV56YYD52EWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioned Successive-Cancellation Flip Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlo Condo, Furkan Ercan, Seyyed Ali Hashemi, Warren J. Gross","submitted_at":"2017-11-29T20:29:38Z","abstract_excerpt":"Polar codes are a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the first proposed decoding algorithm, suffering from mediocre error-correction performance at moderate code length. In order to improve the error-correction performance of SC, two approaches are available: (i) SC-List decoding which keeps a list of candidates by running a number of SC decoders in parallel, thus increasing the implementation complexity, and (ii) SC-Flip decoding that relies on a single SC module, and kee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11093","kind":"arxiv","version":4},"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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DlJZI6e9A4h3Wyhws+A0tj6117BA7EKSNX85ID4HdUrEeME0q7jXlcG+8DMSGkZWrtRUXwlONb7Dm4debACBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:06:53.396538Z"},"content_sha256":"6a48ab0e533ccfc8cd3c466a176304c51839adf2622d80c5e7ee7bf30c6a177e","schema_version":"1.0","event_id":"sha256:6a48ab0e533ccfc8cd3c466a176304c51839adf2622d80c5e7ee7bf30c6a177e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE/bundle.json","state_url":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KINVQ26TV5M3JVRV56YYD52EWE/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-05-27T08:06:53Z","links":{"resolver":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE","bundle":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE/bundle.json","state":"https://pith.science/pith/KINVQ26TV5M3JVRV56YYD52EWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KINVQ26TV5M3JVRV56YYD52EWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KINVQ26TV5M3JVRV56YYD52EWE","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":"73159fbd546cff1fbabfeaee3621e609f9e0496edb650a718253543691cfb60e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-29T20:29:38Z","title_canon_sha256":"f5396aacbe35da32b92632e600e8c832139dbcae5271bb4fa4a2fa7da11d4f48"},"schema_version":"1.0","source":{"id":"1711.11093","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11093","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11093v4","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11093","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"KINVQ26TV5M3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KINVQ26TV5M3JVRV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KINVQ26T","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:6a48ab0e533ccfc8cd3c466a176304c51839adf2622d80c5e7ee7bf30c6a177e","target":"graph","created_at":"2026-05-18T00:03:56Z","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 a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the first proposed decoding algorithm, suffering from mediocre error-correction performance at moderate code length. In order to improve the error-correction performance of SC, two approaches are available: (i) SC-List decoding which keeps a list of candidates by running a number of SC decoders in parallel, thus increasing the implementation complexity, and (ii) SC-Flip decoding that relies on a single SC module, and kee","authors_text":"Carlo Condo, Furkan Ercan, Seyyed Ali Hashemi, Warren J. Gross","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-29T20:29:38Z","title":"Partitioned Successive-Cancellation Flip Decoding of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11093","kind":"arxiv","version":4},"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:7a30c194742956446ae8fe18b28e64c92e42ff881bd9247825912dab2be9a49d","target":"record","created_at":"2026-05-18T00:03:56Z","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":"73159fbd546cff1fbabfeaee3621e609f9e0496edb650a718253543691cfb60e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-29T20:29:38Z","title_canon_sha256":"f5396aacbe35da32b92632e600e8c832139dbcae5271bb4fa4a2fa7da11d4f48"},"schema_version":"1.0","source":{"id":"1711.11093","kind":"arxiv","version":4}},"canonical_sha256":"521b586bd3af59b4d635efb181f744b11f463bdc48cf1b60c8b4ffcecaf6eb7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"521b586bd3af59b4d635efb181f744b11f463bdc48cf1b60c8b4ffcecaf6eb7f","first_computed_at":"2026-05-18T00:03:56.685087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:56.685087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HN4L9XIlHErUe+tfc7YMYbUR4oAkAMH7ZN3UW/3mRAZviFfAjVJzaaFkhsWofKKvCahp5yWtFT6UoGuWuCFRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:56.685805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.11093","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a30c194742956446ae8fe18b28e64c92e42ff881bd9247825912dab2be9a49d","sha256:6a48ab0e533ccfc8cd3c466a176304c51839adf2622d80c5e7ee7bf30c6a177e"],"state_sha256":"459fa6bcb6d19d5f3e19e81718b3612bf0e347c0d4e09a8a504750a3312289d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v7vAyE+q3uv76lyZm/jvTGb/daO6NArL2nYMEllL3UnWkoQN6hoItqr/e7qYrSGGSG6BF3fe723yXuCwj07/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:06:53.399782Z","bundle_sha256":"eba41829699035dbd8e7113023ac59c2334498c3b8a97c5039e6b0ea77dc535b"}}