{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HTTWYYRHURBHBKSKJ5O5TM3AI2","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":"6f38712d9c13d22a29864b7e05d87a7979209cef2322bd3f70b07380ab7f4d94","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-23T15:26:46Z","title_canon_sha256":"0da4d17feb20ad141b71107bb37f941999c84a8fc0c47cc283f6193e2fd2f76c"},"schema_version":"1.0","source":{"id":"2404.15126","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.15126","created_at":"2026-07-05T09:03:52Z"},{"alias_kind":"arxiv_version","alias_value":"2404.15126v2","created_at":"2026-07-05T09:03:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.15126","created_at":"2026-07-05T09:03:52Z"},{"alias_kind":"pith_short_12","alias_value":"HTTWYYRHURBH","created_at":"2026-07-05T09:03:52Z"},{"alias_kind":"pith_short_16","alias_value":"HTTWYYRHURBHBKSK","created_at":"2026-07-05T09:03:52Z"},{"alias_kind":"pith_short_8","alias_value":"HTTWYYRH","created_at":"2026-07-05T09:03:52Z"}],"graph_snapshots":[{"event_id":"sha256:e33e2125225b386b752fe4300cc11a18832e41ca55fc5c7cb15eb21405c8b6da","target":"graph","created_at":"2026-07-05T09:03:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.15126/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Cayley distance between two permutations $\\pi, \\sigma \\in S_n$ is the minimum number of \\textit{transpositions} required to obtain the permutation $\\sigma$ from $\\pi$. When we only allow adjacent transpositions, the minimum number of such transpositions to obtain $\\sigma$ from $\\pi$ is referred to the Kendall $\\tau$-distance. A set $C$ of permutation words of length $n$ is called a $d$-Cayley permutation code if every pair of distinct permutations in $C$ has Cayley distance at least $d$. A $d$-Kendall permutation code is defined similarly. Let $C(n,d)$ and $K(n,d)$ be the maximum size of a","authors_text":"The Nguyen","cross_cats":["cs.DM","cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-23T15:26:46Z","title":"Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall $\\tau$-Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.15126","kind":"arxiv","version":2},"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:df89ef31ec3eb62cbe23ebb8b412e8894f9c24176f4684e0743664f23bd3215e","target":"record","created_at":"2026-07-05T09:03:52Z","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":"6f38712d9c13d22a29864b7e05d87a7979209cef2322bd3f70b07380ab7f4d94","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-23T15:26:46Z","title_canon_sha256":"0da4d17feb20ad141b71107bb37f941999c84a8fc0c47cc283f6193e2fd2f76c"},"schema_version":"1.0","source":{"id":"2404.15126","kind":"arxiv","version":2}},"canonical_sha256":"3ce76c6227a44270aa4a4f5dd9b36046ad42efafce197ce90cefe844c8cb8fb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ce76c6227a44270aa4a4f5dd9b36046ad42efafce197ce90cefe844c8cb8fb6","first_computed_at":"2026-07-05T09:03:52.897849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:03:52.897849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pj56NTHFG2jTrFJ0fOev71eubDpNvZL9quhnNit4k1fPMj40tkopQmBIxjHeGRwSZHblw2wm9BLwREMTp46PAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:03:52.898270Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.15126","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df89ef31ec3eb62cbe23ebb8b412e8894f9c24176f4684e0743664f23bd3215e","sha256:e33e2125225b386b752fe4300cc11a18832e41ca55fc5c7cb15eb21405c8b6da"],"state_sha256":"01993943fc20de1e78ab769d7dfa1f2e087b26f94bbf35407b030fbbe932ab8b"}