{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:C53WLNK3OMLDHS22G7L7OL6F5M","short_pith_number":"pith:C53WLNK3","canonical_record":{"source":{"id":"1205.3878","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-17T08:18:19Z","cross_cats_sorted":[],"title_canon_sha256":"3432ee86d5af85c98ff36ec768d6d279fda2d5b1827f3188f39857d66172acde","abstract_canon_sha256":"d76113806bea059faa3bd239de4fc9b340a579cd733d34ec98d0e2e9ef52fd3b"},"schema_version":"1.0"},"canonical_sha256":"177765b55b731633cb5a37d7f72fc5eb281da902d61c09cd544e2205a9aeb63a","source":{"kind":"arxiv","id":"1205.3878","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3878","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3878v3","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3878","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"C53WLNK3OMLD","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C53WLNK3OMLDHS22","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C53WLNK3","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:C53WLNK3OMLDHS22G7L7OL6F5M","target":"record","payload":{"canonical_record":{"source":{"id":"1205.3878","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-17T08:18:19Z","cross_cats_sorted":[],"title_canon_sha256":"3432ee86d5af85c98ff36ec768d6d279fda2d5b1827f3188f39857d66172acde","abstract_canon_sha256":"d76113806bea059faa3bd239de4fc9b340a579cd733d34ec98d0e2e9ef52fd3b"},"schema_version":"1.0"},"canonical_sha256":"177765b55b731633cb5a37d7f72fc5eb281da902d61c09cd544e2205a9aeb63a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:34.439820Z","signature_b64":"rhwwtRZqumjPAFXjq1IjEvIhyofYBbn8C2nsseF2eEPFAX5HTil05R/XihdWhRfn2iV7sanqN/7Wr/hM++R8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"177765b55b731633cb5a37d7f72fc5eb281da902d61c09cd544e2205a9aeb63a","last_reissued_at":"2026-05-18T00:51:34.439456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:34.439456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.3878","source_version":3,"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:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aoiFe5ikdBIkunXOVm6EcmhivxS2RzlbsXbRAlXLcrNXLI1DRWhu4s9JBH3DnAr9p186Lak7AEKUZjhNZrCRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:00:54.641429Z"},"content_sha256":"1965297e9c9fb4315c0212df8495e9ffc1ce3e09b9a101674410f32e725aba6b","schema_version":"1.0","event_id":"sha256:1965297e9c9fb4315c0212df8495e9ffc1ce3e09b9a101674410f32e725aba6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:C53WLNK3OMLDHS22G7L7OL6F5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New characterisations of the Nordstrom-Robinson codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheryl E. Praeger, Neil I. Gillespie","submitted_at":"2012-05-17T08:18:19Z","abstract_excerpt":"In his doctoral thesis, Snover proved that any binary $(m,256,\\delta)$ code is equivalent to the Nordstrom-Robinson code or the punctured Nordstrom-Robinson code for $(m,\\delta)=(16,6)$ or $(15,5)$ respectively. We prove that these codes are also characterised as \\emph{completely regular} binary codes with $(m,\\delta)=(16,6)$ or $(15,5)$, and moreover, that they are \\emph{completely transitive}. Also, it is known that completely transitive codes are necessarily completely regular, but whether the converse holds has up to now been an open question. We answer this by proving that certain complet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3878","kind":"arxiv","version":3},"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:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J13/NPsRgfxKRQzuLj4hlpDRlQ3T2xv4MpVsC4OUabek/wI+bKaAFYxeghSxxBkUzpnDVJTb5hrTd3bTZZQFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:00:54.642076Z"},"content_sha256":"232445fc09bc990b7af5c43b45586c3ce363fb75c721cb298de914cd6bae6c6d","schema_version":"1.0","event_id":"sha256:232445fc09bc990b7af5c43b45586c3ce363fb75c721cb298de914cd6bae6c6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C53WLNK3OMLDHS22G7L7OL6F5M/bundle.json","state_url":"https://pith.science/pith/C53WLNK3OMLDHS22G7L7OL6F5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C53WLNK3OMLDHS22G7L7OL6F5M/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-26T11:00:54Z","links":{"resolver":"https://pith.science/pith/C53WLNK3OMLDHS22G7L7OL6F5M","bundle":"https://pith.science/pith/C53WLNK3OMLDHS22G7L7OL6F5M/bundle.json","state":"https://pith.science/pith/C53WLNK3OMLDHS22G7L7OL6F5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C53WLNK3OMLDHS22G7L7OL6F5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:C53WLNK3OMLDHS22G7L7OL6F5M","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":"d76113806bea059faa3bd239de4fc9b340a579cd733d34ec98d0e2e9ef52fd3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-17T08:18:19Z","title_canon_sha256":"3432ee86d5af85c98ff36ec768d6d279fda2d5b1827f3188f39857d66172acde"},"schema_version":"1.0","source":{"id":"1205.3878","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3878","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3878v3","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3878","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"C53WLNK3OMLD","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C53WLNK3OMLDHS22","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C53WLNK3","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:232445fc09bc990b7af5c43b45586c3ce363fb75c721cb298de914cd6bae6c6d","target":"graph","created_at":"2026-05-18T00:51:34Z","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":"In his doctoral thesis, Snover proved that any binary $(m,256,\\delta)$ code is equivalent to the Nordstrom-Robinson code or the punctured Nordstrom-Robinson code for $(m,\\delta)=(16,6)$ or $(15,5)$ respectively. We prove that these codes are also characterised as \\emph{completely regular} binary codes with $(m,\\delta)=(16,6)$ or $(15,5)$, and moreover, that they are \\emph{completely transitive}. Also, it is known that completely transitive codes are necessarily completely regular, but whether the converse holds has up to now been an open question. We answer this by proving that certain complet","authors_text":"Cheryl E. Praeger, Neil I. Gillespie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-17T08:18:19Z","title":"New characterisations of the Nordstrom-Robinson codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3878","kind":"arxiv","version":3},"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:1965297e9c9fb4315c0212df8495e9ffc1ce3e09b9a101674410f32e725aba6b","target":"record","created_at":"2026-05-18T00:51:34Z","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":"d76113806bea059faa3bd239de4fc9b340a579cd733d34ec98d0e2e9ef52fd3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-17T08:18:19Z","title_canon_sha256":"3432ee86d5af85c98ff36ec768d6d279fda2d5b1827f3188f39857d66172acde"},"schema_version":"1.0","source":{"id":"1205.3878","kind":"arxiv","version":3}},"canonical_sha256":"177765b55b731633cb5a37d7f72fc5eb281da902d61c09cd544e2205a9aeb63a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"177765b55b731633cb5a37d7f72fc5eb281da902d61c09cd544e2205a9aeb63a","first_computed_at":"2026-05-18T00:51:34.439456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:34.439456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rhwwtRZqumjPAFXjq1IjEvIhyofYBbn8C2nsseF2eEPFAX5HTil05R/XihdWhRfn2iV7sanqN/7Wr/hM++R8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:34.439820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3878","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1965297e9c9fb4315c0212df8495e9ffc1ce3e09b9a101674410f32e725aba6b","sha256:232445fc09bc990b7af5c43b45586c3ce363fb75c721cb298de914cd6bae6c6d"],"state_sha256":"f514053ec9bebc7eb8113e5ee05000a5cfc8ea287b726eae1ae17c24ae25a656"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DEJCgn6ljzzZ6LcEyGqGASvQnpoPBzUEkn5v3HBuJDGtO/IMO7Sgi4F+H0HZAlEBYyx1XJnVGqJSH0CkcBJQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:00:54.645354Z","bundle_sha256":"f6286f758fce6b136c68f24a96fca4fa736cf082590060690ad786d89bfde979"}}