{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EOII2W7NBKQCLPX5BRTUD3PDUL","short_pith_number":"pith:EOII2W7N","schema_version":"1.0","canonical_sha256":"23908d5bed0aa025befd0c6741ede3a2c614f862a4549274f711815e6fa28878","source":{"kind":"arxiv","id":"1112.1244","version":1},"attestation_state":"computed","paper":{"title":"Neighbour transitivity on codes in Hamming graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Neil I. Gillespie","submitted_at":"2011-12-06T11:59:03Z","abstract_excerpt":"We consider a \\emph{code} to be a subset of the vertex set of a \\emph{Hamming graph}. In this setting a \\emph{neighbour} of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the \\emph{set of neighbours} of the code. We call these codes \\emph{neighbour transitive}. We obtain sufficient conditions for a neighbour transitive group to fix the code setwise. Moreover, we construct an infinite family of neighbour transitive codes, with \\emph{minimum distance} $\\delta=4$, where t"},"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":"1112.1244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-06T11:59:03Z","cross_cats_sorted":[],"title_canon_sha256":"fb28fa99a513bfa091f105825d568f9fa1fc643780bda551770032296c9f6d35","abstract_canon_sha256":"71469085911d0e85095304a52beb716c6c99586f46a9946df7423966d564fd03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:47.375534Z","signature_b64":"pX6Rhgx97lLFwNuxEWs1tDzYZIhu4pV0HnCkJQbLHhJGmDbtZMp4wS2GgPT9y3LkMyAsvMUGgKIoE1bjHtFgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23908d5bed0aa025befd0c6741ede3a2c614f862a4549274f711815e6fa28878","last_reissued_at":"2026-05-18T02:54:47.375142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:47.375142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neighbour transitivity on codes in Hamming graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Neil I. Gillespie","submitted_at":"2011-12-06T11:59:03Z","abstract_excerpt":"We consider a \\emph{code} to be a subset of the vertex set of a \\emph{Hamming graph}. In this setting a \\emph{neighbour} of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the \\emph{set of neighbours} of the code. We call these codes \\emph{neighbour transitive}. We obtain sufficient conditions for a neighbour transitive group to fix the code setwise. Moreover, we construct an infinite family of neighbour transitive codes, with \\emph{minimum distance} $\\delta=4$, where t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1244","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":"1112.1244","created_at":"2026-05-18T02:54:47.375198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1244v1","created_at":"2026-05-18T02:54:47.375198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1244","created_at":"2026-05-18T02:54:47.375198+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOII2W7NBKQC","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOII2W7NBKQCLPX5","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOII2W7N","created_at":"2026-05-18T12:26:28.662955+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/EOII2W7NBKQCLPX5BRTUD3PDUL","json":"https://pith.science/pith/EOII2W7NBKQCLPX5BRTUD3PDUL.json","graph_json":"https://pith.science/api/pith-number/EOII2W7NBKQCLPX5BRTUD3PDUL/graph.json","events_json":"https://pith.science/api/pith-number/EOII2W7NBKQCLPX5BRTUD3PDUL/events.json","paper":"https://pith.science/paper/EOII2W7N"},"agent_actions":{"view_html":"https://pith.science/pith/EOII2W7NBKQCLPX5BRTUD3PDUL","download_json":"https://pith.science/pith/EOII2W7NBKQCLPX5BRTUD3PDUL.json","view_paper":"https://pith.science/paper/EOII2W7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1244&json=true","fetch_graph":"https://pith.science/api/pith-number/EOII2W7NBKQCLPX5BRTUD3PDUL/graph.json","fetch_events":"https://pith.science/api/pith-number/EOII2W7NBKQCLPX5BRTUD3PDUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOII2W7NBKQCLPX5BRTUD3PDUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOII2W7NBKQCLPX5BRTUD3PDUL/action/storage_attestation","attest_author":"https://pith.science/pith/EOII2W7NBKQCLPX5BRTUD3PDUL/action/author_attestation","sign_citation":"https://pith.science/pith/EOII2W7NBKQCLPX5BRTUD3PDUL/action/citation_signature","submit_replication":"https://pith.science/pith/EOII2W7NBKQCLPX5BRTUD3PDUL/action/replication_record"}},"created_at":"2026-05-18T02:54:47.375198+00:00","updated_at":"2026-05-18T02:54:47.375198+00:00"}