{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BLFX6LIIM5DEMEMGOEGMK654OB","short_pith_number":"pith:BLFX6LII","schema_version":"1.0","canonical_sha256":"0acb7f2d086746461186710cc57bbc7074564a79203fd2d6e2239058695a29b4","source":{"kind":"arxiv","id":"1203.5069","version":1},"attestation_state":"computed","paper":{"title":"Random Regular Graphs are not Asymptotically Gromov Hyperbolic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.CO"],"primary_cat":"math.MG","authors_text":"Gabriel H. Tucci","submitted_at":"2012-03-22T18:20:55Z","abstract_excerpt":"In this paper we prove that random $d$--regular graphs with $d\\geq 3$ have traffic congestion of the order $O(n\\log_{d-1}^{3}(n))$ where $n$ is the number of nodes and geodesic routing is used. We also show that these graphs are not asymptotically $\\delta$--hyperbolic for any non--negative $\\delta$ almost surely as $n\\to\\infty$."},"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":"1203.5069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2012-03-22T18:20:55Z","cross_cats_sorted":["cs.NI","math.CO"],"title_canon_sha256":"9598159c1dcb792846b7586cf68b27a834912542f7e099915a80448b1daf84df","abstract_canon_sha256":"4cb1f30ee9dc31516a6ace8b55b51d0a3c854f6db4574c2bac5d7c00ff41add5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:28.006533Z","signature_b64":"RtY94HdrT6eoIiEP+5h5sbvG2i8AFZ0fpjdyUS/Qa8uqKxXNE5pTGRf4+or0IMHy/CwgXwBp/P+oYzMaTq2wDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0acb7f2d086746461186710cc57bbc7074564a79203fd2d6e2239058695a29b4","last_reissued_at":"2026-05-18T03:59:28.005972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:28.005972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Regular Graphs are not Asymptotically Gromov Hyperbolic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.CO"],"primary_cat":"math.MG","authors_text":"Gabriel H. Tucci","submitted_at":"2012-03-22T18:20:55Z","abstract_excerpt":"In this paper we prove that random $d$--regular graphs with $d\\geq 3$ have traffic congestion of the order $O(n\\log_{d-1}^{3}(n))$ where $n$ is the number of nodes and geodesic routing is used. We also show that these graphs are not asymptotically $\\delta$--hyperbolic for any non--negative $\\delta$ almost surely as $n\\to\\infty$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5069","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":"1203.5069","created_at":"2026-05-18T03:59:28.006060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.5069v1","created_at":"2026-05-18T03:59:28.006060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5069","created_at":"2026-05-18T03:59:28.006060+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLFX6LIIM5DE","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLFX6LIIM5DEMEMG","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLFX6LII","created_at":"2026-05-18T12:27:01.376967+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/BLFX6LIIM5DEMEMGOEGMK654OB","json":"https://pith.science/pith/BLFX6LIIM5DEMEMGOEGMK654OB.json","graph_json":"https://pith.science/api/pith-number/BLFX6LIIM5DEMEMGOEGMK654OB/graph.json","events_json":"https://pith.science/api/pith-number/BLFX6LIIM5DEMEMGOEGMK654OB/events.json","paper":"https://pith.science/paper/BLFX6LII"},"agent_actions":{"view_html":"https://pith.science/pith/BLFX6LIIM5DEMEMGOEGMK654OB","download_json":"https://pith.science/pith/BLFX6LIIM5DEMEMGOEGMK654OB.json","view_paper":"https://pith.science/paper/BLFX6LII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.5069&json=true","fetch_graph":"https://pith.science/api/pith-number/BLFX6LIIM5DEMEMGOEGMK654OB/graph.json","fetch_events":"https://pith.science/api/pith-number/BLFX6LIIM5DEMEMGOEGMK654OB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLFX6LIIM5DEMEMGOEGMK654OB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLFX6LIIM5DEMEMGOEGMK654OB/action/storage_attestation","attest_author":"https://pith.science/pith/BLFX6LIIM5DEMEMGOEGMK654OB/action/author_attestation","sign_citation":"https://pith.science/pith/BLFX6LIIM5DEMEMGOEGMK654OB/action/citation_signature","submit_replication":"https://pith.science/pith/BLFX6LIIM5DEMEMGOEGMK654OB/action/replication_record"}},"created_at":"2026-05-18T03:59:28.006060+00:00","updated_at":"2026-05-18T03:59:28.006060+00:00"}