{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QLWM27L6AICRZNWK5ZNCMBOLZS","short_pith_number":"pith:QLWM27L6","schema_version":"1.0","canonical_sha256":"82eccd7d7e02051cb6caee5a2605cbcc9e03984445af20260e0f0acfe1571500","source":{"kind":"arxiv","id":"1810.08986","version":1},"attestation_state":"computed","paper":{"title":"On $s$-distance-transitive graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheryl Praeger, Hui Zhou, Michael Giudici, Rongquan Feng, Xingui Fang","submitted_at":"2018-10-21T16:24:53Z","abstract_excerpt":"Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitivity implies distance-regularity. In this paper, we give similar results, i.e. for special $s$ and graphs with other restrictions we show that $s$-distance-transitivity implies distance-regularity."},"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":"1810.08986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-21T16:24:53Z","cross_cats_sorted":[],"title_canon_sha256":"a5c25132c2f27a3711647d045f62b1465b7f5d88ce920b551e49987db8f5f931","abstract_canon_sha256":"2c8f93bee24cd2d3a6dba1f60814e7fd333e89f95171ed9670a43e711d1421cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:41.303494Z","signature_b64":"xLptf5y8WFYgpe2zYJqdI9dtamRBw+PkrIhngk2lO9bPqnI9JTPUkf+EUeaOt9nE5G6EFJkTOpi1R4ZCHPzQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82eccd7d7e02051cb6caee5a2605cbcc9e03984445af20260e0f0acfe1571500","last_reissued_at":"2026-05-18T00:02:41.302954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:41.302954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $s$-distance-transitive graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheryl Praeger, Hui Zhou, Michael Giudici, Rongquan Feng, Xingui Fang","submitted_at":"2018-10-21T16:24:53Z","abstract_excerpt":"Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitivity implies distance-regularity. In this paper, we give similar results, i.e. for special $s$ and graphs with other restrictions we show that $s$-distance-transitivity implies distance-regularity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08986","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.08986","created_at":"2026-05-18T00:02:41.303030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08986v1","created_at":"2026-05-18T00:02:41.303030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08986","created_at":"2026-05-18T00:02:41.303030+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLWM27L6AICR","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLWM27L6AICRZNWK","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLWM27L6","created_at":"2026-05-18T12:32:46.962924+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/QLWM27L6AICRZNWK5ZNCMBOLZS","json":"https://pith.science/pith/QLWM27L6AICRZNWK5ZNCMBOLZS.json","graph_json":"https://pith.science/api/pith-number/QLWM27L6AICRZNWK5ZNCMBOLZS/graph.json","events_json":"https://pith.science/api/pith-number/QLWM27L6AICRZNWK5ZNCMBOLZS/events.json","paper":"https://pith.science/paper/QLWM27L6"},"agent_actions":{"view_html":"https://pith.science/pith/QLWM27L6AICRZNWK5ZNCMBOLZS","download_json":"https://pith.science/pith/QLWM27L6AICRZNWK5ZNCMBOLZS.json","view_paper":"https://pith.science/paper/QLWM27L6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08986&json=true","fetch_graph":"https://pith.science/api/pith-number/QLWM27L6AICRZNWK5ZNCMBOLZS/graph.json","fetch_events":"https://pith.science/api/pith-number/QLWM27L6AICRZNWK5ZNCMBOLZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLWM27L6AICRZNWK5ZNCMBOLZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLWM27L6AICRZNWK5ZNCMBOLZS/action/storage_attestation","attest_author":"https://pith.science/pith/QLWM27L6AICRZNWK5ZNCMBOLZS/action/author_attestation","sign_citation":"https://pith.science/pith/QLWM27L6AICRZNWK5ZNCMBOLZS/action/citation_signature","submit_replication":"https://pith.science/pith/QLWM27L6AICRZNWK5ZNCMBOLZS/action/replication_record"}},"created_at":"2026-05-18T00:02:41.303030+00:00","updated_at":"2026-05-18T00:02:41.303030+00:00"}