{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HTTWYYRHURBHBKSKJ5O5TM3AI2","short_pith_number":"pith:HTTWYYRH","schema_version":"1.0","canonical_sha256":"3ce76c6227a44270aa4a4f5dd9b36046ad42efafce197ce90cefe844c8cb8fb6","source":{"kind":"arxiv","id":"2404.15126","version":2},"attestation_state":"computed","paper":{"title":"Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall $\\tau$-Metric","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"The Nguyen","submitted_at":"2024-04-23T15:26:46Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2404.15126","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-23T15:26:46Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"title_canon_sha256":"0da4d17feb20ad141b71107bb37f941999c84a8fc0c47cc283f6193e2fd2f76c","abstract_canon_sha256":"6f38712d9c13d22a29864b7e05d87a7979209cef2322bd3f70b07380ab7f4d94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:52.898270Z","signature_b64":"pj56NTHFG2jTrFJ0fOev71eubDpNvZL9quhnNit4k1fPMj40tkopQmBIxjHeGRwSZHblw2wm9BLwREMTp46PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ce76c6227a44270aa4a4f5dd9b36046ad42efafce197ce90cefe844c8cb8fb6","last_reissued_at":"2026-07-05T09:03:52.897849Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:52.897849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall $\\tau$-Metric","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"The Nguyen","submitted_at":"2024-04-23T15:26:46Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.15126","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.15126/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.15126","created_at":"2026-07-05T09:03:52.897908+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.15126v2","created_at":"2026-07-05T09:03:52.897908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.15126","created_at":"2026-07-05T09:03:52.897908+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTTWYYRHURBH","created_at":"2026-07-05T09:03:52.897908+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTTWYYRHURBHBKSK","created_at":"2026-07-05T09:03:52.897908+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTTWYYRH","created_at":"2026-07-05T09:03:52.897908+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25478","citing_title":"Transcripts and Algebraic Distances in Time Series: Stochastic Properties and Nonparametric Dependence Tests","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26572","citing_title":"Using Transcripts for Nonparametric Monitoring of Serial Dependence","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29780","citing_title":"Entropic and algebraic transcript-based tools in time series analysis","ref_index":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HTTWYYRHURBHBKSKJ5O5TM3AI2","json":"https://pith.science/pith/HTTWYYRHURBHBKSKJ5O5TM3AI2.json","graph_json":"https://pith.science/api/pith-number/HTTWYYRHURBHBKSKJ5O5TM3AI2/graph.json","events_json":"https://pith.science/api/pith-number/HTTWYYRHURBHBKSKJ5O5TM3AI2/events.json","paper":"https://pith.science/paper/HTTWYYRH"},"agent_actions":{"view_html":"https://pith.science/pith/HTTWYYRHURBHBKSKJ5O5TM3AI2","download_json":"https://pith.science/pith/HTTWYYRHURBHBKSKJ5O5TM3AI2.json","view_paper":"https://pith.science/paper/HTTWYYRH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.15126&json=true","fetch_graph":"https://pith.science/api/pith-number/HTTWYYRHURBHBKSKJ5O5TM3AI2/graph.json","fetch_events":"https://pith.science/api/pith-number/HTTWYYRHURBHBKSKJ5O5TM3AI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTTWYYRHURBHBKSKJ5O5TM3AI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTTWYYRHURBHBKSKJ5O5TM3AI2/action/storage_attestation","attest_author":"https://pith.science/pith/HTTWYYRHURBHBKSKJ5O5TM3AI2/action/author_attestation","sign_citation":"https://pith.science/pith/HTTWYYRHURBHBKSKJ5O5TM3AI2/action/citation_signature","submit_replication":"https://pith.science/pith/HTTWYYRHURBHBKSKJ5O5TM3AI2/action/replication_record"}},"created_at":"2026-07-05T09:03:52.897908+00:00","updated_at":"2026-07-05T09:03:52.897908+00:00"}