{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KVYMV73OOS2CYCONJO5RQKICEB","short_pith_number":"pith:KVYMV73O","canonical_record":{"source":{"id":"1310.5515","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-21T11:59:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c654217f9fce66b10698af10a41ec148e98dc4a7816c19aa055c5cf47180eaea","abstract_canon_sha256":"13cc47489bceb491dd182b1ec6cdfbb8ce67c3fe9edcf35e81fcc60398aaff50"},"schema_version":"1.0"},"canonical_sha256":"5570caff6e74b42c09cd4bbb182902205b0edd39f87ae1551a32c61ec42ee49a","source":{"kind":"arxiv","id":"1310.5515","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5515","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5515v5","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5515","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"KVYMV73OOS2C","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KVYMV73OOS2CYCON","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KVYMV73O","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KVYMV73OOS2CYCONJO5RQKICEB","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5515","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-21T11:59:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c654217f9fce66b10698af10a41ec148e98dc4a7816c19aa055c5cf47180eaea","abstract_canon_sha256":"13cc47489bceb491dd182b1ec6cdfbb8ce67c3fe9edcf35e81fcc60398aaff50"},"schema_version":"1.0"},"canonical_sha256":"5570caff6e74b42c09cd4bbb182902205b0edd39f87ae1551a32c61ec42ee49a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:53.557374Z","signature_b64":"sqOPgntblmoJYYQp5votsCxgQg5UNjjKxnv4A8debgS8dfzqvffYJEpPMFCQ8w2qo9LH/+pCNJT3uFOm3jmrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5570caff6e74b42c09cd4bbb182902205b0edd39f87ae1551a32c61ec42ee49a","last_reissued_at":"2026-05-18T02:53:53.556393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:53.556393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5515","source_version":5,"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:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/a3CHAvStJXl8f4Gam8cwqYR1sMZHXnnUsv62eZGqWGFxNYqEC+FWry70AwByuxPoWy9yQF08l1vd95sBUECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:24:25.620215Z"},"content_sha256":"606bbb36935f099341bd36b8c7060fef61e0835062417eb9c17da946dc9b531d","schema_version":"1.0","event_id":"sha256:606bbb36935f099341bd36b8c7060fef61e0835062417eb9c17da946dc9b531d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KVYMV73OOS2CYCONJO5RQKICEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect Permutation Codes with the Kendall's $\\tau$-Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sarit Buzaglo, Tuvi Etzion","submitted_at":"2013-10-21T11:59:54Z","abstract_excerpt":"The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in the set of all permutations on $n$ elements, $S_n$, using the Kendall's $\\tau$-metric. We prove that there are no perfect single-error-correcting codes in $S_n$, where $n>4$ is a prime or $4\\leq n\\leq 10$. We also prove that if such a code exists for $n$ which is not a prime then the code should have some uniform structure. We define some variations of the K"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5515","kind":"arxiv","version":5},"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:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvIrX6purZS4tm+ae2T86IEVkOo/XXbNGliYv0hj/EWCr6n+eu/i/YCMBmgIvWjTokTQl8TQg1yLA5eUVDNvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:24:25.620918Z"},"content_sha256":"f7fd01c2260570dc35d27b16c73e7d9cc0a21ca60272d668218d1208d0bb7c70","schema_version":"1.0","event_id":"sha256:f7fd01c2260570dc35d27b16c73e7d9cc0a21ca60272d668218d1208d0bb7c70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVYMV73OOS2CYCONJO5RQKICEB/bundle.json","state_url":"https://pith.science/pith/KVYMV73OOS2CYCONJO5RQKICEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVYMV73OOS2CYCONJO5RQKICEB/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-30T07:24:25Z","links":{"resolver":"https://pith.science/pith/KVYMV73OOS2CYCONJO5RQKICEB","bundle":"https://pith.science/pith/KVYMV73OOS2CYCONJO5RQKICEB/bundle.json","state":"https://pith.science/pith/KVYMV73OOS2CYCONJO5RQKICEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVYMV73OOS2CYCONJO5RQKICEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KVYMV73OOS2CYCONJO5RQKICEB","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":"13cc47489bceb491dd182b1ec6cdfbb8ce67c3fe9edcf35e81fcc60398aaff50","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-21T11:59:54Z","title_canon_sha256":"c654217f9fce66b10698af10a41ec148e98dc4a7816c19aa055c5cf47180eaea"},"schema_version":"1.0","source":{"id":"1310.5515","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5515","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5515v5","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5515","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"KVYMV73OOS2C","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KVYMV73OOS2CYCON","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KVYMV73O","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:f7fd01c2260570dc35d27b16c73e7d9cc0a21ca60272d668218d1208d0bb7c70","target":"graph","created_at":"2026-05-18T02:53: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":"The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in the set of all permutations on $n$ elements, $S_n$, using the Kendall's $\\tau$-metric. We prove that there are no perfect single-error-correcting codes in $S_n$, where $n>4$ is a prime or $4\\leq n\\leq 10$. We also prove that if such a code exists for $n$ which is not a prime then the code should have some uniform structure. We define some variations of the K","authors_text":"Sarit Buzaglo, Tuvi Etzion","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-21T11:59:54Z","title":"Perfect Permutation Codes with the Kendall's $\\tau$-Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5515","kind":"arxiv","version":5},"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:606bbb36935f099341bd36b8c7060fef61e0835062417eb9c17da946dc9b531d","target":"record","created_at":"2026-05-18T02:53: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":"13cc47489bceb491dd182b1ec6cdfbb8ce67c3fe9edcf35e81fcc60398aaff50","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-21T11:59:54Z","title_canon_sha256":"c654217f9fce66b10698af10a41ec148e98dc4a7816c19aa055c5cf47180eaea"},"schema_version":"1.0","source":{"id":"1310.5515","kind":"arxiv","version":5}},"canonical_sha256":"5570caff6e74b42c09cd4bbb182902205b0edd39f87ae1551a32c61ec42ee49a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5570caff6e74b42c09cd4bbb182902205b0edd39f87ae1551a32c61ec42ee49a","first_computed_at":"2026-05-18T02:53:53.556393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:53.556393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sqOPgntblmoJYYQp5votsCxgQg5UNjjKxnv4A8debgS8dfzqvffYJEpPMFCQ8w2qo9LH/+pCNJT3uFOm3jmrAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:53.557374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5515","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:606bbb36935f099341bd36b8c7060fef61e0835062417eb9c17da946dc9b531d","sha256:f7fd01c2260570dc35d27b16c73e7d9cc0a21ca60272d668218d1208d0bb7c70"],"state_sha256":"8fc40b483247bfb348d7c160eae2cc0957ad1046c8e86ebbf3a2c006d354f891"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uW14JmkiDfDzNwH3cnnQsQABkuNxL+LNLp9hOsEY1RwLSCi5eZzhFEV5/lz4vpx7+eTm/ulgLjtyIvlaJheCDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:24:25.624612Z","bundle_sha256":"907b1d123898857ec7c6572da419890d63bb80ff25aee7dffade7e97c045b340"}}