{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YDJTBD7PKAEREF3NGZ6ABGJWVD","short_pith_number":"pith:YDJTBD7P","canonical_record":{"source":{"id":"2311.10047","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-11-16T17:43:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00da74630db015a8c34c4afef7b5bd371c7a9331d1fbec9b8847a1dda390ad3c","abstract_canon_sha256":"e1766f3902c482e9f77b03bb124ffffadf0d39e572aa576232a3f61f7a892966"},"schema_version":"1.0"},"canonical_sha256":"c0d3308fef500912176d367c009936a8e72b005c8b5553c8257422229422e305","source":{"kind":"arxiv","id":"2311.10047","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.10047","created_at":"2026-07-05T08:55:21Z"},{"alias_kind":"arxiv_version","alias_value":"2311.10047v3","created_at":"2026-07-05T08:55:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10047","created_at":"2026-07-05T08:55:21Z"},{"alias_kind":"pith_short_12","alias_value":"YDJTBD7PKAER","created_at":"2026-07-05T08:55:21Z"},{"alias_kind":"pith_short_16","alias_value":"YDJTBD7PKAEREF3N","created_at":"2026-07-05T08:55:21Z"},{"alias_kind":"pith_short_8","alias_value":"YDJTBD7P","created_at":"2026-07-05T08:55:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YDJTBD7PKAEREF3NGZ6ABGJWVD","target":"record","payload":{"canonical_record":{"source":{"id":"2311.10047","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-11-16T17:43:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00da74630db015a8c34c4afef7b5bd371c7a9331d1fbec9b8847a1dda390ad3c","abstract_canon_sha256":"e1766f3902c482e9f77b03bb124ffffadf0d39e572aa576232a3f61f7a892966"},"schema_version":"1.0"},"canonical_sha256":"c0d3308fef500912176d367c009936a8e72b005c8b5553c8257422229422e305","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:55:21.096767Z","signature_b64":"FBuc6W/5AK1wmngf/T3J88HFDwyjn9kVG8Zmxx0AOF/iGfm8hOzCjZoHCPqcGDZe0s/xpIEHKO8pntjsnFQMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0d3308fef500912176d367c009936a8e72b005c8b5553c8257422229422e305","last_reissued_at":"2026-07-05T08:55:21.096331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:55:21.096331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.10047","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-07-05T08:55:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TN50bj5eQeUSQ6GWq/++ViatM8WX07z/5Du6NTXkzVPKqJvvGOZxdACd+bhcZhaHeHnX/bblW/rNoDfWMeL3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:26:54.947263Z"},"content_sha256":"f9afff9e3d45a34763985c9b4b672739f9d9af25220c97db289ea152622416a3","schema_version":"1.0","event_id":"sha256:f9afff9e3d45a34763985c9b4b672739f9d9af25220c97db289ea152622416a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YDJTBD7PKAEREF3NGZ6ABGJWVD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Frozen Set Design for Precoded Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Vera Miloslavskaya, Yonghui Li","submitted_at":"2023-11-16T17:43:13Z","abstract_excerpt":"This paper focuses on the frozen set design for precoded polar codes decoded by the successive cancellation list (SCL) algorithm. We propose a novel frozen set design method, whose computational complexity is low due to the use of analytical bounds and constrained frozen set structure. We derive new bounds based on the recently published complexity analysis of SCL decoding with near maximum-likelihood (ML) performance. To predict the ML performance, we employ the state-of-the-art bounds relying on the code weight distribution. The bounds and constrained frozen set structure are incorporated in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10047","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.10047/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:55:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSaZUQLvTbYovXz3rLaZSf95UCs66Y0+xJ2C71PJ3PaSyrUuROUMo12k2/Ln3DJC1IN6gsZeKYyUuQkf80CnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:26:54.947794Z"},"content_sha256":"4c87bf7ef06cdaaf21ecfa8d68f1cacaec6176303a39f5cd39f0c8b8d3c5834c","schema_version":"1.0","event_id":"sha256:4c87bf7ef06cdaaf21ecfa8d68f1cacaec6176303a39f5cd39f0c8b8d3c5834c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD/bundle.json","state_url":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD/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-08-12T20:26:54Z","links":{"resolver":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD","bundle":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD/bundle.json","state":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YDJTBD7PKAEREF3NGZ6ABGJWVD","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":"e1766f3902c482e9f77b03bb124ffffadf0d39e572aa576232a3f61f7a892966","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-11-16T17:43:13Z","title_canon_sha256":"00da74630db015a8c34c4afef7b5bd371c7a9331d1fbec9b8847a1dda390ad3c"},"schema_version":"1.0","source":{"id":"2311.10047","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.10047","created_at":"2026-07-05T08:55:21Z"},{"alias_kind":"arxiv_version","alias_value":"2311.10047v3","created_at":"2026-07-05T08:55:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10047","created_at":"2026-07-05T08:55:21Z"},{"alias_kind":"pith_short_12","alias_value":"YDJTBD7PKAER","created_at":"2026-07-05T08:55:21Z"},{"alias_kind":"pith_short_16","alias_value":"YDJTBD7PKAEREF3N","created_at":"2026-07-05T08:55:21Z"},{"alias_kind":"pith_short_8","alias_value":"YDJTBD7P","created_at":"2026-07-05T08:55:21Z"}],"graph_snapshots":[{"event_id":"sha256:4c87bf7ef06cdaaf21ecfa8d68f1cacaec6176303a39f5cd39f0c8b8d3c5834c","target":"graph","created_at":"2026-07-05T08:55:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.10047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper focuses on the frozen set design for precoded polar codes decoded by the successive cancellation list (SCL) algorithm. We propose a novel frozen set design method, whose computational complexity is low due to the use of analytical bounds and constrained frozen set structure. We derive new bounds based on the recently published complexity analysis of SCL decoding with near maximum-likelihood (ML) performance. To predict the ML performance, we employ the state-of-the-art bounds relying on the code weight distribution. The bounds and constrained frozen set structure are incorporated in","authors_text":"Branka Vucetic, Vera Miloslavskaya, Yonghui Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-11-16T17:43:13Z","title":"Frozen Set Design for Precoded Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10047","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:f9afff9e3d45a34763985c9b4b672739f9d9af25220c97db289ea152622416a3","target":"record","created_at":"2026-07-05T08:55:21Z","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":"e1766f3902c482e9f77b03bb124ffffadf0d39e572aa576232a3f61f7a892966","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-11-16T17:43:13Z","title_canon_sha256":"00da74630db015a8c34c4afef7b5bd371c7a9331d1fbec9b8847a1dda390ad3c"},"schema_version":"1.0","source":{"id":"2311.10047","kind":"arxiv","version":3}},"canonical_sha256":"c0d3308fef500912176d367c009936a8e72b005c8b5553c8257422229422e305","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0d3308fef500912176d367c009936a8e72b005c8b5553c8257422229422e305","first_computed_at":"2026-07-05T08:55:21.096331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:55:21.096331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FBuc6W/5AK1wmngf/T3J88HFDwyjn9kVG8Zmxx0AOF/iGfm8hOzCjZoHCPqcGDZe0s/xpIEHKO8pntjsnFQMAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:55:21.096767Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.10047","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9afff9e3d45a34763985c9b4b672739f9d9af25220c97db289ea152622416a3","sha256:4c87bf7ef06cdaaf21ecfa8d68f1cacaec6176303a39f5cd39f0c8b8d3c5834c"],"state_sha256":"ac09f300e06a3521a39a35133c62089658e921510a4c7abb0d4a795aa84978bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubYE9bfZpx6TXLS4qrzz9wVkIhR7A4dg0XVI8VPF8PE7BEyQWWmJwsJDs9rZALT/cgu3M5iMwcLBoQ0BeaTPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T20:26:54.952399Z","bundle_sha256":"5e8cadc9d19dbe9b6d3151c4dcb3f0445f7c5d7c63eb98f25fda193dd0686c20"}}