{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3P637BFB24A2GERKRFIPSGMLE3","short_pith_number":"pith:3P637BFB","canonical_record":{"source":{"id":"1601.05677","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-21T15:34:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3931c73524af75ded9031778e7f8b7d27fef5835ba7de85496b623cae4fef98c","abstract_canon_sha256":"5093fad26cc78a8c3ece0daf64c54abc2d7736fee09ebcbf69e65a3a1666d065"},"schema_version":"1.0"},"canonical_sha256":"dbfdbf84a1d701a3122a8950f9198b26d6b2c4ea966f5ed4d1c39ed8422e8b09","source":{"kind":"arxiv","id":"1601.05677","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05677","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05677v2","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05677","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"3P637BFB24A2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3P637BFB24A2GERK","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3P637BFB","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3P637BFB24A2GERKRFIPSGMLE3","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05677","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-21T15:34:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3931c73524af75ded9031778e7f8b7d27fef5835ba7de85496b623cae4fef98c","abstract_canon_sha256":"5093fad26cc78a8c3ece0daf64c54abc2d7736fee09ebcbf69e65a3a1666d065"},"schema_version":"1.0"},"canonical_sha256":"dbfdbf84a1d701a3122a8950f9198b26d6b2c4ea966f5ed4d1c39ed8422e8b09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:57.336092Z","signature_b64":"j9ywwPjl8JhmfggyNc3gSk4soPPV35uvmnL+aXkZ1iRokuF0uBcPD0E2HfFTUDm3r0khCbWVdWuovrjO3eBqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbfdbf84a1d701a3122a8950f9198b26d6b2c4ea966f5ed4d1c39ed8422e8b09","last_reissued_at":"2026-05-18T00:58:57.335532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:57.335532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05677","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-18T00:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6VsxmpwcILzWovBiqt5Ae6NdasNmaN/60f9iQPEhybAWNcneWXYGDKV0/vCFvqDU36mQJInwkG3Ena/ViKnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:54:31.659908Z"},"content_sha256":"08b6d7dc2ec269a341d6a19ff246b5a7962e762b3befcb777dd09e79e5a60c12","schema_version":"1.0","event_id":"sha256:08b6d7dc2ec269a341d6a19ff246b5a7962e762b3befcb777dd09e79e5a60c12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3P637BFB24A2GERKRFIPSGMLE3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of Multilevel NAND Flash Memory Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aleksandar Kavcic, Guangyue Han, Yonglong Li","submitted_at":"2016-01-21T15:34:29Z","abstract_excerpt":"In this paper, we initiate a first information-theoretic study on multilevel NAND flash memory channels with intercell interference. More specifically, for a multilevel NAND flash memory channel under mild assumptions, we first prove that such a channel is indecomposable and it features asymptotic equipartition property; we then further prove that stationary processes achieve its information capacity, and consequently, as its order tends to infinity, its Markov capacity converges to its information capacity; eventually, we establish that its operational capacity is equal to its information cap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05677","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-18T00:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtzAI9qxizH4Yt7MA6tgUOVcqFNLi9eeqtGjKUiObkAVOinrNEQDf5WiR5S1Yc0lKp5Ycc+ljOJvdyKl9Jg/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:54:31.660241Z"},"content_sha256":"417957eac3e91b43065d99c6fedcc4af12fb8543057f27b62a9af036073e933d","schema_version":"1.0","event_id":"sha256:417957eac3e91b43065d99c6fedcc4af12fb8543057f27b62a9af036073e933d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3P637BFB24A2GERKRFIPSGMLE3/bundle.json","state_url":"https://pith.science/pith/3P637BFB24A2GERKRFIPSGMLE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3P637BFB24A2GERKRFIPSGMLE3/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-23T05:54:31Z","links":{"resolver":"https://pith.science/pith/3P637BFB24A2GERKRFIPSGMLE3","bundle":"https://pith.science/pith/3P637BFB24A2GERKRFIPSGMLE3/bundle.json","state":"https://pith.science/pith/3P637BFB24A2GERKRFIPSGMLE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3P637BFB24A2GERKRFIPSGMLE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3P637BFB24A2GERKRFIPSGMLE3","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":"5093fad26cc78a8c3ece0daf64c54abc2d7736fee09ebcbf69e65a3a1666d065","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-21T15:34:29Z","title_canon_sha256":"3931c73524af75ded9031778e7f8b7d27fef5835ba7de85496b623cae4fef98c"},"schema_version":"1.0","source":{"id":"1601.05677","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05677","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05677v2","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05677","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"3P637BFB24A2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3P637BFB24A2GERK","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3P637BFB","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:417957eac3e91b43065d99c6fedcc4af12fb8543057f27b62a9af036073e933d","target":"graph","created_at":"2026-05-18T00:58:57Z","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 initiate a first information-theoretic study on multilevel NAND flash memory channels with intercell interference. More specifically, for a multilevel NAND flash memory channel under mild assumptions, we first prove that such a channel is indecomposable and it features asymptotic equipartition property; we then further prove that stationary processes achieve its information capacity, and consequently, as its order tends to infinity, its Markov capacity converges to its information capacity; eventually, we establish that its operational capacity is equal to its information cap","authors_text":"Aleksandar Kavcic, Guangyue Han, Yonglong Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-21T15:34:29Z","title":"On the Capacity of Multilevel NAND Flash Memory Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05677","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:08b6d7dc2ec269a341d6a19ff246b5a7962e762b3befcb777dd09e79e5a60c12","target":"record","created_at":"2026-05-18T00:58:57Z","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":"5093fad26cc78a8c3ece0daf64c54abc2d7736fee09ebcbf69e65a3a1666d065","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-21T15:34:29Z","title_canon_sha256":"3931c73524af75ded9031778e7f8b7d27fef5835ba7de85496b623cae4fef98c"},"schema_version":"1.0","source":{"id":"1601.05677","kind":"arxiv","version":2}},"canonical_sha256":"dbfdbf84a1d701a3122a8950f9198b26d6b2c4ea966f5ed4d1c39ed8422e8b09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbfdbf84a1d701a3122a8950f9198b26d6b2c4ea966f5ed4d1c39ed8422e8b09","first_computed_at":"2026-05-18T00:58:57.335532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:57.335532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j9ywwPjl8JhmfggyNc3gSk4soPPV35uvmnL+aXkZ1iRokuF0uBcPD0E2HfFTUDm3r0khCbWVdWuovrjO3eBqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:57.336092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05677","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08b6d7dc2ec269a341d6a19ff246b5a7962e762b3befcb777dd09e79e5a60c12","sha256:417957eac3e91b43065d99c6fedcc4af12fb8543057f27b62a9af036073e933d"],"state_sha256":"ea71c38e27905838faadbadbb95da510e283a8d0de00cadf367daa9f0503fe63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ayW7X56GrJmY+4EFIbkvrP/SASAL1HNasA6zZweNLd6TZRQ5GNI/zYCMDFBilz4+HGsPk2vnRpTqKshKfPSBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T05:54:31.662092Z","bundle_sha256":"32fcc64c589ec383d1c46d70524cb134cd758edd5257bb0b9d4e0f17de137f4d"}}