{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:33QYJ6USZXJNL2UPKSZ6BZCZPF","short_pith_number":"pith:33QYJ6US","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"},"canonical_sha256":"dee184fa92cdd2d5ea8f54b3e0e4597955a0156c46d3594aed5c6e3610104648","source":{"kind":"arxiv","id":"1702.02568","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02568","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02568v4","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02568","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"33QYJ6USZXJN","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"33QYJ6USZXJNL2UP","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"33QYJ6US","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:33QYJ6USZXJNL2UPKSZ6BZCZPF","target":"record","payload":{"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"},"canonical_sha256":"dee184fa92cdd2d5ea8f54b3e0e4597955a0156c46d3594aed5c6e3610104648","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"},"source_kind":"arxiv","source_id":"1702.02568","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+COtJtju3xGPsTLgx4SUNFEQpXOAxw5yxx0oAEzk8YpuIS61a5SxGE98MaoXDWm6o1a3TwCQKjzz7sxEerDfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:41:22.499094Z"},"content_sha256":"5a6a3c40567af972eef744919149835af671de1b3671ab75a5065c776bd09c42","schema_version":"1.0","event_id":"sha256:5a6a3c40567af972eef744919149835af671de1b3671ab75a5065c776bd09c42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:33QYJ6USZXJNL2UPKSZ6BZCZPF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DVxG6XNegR2IBxR6+i8g2lXaZ6bJxHRerSFzO5r8tDl0FEmtxgA4JPHN2XHbIcKZYQGzHfYcusxKW+IRjoVLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:41:22.499790Z"},"content_sha256":"8952879ac0547b8a8da5ffa433d3c36b0bc934f9bc0e73fcd1720f8e6a8617c2","schema_version":"1.0","event_id":"sha256:8952879ac0547b8a8da5ffa433d3c36b0bc934f9bc0e73fcd1720f8e6a8617c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF/bundle.json","state_url":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T17:41:22Z","links":{"resolver":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF","bundle":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF/bundle.json","state":"https://pith.science/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33QYJ6USZXJNL2UPKSZ6BZCZPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:33QYJ6USZXJNL2UPKSZ6BZCZPF","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":"0160829792c0216de4bdc3aac1907d809d3af35e2d7473b5659c8cfde3be4927","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-08T15:34:12Z","title_canon_sha256":"fd30659c026111a2219967e5013cf9a183fd5b29272016d75b7675049239f8d2"},"schema_version":"1.0","source":{"id":"1702.02568","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02568","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02568v4","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02568","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"33QYJ6USZXJN","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"33QYJ6USZXJNL2UP","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"33QYJ6US","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:8952879ac0547b8a8da5ffa433d3c36b0bc934f9bc0e73fcd1720f8e6a8617c2","target":"graph","created_at":"2026-05-18T00:32:55Z","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":"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","authors_text":"S. Morteza Mirafzal","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-08T15:34:12Z","title":"A note on the automorphism groups of Johnson graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02568","kind":"arxiv","version":4},"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:5a6a3c40567af972eef744919149835af671de1b3671ab75a5065c776bd09c42","target":"record","created_at":"2026-05-18T00:32:55Z","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":"0160829792c0216de4bdc3aac1907d809d3af35e2d7473b5659c8cfde3be4927","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-08T15:34:12Z","title_canon_sha256":"fd30659c026111a2219967e5013cf9a183fd5b29272016d75b7675049239f8d2"},"schema_version":"1.0","source":{"id":"1702.02568","kind":"arxiv","version":4}},"canonical_sha256":"dee184fa92cdd2d5ea8f54b3e0e4597955a0156c46d3594aed5c6e3610104648","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dee184fa92cdd2d5ea8f54b3e0e4597955a0156c46d3594aed5c6e3610104648","first_computed_at":"2026-05-18T00:32:55.354982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:55.354982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kyu701GO16AUK0IGGFVhj+euXPYOU+V8EyDxPZGpBM7qhlODVitQFaTbpWWZAJ9MX9iMc3T0kwuQBnw9K2LWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:55.355543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02568","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a6a3c40567af972eef744919149835af671de1b3671ab75a5065c776bd09c42","sha256:8952879ac0547b8a8da5ffa433d3c36b0bc934f9bc0e73fcd1720f8e6a8617c2"],"state_sha256":"0d15c8150fa1bad4e238dbb4aab46a7382307a1ffc5d3252ae9bc3a084057b80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MyVGT0Il2N6Q5hsZVljVCwOoO24zEF+MzKraLqsVLhsQ1eIvhW6ndiozADm5owyOW9oGjJjp5GbeQXRk2tf1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:41:22.501962Z","bundle_sha256":"37f78bd85cd49ff5c41ad6503ee9dd11e9b196a998f4d0c5e52dbe46c6a87fdb"}}