{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:DFJARFB57BXJYGUPEST52LGZ4V","short_pith_number":"pith:DFJARFB5","canonical_record":{"source":{"id":"math/0610089","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.MG","submitted_at":"2006-10-02T20:07:35Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"402ad9e2d58e4042ddc37b223f5faea9c026890353a9a2bb69322483e7e84ba2","abstract_canon_sha256":"90733c449e3d53d4757fc408af13c0ec3cd7cf81e3f4819da76cbd2fceb480bd"},"schema_version":"1.0"},"canonical_sha256":"195208943df86e9c1a8f24a7dd2cd9e57182a1ea6f542df6cb3737fe1d265f29","source":{"kind":"arxiv","id":"math/0610089","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0610089","created_at":"2026-07-04T14:57:05Z"},{"alias_kind":"arxiv_version","alias_value":"math/0610089v1","created_at":"2026-07-04T14:57:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0610089","created_at":"2026-07-04T14:57:05Z"},{"alias_kind":"pith_short_12","alias_value":"DFJARFB57BXJ","created_at":"2026-07-04T14:57:05Z"},{"alias_kind":"pith_short_16","alias_value":"DFJARFB57BXJYGUP","created_at":"2026-07-04T14:57:05Z"},{"alias_kind":"pith_short_8","alias_value":"DFJARFB5","created_at":"2026-07-04T14:57:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:DFJARFB57BXJYGUPEST52LGZ4V","target":"record","payload":{"canonical_record":{"source":{"id":"math/0610089","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.MG","submitted_at":"2006-10-02T20:07:35Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"402ad9e2d58e4042ddc37b223f5faea9c026890353a9a2bb69322483e7e84ba2","abstract_canon_sha256":"90733c449e3d53d4757fc408af13c0ec3cd7cf81e3f4819da76cbd2fceb480bd"},"schema_version":"1.0"},"canonical_sha256":"195208943df86e9c1a8f24a7dd2cd9e57182a1ea6f542df6cb3737fe1d265f29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:57:05.960168Z","signature_b64":"5ZbD8hV+ZO7uqMk6b7uq2yZJuSNt0Y5GLBQFCm8V0QVZXG1HDFRgj78c3n/9rtyf3/f1VZfbsHuvmAZGuhauDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"195208943df86e9c1a8f24a7dd2cd9e57182a1ea6f542df6cb3737fe1d265f29","last_reissued_at":"2026-07-04T14:57:05.959833Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:57:05.959833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0610089","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-04T14:57:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5H3Al+swWa7nyzArAeis3f6/LWEdd6+Ybh+nqJ35MY9ApVlV5kQ8oX6+GoCLUSQsSYJNfV4vpgqBXsseOIqrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:56:43.160564Z"},"content_sha256":"b96cd21569de670993d0484cf15b3139df7f03651a214d0be5ada38999fcec50","schema_version":"1.0","event_id":"sha256:b96cd21569de670993d0484cf15b3139df7f03651a214d0be5ada38999fcec50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:DFJARFB57BXJYGUPEST52LGZ4V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geodesics and almost geodesic cycles in random regular graphs","license":"","headline":"","cross_cats":["math.PR"],"primary_cat":"math.MG","authors_text":"Carlos Hoppen, Eran Ofek, Itai Benjamini, Nick Wormald, Pawel Pralat","submitted_at":"2006-10-02T20:07:35Z","abstract_excerpt":"A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d_G(u,v) is at least d_C(u,v)-e(n). Let f(n) be any function tending to infinity with n. We consider a random d-regular graph on n vertices. We show that almost all pairs of vertices belong to an almost geodesic cycle C with e(n)= \\log_{d-1} \\log_{d-1} n +f(n) and |C|=2\\log_{d-1}n+O(f(n)). Along the way, we obtain results on near-geodesic paths. We also give the limiting distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0610089","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/math/0610089/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-04T14:57:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qu0O3gcYHvwpVKx39UjLjBmq59QgzqMNOaCGl5b+urE+dM48A/ufCblDagNijZm2DC8a2dnEFFEktKwEbX1XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:56:43.161460Z"},"content_sha256":"457668472658741595694218df0d6aff7934548b713fb5ebb261af66f8f24a8b","schema_version":"1.0","event_id":"sha256:457668472658741595694218df0d6aff7934548b713fb5ebb261af66f8f24a8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V/bundle.json","state_url":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DFJARFB57BXJYGUPEST52LGZ4V/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-11T02:56:43Z","links":{"resolver":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V","bundle":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V/bundle.json","state":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DFJARFB57BXJYGUPEST52LGZ4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:DFJARFB57BXJYGUPEST52LGZ4V","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":"90733c449e3d53d4757fc408af13c0ec3cd7cf81e3f4819da76cbd2fceb480bd","cross_cats_sorted":["math.PR"],"license":"","primary_cat":"math.MG","submitted_at":"2006-10-02T20:07:35Z","title_canon_sha256":"402ad9e2d58e4042ddc37b223f5faea9c026890353a9a2bb69322483e7e84ba2"},"schema_version":"1.0","source":{"id":"math/0610089","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0610089","created_at":"2026-07-04T14:57:05Z"},{"alias_kind":"arxiv_version","alias_value":"math/0610089v1","created_at":"2026-07-04T14:57:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0610089","created_at":"2026-07-04T14:57:05Z"},{"alias_kind":"pith_short_12","alias_value":"DFJARFB57BXJ","created_at":"2026-07-04T14:57:05Z"},{"alias_kind":"pith_short_16","alias_value":"DFJARFB57BXJYGUP","created_at":"2026-07-04T14:57:05Z"},{"alias_kind":"pith_short_8","alias_value":"DFJARFB5","created_at":"2026-07-04T14:57:05Z"}],"graph_snapshots":[{"event_id":"sha256:457668472658741595694218df0d6aff7934548b713fb5ebb261af66f8f24a8b","target":"graph","created_at":"2026-07-04T14:57:05Z","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/math/0610089/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d_G(u,v) is at least d_C(u,v)-e(n). Let f(n) be any function tending to infinity with n. We consider a random d-regular graph on n vertices. We show that almost all pairs of vertices belong to an almost geodesic cycle C with e(n)= \\log_{d-1} \\log_{d-1} n +f(n) and |C|=2\\log_{d-1}n+O(f(n)). Along the way, we obtain results on near-geodesic paths. We also give the limiting distri","authors_text":"Carlos Hoppen, Eran Ofek, Itai Benjamini, Nick Wormald, Pawel Pralat","cross_cats":["math.PR"],"headline":"","license":"","primary_cat":"math.MG","submitted_at":"2006-10-02T20:07:35Z","title":"Geodesics and almost geodesic cycles in random regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0610089","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:b96cd21569de670993d0484cf15b3139df7f03651a214d0be5ada38999fcec50","target":"record","created_at":"2026-07-04T14:57:05Z","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":"90733c449e3d53d4757fc408af13c0ec3cd7cf81e3f4819da76cbd2fceb480bd","cross_cats_sorted":["math.PR"],"license":"","primary_cat":"math.MG","submitted_at":"2006-10-02T20:07:35Z","title_canon_sha256":"402ad9e2d58e4042ddc37b223f5faea9c026890353a9a2bb69322483e7e84ba2"},"schema_version":"1.0","source":{"id":"math/0610089","kind":"arxiv","version":1}},"canonical_sha256":"195208943df86e9c1a8f24a7dd2cd9e57182a1ea6f542df6cb3737fe1d265f29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"195208943df86e9c1a8f24a7dd2cd9e57182a1ea6f542df6cb3737fe1d265f29","first_computed_at":"2026-07-04T14:57:05.959833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:57:05.959833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ZbD8hV+ZO7uqMk6b7uq2yZJuSNt0Y5GLBQFCm8V0QVZXG1HDFRgj78c3n/9rtyf3/f1VZfbsHuvmAZGuhauDQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:57:05.960168Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0610089","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b96cd21569de670993d0484cf15b3139df7f03651a214d0be5ada38999fcec50","sha256:457668472658741595694218df0d6aff7934548b713fb5ebb261af66f8f24a8b"],"state_sha256":"6b0b3801d439c7693f4df51b231cf11abf897d73b3a6025f0d731a53fd87d4b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"evLai6TwJWzCGgVJfJ4DJ76KqQ2C+chkKHJATg01JvN0PGlnPBV0nUL6f8Kp6K+dvVdWuufIhNMj96M9KdlqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T02:56:43.191523Z","bundle_sha256":"1bc076febe09a47304381fcb846681ec231495d1a7f397b1db0a8a5e922ed4e2"}}