{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZOFYF56T5OGPX5NB6FM5BE3ZBN","short_pith_number":"pith:ZOFYF56T","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"},"canonical_sha256":"cb8b82f7d3eb8cfbf5a1f159d093790b7dbb73c98a09cd3d26ff6686e8177ea2","source":{"kind":"arxiv","id":"1311.4703","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4703","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4703v4","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4703","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"ZOFYF56T5OGP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZOFYF56T5OGPX5NB","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZOFYF56T","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZOFYF56T5OGPX5NB6FM5BE3ZBN","target":"record","payload":{"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"},"canonical_sha256":"cb8b82f7d3eb8cfbf5a1f159d093790b7dbb73c98a09cd3d26ff6686e8177ea2","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"},"source_kind":"arxiv","source_id":"1311.4703","source_version":4,"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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1sRcT1dpv5uLNg+nKfDIc9tqMWhmYe3+3enUcdEH173B+QDPAQJn7+SwGg7EExhoLFtfFCJeQlMCPcZZDe8SAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:09:05.214699Z"},"content_sha256":"87a0757e328797790a255639c2f3be0b8488cb914fa6c40e661157fcdba00117","schema_version":"1.0","event_id":"sha256:87a0757e328797790a255639c2f3be0b8488cb914fa6c40e661157fcdba00117"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZOFYF56T5OGPX5NB6FM5BE3ZBN","target":"graph","payload":{"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"},"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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xrn0YLWTkxZk0aaj4o8egNoOfpd7Ys2z+fy9yz54/AG1O7vprLk5tMFo7Gtbll/3odZGOaIxA5A87PIFZNwoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:09:05.215440Z"},"content_sha256":"5cc1a0f0ee8b2140d56d915441aed9e43a0b1a29d0badee8c3abf90ccac7b15f","schema_version":"1.0","event_id":"sha256:5cc1a0f0ee8b2140d56d915441aed9e43a0b1a29d0badee8c3abf90ccac7b15f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN/bundle.json","state_url":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN/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-05-30T00:09:05Z","links":{"resolver":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN","bundle":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN/bundle.json","state":"https://pith.science/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZOFYF56T5OGPX5NB6FM5BE3ZBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZOFYF56T5OGPX5NB6FM5BE3ZBN","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":"03e24d963ab097068291a833be3a3b87e96300aa08399947464d8da4930200f9","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T11:37:16Z","title_canon_sha256":"54c5c0c92c9756a7900137ce14177bd302cec68cb4f1e0e27cbb760ef4798c45"},"schema_version":"1.0","source":{"id":"1311.4703","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4703","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4703v4","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4703","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"ZOFYF56T5OGP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZOFYF56T5OGPX5NB","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZOFYF56T","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:5cc1a0f0ee8b2140d56d915441aed9e43a0b1a29d0badee8c3abf90ccac7b15f","target":"graph","created_at":"2026-05-18T02:42:53Z","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":"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","authors_text":"Michal Horovitz, Tuvi Etzion","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T11:37:16Z","title":"Constructions of Snake-in-the-Box Codes for Rank Modulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4703","kind":"arxiv","version":4},"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:87a0757e328797790a255639c2f3be0b8488cb914fa6c40e661157fcdba00117","target":"record","created_at":"2026-05-18T02:42:53Z","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":"03e24d963ab097068291a833be3a3b87e96300aa08399947464d8da4930200f9","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T11:37:16Z","title_canon_sha256":"54c5c0c92c9756a7900137ce14177bd302cec68cb4f1e0e27cbb760ef4798c45"},"schema_version":"1.0","source":{"id":"1311.4703","kind":"arxiv","version":4}},"canonical_sha256":"cb8b82f7d3eb8cfbf5a1f159d093790b7dbb73c98a09cd3d26ff6686e8177ea2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb8b82f7d3eb8cfbf5a1f159d093790b7dbb73c98a09cd3d26ff6686e8177ea2","first_computed_at":"2026-05-18T02:42:53.988479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:53.988479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IB+1agjaNQ8Oh90ORD1q7LCsm0JGGXO7IwkpN5cH0HKIDEzXGTRSzDq4ldScTCN647ROCL4j+WlOE8yimex1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:53.988863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4703","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87a0757e328797790a255639c2f3be0b8488cb914fa6c40e661157fcdba00117","sha256:5cc1a0f0ee8b2140d56d915441aed9e43a0b1a29d0badee8c3abf90ccac7b15f"],"state_sha256":"530ebdff2c72b6a206cc59bfeec03fd16018b41f5cbbbdd95c95ef8596fe54f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2Ng2jkoxSg1wRdVcfY7ZprnQ/8Rk+p7H3DTHRpn8D3QBAIT0PY9nIrET3q5jnk+DiRTqpCelzRMAp+izt1iDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:09:05.219212Z","bundle_sha256":"bf3221f348d9ac442fa61e8d2e60874797abb1a70b9073775d7f6be5dcef97c1"}}