{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CJHJZGB4FFB4TWB3GM66LO65IN","short_pith_number":"pith:CJHJZGB4","canonical_record":{"source":{"id":"2506.04670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T06:31:48Z","cross_cats_sorted":[],"title_canon_sha256":"780818110903d2cce4483794bb94416770a73ace7351ec8d2114d87ec82470a3","abstract_canon_sha256":"a5e5ab7edb23eb826ad36a2744662bf082984d6462b0d822cafe3b78af6c2192"},"schema_version":"1.0"},"canonical_sha256":"124e9c983c2943c9d83b333de5bbdd4375ffca6b863ccb8bde055358807cc0da","source":{"kind":"arxiv","id":"2506.04670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04670","created_at":"2026-07-05T11:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04670v1","created_at":"2026-07-05T11:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04670","created_at":"2026-07-05T11:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"CJHJZGB4FFB4","created_at":"2026-07-05T11:16:18Z"},{"alias_kind":"pith_short_16","alias_value":"CJHJZGB4FFB4TWB3","created_at":"2026-07-05T11:16:18Z"},{"alias_kind":"pith_short_8","alias_value":"CJHJZGB4","created_at":"2026-07-05T11:16:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CJHJZGB4FFB4TWB3GM66LO65IN","target":"record","payload":{"canonical_record":{"source":{"id":"2506.04670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T06:31:48Z","cross_cats_sorted":[],"title_canon_sha256":"780818110903d2cce4483794bb94416770a73ace7351ec8d2114d87ec82470a3","abstract_canon_sha256":"a5e5ab7edb23eb826ad36a2744662bf082984d6462b0d822cafe3b78af6c2192"},"schema_version":"1.0"},"canonical_sha256":"124e9c983c2943c9d83b333de5bbdd4375ffca6b863ccb8bde055358807cc0da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:18.704659Z","signature_b64":"lGg9q1aNwh33Ddum5MD4TNhzvJb+vPafTeRw6gtq58EZ1XglIP7zE4CIN0Wduk/UfxigaCKhQ4HQvVf63v+OCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"124e9c983c2943c9d83b333de5bbdd4375ffca6b863ccb8bde055358807cc0da","last_reissued_at":"2026-07-05T11:16:18.704213Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:18.704213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.04670","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-07-05T11:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGqIwyrJNAMi+EYkY/Qph+aNhGIm2ItEJW/L31AyG31KZ3J1JLi5dcT1d358CtLGnp93G8uERI7gG3DEPbiiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:52:59.080525Z"},"content_sha256":"d54ea94d69918402a3571cad88c7747cc0c08d5d93400dcb43b0e9114e6df9d8","schema_version":"1.0","event_id":"sha256:d54ea94d69918402a3571cad88c7747cc0c08d5d93400dcb43b0e9114e6df9d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CJHJZGB4FFB4TWB3GM66LO65IN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geodesic transitive graphs of small valency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Jie Huang","submitted_at":"2025-06-05T06:31:48Z","abstract_excerpt":"For a graph $\\Gamma$, the {\\em distance} $d_\\Gamma(u,v)$ between two distinct vertices $u$ and $v$ in $\\Gamma$ is defined as the length of the shortest path from $u$ to $v$, and the {\\em diameter} $\\mathrm{diam}(\\Gamma)$ of $\\Gamma$ is the maximum distance between $u$ and $v$ for all vertices $u$ and $v$ in the vertex set of $\\Gamma$. For a positive integer $s$, a path $(u_0,u_1,\\ldots,u_{s})$ is called an {\\em $s$-geodesic} if the distance of $u_0$ and $u_s$ is $s$. The graph $\\Gamma$ is said to be {\\em distance transitive} if for any vertices $u,v,x,y$ of $\\Ga$ such that $d_\\Ga(u,v)=d_\\Ga(x,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04670","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.04670/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S4M0VPa9RN2Uerp9hxUVmoLRMDQVM0D8xi7fsseWvxcNWMIpPD2Tm48Z8nl6haVjD5LU9bTorEalBoFsW/7EBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:52:59.081227Z"},"content_sha256":"ed958e7b881efc748fa958f156ec6505c4b8acd1c5d1815411b8300917876893","schema_version":"1.0","event_id":"sha256:ed958e7b881efc748fa958f156ec6505c4b8acd1c5d1815411b8300917876893"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJHJZGB4FFB4TWB3GM66LO65IN/bundle.json","state_url":"https://pith.science/pith/CJHJZGB4FFB4TWB3GM66LO65IN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJHJZGB4FFB4TWB3GM66LO65IN/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-08-18T08:52:59Z","links":{"resolver":"https://pith.science/pith/CJHJZGB4FFB4TWB3GM66LO65IN","bundle":"https://pith.science/pith/CJHJZGB4FFB4TWB3GM66LO65IN/bundle.json","state":"https://pith.science/pith/CJHJZGB4FFB4TWB3GM66LO65IN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJHJZGB4FFB4TWB3GM66LO65IN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CJHJZGB4FFB4TWB3GM66LO65IN","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":"a5e5ab7edb23eb826ad36a2744662bf082984d6462b0d822cafe3b78af6c2192","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T06:31:48Z","title_canon_sha256":"780818110903d2cce4483794bb94416770a73ace7351ec8d2114d87ec82470a3"},"schema_version":"1.0","source":{"id":"2506.04670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04670","created_at":"2026-07-05T11:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04670v1","created_at":"2026-07-05T11:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04670","created_at":"2026-07-05T11:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"CJHJZGB4FFB4","created_at":"2026-07-05T11:16:18Z"},{"alias_kind":"pith_short_16","alias_value":"CJHJZGB4FFB4TWB3","created_at":"2026-07-05T11:16:18Z"},{"alias_kind":"pith_short_8","alias_value":"CJHJZGB4","created_at":"2026-07-05T11:16:18Z"}],"graph_snapshots":[{"event_id":"sha256:ed958e7b881efc748fa958f156ec6505c4b8acd1c5d1815411b8300917876893","target":"graph","created_at":"2026-07-05T11:16:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.04670/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a graph $\\Gamma$, the {\\em distance} $d_\\Gamma(u,v)$ between two distinct vertices $u$ and $v$ in $\\Gamma$ is defined as the length of the shortest path from $u$ to $v$, and the {\\em diameter} $\\mathrm{diam}(\\Gamma)$ of $\\Gamma$ is the maximum distance between $u$ and $v$ for all vertices $u$ and $v$ in the vertex set of $\\Gamma$. For a positive integer $s$, a path $(u_0,u_1,\\ldots,u_{s})$ is called an {\\em $s$-geodesic} if the distance of $u_0$ and $u_s$ is $s$. The graph $\\Gamma$ is said to be {\\em distance transitive} if for any vertices $u,v,x,y$ of $\\Ga$ such that $d_\\Ga(u,v)=d_\\Ga(x,","authors_text":"Jun-Jie Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T06:31:48Z","title":"Geodesic transitive graphs of small valency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04670","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:d54ea94d69918402a3571cad88c7747cc0c08d5d93400dcb43b0e9114e6df9d8","target":"record","created_at":"2026-07-05T11:16:18Z","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":"a5e5ab7edb23eb826ad36a2744662bf082984d6462b0d822cafe3b78af6c2192","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T06:31:48Z","title_canon_sha256":"780818110903d2cce4483794bb94416770a73ace7351ec8d2114d87ec82470a3"},"schema_version":"1.0","source":{"id":"2506.04670","kind":"arxiv","version":1}},"canonical_sha256":"124e9c983c2943c9d83b333de5bbdd4375ffca6b863ccb8bde055358807cc0da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"124e9c983c2943c9d83b333de5bbdd4375ffca6b863ccb8bde055358807cc0da","first_computed_at":"2026-07-05T11:16:18.704213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:18.704213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lGg9q1aNwh33Ddum5MD4TNhzvJb+vPafTeRw6gtq58EZ1XglIP7zE4CIN0Wduk/UfxigaCKhQ4HQvVf63v+OCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:18.704659Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.04670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d54ea94d69918402a3571cad88c7747cc0c08d5d93400dcb43b0e9114e6df9d8","sha256:ed958e7b881efc748fa958f156ec6505c4b8acd1c5d1815411b8300917876893"],"state_sha256":"43d0c6b507f7fa7825886b36dca22c6c010c46c6540af2d7a9049b501c9543c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFJgt37vivVMJKmGwL8Y+mtd7fLYGsfbw8CaMBLUPfJdgl/kau8gYQteexo8He/bbhg7KCe5Lj7AdZYDHmVbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T08:52:59.086334Z","bundle_sha256":"b75a9127b4ddd717e2540ea13c57d49fee8ad4be6ecb942b0a66e5bde4ecd3d1"}}