{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ELZ3Y43H56TSJ2NDIBERPBDHSO","short_pith_number":"pith:ELZ3Y43H","canonical_record":{"source":{"id":"1512.05976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-18T14:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"99f386b9a55f29e100bab222069edc37e34340d15c4a617413cb241d77f336c6","abstract_canon_sha256":"895aea485522499f19130d449bc770d4cc405a610e5b29f51d8051ee3a5fdb70"},"schema_version":"1.0"},"canonical_sha256":"22f3bc7367efa724e9a340491784679389bc40479a8959b4800350b5381f4f3a","source":{"kind":"arxiv","id":"1512.05976","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05976","created_at":"2026-05-18T01:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05976v1","created_at":"2026-05-18T01:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05976","created_at":"2026-05-18T01:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"ELZ3Y43H56TS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ELZ3Y43H56TSJ2ND","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ELZ3Y43H","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ELZ3Y43H56TSJ2NDIBERPBDHSO","target":"record","payload":{"canonical_record":{"source":{"id":"1512.05976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-18T14:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"99f386b9a55f29e100bab222069edc37e34340d15c4a617413cb241d77f336c6","abstract_canon_sha256":"895aea485522499f19130d449bc770d4cc405a610e5b29f51d8051ee3a5fdb70"},"schema_version":"1.0"},"canonical_sha256":"22f3bc7367efa724e9a340491784679389bc40479a8959b4800350b5381f4f3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:05.747602Z","signature_b64":"ozLMJPPpn0+AdwrtN/nRecon6EtAAZ1Y5ZHCQbWgnLySKSao3DskoNqFsFqm/OcoBeDMWVtgVOGorT2/mXJWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22f3bc7367efa724e9a340491784679389bc40479a8959b4800350b5381f4f3a","last_reissued_at":"2026-05-18T01:24:05.747069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:05.747069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.05976","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-18T01:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gpgok7utFC8m0rDpzRxzwZWSyk+UQncgV73dNVQWYFBn/H4qI5dMPbKL3PsGbWWwro/8uRYCVzFdfDD7QWM/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T00:40:55.922140Z"},"content_sha256":"0141788fc92bc19ee3e0e1604ed007d21134d8e6a1ff4d7c02024a30ea7c9c9a","schema_version":"1.0","event_id":"sha256:0141788fc92bc19ee3e0e1604ed007d21134d8e6a1ff4d7c02024a30ea7c9c9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ELZ3Y43H56TSJ2NDIBERPBDHSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The uniqueness of a distance-regular graph with intersection array {32,27,8,1;1,4,27,32} and related results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Leonard H. Soicher","submitted_at":"2015-12-18T14:44:43Z","abstract_excerpt":"It is known that, up to isomorphism, there is a unique distance-regular graph $\\Delta$ with intersection array {32,27;1,12} (equivalently, $\\Delta$ is the unique strongly regular graph with parameters (105,32,4,12)). Here we investigate the distance-regular antipodal covers of $\\Delta$. We show that, up to isomorphism, there is just one distance-regular antipodal triple cover of $\\Delta$ (a graph $\\hat\\Delta$ discovered by the author over twenty years ago), proving that there is a unique distance-regular graph with intersection array {32,27,8,1;1,4,27,32}. In the process, we confirm an unpubli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05976","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-18T01:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KME/RnfS6B9KtbDDi2JUi5b22s1U4sOka7I3JNICJ8oc8cTXcRhVjvkOKAa4XI17AtG1r5eAAua51FUJ9QqHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T00:40:55.922497Z"},"content_sha256":"437c9296e48e9ad885c1cbc4b58974a811f4967acc6cd3acd2bec7be2cc90a1e","schema_version":"1.0","event_id":"sha256:437c9296e48e9ad885c1cbc4b58974a811f4967acc6cd3acd2bec7be2cc90a1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELZ3Y43H56TSJ2NDIBERPBDHSO/bundle.json","state_url":"https://pith.science/pith/ELZ3Y43H56TSJ2NDIBERPBDHSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELZ3Y43H56TSJ2NDIBERPBDHSO/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-06-21T00:40:55Z","links":{"resolver":"https://pith.science/pith/ELZ3Y43H56TSJ2NDIBERPBDHSO","bundle":"https://pith.science/pith/ELZ3Y43H56TSJ2NDIBERPBDHSO/bundle.json","state":"https://pith.science/pith/ELZ3Y43H56TSJ2NDIBERPBDHSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELZ3Y43H56TSJ2NDIBERPBDHSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ELZ3Y43H56TSJ2NDIBERPBDHSO","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":"895aea485522499f19130d449bc770d4cc405a610e5b29f51d8051ee3a5fdb70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-18T14:44:43Z","title_canon_sha256":"99f386b9a55f29e100bab222069edc37e34340d15c4a617413cb241d77f336c6"},"schema_version":"1.0","source":{"id":"1512.05976","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05976","created_at":"2026-05-18T01:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05976v1","created_at":"2026-05-18T01:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05976","created_at":"2026-05-18T01:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"ELZ3Y43H56TS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ELZ3Y43H56TSJ2ND","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ELZ3Y43H","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:437c9296e48e9ad885c1cbc4b58974a811f4967acc6cd3acd2bec7be2cc90a1e","target":"graph","created_at":"2026-05-18T01:24:05Z","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":"It is known that, up to isomorphism, there is a unique distance-regular graph $\\Delta$ with intersection array {32,27;1,12} (equivalently, $\\Delta$ is the unique strongly regular graph with parameters (105,32,4,12)). Here we investigate the distance-regular antipodal covers of $\\Delta$. We show that, up to isomorphism, there is just one distance-regular antipodal triple cover of $\\Delta$ (a graph $\\hat\\Delta$ discovered by the author over twenty years ago), proving that there is a unique distance-regular graph with intersection array {32,27,8,1;1,4,27,32}. In the process, we confirm an unpubli","authors_text":"Leonard H. Soicher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-18T14:44:43Z","title":"The uniqueness of a distance-regular graph with intersection array {32,27,8,1;1,4,27,32} and related results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05976","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:0141788fc92bc19ee3e0e1604ed007d21134d8e6a1ff4d7c02024a30ea7c9c9a","target":"record","created_at":"2026-05-18T01:24:05Z","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":"895aea485522499f19130d449bc770d4cc405a610e5b29f51d8051ee3a5fdb70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-18T14:44:43Z","title_canon_sha256":"99f386b9a55f29e100bab222069edc37e34340d15c4a617413cb241d77f336c6"},"schema_version":"1.0","source":{"id":"1512.05976","kind":"arxiv","version":1}},"canonical_sha256":"22f3bc7367efa724e9a340491784679389bc40479a8959b4800350b5381f4f3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22f3bc7367efa724e9a340491784679389bc40479a8959b4800350b5381f4f3a","first_computed_at":"2026-05-18T01:24:05.747069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:05.747069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ozLMJPPpn0+AdwrtN/nRecon6EtAAZ1Y5ZHCQbWgnLySKSao3DskoNqFsFqm/OcoBeDMWVtgVOGorT2/mXJWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:05.747602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05976","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0141788fc92bc19ee3e0e1604ed007d21134d8e6a1ff4d7c02024a30ea7c9c9a","sha256:437c9296e48e9ad885c1cbc4b58974a811f4967acc6cd3acd2bec7be2cc90a1e"],"state_sha256":"f244f4a186673f30aae6be082adb86105e81aab7dfa06d69f04324dd164f0f53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krXodxe+mYWtTR2a3oE2u5QzK5kzt7BQD82TPaL6/byPb0pNe5uJ9MT0Rt+PLIs1XwAmXmRNTSv7Jgc0UBqHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T00:40:55.924632Z","bundle_sha256":"1e6c33ca2bba9f6d5c967d4480bed8de5fb36381b6e17862f8d0ac0e96d129f2"}}