{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BJW2RGIJ6B2ATVRBWIYE75HFAK","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":"92cb0536f638163a3834e36985e480a3907886365d8c1d66eeeab5fc92e88464","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T01:02:32Z","title_canon_sha256":"6bd830d824f5047c3f22c6c3d66324e3daaf492e474562c1b888df11152c4345"},"schema_version":"1.0","source":{"id":"1804.03768","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03768","created_at":"2026-05-18T00:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03768v3","created_at":"2026-05-18T00:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03768","created_at":"2026-05-18T00:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"BJW2RGIJ6B2A","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BJW2RGIJ6B2ATVRB","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BJW2RGIJ","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:18f34c05666cc45fb3a54fc358c3df2fc60c5c89e9e216bc64a9fd95a3c23752","target":"graph","created_at":"2026-05-18T00:06:04Z","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":"A permutation array $A$ is a set of permutations on a finite set $\\Omega$, say of size $n$. Given distinct permutations $\\pi, \\sigma\\in \\Omega$, we let $hd(\\pi, \\sigma) = |\\{ x\\in \\Omega: \\pi(x) \\ne \\sigma(x) \\}|$, called the Hamming distance between $\\pi$ and $\\sigma$. Now let $hd(A) =$ min$\\{ hd(\\pi, \\sigma): \\pi, \\sigma \\in A \\}$. For positive integers $n$ and $d$ with $d\\le n$, we let $M(n,d)$ be the maximum number of permutations in any array $A$ satisfying $hd(A) \\geq d$. There is an extensive literature on the function $M(n,d)$, motivated in part by suggested applications to error corre","authors_text":"I.H. Sudborough, Linda Morales, Luis Gerardo Mojica, Sergey Bereg, Zevi Miller","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T01:02:32Z","title":"New Lower Bounds for Permutation Arrays Using Contraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03768","kind":"arxiv","version":3},"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:314a37ee3cb69b2139c854277210082221a491411e063b4e07e2d5e78a9d5f47","target":"record","created_at":"2026-05-18T00:06:04Z","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":"92cb0536f638163a3834e36985e480a3907886365d8c1d66eeeab5fc92e88464","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T01:02:32Z","title_canon_sha256":"6bd830d824f5047c3f22c6c3d66324e3daaf492e474562c1b888df11152c4345"},"schema_version":"1.0","source":{"id":"1804.03768","kind":"arxiv","version":3}},"canonical_sha256":"0a6da89909f07409d621b2304ff4e5028995934830adf672d6a69e779af0a2c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a6da89909f07409d621b2304ff4e5028995934830adf672d6a69e779af0a2c0","first_computed_at":"2026-05-18T00:06:04.467073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:04.467073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v63OKoFvgeRbbhR8x8WazriVoCiBfiBrKzXkjLJXd6QGHHbR0W9aiW83vK1DjJ/0INfq+WTUljykCmKSKBbTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:04.467744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03768","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:314a37ee3cb69b2139c854277210082221a491411e063b4e07e2d5e78a9d5f47","sha256:18f34c05666cc45fb3a54fc358c3df2fc60c5c89e9e216bc64a9fd95a3c23752"],"state_sha256":"0fdeff8840edc9816f4764f5ece2ab30cf54c79102fd0c3a09e21f2fb8766424"}