{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QXIPNCNYEJNSEQ7ZB7J2UWMWD4","short_pith_number":"pith:QXIPNCNY","canonical_record":{"source":{"id":"1602.06690","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-22T09:07:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1715bc66ff2cf73d1bef607ecdb452a1934e043462ac5725b498319982470439","abstract_canon_sha256":"0f2093a0a0184afeb95d60a0e23439f675e6edd4af47b193a8ff4ae730e098fc"},"schema_version":"1.0"},"canonical_sha256":"85d0f689b8225b2243f90fd3aa59961f303da07b34a5d2ac8c7095e2ea48f4bf","source":{"kind":"arxiv","id":"1602.06690","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06690","created_at":"2026-05-18T01:17:50Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06690v3","created_at":"2026-05-18T01:17:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06690","created_at":"2026-05-18T01:17:50Z"},{"alias_kind":"pith_short_12","alias_value":"QXIPNCNYEJNS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QXIPNCNYEJNSEQ7Z","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QXIPNCNY","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QXIPNCNYEJNSEQ7ZB7J2UWMWD4","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06690","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-22T09:07:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1715bc66ff2cf73d1bef607ecdb452a1934e043462ac5725b498319982470439","abstract_canon_sha256":"0f2093a0a0184afeb95d60a0e23439f675e6edd4af47b193a8ff4ae730e098fc"},"schema_version":"1.0"},"canonical_sha256":"85d0f689b8225b2243f90fd3aa59961f303da07b34a5d2ac8c7095e2ea48f4bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:50.105071Z","signature_b64":"+bJbkhG7BPPhnctp44sOywb7QNu0An2/skTSvLX580xsw00xV5h0oKFgH7IT2ddlmHDg2gPTqin/3jkRbmZ/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d0f689b8225b2243f90fd3aa59961f303da07b34a5d2ac8c7095e2ea48f4bf","last_reissued_at":"2026-05-18T01:17:50.104300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:50.104300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06690","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:17:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRcyqadF4B+KqUW3A2VP3vtmsbGqruo4R+EMZ40pSjdqHztG/3v+uQGLj+nsh0odzdvCq5XI6jK7hIWXxtsHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:01:23.004125Z"},"content_sha256":"a97f82088abf9f2dc893fd69a610d8328ff3c70bf1d650e78ef871f5631e5c25","schema_version":"1.0","event_id":"sha256:a97f82088abf9f2dc893fd69a610d8328ff3c70bf1d650e78ef871f5631e5c25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QXIPNCNYEJNSEQ7ZB7J2UWMWD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Erasure Schemes Using Generalized Polar Codes: Zero-Undetected-Error Capacity and Performance Trade-offs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Rajai Nasser","submitted_at":"2016-02-22T09:07:32Z","abstract_excerpt":"We study the performance of generalized polar (GP) codes when they are used for coding schemes involving erasure. GP codes are a family of codes which contains, among others, the standard polar codes of Ar{\\i}kan and Reed-Muller codes. We derive a closed formula for the zero-undetected-error capacity $I_0^{GP}(W)$ of GP codes for a given binary memoryless symmetric (BMS) channel $W$ under the low complexity successive cancellation decoder with erasure. We show that for every $R<I_0^{GP}(W)$, there exists a generalized polar code of blocklength $N$ and of rate at least $R$ where the undetected-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06690","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:17:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"roResYwc5SWU7rcZF3eM2pdIH3Et2SfH2KDTpHYL/MHT3iGnvimnRiPoDkqEAPOiHb45CYVRPTsO8CBxDoi0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:01:23.004505Z"},"content_sha256":"7427cfb62f50822209f62f8574969c34a09ff14a7072527231a97a4cbfb0891d","schema_version":"1.0","event_id":"sha256:7427cfb62f50822209f62f8574969c34a09ff14a7072527231a97a4cbfb0891d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXIPNCNYEJNSEQ7ZB7J2UWMWD4/bundle.json","state_url":"https://pith.science/pith/QXIPNCNYEJNSEQ7ZB7J2UWMWD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXIPNCNYEJNSEQ7ZB7J2UWMWD4/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-03T20:01:23Z","links":{"resolver":"https://pith.science/pith/QXIPNCNYEJNSEQ7ZB7J2UWMWD4","bundle":"https://pith.science/pith/QXIPNCNYEJNSEQ7ZB7J2UWMWD4/bundle.json","state":"https://pith.science/pith/QXIPNCNYEJNSEQ7ZB7J2UWMWD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXIPNCNYEJNSEQ7ZB7J2UWMWD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QXIPNCNYEJNSEQ7ZB7J2UWMWD4","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":"0f2093a0a0184afeb95d60a0e23439f675e6edd4af47b193a8ff4ae730e098fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-22T09:07:32Z","title_canon_sha256":"1715bc66ff2cf73d1bef607ecdb452a1934e043462ac5725b498319982470439"},"schema_version":"1.0","source":{"id":"1602.06690","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06690","created_at":"2026-05-18T01:17:50Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06690v3","created_at":"2026-05-18T01:17:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06690","created_at":"2026-05-18T01:17:50Z"},{"alias_kind":"pith_short_12","alias_value":"QXIPNCNYEJNS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QXIPNCNYEJNSEQ7Z","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QXIPNCNY","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:7427cfb62f50822209f62f8574969c34a09ff14a7072527231a97a4cbfb0891d","target":"graph","created_at":"2026-05-18T01:17:50Z","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":"We study the performance of generalized polar (GP) codes when they are used for coding schemes involving erasure. GP codes are a family of codes which contains, among others, the standard polar codes of Ar{\\i}kan and Reed-Muller codes. We derive a closed formula for the zero-undetected-error capacity $I_0^{GP}(W)$ of GP codes for a given binary memoryless symmetric (BMS) channel $W$ under the low complexity successive cancellation decoder with erasure. We show that for every $R<I_0^{GP}(W)$, there exists a generalized polar code of blocklength $N$ and of rate at least $R$ where the undetected-","authors_text":"Rajai Nasser","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-22T09:07:32Z","title":"Erasure Schemes Using Generalized Polar Codes: Zero-Undetected-Error Capacity and Performance Trade-offs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06690","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:a97f82088abf9f2dc893fd69a610d8328ff3c70bf1d650e78ef871f5631e5c25","target":"record","created_at":"2026-05-18T01:17:50Z","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":"0f2093a0a0184afeb95d60a0e23439f675e6edd4af47b193a8ff4ae730e098fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-22T09:07:32Z","title_canon_sha256":"1715bc66ff2cf73d1bef607ecdb452a1934e043462ac5725b498319982470439"},"schema_version":"1.0","source":{"id":"1602.06690","kind":"arxiv","version":3}},"canonical_sha256":"85d0f689b8225b2243f90fd3aa59961f303da07b34a5d2ac8c7095e2ea48f4bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85d0f689b8225b2243f90fd3aa59961f303da07b34a5d2ac8c7095e2ea48f4bf","first_computed_at":"2026-05-18T01:17:50.104300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:50.104300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+bJbkhG7BPPhnctp44sOywb7QNu0An2/skTSvLX580xsw00xV5h0oKFgH7IT2ddlmHDg2gPTqin/3jkRbmZ/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:50.105071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06690","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a97f82088abf9f2dc893fd69a610d8328ff3c70bf1d650e78ef871f5631e5c25","sha256:7427cfb62f50822209f62f8574969c34a09ff14a7072527231a97a4cbfb0891d"],"state_sha256":"fde13375f76f8c6a64281018af8f39c23a4b9b0d81e6267511a9f2fffde8f7ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DUxF6SxoOgXoa9dauzuokGLQuZaRAXCzi3xSffFC9sV6ibCT2raZ60PMB1DxhnGa17jHHTabpvAjORBUUa20Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:01:23.006463Z","bundle_sha256":"c9a046a15b33853ccc05e221fc8c62a588849b09dfebb3b02f7ccd98560297be"}}