{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JORHYLJNXBGO275E7PV5P4PEWR","short_pith_number":"pith:JORHYLJN","canonical_record":{"source":{"id":"1410.3542","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-14T00:33:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df33d83a025d77e86a0f5c2ef9938de394759205a94cc31d4fa764e49e5256eb","abstract_canon_sha256":"abf1a6cf7863d4279f1aeed412bfeec93e24aef5c3d15a110f1172e721828d0b"},"schema_version":"1.0"},"canonical_sha256":"4ba27c2d2db84ced7fa4fbebd7f1e4b461b29ee57c41c28c2c26859931424856","source":{"kind":"arxiv","id":"1410.3542","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3542","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3542v3","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3542","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"JORHYLJNXBGO","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JORHYLJNXBGO275E","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JORHYLJN","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JORHYLJNXBGO275E7PV5P4PEWR","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3542","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-14T00:33:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df33d83a025d77e86a0f5c2ef9938de394759205a94cc31d4fa764e49e5256eb","abstract_canon_sha256":"abf1a6cf7863d4279f1aeed412bfeec93e24aef5c3d15a110f1172e721828d0b"},"schema_version":"1.0"},"canonical_sha256":"4ba27c2d2db84ced7fa4fbebd7f1e4b461b29ee57c41c28c2c26859931424856","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:38.745644Z","signature_b64":"1cJ43TWb7QqrD7oaa1wSagG1CPu2/Q4/ROxPcQCnh8eT5CW3Y3g3tn+d2O92t6+DJIB/4Jern5kr1PUvu606CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ba27c2d2db84ced7fa4fbebd7f1e4b461b29ee57c41c28c2c26859931424856","last_reissued_at":"2026-05-18T01:23:38.744812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:38.744812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3542","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:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QI/pe/JFVszwQuqV236a+6xqKFMh5cPsIZvmehiMNrNSbeiwuDTAZEyAk9ShcudiI3m/JZHhMyTCg15NKuNPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:46:27.366004Z"},"content_sha256":"7b4321dd6e76dd63459ced2987199e6bcaa5e3b36e4663db12c71fa2b04a58ea","schema_version":"1.0","event_id":"sha256:7b4321dd6e76dd63459ced2987199e6bcaa5e3b36e4663db12c71fa2b04a58ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JORHYLJNXBGO275E7PV5P4PEWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anxiao Jiang, Eyal En Gad, Jehoshua Bruck, Joerg Kliewer, Michael Langberg, Yue Li","submitted_at":"2014-10-14T00:33:39Z","abstract_excerpt":"We propose efficient coding schemes for two communication settings: 1. asymmetric channels, and 2. channels with an informed encoder. These settings are important in non-volatile memories, as well as optical and broadcast communication. The schemes are based on non-linear polar codes, and they build on and improve recent work on these settings. In asymmetric channels, we tackle the exponential storage requirement of previously known schemes, that resulted from the use of large Boolean functions. We propose an improved scheme, that achieves the capacity of asymmetric channels with polynomial co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3542","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:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lfHEAMH+c1hQnXNBgecJan1sNlRdW756ySOWEyy1SNe3CznippEUXmSuSlCyeMHppRYajXZUg6+4wjACBLE7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:46:27.366376Z"},"content_sha256":"75d1223d6ab56d7c10f4f72730230c49af0695dec3daa48f09ca687c46c1e732","schema_version":"1.0","event_id":"sha256:75d1223d6ab56d7c10f4f72730230c49af0695dec3daa48f09ca687c46c1e732"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JORHYLJNXBGO275E7PV5P4PEWR/bundle.json","state_url":"https://pith.science/pith/JORHYLJNXBGO275E7PV5P4PEWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JORHYLJNXBGO275E7PV5P4PEWR/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-22T11:46:27Z","links":{"resolver":"https://pith.science/pith/JORHYLJNXBGO275E7PV5P4PEWR","bundle":"https://pith.science/pith/JORHYLJNXBGO275E7PV5P4PEWR/bundle.json","state":"https://pith.science/pith/JORHYLJNXBGO275E7PV5P4PEWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JORHYLJNXBGO275E7PV5P4PEWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JORHYLJNXBGO275E7PV5P4PEWR","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":"abf1a6cf7863d4279f1aeed412bfeec93e24aef5c3d15a110f1172e721828d0b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-14T00:33:39Z","title_canon_sha256":"df33d83a025d77e86a0f5c2ef9938de394759205a94cc31d4fa764e49e5256eb"},"schema_version":"1.0","source":{"id":"1410.3542","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3542","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3542v3","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3542","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"JORHYLJNXBGO","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JORHYLJNXBGO275E","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JORHYLJN","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:75d1223d6ab56d7c10f4f72730230c49af0695dec3daa48f09ca687c46c1e732","target":"graph","created_at":"2026-05-18T01:23:38Z","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 propose efficient coding schemes for two communication settings: 1. asymmetric channels, and 2. channels with an informed encoder. These settings are important in non-volatile memories, as well as optical and broadcast communication. The schemes are based on non-linear polar codes, and they build on and improve recent work on these settings. In asymmetric channels, we tackle the exponential storage requirement of previously known schemes, that resulted from the use of large Boolean functions. We propose an improved scheme, that achieves the capacity of asymmetric channels with polynomial co","authors_text":"Anxiao Jiang, Eyal En Gad, Jehoshua Bruck, Joerg Kliewer, Michael Langberg, Yue Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-14T00:33:39Z","title":"Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3542","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:7b4321dd6e76dd63459ced2987199e6bcaa5e3b36e4663db12c71fa2b04a58ea","target":"record","created_at":"2026-05-18T01:23:38Z","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":"abf1a6cf7863d4279f1aeed412bfeec93e24aef5c3d15a110f1172e721828d0b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-14T00:33:39Z","title_canon_sha256":"df33d83a025d77e86a0f5c2ef9938de394759205a94cc31d4fa764e49e5256eb"},"schema_version":"1.0","source":{"id":"1410.3542","kind":"arxiv","version":3}},"canonical_sha256":"4ba27c2d2db84ced7fa4fbebd7f1e4b461b29ee57c41c28c2c26859931424856","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ba27c2d2db84ced7fa4fbebd7f1e4b461b29ee57c41c28c2c26859931424856","first_computed_at":"2026-05-18T01:23:38.744812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:38.744812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1cJ43TWb7QqrD7oaa1wSagG1CPu2/Q4/ROxPcQCnh8eT5CW3Y3g3tn+d2O92t6+DJIB/4Jern5kr1PUvu606CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:38.745644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3542","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b4321dd6e76dd63459ced2987199e6bcaa5e3b36e4663db12c71fa2b04a58ea","sha256:75d1223d6ab56d7c10f4f72730230c49af0695dec3daa48f09ca687c46c1e732"],"state_sha256":"663d473cb49adae72a86010054ef27a9428db73fc5ca1c753258cc63db8e7087"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Ts1B4+/SVDjwsSpSL5gHULva2DNMMT47uYUEktrz0f4y3PWobFPWPSac5SV+89udvuNxvZnBFdrKGIzA5KxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:46:27.368338Z","bundle_sha256":"8a6ce58b6477ff6db700bf40c9a05a7f1cae4c1c76278b717317250f2f97e352"}}