{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PM65SZXV3LZR7NWSCDGTZTMMUI","short_pith_number":"pith:PM65SZXV","canonical_record":{"source":{"id":"1701.08927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-31T06:39:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7848d117ff6719a5d32e24bea77dbc372ebec1e0a12c3cb648308a7f12b4d33b","abstract_canon_sha256":"577ee1f6dd420c1ba576140be986fe54ef53118c17a2db070f72b4506f98a896"},"schema_version":"1.0"},"canonical_sha256":"7b3dd966f5daf31fb6d210cd3ccd8ca23a55cc574f1a3baf3f483cd016d0c657","source":{"kind":"arxiv","id":"1701.08927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08927","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08927v1","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08927","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"PM65SZXV3LZR","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PM65SZXV3LZR7NWS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PM65SZXV","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PM65SZXV3LZR7NWSCDGTZTMMUI","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-31T06:39:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7848d117ff6719a5d32e24bea77dbc372ebec1e0a12c3cb648308a7f12b4d33b","abstract_canon_sha256":"577ee1f6dd420c1ba576140be986fe54ef53118c17a2db070f72b4506f98a896"},"schema_version":"1.0"},"canonical_sha256":"7b3dd966f5daf31fb6d210cd3ccd8ca23a55cc574f1a3baf3f483cd016d0c657","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:38.867466Z","signature_b64":"6oA86ROt/n5YJzRMQbCULDsQ4E44UdJw7qaOVj0b9NjEByJTnAV5iqPbL9Op8SMivCZ1oocy/bmmNN7nVzpkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b3dd966f5daf31fb6d210cd3ccd8ca23a55cc574f1a3baf3f483cd016d0c657","last_reissued_at":"2026-05-18T00:51:38.867043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:38.867043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08927","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-18T00:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MOWJ8m2GWphmmG0AyIEUxn3aCf82NgMzXU5DY81LsjSmNObH368gVatUWlrIO2ZyuvHKlWu2tt5Vp2WwG8IBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:28:37.147857Z"},"content_sha256":"5cd8f74c0811169cb603a30497a5f020d11342864e9679d7d5054330c2b26926","schema_version":"1.0","event_id":"sha256:5cd8f74c0811169cb603a30497a5f020d11342864e9679d7d5054330c2b26926"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PM65SZXV3LZR7NWSCDGTZTMMUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds on the Number of Writing Operations by ILIFC with Inversion Cells","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Akira Yamawaki, Hiroshi Kamabe, Shan Lu","submitted_at":"2017-01-31T06:39:21Z","abstract_excerpt":"Index-less Indexed Flash Code (ILIFC) is a coding scheme for flash memories, in which one bit of a data sequence is stored in a slice consisting of several cells but the index of the bit is stored implicitly. Although several modified ILIFC schemes have been proposed, in this research we consider an ILIFC with inversion cells(I-ILIFC). The I-ILIFC reduces the total number of cell level changes at each writing request. Computer simulation is used to show that the I-ILIFC improves the average performance of the ILIFC in many cases. This paper presents our derivation of the lower bounds on the nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08927","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-18T00:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGeH/Mdi27cJvZajUL7js1xJ6ZR1Q/NQ73XzTjTRtJ2dKyGJIL/KeEIpZxvjr4WqLFD0WFzLQ+/8kJW1umnKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:28:37.148195Z"},"content_sha256":"9aeda32e15baad3488d374095a8dd8fa7341b3c50e5ae90f77212f3c2e1445e0","schema_version":"1.0","event_id":"sha256:9aeda32e15baad3488d374095a8dd8fa7341b3c50e5ae90f77212f3c2e1445e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PM65SZXV3LZR7NWSCDGTZTMMUI/bundle.json","state_url":"https://pith.science/pith/PM65SZXV3LZR7NWSCDGTZTMMUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PM65SZXV3LZR7NWSCDGTZTMMUI/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-01T07:28:37Z","links":{"resolver":"https://pith.science/pith/PM65SZXV3LZR7NWSCDGTZTMMUI","bundle":"https://pith.science/pith/PM65SZXV3LZR7NWSCDGTZTMMUI/bundle.json","state":"https://pith.science/pith/PM65SZXV3LZR7NWSCDGTZTMMUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PM65SZXV3LZR7NWSCDGTZTMMUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PM65SZXV3LZR7NWSCDGTZTMMUI","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":"577ee1f6dd420c1ba576140be986fe54ef53118c17a2db070f72b4506f98a896","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-31T06:39:21Z","title_canon_sha256":"7848d117ff6719a5d32e24bea77dbc372ebec1e0a12c3cb648308a7f12b4d33b"},"schema_version":"1.0","source":{"id":"1701.08927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08927","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08927v1","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08927","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"PM65SZXV3LZR","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PM65SZXV3LZR7NWS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PM65SZXV","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:9aeda32e15baad3488d374095a8dd8fa7341b3c50e5ae90f77212f3c2e1445e0","target":"graph","created_at":"2026-05-18T00:51: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":"Index-less Indexed Flash Code (ILIFC) is a coding scheme for flash memories, in which one bit of a data sequence is stored in a slice consisting of several cells but the index of the bit is stored implicitly. Although several modified ILIFC schemes have been proposed, in this research we consider an ILIFC with inversion cells(I-ILIFC). The I-ILIFC reduces the total number of cell level changes at each writing request. Computer simulation is used to show that the I-ILIFC improves the average performance of the ILIFC in many cases. This paper presents our derivation of the lower bounds on the nu","authors_text":"Akira Yamawaki, Hiroshi Kamabe, Shan Lu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-31T06:39:21Z","title":"Lower Bounds on the Number of Writing Operations by ILIFC with Inversion Cells"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08927","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:5cd8f74c0811169cb603a30497a5f020d11342864e9679d7d5054330c2b26926","target":"record","created_at":"2026-05-18T00:51: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":"577ee1f6dd420c1ba576140be986fe54ef53118c17a2db070f72b4506f98a896","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-31T06:39:21Z","title_canon_sha256":"7848d117ff6719a5d32e24bea77dbc372ebec1e0a12c3cb648308a7f12b4d33b"},"schema_version":"1.0","source":{"id":"1701.08927","kind":"arxiv","version":1}},"canonical_sha256":"7b3dd966f5daf31fb6d210cd3ccd8ca23a55cc574f1a3baf3f483cd016d0c657","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b3dd966f5daf31fb6d210cd3ccd8ca23a55cc574f1a3baf3f483cd016d0c657","first_computed_at":"2026-05-18T00:51:38.867043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:38.867043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6oA86ROt/n5YJzRMQbCULDsQ4E44UdJw7qaOVj0b9NjEByJTnAV5iqPbL9Op8SMivCZ1oocy/bmmNN7nVzpkBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:38.867466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cd8f74c0811169cb603a30497a5f020d11342864e9679d7d5054330c2b26926","sha256:9aeda32e15baad3488d374095a8dd8fa7341b3c50e5ae90f77212f3c2e1445e0"],"state_sha256":"12b1f0d1fb062f486eb7c44a6050c5061ef8bf007e67b890da7bc0f3a3b2d14c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8gktwSNwmKEJO8MVUAnsrbrXFLxrGunJeYUbCG/x/l2+DYv45o1O3+IMzPwxfbT53ZHlZDt5b4qyaSUTC060Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:28:37.150015Z","bundle_sha256":"9636432ef91c843b7f963444fb19f7d449e33c7dcc15d25c7378cd7760565a52"}}