{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PH7ZEJPGOYPA65Q22C5IJ62RRD","short_pith_number":"pith:PH7ZEJPG","schema_version":"1.0","canonical_sha256":"79ff9225e6761e0f761ad0ba84fb5188ebd81102bcdb566145305e3518597b0a","source":{"kind":"arxiv","id":"1103.5846","version":1},"attestation_state":"computed","paper":{"title":"A classification of graphs whose subdivision graphs are locally $G$-distance transitive","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Alice Devillers, Ashraf Daneshkhah","submitted_at":"2011-03-30T08:12:52Z","abstract_excerpt":"The subdivision graph $S(\\Sigma)$ of a connected graph $\\Sigma$ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs $\\Sigma$ such that $S(\\Sigma)$ is locally $(G,s)$-distance transitive for $s\\leq 2\\, diam(\\Sigma)-1$ and some $G\\leq Aut(\\Sigma)$. In this paper, we solve the remaining cases by classifying all the graphs $\\Sigma$ such that the subdivision graphs is locally $(G,s)$-distance transitive for $s\\geq 2\\, diam(\\Sigma)$ and some $G\\leq Aut(\\Sigma)$. In particular, their subdivision graph are always"},"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":"1103.5846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-30T08:12:52Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"07aa9392556d9a83ef1fa9ba6978fc04dbb97147ed8725bd7dd9284bae39d61f","abstract_canon_sha256":"a2a3c3dae4325f5a0edf69596b87f99cb443ecb14e6012697405f717839adb31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:27.405174Z","signature_b64":"p3/6CyzMYRuZH61SLipZI0aj08J3Oj/mRFaJhj3vOUUZ9AIK+YDOcTByh8axmNrkPmBqDNggPiQStXkp+O80CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79ff9225e6761e0f761ad0ba84fb5188ebd81102bcdb566145305e3518597b0a","last_reissued_at":"2026-05-18T04:25:27.404670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:27.404670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A classification of graphs whose subdivision graphs are locally $G$-distance transitive","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Alice Devillers, Ashraf Daneshkhah","submitted_at":"2011-03-30T08:12:52Z","abstract_excerpt":"The subdivision graph $S(\\Sigma)$ of a connected graph $\\Sigma$ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs $\\Sigma$ such that $S(\\Sigma)$ is locally $(G,s)$-distance transitive for $s\\leq 2\\, diam(\\Sigma)-1$ and some $G\\leq Aut(\\Sigma)$. In this paper, we solve the remaining cases by classifying all the graphs $\\Sigma$ such that the subdivision graphs is locally $(G,s)$-distance transitive for $s\\geq 2\\, diam(\\Sigma)$ and some $G\\leq Aut(\\Sigma)$. In particular, their subdivision graph are always"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5846","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":"1103.5846","created_at":"2026-05-18T04:25:27.404745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5846v1","created_at":"2026-05-18T04:25:27.404745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5846","created_at":"2026-05-18T04:25:27.404745+00:00"},{"alias_kind":"pith_short_12","alias_value":"PH7ZEJPGOYPA","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PH7ZEJPGOYPA65Q2","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PH7ZEJPG","created_at":"2026-05-18T12:26:39.201973+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/PH7ZEJPGOYPA65Q22C5IJ62RRD","json":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD.json","graph_json":"https://pith.science/api/pith-number/PH7ZEJPGOYPA65Q22C5IJ62RRD/graph.json","events_json":"https://pith.science/api/pith-number/PH7ZEJPGOYPA65Q22C5IJ62RRD/events.json","paper":"https://pith.science/paper/PH7ZEJPG"},"agent_actions":{"view_html":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD","download_json":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD.json","view_paper":"https://pith.science/paper/PH7ZEJPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5846&json=true","fetch_graph":"https://pith.science/api/pith-number/PH7ZEJPGOYPA65Q22C5IJ62RRD/graph.json","fetch_events":"https://pith.science/api/pith-number/PH7ZEJPGOYPA65Q22C5IJ62RRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD/action/storage_attestation","attest_author":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD/action/author_attestation","sign_citation":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD/action/citation_signature","submit_replication":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD/action/replication_record"}},"created_at":"2026-05-18T04:25:27.404745+00:00","updated_at":"2026-05-18T04:25:27.404745+00:00"}