{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EXGKRNFY376WXDJ57MDMUAJMQF","short_pith_number":"pith:EXGKRNFY","canonical_record":{"source":{"id":"1308.0398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-02T03:33:52Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"8528ed3dfe8c71c0ab5d3d0b4cbd6482ae4697609d268e7224922339fe57c1c8","abstract_canon_sha256":"cadd648a00fd07056f83fe14662621cd8c269dd51601c996133854aa1894218c"},"schema_version":"1.0"},"canonical_sha256":"25cca8b4b8dffd6b8d3dfb06ca012c814fa5d1c02623040e93563f0b9906a68f","source":{"kind":"arxiv","id":"1308.0398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0398","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0398v1","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0398","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"EXGKRNFY376W","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EXGKRNFY376WXDJ5","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EXGKRNFY","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EXGKRNFY376WXDJ57MDMUAJMQF","target":"record","payload":{"canonical_record":{"source":{"id":"1308.0398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-02T03:33:52Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"8528ed3dfe8c71c0ab5d3d0b4cbd6482ae4697609d268e7224922339fe57c1c8","abstract_canon_sha256":"cadd648a00fd07056f83fe14662621cd8c269dd51601c996133854aa1894218c"},"schema_version":"1.0"},"canonical_sha256":"25cca8b4b8dffd6b8d3dfb06ca012c814fa5d1c02623040e93563f0b9906a68f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:50.562616Z","signature_b64":"ngPJ1Z2mD7jK+/Bv31ehjXlyZA+qQZJ6t2TGsCt33/hgPjXy6SsLkbjINYBMW4OX8Z7uBK4PmW6yhVinw0NbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25cca8b4b8dffd6b8d3dfb06ca012c814fa5d1c02623040e93563f0b9906a68f","last_reissued_at":"2026-05-18T03:16:50.561936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:50.561936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.0398","source_version":1,"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-18T03:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZ/3zT+8FoWAugWMfx3v67/aLcmPpz0+SII9jsUAizqh37P5IgyJ5ltgASijsMHXRVkCx8el+sVMvbGlY7qBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:37:09.482476Z"},"content_sha256":"7544b40d3c8b4b4abbd768f5e71d5f620ee75f18dae5d0e75b7fb7d7cdf3ae03","schema_version":"1.0","event_id":"sha256:7544b40d3c8b4b4abbd768f5e71d5f620ee75f18dae5d0e75b7fb7d7cdf3ae03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EXGKRNFY376WXDJ57MDMUAJMQF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sporadic neighbour-transitive codes in Johnson graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Cheryl E Praeger, Max Neunhoeffer","submitted_at":"2013-08-02T03:33:52Z","abstract_excerpt":"We classify the neighbour-transitive codes in Johnson graphs J(v, k) of minimum distance at least three which admit a neighbour-transitive group of automorphisms that is an almost simple two-transitive group of degree v and does not occur in an infinite family of two-transitive groups. The result of this classification is a table of 22 codes with these properties. Many have relatively large minimum distance in comparison to their length v and number of code words. We construct an additional five neighbour-transitive codes with minimum distance two admitting such a group. All 27 codes are t-des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0398","kind":"arxiv","version":1},"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-18T03:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gNAytWmrilUFAVezyJikjiUf54x9+0K0o8QEWpdfOVSctvyOCa6En4BL7CYkzErQHwd8oDnYtAbW5iFH4P5oBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:37:09.483119Z"},"content_sha256":"ad3375a8d963ec0fe1c933472562c3a584a47b5ffabc67c197722e269558b976","schema_version":"1.0","event_id":"sha256:ad3375a8d963ec0fe1c933472562c3a584a47b5ffabc67c197722e269558b976"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF/bundle.json","state_url":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXGKRNFY376WXDJ57MDMUAJMQF/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-05-31T03:37:09Z","links":{"resolver":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF","bundle":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF/bundle.json","state":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXGKRNFY376WXDJ57MDMUAJMQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EXGKRNFY376WXDJ57MDMUAJMQF","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":"cadd648a00fd07056f83fe14662621cd8c269dd51601c996133854aa1894218c","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-02T03:33:52Z","title_canon_sha256":"8528ed3dfe8c71c0ab5d3d0b4cbd6482ae4697609d268e7224922339fe57c1c8"},"schema_version":"1.0","source":{"id":"1308.0398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0398","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0398v1","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0398","created_at":"2026-05-18T03:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"EXGKRNFY376W","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EXGKRNFY376WXDJ5","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EXGKRNFY","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:ad3375a8d963ec0fe1c933472562c3a584a47b5ffabc67c197722e269558b976","target":"graph","created_at":"2026-05-18T03:16:50Z","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":"We classify the neighbour-transitive codes in Johnson graphs J(v, k) of minimum distance at least three which admit a neighbour-transitive group of automorphisms that is an almost simple two-transitive group of degree v and does not occur in an infinite family of two-transitive groups. The result of this classification is a table of 22 codes with these properties. Many have relatively large minimum distance in comparison to their length v and number of code words. We construct an additional five neighbour-transitive codes with minimum distance two admitting such a group. All 27 codes are t-des","authors_text":"Cheryl E Praeger, Max Neunhoeffer","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-02T03:33:52Z","title":"Sporadic neighbour-transitive codes in Johnson graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0398","kind":"arxiv","version":1},"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:7544b40d3c8b4b4abbd768f5e71d5f620ee75f18dae5d0e75b7fb7d7cdf3ae03","target":"record","created_at":"2026-05-18T03:16:50Z","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":"cadd648a00fd07056f83fe14662621cd8c269dd51601c996133854aa1894218c","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-02T03:33:52Z","title_canon_sha256":"8528ed3dfe8c71c0ab5d3d0b4cbd6482ae4697609d268e7224922339fe57c1c8"},"schema_version":"1.0","source":{"id":"1308.0398","kind":"arxiv","version":1}},"canonical_sha256":"25cca8b4b8dffd6b8d3dfb06ca012c814fa5d1c02623040e93563f0b9906a68f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25cca8b4b8dffd6b8d3dfb06ca012c814fa5d1c02623040e93563f0b9906a68f","first_computed_at":"2026-05-18T03:16:50.561936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:50.561936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ngPJ1Z2mD7jK+/Bv31ehjXlyZA+qQZJ6t2TGsCt33/hgPjXy6SsLkbjINYBMW4OX8Z7uBK4PmW6yhVinw0NbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:50.562616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7544b40d3c8b4b4abbd768f5e71d5f620ee75f18dae5d0e75b7fb7d7cdf3ae03","sha256:ad3375a8d963ec0fe1c933472562c3a584a47b5ffabc67c197722e269558b976"],"state_sha256":"7a5b214eebf10df9b5b3f8bd4eabb66ae93c1b9bb09c67e18f2654d6c3b91229"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VQ4x+siTjMM7Ch4JA/D6fomHXRuwCdjwAHXFrzIzj9yaok3jeLbcvbag9NtJpzMu05F8D1WgaUlZ9hgb5BJOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:37:09.486153Z","bundle_sha256":"85154f011a31b20f4de59d8c7072745b1a239466efae6aca0a485ec9598a1975"}}