{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VGO36XB2UBIX3SLWQM6LH4IWEJ","short_pith_number":"pith:VGO36XB2","schema_version":"1.0","canonical_sha256":"a99dbf5c3aa0517dc976833cb3f1162246c6ca6ca165ab2276b6576792e03ba6","source":{"kind":"arxiv","id":"1506.07811","version":2},"attestation_state":"computed","paper":{"title":"Typical distances in a geometric model for complex networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Michel Bode, Mohammed Amin Abdullah, Nikolaos Fountoulakis","submitted_at":"2015-06-25T16:48:45Z","abstract_excerpt":"We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic plane and any two of them are joined if they are within a threshold hyperbolic distance. With appropriately chosen parameters, the random graph is sparse and exhibits power law degree distribution as well as local clustering. In this paper we show a further property: the distance between two uniformly chosen vertices that belong to the same component is doubly l"},"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":"1506.07811","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2015-06-25T16:48:45Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"37a804246490803be3a6119a74df93a0ccfecee5ef537a301dd59d1515ac4cd2","abstract_canon_sha256":"ef4ff7a753f7bd0cd864cdc1969ff470ab5bcce95b8c707c8bc2da7eb4a4d8c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:44.249476Z","signature_b64":"ajijlOLXkJOBqoL+KB0l3KNVSPn4viqpTsDNzq0QHrGBD3qyfBfwaVBj4imuY3VySPc623fGmLZAQGa9jEj3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a99dbf5c3aa0517dc976833cb3f1162246c6ca6ca165ab2276b6576792e03ba6","last_reissued_at":"2026-05-18T00:38:44.249001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:44.249001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Typical distances in a geometric model for complex networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Michel Bode, Mohammed Amin Abdullah, Nikolaos Fountoulakis","submitted_at":"2015-06-25T16:48:45Z","abstract_excerpt":"We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic plane and any two of them are joined if they are within a threshold hyperbolic distance. With appropriately chosen parameters, the random graph is sparse and exhibits power law degree distribution as well as local clustering. In this paper we show a further property: the distance between two uniformly chosen vertices that belong to the same component is doubly l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07811","kind":"arxiv","version":2},"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":"1506.07811","created_at":"2026-05-18T00:38:44.249068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07811v2","created_at":"2026-05-18T00:38:44.249068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07811","created_at":"2026-05-18T00:38:44.249068+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGO36XB2UBIX","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGO36XB2UBIX3SLW","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGO36XB2","created_at":"2026-05-18T12:29:44.643036+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/VGO36XB2UBIX3SLWQM6LH4IWEJ","json":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ.json","graph_json":"https://pith.science/api/pith-number/VGO36XB2UBIX3SLWQM6LH4IWEJ/graph.json","events_json":"https://pith.science/api/pith-number/VGO36XB2UBIX3SLWQM6LH4IWEJ/events.json","paper":"https://pith.science/paper/VGO36XB2"},"agent_actions":{"view_html":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ","download_json":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ.json","view_paper":"https://pith.science/paper/VGO36XB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07811&json=true","fetch_graph":"https://pith.science/api/pith-number/VGO36XB2UBIX3SLWQM6LH4IWEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VGO36XB2UBIX3SLWQM6LH4IWEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ/action/storage_attestation","attest_author":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ/action/author_attestation","sign_citation":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ/action/citation_signature","submit_replication":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ/action/replication_record"}},"created_at":"2026-05-18T00:38:44.249068+00:00","updated_at":"2026-05-18T00:38:44.249068+00:00"}