{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B3S6EN5UTYYXO63R32PNS7JH2Q","short_pith_number":"pith:B3S6EN5U","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"},"canonical_sha256":"0ee5e237b49e31777b71de9ed97d27d4073dfd69992f855aeed461f082d1b7c2","source":{"kind":"arxiv","id":"1405.5427","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5427","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5427v1","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5427","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"B3S6EN5UTYYX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B3S6EN5UTYYXO63R","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B3S6EN5U","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B3S6EN5UTYYXO63R32PNS7JH2Q","target":"record","payload":{"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"},"canonical_sha256":"0ee5e237b49e31777b71de9ed97d27d4073dfd69992f855aeed461f082d1b7c2","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"},"source_kind":"arxiv","source_id":"1405.5427","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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ogYRqj1SMkFsYYMEDCwFeFqL5yZRWc6Ld1uM0JVGj30YqIH0vjsnUc4aKmR/DduXgrorLk2AKMUJbgSumZoFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:37:46.195457Z"},"content_sha256":"4abb24c1666b501201af1bf07ef1d1da60d4068df2b167022587474439a06141","schema_version":"1.0","event_id":"sha256:4abb24c1666b501201af1bf07ef1d1da60d4068df2b167022587474439a06141"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B3S6EN5UTYYXO63R32PNS7JH2Q","target":"graph","payload":{"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"},"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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ESYdPE3VY9xzL5T4A9+6EMDdPCHGl7GW+FJSGRT6brZc+eZsZBS2X1cdhzya4Iv68XFif6gAjqqb2V/iFAGvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:37:46.196137Z"},"content_sha256":"4dac8d08de53de969a1f527c5cd76fee50cc748a5a32dbb8f5728c4d04ee7c91","schema_version":"1.0","event_id":"sha256:4dac8d08de53de969a1f527c5cd76fee50cc748a5a32dbb8f5728c4d04ee7c91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q/bundle.json","state_url":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3S6EN5UTYYXO63R32PNS7JH2Q/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-26T12:37:46Z","links":{"resolver":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q","bundle":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q/bundle.json","state":"https://pith.science/pith/B3S6EN5UTYYXO63R32PNS7JH2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3S6EN5UTYYXO63R32PNS7JH2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B3S6EN5UTYYXO63R32PNS7JH2Q","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":"ebc2e2527e9a773eba9c9b5ce64a42e0861666425ef75117f03fd6c8c2b47c99","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-21T14:02:34Z","title_canon_sha256":"3ff705056462a11042fe5a4fb7e0731e7d3c69503c473e3e791bfad448039ade"},"schema_version":"1.0","source":{"id":"1405.5427","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5427","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5427v1","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5427","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"B3S6EN5UTYYX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B3S6EN5UTYYXO63R","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B3S6EN5U","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:4dac8d08de53de969a1f527c5cd76fee50cc748a5a32dbb8f5728c4d04ee7c91","target":"graph","created_at":"2026-05-18T02:51:24Z","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 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","authors_text":"Cheryl E. Praeger, Neil I. Gillespie","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-21T14:02:34Z","title":"Characterisation of a family of neighbour transitive codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5427","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:4abb24c1666b501201af1bf07ef1d1da60d4068df2b167022587474439a06141","target":"record","created_at":"2026-05-18T02:51:24Z","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":"ebc2e2527e9a773eba9c9b5ce64a42e0861666425ef75117f03fd6c8c2b47c99","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-21T14:02:34Z","title_canon_sha256":"3ff705056462a11042fe5a4fb7e0731e7d3c69503c473e3e791bfad448039ade"},"schema_version":"1.0","source":{"id":"1405.5427","kind":"arxiv","version":1}},"canonical_sha256":"0ee5e237b49e31777b71de9ed97d27d4073dfd69992f855aeed461f082d1b7c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ee5e237b49e31777b71de9ed97d27d4073dfd69992f855aeed461f082d1b7c2","first_computed_at":"2026-05-18T02:51:24.217809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:24.217809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CcEZ4FISwENkAzq6O5obgmbdgr+6pRjHP3tWKTQUTvkDj0MZCNboVzWnBYk3YWBhs/omtLHmJ6GP+D+bGDSdDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:24.218379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5427","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4abb24c1666b501201af1bf07ef1d1da60d4068df2b167022587474439a06141","sha256:4dac8d08de53de969a1f527c5cd76fee50cc748a5a32dbb8f5728c4d04ee7c91"],"state_sha256":"fe35016f4532a54512b1fb4b3d977a07d3890ffb33cc0a86d1cdd2c68f9c7fea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2VSUFqbhfYIqMEV7eOoJYqeGxxfgIVNZ4lU6hw+bbyb0YuL/5gdvu2vMIKPDO24VOcVDS3s38dLILQdXEnVYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:37:46.199615Z","bundle_sha256":"f95fb4b6436c2f628ed7437a01bc2f332148527e1e150f24d5e2c5b93e6632de"}}