{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:33QYJ6USZXJNL2UPKSZ6BZCZPF","short_pith_number":"pith:33QYJ6US","schema_version":"1.0","canonical_sha256":"dee184fa92cdd2d5ea8f54b3e0e4597955a0156c46d3594aed5c6e3610104648","source":{"kind":"arxiv","id":"1702.02568","version":4},"attestation_state":"computed","paper":{"title":"A note on the automorphism groups of Johnson graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"S. Morteza Mirafzal","submitted_at":"2017-02-08T15:34:12Z","abstract_excerpt":"The Johnson graph $J(n, i)$ is defined as the graph whose vertex set is the set of all $i$-element subsets of $\\{1, . . ., n \\}$, and two vertices are adjacent whenever the cardinality of their intersection is equal to $i$-1. In Ramras and Donovan [SIAM J. Discrete Math, 25(1): 267-270, 2011], it is proved that if $ n \\neq 2i$, then the automorphism group of $J(n, i)$ is isomorphic with the group $Sym(n)$ and it is conjectured that if $n = 2i$, then the automorphism group of $J(n, i)$ is isomorphic with the group $ Sym(n) \\times \\mathbb{Z}_2$. In this paper, we will find these results by diffe"},"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":"1702.02568","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-08T15:34:12Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"fd30659c026111a2219967e5013cf9a183fd5b29272016d75b7675049239f8d2","abstract_canon_sha256":"0160829792c0216de4bdc3aac1907d809d3af35e2d7473b5659c8cfde3be4927"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:55.355543Z","signature_b64":"Kyu701GO16AUK0IGGFVhj+euXPYOU+V8EyDxPZGpBM7qhlODVitQFaTbpWWZAJ9MX9iMc3T0kwuQBnw9K2LWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee184fa92cdd2d5ea8f54b3e0e4597955a0156c46d3594aed5c6e3610104648","last_reissued_at":"2026-05-18T00:32:55.354982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:55.354982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the automorphism groups of Johnson graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"S. Morteza Mirafzal","submitted_at":"2017-02-08T15:34:12Z","abstract_excerpt":"The Johnson graph $J(n, i)$ is defined as the graph whose vertex set is the set of all $i$-element subsets of $\\{1, . . ., n \\}$, and two vertices are adjacent whenever the cardinality of their intersection is equal to $i$-1. In Ramras and Donovan [SIAM J. Discrete Math, 25(1): 267-270, 2011], it is proved that if $ n \\neq 2i$, then the automorphism group of $J(n, i)$ is isomorphic with the group $Sym(n)$ and it is conjectured that if $n = 2i$, then the automorphism group of $J(n, i)$ is isomorphic with the group $ Sym(n) \\times \\mathbb{Z}_2$. In this paper, we will find these results by diffe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02568","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.02568","created_at":"2026-05-18T00:32:55.355071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02568v4","created_at":"2026-05-18T00:32:55.355071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02568","created_at":"2026-05-18T00:32:55.355071+00:00"},{"alias_kind":"pith_short_12","alias_value":"33QYJ6USZXJN","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"33QYJ6USZXJNL2UP","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"33QYJ6US","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF","json":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF.json","graph_json":"https://pith.science/api/pith-number/33QYJ6USZXJNL2UPKSZ6BZCZPF/graph.json","events_json":"https://pith.science/api/pith-number/33QYJ6USZXJNL2UPKSZ6BZCZPF/events.json","paper":"https://pith.science/paper/33QYJ6US"},"agent_actions":{"view_html":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF","download_json":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF.json","view_paper":"https://pith.science/paper/33QYJ6US","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02568&json=true","fetch_graph":"https://pith.science/api/pith-number/33QYJ6USZXJNL2UPKSZ6BZCZPF/graph.json","fetch_events":"https://pith.science/api/pith-number/33QYJ6USZXJNL2UPKSZ6BZCZPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF/action/storage_attestation","attest_author":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF/action/author_attestation","sign_citation":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF/action/citation_signature","submit_replication":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF/action/replication_record"}},"created_at":"2026-05-18T00:32:55.355071+00:00","updated_at":"2026-05-18T00:32:55.355071+00:00"}