{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ETFRO4RGCMOSTKK2N5WUQJGGCR","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":"7aac96caa9a8b9655be4230910c6ec916af325ad96141b3890427ff069c944a8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-20T00:33:16Z","title_canon_sha256":"1961615c6a5b895282d4bf1c083cf9ae1c8425cea3a195b9c4e29603f7b32c70"},"schema_version":"1.0","source":{"id":"1311.4925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4925","created_at":"2026-05-18T03:06:42Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4925v1","created_at":"2026-05-18T03:06:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4925","created_at":"2026-05-18T03:06:42Z"},{"alias_kind":"pith_short_12","alias_value":"ETFRO4RGCMOS","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ETFRO4RGCMOSTKK2","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ETFRO4RG","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:66a273c88553e180389bfd8a94c4591ac58c6a9b0796c17a5a10c48d9c2cd8ee","target":"graph","created_at":"2026-05-18T03:06:42Z","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":"Given positive integers $n$ and $d$, let $M(n,d)$ denote the maximum size of a permutation code of length $n$ and minimum Hamming distance $d$. The Gilbert-Varshamov bound asserts that $M(n,d) \\geq n!/V(n,d-1)$ where $V(n,d)$ is the volume of a Hamming sphere of radius $d$ in $\\S_n$.\n  Recently, Gao, Yang, and Ge showed that this bound can be improved by a factor $\\Omega(\\log n)$, when $d$ is fixed and $n \\to \\infty$. Herein, we consider the situation where the ratio $d/n$ is fixed and improve the Gilbert-Varshamov bound by a factor that is \\emph{linear in $n$}. That is, we show that if $d/n <","authors_text":"Alexander Vardy, Jacques Verstraete, Michael Tait","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-20T00:33:16Z","title":"Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4925","kind":"arxiv","version":1},"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:954048df4bad4c617519e4e6e456ab61aaf7170445271a6936ffb05e58311c04","target":"record","created_at":"2026-05-18T03:06:42Z","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":"7aac96caa9a8b9655be4230910c6ec916af325ad96141b3890427ff069c944a8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-20T00:33:16Z","title_canon_sha256":"1961615c6a5b895282d4bf1c083cf9ae1c8425cea3a195b9c4e29603f7b32c70"},"schema_version":"1.0","source":{"id":"1311.4925","kind":"arxiv","version":1}},"canonical_sha256":"24cb177226131d29a95a6f6d4824c6144553f5bd8ddeb8e3b5d3c0268d0d105f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24cb177226131d29a95a6f6d4824c6144553f5bd8ddeb8e3b5d3c0268d0d105f","first_computed_at":"2026-05-18T03:06:42.399582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:42.399582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F/kUXnwQFc++Wo6+w8bu1S92NcNVPL7kFuPw0hM+s9Fe4NqZdaSi9LbXhVrExzxDVjeK9942eKoeBx/gSMS1BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:42.400037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:954048df4bad4c617519e4e6e456ab61aaf7170445271a6936ffb05e58311c04","sha256:66a273c88553e180389bfd8a94c4591ac58c6a9b0796c17a5a10c48d9c2cd8ee"],"state_sha256":"11b4996a4ee8259b8257b815f417a3cc3eb203f0b19292b9102632e5b5e92b6b"}