{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:DFJARFB57BXJYGUPEST52LGZ4V","short_pith_number":"pith:DFJARFB5","schema_version":"1.0","canonical_sha256":"195208943df86e9c1a8f24a7dd2cd9e57182a1ea6f542df6cb3737fe1d265f29","source":{"kind":"arxiv","id":"math/0610089","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0610089","created_at":"2026-07-04T14:57:05.959893+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0610089v1","created_at":"2026-07-04T14:57:05.959893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0610089","created_at":"2026-07-04T14:57:05.959893+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFJARFB57BXJ","created_at":"2026-07-04T14:57:05.959893+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFJARFB57BXJYGUP","created_at":"2026-07-04T14:57:05.959893+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFJARFB5","created_at":"2026-07-04T14:57:05.959893+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/DFJARFB57BXJYGUPEST52LGZ4V","json":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V.json","graph_json":"https://pith.science/api/pith-number/DFJARFB57BXJYGUPEST52LGZ4V/graph.json","events_json":"https://pith.science/api/pith-number/DFJARFB57BXJYGUPEST52LGZ4V/events.json","paper":"https://pith.science/paper/DFJARFB5"},"agent_actions":{"view_html":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V","download_json":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V.json","view_paper":"https://pith.science/paper/DFJARFB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0610089&json=true","fetch_graph":"https://pith.science/api/pith-number/DFJARFB57BXJYGUPEST52LGZ4V/graph.json","fetch_events":"https://pith.science/api/pith-number/DFJARFB57BXJYGUPEST52LGZ4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V/action/storage_attestation","attest_author":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V/action/author_attestation","sign_citation":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V/action/citation_signature","submit_replication":"https://pith.science/pith/DFJARFB57BXJYGUPEST52LGZ4V/action/replication_record"}},"created_at":"2026-07-04T14:57:05.959893+00:00","updated_at":"2026-07-04T14:57:05.959893+00:00"}