{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PH7ZEJPGOYPA65Q22C5IJ62RRD","short_pith_number":"pith:PH7ZEJPG","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"},"canonical_sha256":"79ff9225e6761e0f761ad0ba84fb5188ebd81102bcdb566145305e3518597b0a","source":{"kind":"arxiv","id":"1103.5846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5846","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5846v1","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5846","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"PH7ZEJPGOYPA","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PH7ZEJPGOYPA65Q2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PH7ZEJPG","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PH7ZEJPGOYPA65Q22C5IJ62RRD","target":"record","payload":{"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"},"canonical_sha256":"79ff9225e6761e0f761ad0ba84fb5188ebd81102bcdb566145305e3518597b0a","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"},"source_kind":"arxiv","source_id":"1103.5846","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-18T04:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzyK0qKIjOJ6F4+60jyM8lHeM5b3JLC29LI5C2LFdbmnUjNFXxrRi92xbYb/wFDciMEIQ2px1ZRSz4P/CwRCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:05:39.025413Z"},"content_sha256":"fbefb18facb2106fd272a2bf1bcf0d7e272e296f0e226fdb6355e295e133d576","schema_version":"1.0","event_id":"sha256:fbefb18facb2106fd272a2bf1bcf0d7e272e296f0e226fdb6355e295e133d576"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PH7ZEJPGOYPA65Q22C5IJ62RRD","target":"graph","payload":{"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"},"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-18T04:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NmqgAGfOo6g9Z3/c9C0WQ49rUhmyIapHRgdW4pl34LeylQ3HGiUFbwctxA564YYN9CdsUMBz24b1E5e4c6dbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:05:39.025778Z"},"content_sha256":"2fe08ae114601530764b612a1cd14814a929bdd1db9c0f7c814a04fbd6fbe733","schema_version":"1.0","event_id":"sha256:2fe08ae114601530764b612a1cd14814a929bdd1db9c0f7c814a04fbd6fbe733"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD/bundle.json","state_url":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD/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-11T10:05:39Z","links":{"resolver":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD","bundle":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD/bundle.json","state":"https://pith.science/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PH7ZEJPGOYPA65Q22C5IJ62RRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PH7ZEJPGOYPA65Q22C5IJ62RRD","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":"a2a3c3dae4325f5a0edf69596b87f99cb443ecb14e6012697405f717839adb31","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-30T08:12:52Z","title_canon_sha256":"07aa9392556d9a83ef1fa9ba6978fc04dbb97147ed8725bd7dd9284bae39d61f"},"schema_version":"1.0","source":{"id":"1103.5846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5846","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5846v1","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5846","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"PH7ZEJPGOYPA","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PH7ZEJPGOYPA65Q2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PH7ZEJPG","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:2fe08ae114601530764b612a1cd14814a929bdd1db9c0f7c814a04fbd6fbe733","target":"graph","created_at":"2026-05-18T04:25:27Z","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":"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","authors_text":"Alice Devillers, Ashraf Daneshkhah","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-30T08:12:52Z","title":"A classification of graphs whose subdivision graphs are locally $G$-distance transitive"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5846","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:fbefb18facb2106fd272a2bf1bcf0d7e272e296f0e226fdb6355e295e133d576","target":"record","created_at":"2026-05-18T04:25:27Z","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":"a2a3c3dae4325f5a0edf69596b87f99cb443ecb14e6012697405f717839adb31","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-30T08:12:52Z","title_canon_sha256":"07aa9392556d9a83ef1fa9ba6978fc04dbb97147ed8725bd7dd9284bae39d61f"},"schema_version":"1.0","source":{"id":"1103.5846","kind":"arxiv","version":1}},"canonical_sha256":"79ff9225e6761e0f761ad0ba84fb5188ebd81102bcdb566145305e3518597b0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79ff9225e6761e0f761ad0ba84fb5188ebd81102bcdb566145305e3518597b0a","first_computed_at":"2026-05-18T04:25:27.404670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:27.404670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p3/6CyzMYRuZH61SLipZI0aj08J3Oj/mRFaJhj3vOUUZ9AIK+YDOcTByh8axmNrkPmBqDNggPiQStXkp+O80CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:27.405174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbefb18facb2106fd272a2bf1bcf0d7e272e296f0e226fdb6355e295e133d576","sha256:2fe08ae114601530764b612a1cd14814a929bdd1db9c0f7c814a04fbd6fbe733"],"state_sha256":"a66308b1154f1f944a092c77a0049dcc1b74a15c2e28f310944ad2a8ebed62ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBmb5vS1VN9LZ5kGYzW7Qmab0SBdtpg1o29Z8wAE8e9eCs7lRTroWIByoNKWK6PYzsWRqiZIS3F4cSYCGmygDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:05:39.027851Z","bundle_sha256":"5cc88f17549991759d13df2e8c411c667402131693bf1b4e7273c403bdfa2774"}}