{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NHWCNHC4ONEMGCS65STVQDTSZR","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":"819d27fdaaa545a42a649c72c844c09958694061bca96fc52b83e5bb56b556c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-23T08:57:15Z","title_canon_sha256":"a8151184cd05a1e66482453104fe994dd52a4d513ff5cf7d227e23901880bf1d"},"schema_version":"1.0","source":{"id":"1412.7290","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7290","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7290v1","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7290","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"NHWCNHC4ONEM","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NHWCNHC4ONEMGCS6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NHWCNHC4","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:8c668b41954d489dbedfa4bd3e4e878500929e79fc694c4cb3041cb00d8691f7","target":"graph","created_at":"2026-05-18T02:30:39Z","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 consider a code to be a subset of the vertex set of a Hamming graph. The set of $s$-neighbours of a code is the set of vertices, not in the code, at distance $s$ from some codeword, but not distance less than $s$ from any codeword. A $2$-neighbour transitive code is a code which admits a group $X$ of automorphisms which is transitive on the $s$-neighbours, for $s=1,2$, and transitive on the code itself. We give a classification of $2$-neighbour transitive codes, with minimum distance $\\delta\\geq 5$, for which $X$ acts faithfully on the set of entries of the Hamming graph.","authors_text":"Cheryl E. Praeger, Daniel R. Hawtin, Michael Giudici, Neil I. Gillespie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-23T08:57:15Z","title":"Entry-Faithful $2$-Neighbour Transitive Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7290","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:db8dc8c02ea0bae8a2a979387ec2cf8803bcd7fccc076ebcd9b812edf41dcb4d","target":"record","created_at":"2026-05-18T02:30:39Z","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":"819d27fdaaa545a42a649c72c844c09958694061bca96fc52b83e5bb56b556c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-23T08:57:15Z","title_canon_sha256":"a8151184cd05a1e66482453104fe994dd52a4d513ff5cf7d227e23901880bf1d"},"schema_version":"1.0","source":{"id":"1412.7290","kind":"arxiv","version":1}},"canonical_sha256":"69ec269c5c7348c30a5eeca7580e72cc4af7d4e856d52e0dd8e47ea63ad3fe75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69ec269c5c7348c30a5eeca7580e72cc4af7d4e856d52e0dd8e47ea63ad3fe75","first_computed_at":"2026-05-18T02:30:39.217151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:39.217151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qPJKGTzio2oYI2oMkL9Q86eAtupLkubf7pXo33in4WEiuyc2k4xSzv5EVDnLdmfpG10Yr+/VeLf4TUpH0B81DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:39.217637Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.7290","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db8dc8c02ea0bae8a2a979387ec2cf8803bcd7fccc076ebcd9b812edf41dcb4d","sha256:8c668b41954d489dbedfa4bd3e4e878500929e79fc694c4cb3041cb00d8691f7"],"state_sha256":"2efc97c7eb4de4437287679c10d95daa5d3a22444ca396e94e10d980aa98b265"}