{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XS3JIETXMJHUROS4SCHCP6DLV3","short_pith_number":"pith:XS3JIETX","schema_version":"1.0","canonical_sha256":"bcb6941277624f48ba5c908e27f86baedb9610b3e408989a2ca9d9a2aa09386d","source":{"kind":"arxiv","id":"1103.0317","version":1},"attestation_state":"computed","paper":{"title":"Generalized Gray Codes for Local Rank Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eyal En Gad, Jehoshua Bruck, Michael Langberg, Moshe Schwartz","submitted_at":"2011-03-01T23:53:45Z","abstract_excerpt":"We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rank-modulation is a generalization of the rank-modulation scheme, which has been recently suggested as a way of storing information in flash memory. We study Gray codes for the local rank-modulation scheme in order to simulate conventional multi-level flash cells while retaining the benefits of rank modulation. Unlike the limited scope of previous works, we consider code constructions for the entire range of parameters including the co"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1103.0317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-01T23:53:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3973be6df7fa602784be899a8cad943c7af2af185352136cbdd5e4e3a6ef11c7","abstract_canon_sha256":"f6f374af5f20cbf5940fcaca90c971423f2e91918a36bfb3aab861f6b267206d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:35.311640Z","signature_b64":"W7c3M7+mysEo8HX04bOoAl45FhwOgvxjfV+r/Z7ymCc6f9boCs86bK7RyGjLHxfOtkLW+PIxSIzVKE4DIXKWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcb6941277624f48ba5c908e27f86baedb9610b3e408989a2ca9d9a2aa09386d","last_reissued_at":"2026-05-18T04:27:35.310897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:35.310897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Gray Codes for Local Rank Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eyal En Gad, Jehoshua Bruck, Michael Langberg, Moshe Schwartz","submitted_at":"2011-03-01T23:53:45Z","abstract_excerpt":"We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rank-modulation is a generalization of the rank-modulation scheme, which has been recently suggested as a way of storing information in flash memory. We study Gray codes for the local rank-modulation scheme in order to simulate conventional multi-level flash cells while retaining the benefits of rank modulation. Unlike the limited scope of previous works, we consider code constructions for the entire range of parameters including the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0317","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.0317","created_at":"2026-05-18T04:27:35.311016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0317v1","created_at":"2026-05-18T04:27:35.311016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0317","created_at":"2026-05-18T04:27:35.311016+00:00"},{"alias_kind":"pith_short_12","alias_value":"XS3JIETXMJHU","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XS3JIETXMJHUROS4","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XS3JIETX","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XS3JIETXMJHUROS4SCHCP6DLV3","json":"https://pith.science/pith/XS3JIETXMJHUROS4SCHCP6DLV3.json","graph_json":"https://pith.science/api/pith-number/XS3JIETXMJHUROS4SCHCP6DLV3/graph.json","events_json":"https://pith.science/api/pith-number/XS3JIETXMJHUROS4SCHCP6DLV3/events.json","paper":"https://pith.science/paper/XS3JIETX"},"agent_actions":{"view_html":"https://pith.science/pith/XS3JIETXMJHUROS4SCHCP6DLV3","download_json":"https://pith.science/pith/XS3JIETXMJHUROS4SCHCP6DLV3.json","view_paper":"https://pith.science/paper/XS3JIETX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0317&json=true","fetch_graph":"https://pith.science/api/pith-number/XS3JIETXMJHUROS4SCHCP6DLV3/graph.json","fetch_events":"https://pith.science/api/pith-number/XS3JIETXMJHUROS4SCHCP6DLV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XS3JIETXMJHUROS4SCHCP6DLV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XS3JIETXMJHUROS4SCHCP6DLV3/action/storage_attestation","attest_author":"https://pith.science/pith/XS3JIETXMJHUROS4SCHCP6DLV3/action/author_attestation","sign_citation":"https://pith.science/pith/XS3JIETXMJHUROS4SCHCP6DLV3/action/citation_signature","submit_replication":"https://pith.science/pith/XS3JIETXMJHUROS4SCHCP6DLV3/action/replication_record"}},"created_at":"2026-05-18T04:27:35.311016+00:00","updated_at":"2026-05-18T04:27:35.311016+00:00"}