{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TGLBEXK4APYXVGFPVIYFH75PSJ","short_pith_number":"pith:TGLBEXK4","canonical_record":{"source":{"id":"1806.10514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-27T15:00:23Z","cross_cats_sorted":[],"title_canon_sha256":"2ccc94882f9a526fb7ef9673a8e1522afc793704cb1058a166a56c622c4d2c55","abstract_canon_sha256":"e0fdeadef829b53f826f9ea77c1b22e424c8af216e44b63f73ee22b76d7dc847"},"schema_version":"1.0"},"canonical_sha256":"9996125d5c03f17a98afaa3053ffaf925c015c4a5d5a3a26e346896650d6a135","source":{"kind":"arxiv","id":"1806.10514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10514","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10514v1","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10514","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"TGLBEXK4APYX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TGLBEXK4APYXVGFP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TGLBEXK4","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TGLBEXK4APYXVGFPVIYFH75PSJ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.10514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-27T15:00:23Z","cross_cats_sorted":[],"title_canon_sha256":"2ccc94882f9a526fb7ef9673a8e1522afc793704cb1058a166a56c622c4d2c55","abstract_canon_sha256":"e0fdeadef829b53f826f9ea77c1b22e424c8af216e44b63f73ee22b76d7dc847"},"schema_version":"1.0"},"canonical_sha256":"9996125d5c03f17a98afaa3053ffaf925c015c4a5d5a3a26e346896650d6a135","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:12.144184Z","signature_b64":"LVgeaLiLJrxkGRAasKUh1lhmsFsOPnpb3VjWfjAS8GTnoyMtBrGykrvyVWE58o6qoueFBrkeNVcnpM1GFM6IAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9996125d5c03f17a98afaa3053ffaf925c015c4a5d5a3a26e346896650d6a135","last_reissued_at":"2026-05-18T00:12:12.143475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:12.143475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.10514","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-18T00:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m4SySXjM+R1RZHV85Nqk3wyV+3zE0PocE9pvg56ePWPj0zh70KGKFQ2fZd8MccjHicZdpuMAS0JRF5SqUqtjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:28:36.668659Z"},"content_sha256":"97a6133745121ecc7847e07c35b052b472fb74320a4b23e32467cf3fb87c3a00","schema_version":"1.0","event_id":"sha256:97a6133745121ecc7847e07c35b052b472fb74320a4b23e32467cf3fb87c3a00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TGLBEXK4APYXVGFPVIYFH75PSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$2$-Neighbour-Transitive Codes with Small Blocks of Imprimitivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Daniel R. Hawtin, Neil I. Gillespie","submitted_at":"2018-06-27T15:00:23Z","abstract_excerpt":"A code $C$ in the Hamming graph $\\varGamma=H(m,q)$ is $2\\it{\\text{-neighbour-transitive}}$ if ${\\rm Aut}(C)$ acts transitively on each of $C=C_0$, $C_1$ and $C_2$, the first three parts of the distance partition of $V\\varGamma$ with respect to $C$. Previous classifications of families of $2$-neighbour-transitive codes leave only those with an affine action on the alphabet to be investigated. Here, $2$-neighbour-transitive codes with minimum distance at least $5$ and that contain \"small\" subcodes as blocks of imprimitivity are classified. When considering codes with minimum distance at least $5"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10514","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-18T00:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXKD3FQLTl0Lc5b51XInx5dnauZkBbCLGA7p6+ospZOJ9yYYbEP8oDybiyye7vHToUSNLTT8aWprp/l3/SazDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:28:36.669368Z"},"content_sha256":"490fba1401e16605f6c224f1ac23132e3ddd182071eda17f225c3cdbfce2bed1","schema_version":"1.0","event_id":"sha256:490fba1401e16605f6c224f1ac23132e3ddd182071eda17f225c3cdbfce2bed1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGLBEXK4APYXVGFPVIYFH75PSJ/bundle.json","state_url":"https://pith.science/pith/TGLBEXK4APYXVGFPVIYFH75PSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGLBEXK4APYXVGFPVIYFH75PSJ/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:28:36Z","links":{"resolver":"https://pith.science/pith/TGLBEXK4APYXVGFPVIYFH75PSJ","bundle":"https://pith.science/pith/TGLBEXK4APYXVGFPVIYFH75PSJ/bundle.json","state":"https://pith.science/pith/TGLBEXK4APYXVGFPVIYFH75PSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGLBEXK4APYXVGFPVIYFH75PSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TGLBEXK4APYXVGFPVIYFH75PSJ","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":"e0fdeadef829b53f826f9ea77c1b22e424c8af216e44b63f73ee22b76d7dc847","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-27T15:00:23Z","title_canon_sha256":"2ccc94882f9a526fb7ef9673a8e1522afc793704cb1058a166a56c622c4d2c55"},"schema_version":"1.0","source":{"id":"1806.10514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10514","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10514v1","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10514","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"TGLBEXK4APYX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TGLBEXK4APYXVGFP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TGLBEXK4","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:490fba1401e16605f6c224f1ac23132e3ddd182071eda17f225c3cdbfce2bed1","target":"graph","created_at":"2026-05-18T00:12:12Z","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":"A code $C$ in the Hamming graph $\\varGamma=H(m,q)$ is $2\\it{\\text{-neighbour-transitive}}$ if ${\\rm Aut}(C)$ acts transitively on each of $C=C_0$, $C_1$ and $C_2$, the first three parts of the distance partition of $V\\varGamma$ with respect to $C$. Previous classifications of families of $2$-neighbour-transitive codes leave only those with an affine action on the alphabet to be investigated. Here, $2$-neighbour-transitive codes with minimum distance at least $5$ and that contain \"small\" subcodes as blocks of imprimitivity are classified. When considering codes with minimum distance at least $5","authors_text":"Cheryl E. Praeger, Daniel R. Hawtin, Neil I. Gillespie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-27T15:00:23Z","title":"$2$-Neighbour-Transitive Codes with Small Blocks of Imprimitivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10514","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:97a6133745121ecc7847e07c35b052b472fb74320a4b23e32467cf3fb87c3a00","target":"record","created_at":"2026-05-18T00:12:12Z","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":"e0fdeadef829b53f826f9ea77c1b22e424c8af216e44b63f73ee22b76d7dc847","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-27T15:00:23Z","title_canon_sha256":"2ccc94882f9a526fb7ef9673a8e1522afc793704cb1058a166a56c622c4d2c55"},"schema_version":"1.0","source":{"id":"1806.10514","kind":"arxiv","version":1}},"canonical_sha256":"9996125d5c03f17a98afaa3053ffaf925c015c4a5d5a3a26e346896650d6a135","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9996125d5c03f17a98afaa3053ffaf925c015c4a5d5a3a26e346896650d6a135","first_computed_at":"2026-05-18T00:12:12.143475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:12.143475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LVgeaLiLJrxkGRAasKUh1lhmsFsOPnpb3VjWfjAS8GTnoyMtBrGykrvyVWE58o6qoueFBrkeNVcnpM1GFM6IAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:12.144184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97a6133745121ecc7847e07c35b052b472fb74320a4b23e32467cf3fb87c3a00","sha256:490fba1401e16605f6c224f1ac23132e3ddd182071eda17f225c3cdbfce2bed1"],"state_sha256":"b447332350906037f06f7974c18fc5c0f0f4fadb014f8256fe53d0f0d693ad6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6CXz5W1vDYn0z1AQpo/BFcgYIkL8UVbHUoBAouwzxUpZdXbev0T61kfS2uMkV/4I3tTn1XZt8tKZAiXPm3wDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:28:36.672942Z","bundle_sha256":"188d042b89af662283e8c0a9f368f3335cbb8ce0a7435f1f0bc8009af2f4533d"}}