{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IFYZGUFR3LBLA34VC6G5HI26FB","short_pith_number":"pith:IFYZGUFR","canonical_record":{"source":{"id":"1207.0782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-03T19:11:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b06930d86caed8f8f8d0014952b150b028ad804230a5e1d1764d6a70422b9394","abstract_canon_sha256":"947c2ae0ae799488d6c2bd3e20f6a2fcb3050403989a0afaa56f6eb279676a9d"},"schema_version":"1.0"},"canonical_sha256":"41719350b1dac2b06f95178dd3a35e286f8c19d8b4d67f72713d4a1685b5b4bb","source":{"kind":"arxiv","id":"1207.0782","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0782","created_at":"2026-05-18T03:43:52Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0782v2","created_at":"2026-05-18T03:43:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0782","created_at":"2026-05-18T03:43:52Z"},{"alias_kind":"pith_short_12","alias_value":"IFYZGUFR3LBL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IFYZGUFR3LBLA34V","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IFYZGUFR","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IFYZGUFR3LBLA34VC6G5HI26FB","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-03T19:11:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b06930d86caed8f8f8d0014952b150b028ad804230a5e1d1764d6a70422b9394","abstract_canon_sha256":"947c2ae0ae799488d6c2bd3e20f6a2fcb3050403989a0afaa56f6eb279676a9d"},"schema_version":"1.0"},"canonical_sha256":"41719350b1dac2b06f95178dd3a35e286f8c19d8b4d67f72713d4a1685b5b4bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:52.153062Z","signature_b64":"n+PIunBTS99nMGKvEOZapy9G4oHGoQwIgxI7DClfx9r+uUWgmZzbDqGO11/JmenkZsLXJSr/4jzZeUAY0dsOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41719350b1dac2b06f95178dd3a35e286f8c19d8b4d67f72713d4a1685b5b4bb","last_reissued_at":"2026-05-18T03:43:52.152584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:52.152584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0782","source_version":2,"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-18T03:43:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMn13i874SRSyb8GfgBOaJn/YK/Y+mnmMdahp3N1JVF3L7WsJ/JcnRaY4ZwrsA20L0jYLoQfRCdL4fBWgs0IDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T17:46:30.356563Z"},"content_sha256":"addfe536980a6455f30028d1e8cee758cd8a555a02673fbd1656b6a8838df615","schema_version":"1.0","event_id":"sha256:addfe536980a6455f30028d1e8cee758cd8a555a02673fbd1656b6a8838df615"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IFYZGUFR3LBLA34VC6G5HI26FB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polar write once memory codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alona Strugatski, David Burshtein","submitted_at":"2012-07-03T19:11:25Z","abstract_excerpt":"A coding scheme for write once memory (WOM) using polar codes is presented. It is shown that the scheme achieves the capacity region of noiseless WOMs when an arbitrary number of multiple writes is permitted. The encoding and decoding complexities scale as O(N log N) where N is the blocklength. For N sufficiently large, the error probability decreases sub-exponentially in N. The results can be generalized from binary to generalized WOMs, described by an arbitrary directed acyclic graph, using nonbinary polar codes. In the derivation we also obtain results on the typical distortion of polar cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0782","kind":"arxiv","version":2},"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-18T03:43:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D2c1+fJTBSR8RBfYZr+bBTyuQAQVs6fXF96QcUFI9i15aI5gdQyU9sJmlgh6CILbLIbgpvuq6SdkKgwj8uDSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T17:46:30.356912Z"},"content_sha256":"99221a509efe6c4afa16e999e59f5739c9d04e9a8b02558b2f0c3cb35fdd55ac","schema_version":"1.0","event_id":"sha256:99221a509efe6c4afa16e999e59f5739c9d04e9a8b02558b2f0c3cb35fdd55ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFYZGUFR3LBLA34VC6G5HI26FB/bundle.json","state_url":"https://pith.science/pith/IFYZGUFR3LBLA34VC6G5HI26FB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFYZGUFR3LBLA34VC6G5HI26FB/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-07-02T17:46:30Z","links":{"resolver":"https://pith.science/pith/IFYZGUFR3LBLA34VC6G5HI26FB","bundle":"https://pith.science/pith/IFYZGUFR3LBLA34VC6G5HI26FB/bundle.json","state":"https://pith.science/pith/IFYZGUFR3LBLA34VC6G5HI26FB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFYZGUFR3LBLA34VC6G5HI26FB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IFYZGUFR3LBLA34VC6G5HI26FB","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":"947c2ae0ae799488d6c2bd3e20f6a2fcb3050403989a0afaa56f6eb279676a9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-03T19:11:25Z","title_canon_sha256":"b06930d86caed8f8f8d0014952b150b028ad804230a5e1d1764d6a70422b9394"},"schema_version":"1.0","source":{"id":"1207.0782","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0782","created_at":"2026-05-18T03:43:52Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0782v2","created_at":"2026-05-18T03:43:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0782","created_at":"2026-05-18T03:43:52Z"},{"alias_kind":"pith_short_12","alias_value":"IFYZGUFR3LBL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IFYZGUFR3LBLA34V","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IFYZGUFR","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:99221a509efe6c4afa16e999e59f5739c9d04e9a8b02558b2f0c3cb35fdd55ac","target":"graph","created_at":"2026-05-18T03:43:52Z","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":"A coding scheme for write once memory (WOM) using polar codes is presented. It is shown that the scheme achieves the capacity region of noiseless WOMs when an arbitrary number of multiple writes is permitted. The encoding and decoding complexities scale as O(N log N) where N is the blocklength. For N sufficiently large, the error probability decreases sub-exponentially in N. The results can be generalized from binary to generalized WOMs, described by an arbitrary directed acyclic graph, using nonbinary polar codes. In the derivation we also obtain results on the typical distortion of polar cod","authors_text":"Alona Strugatski, David Burshtein","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-03T19:11:25Z","title":"Polar write once memory codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0782","kind":"arxiv","version":2},"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:addfe536980a6455f30028d1e8cee758cd8a555a02673fbd1656b6a8838df615","target":"record","created_at":"2026-05-18T03:43:52Z","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":"947c2ae0ae799488d6c2bd3e20f6a2fcb3050403989a0afaa56f6eb279676a9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-03T19:11:25Z","title_canon_sha256":"b06930d86caed8f8f8d0014952b150b028ad804230a5e1d1764d6a70422b9394"},"schema_version":"1.0","source":{"id":"1207.0782","kind":"arxiv","version":2}},"canonical_sha256":"41719350b1dac2b06f95178dd3a35e286f8c19d8b4d67f72713d4a1685b5b4bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41719350b1dac2b06f95178dd3a35e286f8c19d8b4d67f72713d4a1685b5b4bb","first_computed_at":"2026-05-18T03:43:52.152584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:52.152584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n+PIunBTS99nMGKvEOZapy9G4oHGoQwIgxI7DClfx9r+uUWgmZzbDqGO11/JmenkZsLXJSr/4jzZeUAY0dsOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:52.153062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0782","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:addfe536980a6455f30028d1e8cee758cd8a555a02673fbd1656b6a8838df615","sha256:99221a509efe6c4afa16e999e59f5739c9d04e9a8b02558b2f0c3cb35fdd55ac"],"state_sha256":"c45f6722ac6d3e4851997170fa9c01a1d3453abe41241d736857b339c73fa6b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pot6A+mNMg0SA7IDSCZY0dGPVg9ohn8dMTDXg7dhMXLEaZdCjVWgFNYVDTxZEeGCLjmo2RBSLlEbhb64cBI1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T17:46:30.358880Z","bundle_sha256":"d48b50b69f07bfc0050e02522d3eb844ce12ddcfcabde1755731c80989e6e4dc"}}