{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DCBPZIXQM4QFIKKTJG264J7PGF","short_pith_number":"pith:DCBPZIXQ","canonical_record":{"source":{"id":"1803.10797","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T18:40:59Z","cross_cats_sorted":[],"title_canon_sha256":"80c9090a7e6cfd06cccf40b54b7f3b61c7caa7c591e6b94b3584c01e938cdbba","abstract_canon_sha256":"9af209241482ceb0a0ac45d45c4c6130a7ffd4a5a79ffa942f2c25b56d3531e5"},"schema_version":"1.0"},"canonical_sha256":"1882fca2f0672054295349b5ee27ef316954a1aafc54eaa12145bf04157cfbe6","source":{"kind":"arxiv","id":"1803.10797","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10797","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10797v2","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10797","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"DCBPZIXQM4QF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCBPZIXQM4QFIKKT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCBPZIXQ","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DCBPZIXQM4QFIKKTJG264J7PGF","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10797","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T18:40:59Z","cross_cats_sorted":[],"title_canon_sha256":"80c9090a7e6cfd06cccf40b54b7f3b61c7caa7c591e6b94b3584c01e938cdbba","abstract_canon_sha256":"9af209241482ceb0a0ac45d45c4c6130a7ffd4a5a79ffa942f2c25b56d3531e5"},"schema_version":"1.0"},"canonical_sha256":"1882fca2f0672054295349b5ee27ef316954a1aafc54eaa12145bf04157cfbe6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:49.506795Z","signature_b64":"2RlV9w6i3/yqSECZoHnATX1nNJGeKo7Sgrp9P38gFGf85eXbBgh0wTU2r19QfPPgEJrjsTd+CzliRTDHjW+gAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1882fca2f0672054295349b5ee27ef316954a1aafc54eaa12145bf04157cfbe6","last_reissued_at":"2026-05-18T00:02:49.506205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:49.506205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10797","source_version":2,"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:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uX+A6XHDoXtYXw4UJ/ZhtcKSfhT+hJUHdXFR1j8P8fTq8UYSyEpIXQIm/dz90BkdcOYye8/VqCoC5m8UmnG0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:47:22.142657Z"},"content_sha256":"9b7aaa03a9c74ebda1b430f355a3f9b08fa63546adde70d1a73586fc7cc245e5","schema_version":"1.0","event_id":"sha256:9b7aaa03a9c74ebda1b430f355a3f9b08fa63546adde70d1a73586fc7cc245e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DCBPZIXQM4QFIKKTJG264J7PGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using symbolic computation to prove nonexistence of distance-regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jano\\v{s} Vidali","submitted_at":"2018-03-28T18:40:59Z","abstract_excerpt":"A package for the Sage computer algebra system is developed for checking feasibility of a given intersection array for a distance-regular graph. We use this tool to show that there is no distance-regular graph with intersection array $\\{(2r+1)(4r+1)(4t-1), 8r(4rt-r+2t), (r+t)(4r+1); 1, (r+t)(4r+1), 4r(2r+1)(4t-1)\\}$ ($r, t \\ge 1$), $\\{135, 128, 16; 1, 16, 120\\}$, $\\{234, 165, 12; 1, 30, 198\\}$ or $\\{55, 54, 50, 35, 10; 1, 5, 20, 45, 55\\}$. In all cases, the proofs rely on equality in the Krein condition, from which triple intersection numbers are determined. Further combinatorial arguments are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10797","kind":"arxiv","version":2},"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:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fl3wuxOVJrqJ1hZK8iykHoJnFffCS9q3IOdKJiFdlPqepBtYGiVcPbTg8Ff58kdA4HgzJh9JKMuHwR8qoBdpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:47:22.143342Z"},"content_sha256":"655211f42c89d76ad5e55518512ea05168f7a8328409452191592c5f5bdc8baf","schema_version":"1.0","event_id":"sha256:655211f42c89d76ad5e55518512ea05168f7a8328409452191592c5f5bdc8baf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCBPZIXQM4QFIKKTJG264J7PGF/bundle.json","state_url":"https://pith.science/pith/DCBPZIXQM4QFIKKTJG264J7PGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCBPZIXQM4QFIKKTJG264J7PGF/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-04T04:47:22Z","links":{"resolver":"https://pith.science/pith/DCBPZIXQM4QFIKKTJG264J7PGF","bundle":"https://pith.science/pith/DCBPZIXQM4QFIKKTJG264J7PGF/bundle.json","state":"https://pith.science/pith/DCBPZIXQM4QFIKKTJG264J7PGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCBPZIXQM4QFIKKTJG264J7PGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DCBPZIXQM4QFIKKTJG264J7PGF","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":"9af209241482ceb0a0ac45d45c4c6130a7ffd4a5a79ffa942f2c25b56d3531e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T18:40:59Z","title_canon_sha256":"80c9090a7e6cfd06cccf40b54b7f3b61c7caa7c591e6b94b3584c01e938cdbba"},"schema_version":"1.0","source":{"id":"1803.10797","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10797","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10797v2","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10797","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"DCBPZIXQM4QF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCBPZIXQM4QFIKKT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCBPZIXQ","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:655211f42c89d76ad5e55518512ea05168f7a8328409452191592c5f5bdc8baf","target":"graph","created_at":"2026-05-18T00:02:49Z","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 package for the Sage computer algebra system is developed for checking feasibility of a given intersection array for a distance-regular graph. We use this tool to show that there is no distance-regular graph with intersection array $\\{(2r+1)(4r+1)(4t-1), 8r(4rt-r+2t), (r+t)(4r+1); 1, (r+t)(4r+1), 4r(2r+1)(4t-1)\\}$ ($r, t \\ge 1$), $\\{135, 128, 16; 1, 16, 120\\}$, $\\{234, 165, 12; 1, 30, 198\\}$ or $\\{55, 54, 50, 35, 10; 1, 5, 20, 45, 55\\}$. In all cases, the proofs rely on equality in the Krein condition, from which triple intersection numbers are determined. Further combinatorial arguments are","authors_text":"Jano\\v{s} Vidali","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T18:40:59Z","title":"Using symbolic computation to prove nonexistence of distance-regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10797","kind":"arxiv","version":2},"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:9b7aaa03a9c74ebda1b430f355a3f9b08fa63546adde70d1a73586fc7cc245e5","target":"record","created_at":"2026-05-18T00:02:49Z","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":"9af209241482ceb0a0ac45d45c4c6130a7ffd4a5a79ffa942f2c25b56d3531e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T18:40:59Z","title_canon_sha256":"80c9090a7e6cfd06cccf40b54b7f3b61c7caa7c591e6b94b3584c01e938cdbba"},"schema_version":"1.0","source":{"id":"1803.10797","kind":"arxiv","version":2}},"canonical_sha256":"1882fca2f0672054295349b5ee27ef316954a1aafc54eaa12145bf04157cfbe6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1882fca2f0672054295349b5ee27ef316954a1aafc54eaa12145bf04157cfbe6","first_computed_at":"2026-05-18T00:02:49.506205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:49.506205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2RlV9w6i3/yqSECZoHnATX1nNJGeKo7Sgrp9P38gFGf85eXbBgh0wTU2r19QfPPgEJrjsTd+CzliRTDHjW+gAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:49.506795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10797","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b7aaa03a9c74ebda1b430f355a3f9b08fa63546adde70d1a73586fc7cc245e5","sha256:655211f42c89d76ad5e55518512ea05168f7a8328409452191592c5f5bdc8baf"],"state_sha256":"84bea6a6bd7a8df9c484de98147be5aa6c829c0981e116146f81321758108e6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j++X8Ird7lu39xg+wh/qCIHynoPCDO0Hffyl1tcHpyZxzQUUndxmDV9GbvhAYvUTWQl416eOKfC022tQRhWoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:47:22.147896Z","bundle_sha256":"8ca9276e31c0a76f0a6256da92a73b34d368bf318560b6c1a282c7f17b4bef9d"}}