{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IE7K42CKZ23IPLN4ARHBJFUTJF","short_pith_number":"pith:IE7K42CK","canonical_record":{"source":{"id":"1901.03084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T10:28:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"22e8e8c76f0cfd46cb6bd907cbea07f75203976bf315ef20bcbf04b0527329e7","abstract_canon_sha256":"2485d93876cdcae3e7f64b96130bf3b0cdcadb1cce22e626b94e014bd7faea5a"},"schema_version":"1.0"},"canonical_sha256":"413eae684aceb687adbc044e149693497e6c4ac3a3f5f334158ad0912c2cd46a","source":{"kind":"arxiv","id":"1901.03084","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03084","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03084v1","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03084","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"IE7K42CKZ23I","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IE7K42CKZ23IPLN4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IE7K42CK","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IE7K42CKZ23IPLN4ARHBJFUTJF","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T10:28:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"22e8e8c76f0cfd46cb6bd907cbea07f75203976bf315ef20bcbf04b0527329e7","abstract_canon_sha256":"2485d93876cdcae3e7f64b96130bf3b0cdcadb1cce22e626b94e014bd7faea5a"},"schema_version":"1.0"},"canonical_sha256":"413eae684aceb687adbc044e149693497e6c4ac3a3f5f334158ad0912c2cd46a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:35.597272Z","signature_b64":"UivsIQXLFhkXUpAiffYgOfkvZaJOQ4lFtR8LQBRCBgYGYVCsIEVN1fL9bVbULXooEFpm7FcM8YGunvfeISo8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"413eae684aceb687adbc044e149693497e6c4ac3a3f5f334158ad0912c2cd46a","last_reissued_at":"2026-05-17T23:56:35.596631Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:35.596631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03084","source_version":1,"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-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5elzm3KDd4PcV0xo2KAnBF+7OYGmy6RadRZIzC/shc+BtkrSwByZ41y589Ot+TGltEDyhqX1F6i1mHtv+IhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:39:24.222115Z"},"content_sha256":"203b0a4b1056436bfe340c4966dc35dc690857ea6dd465ed3fdae2abc879f269","schema_version":"1.0","event_id":"sha256:203b0a4b1056436bfe340c4966dc35dc690857ea6dd465ed3fdae2abc879f269"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IE7K42CKZ23IPLN4ARHBJFUTJF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Programming of Noisy Memory Cells","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Eyal En Gad, Jehoshua Bruck, Michal Horovitz","submitted_at":"2019-01-10T10:28:40Z","abstract_excerpt":"In this paper, we study a model, which was first presented by Bunte and Lapidoth, that mimics the programming operation of memory cells. Under this paradigm we assume that cells are programmed sequentially and individually. The programming process is modeled as transmission over a channel, while it is possible to read the cell state in order to determine its programming success, and in case of programming failure, to reprogram the cell again. Reprogramming a cell can reduce the bit error rate, however this comes with the price of increasing the overall programming time and thereby affecting th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03084","kind":"arxiv","version":1},"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-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h85pUdWIFNj5Asg0hvEwZezAyg2p4DilaIY4KyLVPP9lNcK7pAwAWkXduwlUuqnte6Wsi4045uQkCrmGEbbqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:39:24.222477Z"},"content_sha256":"0ae5b9d3ce14f058979c1c503838123655f5be860a7a3c789c2c67e9b0df3320","schema_version":"1.0","event_id":"sha256:0ae5b9d3ce14f058979c1c503838123655f5be860a7a3c789c2c67e9b0df3320"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IE7K42CKZ23IPLN4ARHBJFUTJF/bundle.json","state_url":"https://pith.science/pith/IE7K42CKZ23IPLN4ARHBJFUTJF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IE7K42CKZ23IPLN4ARHBJFUTJF/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-01T18:39:24Z","links":{"resolver":"https://pith.science/pith/IE7K42CKZ23IPLN4ARHBJFUTJF","bundle":"https://pith.science/pith/IE7K42CKZ23IPLN4ARHBJFUTJF/bundle.json","state":"https://pith.science/pith/IE7K42CKZ23IPLN4ARHBJFUTJF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IE7K42CKZ23IPLN4ARHBJFUTJF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IE7K42CKZ23IPLN4ARHBJFUTJF","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":"2485d93876cdcae3e7f64b96130bf3b0cdcadb1cce22e626b94e014bd7faea5a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T10:28:40Z","title_canon_sha256":"22e8e8c76f0cfd46cb6bd907cbea07f75203976bf315ef20bcbf04b0527329e7"},"schema_version":"1.0","source":{"id":"1901.03084","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03084","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03084v1","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03084","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"IE7K42CKZ23I","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IE7K42CKZ23IPLN4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IE7K42CK","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:0ae5b9d3ce14f058979c1c503838123655f5be860a7a3c789c2c67e9b0df3320","target":"graph","created_at":"2026-05-17T23:56:35Z","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":"In this paper, we study a model, which was first presented by Bunte and Lapidoth, that mimics the programming operation of memory cells. Under this paradigm we assume that cells are programmed sequentially and individually. The programming process is modeled as transmission over a channel, while it is possible to read the cell state in order to determine its programming success, and in case of programming failure, to reprogram the cell again. Reprogramming a cell can reduce the bit error rate, however this comes with the price of increasing the overall programming time and thereby affecting th","authors_text":"Eitan Yaakobi, Eyal En Gad, Jehoshua Bruck, Michal Horovitz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T10:28:40Z","title":"Iterative Programming of Noisy Memory Cells"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03084","kind":"arxiv","version":1},"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:203b0a4b1056436bfe340c4966dc35dc690857ea6dd465ed3fdae2abc879f269","target":"record","created_at":"2026-05-17T23:56:35Z","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":"2485d93876cdcae3e7f64b96130bf3b0cdcadb1cce22e626b94e014bd7faea5a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-10T10:28:40Z","title_canon_sha256":"22e8e8c76f0cfd46cb6bd907cbea07f75203976bf315ef20bcbf04b0527329e7"},"schema_version":"1.0","source":{"id":"1901.03084","kind":"arxiv","version":1}},"canonical_sha256":"413eae684aceb687adbc044e149693497e6c4ac3a3f5f334158ad0912c2cd46a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"413eae684aceb687adbc044e149693497e6c4ac3a3f5f334158ad0912c2cd46a","first_computed_at":"2026-05-17T23:56:35.596631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:35.596631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UivsIQXLFhkXUpAiffYgOfkvZaJOQ4lFtR8LQBRCBgYGYVCsIEVN1fL9bVbULXooEFpm7FcM8YGunvfeISo8BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:35.597272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03084","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:203b0a4b1056436bfe340c4966dc35dc690857ea6dd465ed3fdae2abc879f269","sha256:0ae5b9d3ce14f058979c1c503838123655f5be860a7a3c789c2c67e9b0df3320"],"state_sha256":"d9e5ad1d60220a138c32aa4b3aebfd828efe58cd4efdf1e8bde42641c923199b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AONi3l8DeLtQgZDT+ZcRYVdJe4bNgo4SiR7BmR75yFEAohRCDATqRp2rceZjuJ/BzYaqrwf8GVQ92Gs+07FYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:39:24.224340Z","bundle_sha256":"51e627e63a295fdf7ada19b3bf90a9f53238883a92ad6f965e69d8a73d20ced7"}}