{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:57H7TRKXMA3445IT3S5IORMG2X","short_pith_number":"pith:57H7TRKX","canonical_record":{"source":{"id":"1702.02095","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-02-07T16:52:10Z","cross_cats_sorted":[],"title_canon_sha256":"4ac5d7a0f719b6758b4a021a98cade026524be4a7273fc02cc505770448707ab","abstract_canon_sha256":"0ed74cf082b18211d8fef5fdf6bffadb151b2d62ab707a84ec284377ce534070"},"schema_version":"1.0"},"canonical_sha256":"efcff9c5576037ce7513dcba874586d5da0efdf6b98fc4dcebe11e76deb95683","source":{"kind":"arxiv","id":"1702.02095","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02095","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02095v5","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02095","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"57H7TRKXMA34","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"57H7TRKXMA3445IT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"57H7TRKX","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:57H7TRKXMA3445IT3S5IORMG2X","target":"record","payload":{"canonical_record":{"source":{"id":"1702.02095","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-02-07T16:52:10Z","cross_cats_sorted":[],"title_canon_sha256":"4ac5d7a0f719b6758b4a021a98cade026524be4a7273fc02cc505770448707ab","abstract_canon_sha256":"0ed74cf082b18211d8fef5fdf6bffadb151b2d62ab707a84ec284377ce534070"},"schema_version":"1.0"},"canonical_sha256":"efcff9c5576037ce7513dcba874586d5da0efdf6b98fc4dcebe11e76deb95683","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:13.842830Z","signature_b64":"mgHAV3dKOydN1QWWBOv+u6GmtVrT3ZnnUvGzeQRH1ocIE7NVVt5TmtTOWmvJEiyUwNkvAqo3RP0cWzQ90mUrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efcff9c5576037ce7513dcba874586d5da0efdf6b98fc4dcebe11e76deb95683","last_reissued_at":"2026-05-18T00:35:13.842373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:13.842373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.02095","source_version":5,"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:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKZHtgbm+EnChk8Yjl0naXq/9aKLHXQHq60+Gy5QV/cRIwQ6Kiyqv6hvjFfkY5bxmYUNedLTnulVq4E03uPgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:20:59.268174Z"},"content_sha256":"c5d8d1f1ebd642d94ac014acced4255ebf15ea12b6522e6909716f0bc8d37e39","schema_version":"1.0","event_id":"sha256:c5d8d1f1ebd642d94ac014acced4255ebf15ea12b6522e6909716f0bc8d37e39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:57H7TRKXMA3445IT3S5IORMG2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More odd graph theory from another point of view","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"S. Morteza Mirafzal","submitted_at":"2017-02-07T16:52:10Z","abstract_excerpt":"The Kneser graph $K(n, k)$ has as vertices all $k$-element subsets of $[n]=\\{1,2,...,n \\}$ and an edge between any two vertices that are disjoint. If $n=2k+1$, then $K(n, k)$ is called an odd graph. Let $ n >4$ and $1< k < \\frac{n}{2} $. In the present paper, we show that if the Kneser graph $K(n,k)$ is of even order where $n$ is an odd integer or both of the integers $n,k $ are even, then $K(n,k)$ is a vertex-transitive non Cayley graph. Although, these are special cases of Godsil [8], unlike his proof that uses some very deep group-theoretical facts, ours uses no heavy group-theoretic facts."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02095","kind":"arxiv","version":5},"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:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfcKMEIaHs0b08qiXxcQ8RtoN3uD4Y1Bh1gbTokE9Y9O+RCL3HkqXEYvP2r2GAEC9NuyNeNHEyla97EgmrwPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:20:59.268923Z"},"content_sha256":"33b7f6bfb773aeec9b29cbb0b8f7399a8b8bcc3c7aec3ccf0279e7a91460ee51","schema_version":"1.0","event_id":"sha256:33b7f6bfb773aeec9b29cbb0b8f7399a8b8bcc3c7aec3ccf0279e7a91460ee51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57H7TRKXMA3445IT3S5IORMG2X/bundle.json","state_url":"https://pith.science/pith/57H7TRKXMA3445IT3S5IORMG2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57H7TRKXMA3445IT3S5IORMG2X/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-11T16:20:59Z","links":{"resolver":"https://pith.science/pith/57H7TRKXMA3445IT3S5IORMG2X","bundle":"https://pith.science/pith/57H7TRKXMA3445IT3S5IORMG2X/bundle.json","state":"https://pith.science/pith/57H7TRKXMA3445IT3S5IORMG2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57H7TRKXMA3445IT3S5IORMG2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:57H7TRKXMA3445IT3S5IORMG2X","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":"0ed74cf082b18211d8fef5fdf6bffadb151b2d62ab707a84ec284377ce534070","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-02-07T16:52:10Z","title_canon_sha256":"4ac5d7a0f719b6758b4a021a98cade026524be4a7273fc02cc505770448707ab"},"schema_version":"1.0","source":{"id":"1702.02095","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02095","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02095v5","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02095","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"57H7TRKXMA34","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"57H7TRKXMA3445IT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"57H7TRKX","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:33b7f6bfb773aeec9b29cbb0b8f7399a8b8bcc3c7aec3ccf0279e7a91460ee51","target":"graph","created_at":"2026-05-18T00:35:13Z","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 Kneser graph $K(n, k)$ has as vertices all $k$-element subsets of $[n]=\\{1,2,...,n \\}$ and an edge between any two vertices that are disjoint. If $n=2k+1$, then $K(n, k)$ is called an odd graph. Let $ n >4$ and $1< k < \\frac{n}{2} $. In the present paper, we show that if the Kneser graph $K(n,k)$ is of even order where $n$ is an odd integer or both of the integers $n,k $ are even, then $K(n,k)$ is a vertex-transitive non Cayley graph. Although, these are special cases of Godsil [8], unlike his proof that uses some very deep group-theoretical facts, ours uses no heavy group-theoretic facts.","authors_text":"S. Morteza Mirafzal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-02-07T16:52:10Z","title":"More odd graph theory from another point of view"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02095","kind":"arxiv","version":5},"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:c5d8d1f1ebd642d94ac014acced4255ebf15ea12b6522e6909716f0bc8d37e39","target":"record","created_at":"2026-05-18T00:35:13Z","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":"0ed74cf082b18211d8fef5fdf6bffadb151b2d62ab707a84ec284377ce534070","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-02-07T16:52:10Z","title_canon_sha256":"4ac5d7a0f719b6758b4a021a98cade026524be4a7273fc02cc505770448707ab"},"schema_version":"1.0","source":{"id":"1702.02095","kind":"arxiv","version":5}},"canonical_sha256":"efcff9c5576037ce7513dcba874586d5da0efdf6b98fc4dcebe11e76deb95683","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efcff9c5576037ce7513dcba874586d5da0efdf6b98fc4dcebe11e76deb95683","first_computed_at":"2026-05-18T00:35:13.842373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:13.842373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mgHAV3dKOydN1QWWBOv+u6GmtVrT3ZnnUvGzeQRH1ocIE7NVVt5TmtTOWmvJEiyUwNkvAqo3RP0cWzQ90mUrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:13.842830Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02095","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5d8d1f1ebd642d94ac014acced4255ebf15ea12b6522e6909716f0bc8d37e39","sha256:33b7f6bfb773aeec9b29cbb0b8f7399a8b8bcc3c7aec3ccf0279e7a91460ee51"],"state_sha256":"089df10e0a993eaede8387b80b656c4eadaf179a43e9db946f6b1b522b170678"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1rcG14gIcKPwHng+MierqiOA2pjTxA7bv5gNdaKjzp7JgJSQG1Z1v7HgX8VRAwuDmKlPc5tXoDY/mh4dx+zDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:20:59.273766Z","bundle_sha256":"87b82abfd155cbcea1f563e3297331fe04cac11a302f2a87d393793893b23945"}}