{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5HQHOPW7Q5LMVW52XJYWQWHB6J","short_pith_number":"pith:5HQHOPW7","canonical_record":{"source":{"id":"1108.2741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T00:06:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6ed83b37ffe4b7e422ac4f40bc93fe2c5cf72d46b6880d2069d6a55ca7e04fde","abstract_canon_sha256":"a09592782927ab129e7380af0a92289695b7af06738651c3880cbfbe83548677"},"schema_version":"1.0"},"canonical_sha256":"e9e0773edf8756cadbbaba716858e1f241f8dc08880721ba8721b4f32a2a3153","source":{"kind":"arxiv","id":"1108.2741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2741","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2741v1","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2741","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"5HQHOPW7Q5LM","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5HQHOPW7Q5LMVW52","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5HQHOPW7","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5HQHOPW7Q5LMVW52XJYWQWHB6J","target":"record","payload":{"canonical_record":{"source":{"id":"1108.2741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T00:06:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6ed83b37ffe4b7e422ac4f40bc93fe2c5cf72d46b6880d2069d6a55ca7e04fde","abstract_canon_sha256":"a09592782927ab129e7380af0a92289695b7af06738651c3880cbfbe83548677"},"schema_version":"1.0"},"canonical_sha256":"e9e0773edf8756cadbbaba716858e1f241f8dc08880721ba8721b4f32a2a3153","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:35.691882Z","signature_b64":"OrVxcRsNs3NiNN4Vk0oJYbHq6WyOQCq5MkKxeSWEpFjnb5pLZ7BrjbCVPk9jGKdPACYUZ9vSPHUW6DQndbyrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9e0773edf8756cadbbaba716858e1f241f8dc08880721ba8721b4f32a2a3153","last_reissued_at":"2026-05-18T04:15:35.691381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:35.691381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.2741","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-18T04:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nNQsJJWjD+2AIkW549UUx6Pmo8r+V5fvm3sEiTxsGRI//ImmWLdBojYvTiUybG1U7opvK1Sq5tHdrUj6/eNHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:20:38.040281Z"},"content_sha256":"6c46c28763296e8ef699b306965f373ac0dab82d4670b37b73bc8eef14f37297","schema_version":"1.0","event_id":"sha256:6c46c28763296e8ef699b306965f373ac0dab82d4670b37b73bc8eef14f37297"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5HQHOPW7Q5LMVW52XJYWQWHB6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed Encoding for Rank Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anxiao (Andrew) Jiang, Eyal En Gad, Jehoshua Bruck","submitted_at":"2011-08-13T00:06:13Z","abstract_excerpt":"Rank modulation has been recently proposed as a scheme for storing information in flash memories. While rank modulation has advantages in improving write speed and endurance, the current encoding approach is based on the \"push to the top\" operation that is not efficient in the general case. We propose a new encoding procedure where a cell level is raised to be higher than the minimal necessary subset - instead of all - of the other cell levels. This new procedure leads to a significantly more compressed (lower charge levels) encoding. We derive an upper bound for a family of codes that utilize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2741","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-18T04:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZTiwhLzsD5xfB/9kMHJYTmkZ2NYIeZFHip9qko18uqzFdXuWK6fXgjVr/HsPOSyGOCQceTBbvZT5C1KDuvgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:20:38.040651Z"},"content_sha256":"f1de72bb90d5c39524d6d7f40c96951ced2b6ab32418c8c7bac363fe96189bcc","schema_version":"1.0","event_id":"sha256:f1de72bb90d5c39524d6d7f40c96951ced2b6ab32418c8c7bac363fe96189bcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HQHOPW7Q5LMVW52XJYWQWHB6J/bundle.json","state_url":"https://pith.science/pith/5HQHOPW7Q5LMVW52XJYWQWHB6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HQHOPW7Q5LMVW52XJYWQWHB6J/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-22T16:20:38Z","links":{"resolver":"https://pith.science/pith/5HQHOPW7Q5LMVW52XJYWQWHB6J","bundle":"https://pith.science/pith/5HQHOPW7Q5LMVW52XJYWQWHB6J/bundle.json","state":"https://pith.science/pith/5HQHOPW7Q5LMVW52XJYWQWHB6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HQHOPW7Q5LMVW52XJYWQWHB6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5HQHOPW7Q5LMVW52XJYWQWHB6J","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":"a09592782927ab129e7380af0a92289695b7af06738651c3880cbfbe83548677","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T00:06:13Z","title_canon_sha256":"6ed83b37ffe4b7e422ac4f40bc93fe2c5cf72d46b6880d2069d6a55ca7e04fde"},"schema_version":"1.0","source":{"id":"1108.2741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2741","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2741v1","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2741","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"5HQHOPW7Q5LM","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5HQHOPW7Q5LMVW52","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5HQHOPW7","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:f1de72bb90d5c39524d6d7f40c96951ced2b6ab32418c8c7bac363fe96189bcc","target":"graph","created_at":"2026-05-18T04:15: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":"Rank modulation has been recently proposed as a scheme for storing information in flash memories. While rank modulation has advantages in improving write speed and endurance, the current encoding approach is based on the \"push to the top\" operation that is not efficient in the general case. We propose a new encoding procedure where a cell level is raised to be higher than the minimal necessary subset - instead of all - of the other cell levels. This new procedure leads to a significantly more compressed (lower charge levels) encoding. We derive an upper bound for a family of codes that utilize","authors_text":"Anxiao (Andrew) Jiang, Eyal En Gad, Jehoshua Bruck","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T00:06:13Z","title":"Compressed Encoding for Rank Modulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2741","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:6c46c28763296e8ef699b306965f373ac0dab82d4670b37b73bc8eef14f37297","target":"record","created_at":"2026-05-18T04:15: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":"a09592782927ab129e7380af0a92289695b7af06738651c3880cbfbe83548677","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-13T00:06:13Z","title_canon_sha256":"6ed83b37ffe4b7e422ac4f40bc93fe2c5cf72d46b6880d2069d6a55ca7e04fde"},"schema_version":"1.0","source":{"id":"1108.2741","kind":"arxiv","version":1}},"canonical_sha256":"e9e0773edf8756cadbbaba716858e1f241f8dc08880721ba8721b4f32a2a3153","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9e0773edf8756cadbbaba716858e1f241f8dc08880721ba8721b4f32a2a3153","first_computed_at":"2026-05-18T04:15:35.691381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:35.691381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OrVxcRsNs3NiNN4Vk0oJYbHq6WyOQCq5MkKxeSWEpFjnb5pLZ7BrjbCVPk9jGKdPACYUZ9vSPHUW6DQndbyrBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:35.691882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c46c28763296e8ef699b306965f373ac0dab82d4670b37b73bc8eef14f37297","sha256:f1de72bb90d5c39524d6d7f40c96951ced2b6ab32418c8c7bac363fe96189bcc"],"state_sha256":"b349662cf59e6757d53fcc40f327e660e4a6e4d07cc5a84ad199a755008936db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyxmurXvQRHbb5HOdLuf4frqrtsO8On+QYyfdoPHHlcfnoQ16wWDiQCUH9Qsg4kny8gvJHttvZlNP9kTkd65DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T16:20:38.042629Z","bundle_sha256":"5b7ff3bd1b4c6a1c889cc3ccfac57b7940fc9ce8bafaf08d03ac7f4775f4c2a7"}}