{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EXGKRNFY376WXDJ57MDMUAJMQF","short_pith_number":"pith:EXGKRNFY","schema_version":"1.0","canonical_sha256":"25cca8b4b8dffd6b8d3dfb06ca012c814fa5d1c02623040e93563f0b9906a68f","source":{"kind":"arxiv","id":"1308.0398","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.0398","created_at":"2026-05-18T03:16:50.562049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0398v1","created_at":"2026-05-18T03:16:50.562049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0398","created_at":"2026-05-18T03:16:50.562049+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXGKRNFY376W","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXGKRNFY376WXDJ5","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXGKRNFY","created_at":"2026-05-18T12:27:43.054852+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/EXGKRNFY376WXDJ57MDMUAJMQF","json":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF.json","graph_json":"https://pith.science/api/pith-number/EXGKRNFY376WXDJ57MDMUAJMQF/graph.json","events_json":"https://pith.science/api/pith-number/EXGKRNFY376WXDJ57MDMUAJMQF/events.json","paper":"https://pith.science/paper/EXGKRNFY"},"agent_actions":{"view_html":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF","download_json":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF.json","view_paper":"https://pith.science/paper/EXGKRNFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0398&json=true","fetch_graph":"https://pith.science/api/pith-number/EXGKRNFY376WXDJ57MDMUAJMQF/graph.json","fetch_events":"https://pith.science/api/pith-number/EXGKRNFY376WXDJ57MDMUAJMQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF/action/storage_attestation","attest_author":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF/action/author_attestation","sign_citation":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF/action/citation_signature","submit_replication":"https://pith.science/pith/EXGKRNFY376WXDJ57MDMUAJMQF/action/replication_record"}},"created_at":"2026-05-18T03:16:50.562049+00:00","updated_at":"2026-05-18T03:16:50.562049+00:00"}