{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:K4OZ6QF7GZUGWP3TAJXDKPYXBI","short_pith_number":"pith:K4OZ6QF7","schema_version":"1.0","canonical_sha256":"571d9f40bf36686b3f73026e353f170a0ffdf98b182e9d7cb90b0eaca34b5c92","source":{"kind":"arxiv","id":"1809.10197","version":2},"attestation_state":"computed","paper":{"title":"On some distance-regular graphs with many vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Svob, Dean Crnkovic, Sanja Rukavina","submitted_at":"2018-09-26T19:14:06Z","abstract_excerpt":"We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups $G_2(4)$ and $G_2(5)$, the orthogonal group $O(7,3)$ and the Tits group $T=$$^2F_4(2)'$. Most of the constructed graphs have more than 1000 vertices, and the number of vertices goes up to 28431. Some of the obtained graphs are new."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1809.10197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-26T19:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"fbc91a25ee84a277b4eebe3f122a226f70ad8c2bcb545ce02a72ff5712ced4fe","abstract_canon_sha256":"a145fcef5a986cc7a06cf15fc5fa333374ba824c39647e4590870dca2d259121"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:02.203743Z","signature_b64":"OezIETLGHgidBhPXRyx8BK081AadqaYeSC6tWkC0VL0LukZRIVULdToW2taieXcnzJYux5Ybv1VpJ2YJ+d34CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"571d9f40bf36686b3f73026e353f170a0ffdf98b182e9d7cb90b0eaca34b5c92","last_reissued_at":"2026-05-18T00:04:02.203168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:02.203168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On some distance-regular graphs with many vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Svob, Dean Crnkovic, Sanja Rukavina","submitted_at":"2018-09-26T19:14:06Z","abstract_excerpt":"We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups $G_2(4)$ and $G_2(5)$, the orthogonal group $O(7,3)$ and the Tits group $T=$$^2F_4(2)'$. Most of the constructed graphs have more than 1000 vertices, and the number of vertices goes up to 28431. Some of the obtained graphs are new."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10197","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.10197","created_at":"2026-05-18T00:04:02.203259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10197v2","created_at":"2026-05-18T00:04:02.203259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10197","created_at":"2026-05-18T00:04:02.203259+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4OZ6QF7GZUG","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4OZ6QF7GZUGWP3T","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4OZ6QF7","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K4OZ6QF7GZUGWP3TAJXDKPYXBI","json":"https://pith.science/pith/K4OZ6QF7GZUGWP3TAJXDKPYXBI.json","graph_json":"https://pith.science/api/pith-number/K4OZ6QF7GZUGWP3TAJXDKPYXBI/graph.json","events_json":"https://pith.science/api/pith-number/K4OZ6QF7GZUGWP3TAJXDKPYXBI/events.json","paper":"https://pith.science/paper/K4OZ6QF7"},"agent_actions":{"view_html":"https://pith.science/pith/K4OZ6QF7GZUGWP3TAJXDKPYXBI","download_json":"https://pith.science/pith/K4OZ6QF7GZUGWP3TAJXDKPYXBI.json","view_paper":"https://pith.science/paper/K4OZ6QF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10197&json=true","fetch_graph":"https://pith.science/api/pith-number/K4OZ6QF7GZUGWP3TAJXDKPYXBI/graph.json","fetch_events":"https://pith.science/api/pith-number/K4OZ6QF7GZUGWP3TAJXDKPYXBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4OZ6QF7GZUGWP3TAJXDKPYXBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4OZ6QF7GZUGWP3TAJXDKPYXBI/action/storage_attestation","attest_author":"https://pith.science/pith/K4OZ6QF7GZUGWP3TAJXDKPYXBI/action/author_attestation","sign_citation":"https://pith.science/pith/K4OZ6QF7GZUGWP3TAJXDKPYXBI/action/citation_signature","submit_replication":"https://pith.science/pith/K4OZ6QF7GZUGWP3TAJXDKPYXBI/action/replication_record"}},"created_at":"2026-05-18T00:04:02.203259+00:00","updated_at":"2026-05-18T00:04:02.203259+00:00"}