{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZIJ5QSD6FQ5BRXPXH4YA2D4DF4","short_pith_number":"pith:ZIJ5QSD6","canonical_record":{"source":{"id":"1202.0932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T01:25:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c7ac15d97de85f1ff1706d74385d05152a4ca0d13022ebfa641bbd8ccef7076","abstract_canon_sha256":"33c8a57dd4a7236788ede6aba04477a31ee89bf120b1b0d5e25f90c9ea90b771"},"schema_version":"1.0"},"canonical_sha256":"ca13d8487e2c3a18ddf73f300d0f832f09c66919d5fefea8a9291907f3ce3c1b","source":{"kind":"arxiv","id":"1202.0932","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0932","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0932v2","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0932","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZIJ5QSD6FQ5B","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZIJ5QSD6FQ5BRXPX","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZIJ5QSD6","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZIJ5QSD6FQ5BRXPXH4YA2D4DF4","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T01:25:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c7ac15d97de85f1ff1706d74385d05152a4ca0d13022ebfa641bbd8ccef7076","abstract_canon_sha256":"33c8a57dd4a7236788ede6aba04477a31ee89bf120b1b0d5e25f90c9ea90b771"},"schema_version":"1.0"},"canonical_sha256":"ca13d8487e2c3a18ddf73f300d0f832f09c66919d5fefea8a9291907f3ce3c1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:32.977308Z","signature_b64":"R3TfEMHgfLWgtgg3m10GZ0DV1yrK5fjGtT9JGaU5nH/An6fZef/EKzNAyWediY7aG2Idd++LV+260mu1sEraAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca13d8487e2c3a18ddf73f300d0f832f09c66919d5fefea8a9291907f3ce3c1b","last_reissued_at":"2026-05-18T03:27:32.976829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:32.976829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0932","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:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hia2Qj45Kgp5rvfDeNKXCdSRtYfblAusQGSQalv8ZZireDS7htgvg4NvZlGCQjLSRxSffWlsilILTjSY7zyICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:49:56.651577Z"},"content_sha256":"d938524645ef696c82af3990ae9954b7b1aeb48d56e0757d9efb7336abd5dff8","schema_version":"1.0","event_id":"sha256:d938524645ef696c82af3990ae9954b7b1aeb48d56e0757d9efb7336abd5dff8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZIJ5QSD6FQ5BRXPXH4YA2D4DF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error-Correction in Flash Memories via Codes in the Ulam Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzad Farnoud (Hassanzadeh), Olgica Milenkovic, Vitaly Skachek","submitted_at":"2012-02-05T01:25:24Z","abstract_excerpt":"We consider rank modulation codes for flash memories that allow for handling arbitrary charge-drop errors. Unlike classical rank modulation codes used for correcting errors that manifest themselves as swaps of two adjacently ranked elements, the proposed \\emph{translocation rank codes} account for more general forms of errors that arise in storage systems. Translocations represent a natural extension of the notion of adjacent transpositions and as such may be analyzed using related concepts in combinatorics and rank modulation coding. Our results include derivation of the asymptotic capacity o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0932","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:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mo+MDv2+y/VCIZWI82/ddm7ZRZHixh4IS6kt8wS18v+cXqMddM4H8IYM/ig0Xt0gJeMo6Ho2r9Yd154P+/2nBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:49:56.651924Z"},"content_sha256":"70c5fd99b9b9a55f1cd3ec0a91d806a7e2a3f1bcdddc12cabefe6558e5a5f713","schema_version":"1.0","event_id":"sha256:70c5fd99b9b9a55f1cd3ec0a91d806a7e2a3f1bcdddc12cabefe6558e5a5f713"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIJ5QSD6FQ5BRXPXH4YA2D4DF4/bundle.json","state_url":"https://pith.science/pith/ZIJ5QSD6FQ5BRXPXH4YA2D4DF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIJ5QSD6FQ5BRXPXH4YA2D4DF4/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-22T17:49:56Z","links":{"resolver":"https://pith.science/pith/ZIJ5QSD6FQ5BRXPXH4YA2D4DF4","bundle":"https://pith.science/pith/ZIJ5QSD6FQ5BRXPXH4YA2D4DF4/bundle.json","state":"https://pith.science/pith/ZIJ5QSD6FQ5BRXPXH4YA2D4DF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIJ5QSD6FQ5BRXPXH4YA2D4DF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZIJ5QSD6FQ5BRXPXH4YA2D4DF4","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":"33c8a57dd4a7236788ede6aba04477a31ee89bf120b1b0d5e25f90c9ea90b771","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T01:25:24Z","title_canon_sha256":"2c7ac15d97de85f1ff1706d74385d05152a4ca0d13022ebfa641bbd8ccef7076"},"schema_version":"1.0","source":{"id":"1202.0932","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0932","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0932v2","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0932","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZIJ5QSD6FQ5B","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZIJ5QSD6FQ5BRXPX","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZIJ5QSD6","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:70c5fd99b9b9a55f1cd3ec0a91d806a7e2a3f1bcdddc12cabefe6558e5a5f713","target":"graph","created_at":"2026-05-18T03:27:32Z","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 consider rank modulation codes for flash memories that allow for handling arbitrary charge-drop errors. Unlike classical rank modulation codes used for correcting errors that manifest themselves as swaps of two adjacently ranked elements, the proposed \\emph{translocation rank codes} account for more general forms of errors that arise in storage systems. Translocations represent a natural extension of the notion of adjacent transpositions and as such may be analyzed using related concepts in combinatorics and rank modulation coding. Our results include derivation of the asymptotic capacity o","authors_text":"Farzad Farnoud (Hassanzadeh), Olgica Milenkovic, Vitaly Skachek","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T01:25:24Z","title":"Error-Correction in Flash Memories via Codes in the Ulam Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0932","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:d938524645ef696c82af3990ae9954b7b1aeb48d56e0757d9efb7336abd5dff8","target":"record","created_at":"2026-05-18T03:27:32Z","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":"33c8a57dd4a7236788ede6aba04477a31ee89bf120b1b0d5e25f90c9ea90b771","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T01:25:24Z","title_canon_sha256":"2c7ac15d97de85f1ff1706d74385d05152a4ca0d13022ebfa641bbd8ccef7076"},"schema_version":"1.0","source":{"id":"1202.0932","kind":"arxiv","version":2}},"canonical_sha256":"ca13d8487e2c3a18ddf73f300d0f832f09c66919d5fefea8a9291907f3ce3c1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca13d8487e2c3a18ddf73f300d0f832f09c66919d5fefea8a9291907f3ce3c1b","first_computed_at":"2026-05-18T03:27:32.976829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:32.976829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R3TfEMHgfLWgtgg3m10GZ0DV1yrK5fjGtT9JGaU5nH/An6fZef/EKzNAyWediY7aG2Idd++LV+260mu1sEraAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:32.977308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0932","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d938524645ef696c82af3990ae9954b7b1aeb48d56e0757d9efb7336abd5dff8","sha256:70c5fd99b9b9a55f1cd3ec0a91d806a7e2a3f1bcdddc12cabefe6558e5a5f713"],"state_sha256":"d643682d786a4c8e2797a18724c8684cf54822d68a4365f14894e351c84bc903"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLmQuRpaNnZvjjwbvn362LxrTFT4VVosDYz1ZNfAKlskixm0LsqXBtLqNUiwyPNjWn4VRMDpJRwjKKmsBONiBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:49:56.653879Z","bundle_sha256":"614661d1bf973efcf81283bbf304243d6590fd8b685c272b2159ea36f1c55e06"}}