{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:B3S6EN5UTYYXO63R32PNS7JH2Q","short_pith_number":"pith:B3S6EN5U","schema_version":"1.0","canonical_sha256":"0ee5e237b49e31777b71de9ed97d27d4073dfd69992f855aeed461f082d1b7c2","source":{"kind":"arxiv","id":"1405.5427","version":1},"attestation_state":"computed","paper":{"title":"Characterisation of a family of neighbour transitive codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Neil I. Gillespie","submitted_at":"2014-05-21T14:02:34Z","abstract_excerpt":"We consider codes of length $m$ over an alphabet of size $q$ as subsets of the vertex set of the Hamming graph $\\Gamma=H(m,q)$. A code for which there exists an automorphism group $X\\leq Aut(\\Gamma)$ that acts transitively on the code and on its set of neighbours is said to be neighbour transitive, and were introduced by the authors as a group theoretic analogue to the assumption that single errors are equally likely over a noisy channel. Examples of neighbour transitive codes include the Hamming codes, various Golay codes, certain Hadamard codes, the Nordstrom Robinson codes, certain permutat"},"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":"1405.5427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-21T14:02:34Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"3ff705056462a11042fe5a4fb7e0731e7d3c69503c473e3e791bfad448039ade","abstract_canon_sha256":"ebc2e2527e9a773eba9c9b5ce64a42e0861666425ef75117f03fd6c8c2b47c99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:24.218379Z","signature_b64":"CcEZ4FISwENkAzq6O5obgmbdgr+6pRjHP3tWKTQUTvkDj0MZCNboVzWnBYk3YWBhs/omtLHmJ6GP+D+bGDSdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ee5e237b49e31777b71de9ed97d27d4073dfd69992f855aeed461f082d1b7c2","last_reissued_at":"2026-05-18T02:51:24.217809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:24.217809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterisation of a family of neighbour transitive codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Neil I. Gillespie","submitted_at":"2014-05-21T14:02:34Z","abstract_excerpt":"We consider codes of length $m$ over an alphabet of size $q$ as subsets of the vertex set of the Hamming graph $\\Gamma=H(m,q)$. A code for which there exists an automorphism group $X\\leq Aut(\\Gamma)$ that acts transitively on the code and on its set of neighbours is said to be neighbour transitive, and were introduced by the authors as a group theoretic analogue to the assumption that single errors are equally likely over a noisy channel. Examples of neighbour transitive codes include the Hamming codes, various Golay codes, certain Hadamard codes, the Nordstrom Robinson codes, certain permutat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5427","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":"1405.5427","created_at":"2026-05-18T02:51:24.217903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5427v1","created_at":"2026-05-18T02:51:24.217903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5427","created_at":"2026-05-18T02:51:24.217903+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3S6EN5UTYYX","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3S6EN5UTYYXO63R","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3S6EN5U","created_at":"2026-05-18T12:28:19.803747+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/B3S6EN5UTYYXO63R32PNS7JH2Q","json":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q.json","graph_json":"https://pith.science/api/pith-number/B3S6EN5UTYYXO63R32PNS7JH2Q/graph.json","events_json":"https://pith.science/api/pith-number/B3S6EN5UTYYXO63R32PNS7JH2Q/events.json","paper":"https://pith.science/paper/B3S6EN5U"},"agent_actions":{"view_html":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q","download_json":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q.json","view_paper":"https://pith.science/paper/B3S6EN5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5427&json=true","fetch_graph":"https://pith.science/api/pith-number/B3S6EN5UTYYXO63R32PNS7JH2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/B3S6EN5UTYYXO63R32PNS7JH2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q/action/storage_attestation","attest_author":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q/action/author_attestation","sign_citation":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q/action/citation_signature","submit_replication":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q/action/replication_record"}},"created_at":"2026-05-18T02:51:24.217903+00:00","updated_at":"2026-05-18T02:51:24.217903+00:00"}