{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NHWCNHC4ONEMGCS65STVQDTSZR","short_pith_number":"pith:NHWCNHC4","canonical_record":{"source":{"id":"1412.7290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-23T08:57:15Z","cross_cats_sorted":[],"title_canon_sha256":"a8151184cd05a1e66482453104fe994dd52a4d513ff5cf7d227e23901880bf1d","abstract_canon_sha256":"819d27fdaaa545a42a649c72c844c09958694061bca96fc52b83e5bb56b556c6"},"schema_version":"1.0"},"canonical_sha256":"69ec269c5c7348c30a5eeca7580e72cc4af7d4e856d52e0dd8e47ea63ad3fe75","source":{"kind":"arxiv","id":"1412.7290","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NHWCNHC4ONEMGCS65STVQDTSZR","target":"record","payload":{"canonical_record":{"source":{"id":"1412.7290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-23T08:57:15Z","cross_cats_sorted":[],"title_canon_sha256":"a8151184cd05a1e66482453104fe994dd52a4d513ff5cf7d227e23901880bf1d","abstract_canon_sha256":"819d27fdaaa545a42a649c72c844c09958694061bca96fc52b83e5bb56b556c6"},"schema_version":"1.0"},"canonical_sha256":"69ec269c5c7348c30a5eeca7580e72cc4af7d4e856d52e0dd8e47ea63ad3fe75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:39.217637Z","signature_b64":"qPJKGTzio2oYI2oMkL9Q86eAtupLkubf7pXo33in4WEiuyc2k4xSzv5EVDnLdmfpG10Yr+/VeLf4TUpH0B81DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69ec269c5c7348c30a5eeca7580e72cc4af7d4e856d52e0dd8e47ea63ad3fe75","last_reissued_at":"2026-05-18T02:30:39.217151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:39.217151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.7290","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-18T02:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qRSY/xOqN1AgXgOfDDiUt/eoFPsOI11/Q7i2KoMIpZ/9fAul3QEjzy6W91K3N3BGuVKNtQgxSlByoL4JEXfrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:27:34.608849Z"},"content_sha256":"db8dc8c02ea0bae8a2a979387ec2cf8803bcd7fccc076ebcd9b812edf41dcb4d","schema_version":"1.0","event_id":"sha256:db8dc8c02ea0bae8a2a979387ec2cf8803bcd7fccc076ebcd9b812edf41dcb4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NHWCNHC4ONEMGCS65STVQDTSZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entry-Faithful $2$-Neighbour Transitive Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Daniel R. Hawtin, Michael Giudici, Neil I. Gillespie","submitted_at":"2014-12-23T08:57:15Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7290","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-18T02:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OjdS5fuQKaJBFXZJtEQPxfQyvUptVwSaTU56572Td9WyGIvnit+sAQSOUVlz5znzH7lDfU4Euiw1aIjLz1hABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:27:34.609551Z"},"content_sha256":"8c668b41954d489dbedfa4bd3e4e878500929e79fc694c4cb3041cb00d8691f7","schema_version":"1.0","event_id":"sha256:8c668b41954d489dbedfa4bd3e4e878500929e79fc694c4cb3041cb00d8691f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHWCNHC4ONEMGCS65STVQDTSZR/bundle.json","state_url":"https://pith.science/pith/NHWCNHC4ONEMGCS65STVQDTSZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHWCNHC4ONEMGCS65STVQDTSZR/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-26T08:27:34Z","links":{"resolver":"https://pith.science/pith/NHWCNHC4ONEMGCS65STVQDTSZR","bundle":"https://pith.science/pith/NHWCNHC4ONEMGCS65STVQDTSZR/bundle.json","state":"https://pith.science/pith/NHWCNHC4ONEMGCS65STVQDTSZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHWCNHC4ONEMGCS65STVQDTSZR/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pN41RK5PPxgtpe8Z9QNBamHWGxmaxK6onELgpUHi4/qVH8haJ/NtcBUKGTevRURPuonTqBBrFPZtOiknDjoBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:27:34.613192Z","bundle_sha256":"7519fb87b22b59088565adff71c4cb0cc5235383050849b3fa1269c35e833aab"}}