{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZOFYF56T5OGPX5NB6FM5BE3ZBN","short_pith_number":"pith:ZOFYF56T","schema_version":"1.0","canonical_sha256":"cb8b82f7d3eb8cfbf5a1f159d093790b7dbb73c98a09cd3d26ff6686e8177ea2","source":{"kind":"arxiv","id":"1311.4703","version":4},"attestation_state":"computed","paper":{"title":"Constructions of Snake-in-the-Box Codes for Rank Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Michal Horovitz, Tuvi Etzion","submitted_at":"2013-11-19T11:37:16Z","abstract_excerpt":"Snake-in-the-box code is a Gray code which is capable of detecting a single error. Gray codes are important in the context of the rank modulation scheme which was suggested recently for representing information in flash memories. For a Gray code in this scheme the codewords are permutations, two consecutive codewords are obtained by using the \"push-to-the-top\" operation, and the distance measure is defined on permutations. In this paper the Kendall's $\\tau$-metric is used as the distance measure. We present a general method for constructing such Gray codes. We apply the method recursively to o"},"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":"1311.4703","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T11:37:16Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"54c5c0c92c9756a7900137ce14177bd302cec68cb4f1e0e27cbb760ef4798c45","abstract_canon_sha256":"03e24d963ab097068291a833be3a3b87e96300aa08399947464d8da4930200f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:53.988863Z","signature_b64":"IB+1agjaNQ8Oh90ORD1q7LCsm0JGGXO7IwkpN5cH0HKIDEzXGTRSzDq4ldScTCN647ROCL4j+WlOE8yimex1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb8b82f7d3eb8cfbf5a1f159d093790b7dbb73c98a09cd3d26ff6686e8177ea2","last_reissued_at":"2026-05-18T02:42:53.988479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:53.988479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions of Snake-in-the-Box Codes for Rank Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Michal Horovitz, Tuvi Etzion","submitted_at":"2013-11-19T11:37:16Z","abstract_excerpt":"Snake-in-the-box code is a Gray code which is capable of detecting a single error. Gray codes are important in the context of the rank modulation scheme which was suggested recently for representing information in flash memories. For a Gray code in this scheme the codewords are permutations, two consecutive codewords are obtained by using the \"push-to-the-top\" operation, and the distance measure is defined on permutations. In this paper the Kendall's $\\tau$-metric is used as the distance measure. We present a general method for constructing such Gray codes. We apply the method recursively to o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4703","kind":"arxiv","version":4},"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":"1311.4703","created_at":"2026-05-18T02:42:53.988536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4703v4","created_at":"2026-05-18T02:42:53.988536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4703","created_at":"2026-05-18T02:42:53.988536+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOFYF56T5OGP","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOFYF56T5OGPX5NB","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOFYF56T","created_at":"2026-05-18T12:28:09.283467+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/ZOFYF56T5OGPX5NB6FM5BE3ZBN","json":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN.json","graph_json":"https://pith.science/api/pith-number/ZOFYF56T5OGPX5NB6FM5BE3ZBN/graph.json","events_json":"https://pith.science/api/pith-number/ZOFYF56T5OGPX5NB6FM5BE3ZBN/events.json","paper":"https://pith.science/paper/ZOFYF56T"},"agent_actions":{"view_html":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN","download_json":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN.json","view_paper":"https://pith.science/paper/ZOFYF56T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4703&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOFYF56T5OGPX5NB6FM5BE3ZBN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOFYF56T5OGPX5NB6FM5BE3ZBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN/action/storage_attestation","attest_author":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN/action/author_attestation","sign_citation":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN/action/citation_signature","submit_replication":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN/action/replication_record"}},"created_at":"2026-05-18T02:42:53.988536+00:00","updated_at":"2026-05-18T02:42:53.988536+00:00"}