{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VGO36XB2UBIX3SLWQM6LH4IWEJ","short_pith_number":"pith:VGO36XB2","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"},"canonical_sha256":"a99dbf5c3aa0517dc976833cb3f1162246c6ca6ca165ab2276b6576792e03ba6","source":{"kind":"arxiv","id":"1506.07811","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07811","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07811v2","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07811","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"VGO36XB2UBIX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VGO36XB2UBIX3SLW","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VGO36XB2","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VGO36XB2UBIX3SLWQM6LH4IWEJ","target":"record","payload":{"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"},"canonical_sha256":"a99dbf5c3aa0517dc976833cb3f1162246c6ca6ca165ab2276b6576792e03ba6","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"},"source_kind":"arxiv","source_id":"1506.07811","source_version":2,"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-05-18T00:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fPLlrc2PFto8B96vTDzErX6HpVMdbP9FBQ2/hIjZllwFGDsIpbLqjzHNA/UeuvNGhflO9I5CId53MdRpwqunAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:39:21.180016Z"},"content_sha256":"790b725b17434b2399035ade7db0e4ed374b4c56b125a9b46e75f6f04051b82a","schema_version":"1.0","event_id":"sha256:790b725b17434b2399035ade7db0e4ed374b4c56b125a9b46e75f6f04051b82a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VGO36XB2UBIX3SLWQM6LH4IWEJ","target":"graph","payload":{"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"},"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-05-18T00:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhWeKFHJz7KOwGz+moPWkNmg8PZ7/Ps+9FJsE1wvQ8bEhfxZo74HIro/quD4lhgV/JggrJ043oCphiKn9iWsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:39:21.180384Z"},"content_sha256":"2d80481f486ff531e14de159a7fdeaf88f398dfdd1dca049dc957a36eb36d839","schema_version":"1.0","event_id":"sha256:2d80481f486ff531e14de159a7fdeaf88f398dfdd1dca049dc957a36eb36d839"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ/bundle.json","state_url":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ/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-06-24T20:39:21Z","links":{"resolver":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ","bundle":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ/bundle.json","state":"https://pith.science/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VGO36XB2UBIX3SLWQM6LH4IWEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VGO36XB2UBIX3SLWQM6LH4IWEJ","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":"ef4ff7a753f7bd0cd864cdc1969ff470ab5bcce95b8c707c8bc2da7eb4a4d8c2","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2015-06-25T16:48:45Z","title_canon_sha256":"37a804246490803be3a6119a74df93a0ccfecee5ef537a301dd59d1515ac4cd2"},"schema_version":"1.0","source":{"id":"1506.07811","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07811","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07811v2","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07811","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"VGO36XB2UBIX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VGO36XB2UBIX3SLW","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VGO36XB2","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:2d80481f486ff531e14de159a7fdeaf88f398dfdd1dca049dc957a36eb36d839","target":"graph","created_at":"2026-05-18T00:38:44Z","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"},"paper":{"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","authors_text":"Michel Bode, Mohammed Amin Abdullah, Nikolaos Fountoulakis","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2015-06-25T16:48:45Z","title":"Typical distances in a geometric model for complex networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07811","kind":"arxiv","version":2},"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:790b725b17434b2399035ade7db0e4ed374b4c56b125a9b46e75f6f04051b82a","target":"record","created_at":"2026-05-18T00:38:44Z","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":"ef4ff7a753f7bd0cd864cdc1969ff470ab5bcce95b8c707c8bc2da7eb4a4d8c2","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2015-06-25T16:48:45Z","title_canon_sha256":"37a804246490803be3a6119a74df93a0ccfecee5ef537a301dd59d1515ac4cd2"},"schema_version":"1.0","source":{"id":"1506.07811","kind":"arxiv","version":2}},"canonical_sha256":"a99dbf5c3aa0517dc976833cb3f1162246c6ca6ca165ab2276b6576792e03ba6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a99dbf5c3aa0517dc976833cb3f1162246c6ca6ca165ab2276b6576792e03ba6","first_computed_at":"2026-05-18T00:38:44.249001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:44.249001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ajijlOLXkJOBqoL+KB0l3KNVSPn4viqpTsDNzq0QHrGBD3qyfBfwaVBj4imuY3VySPc623fGmLZAQGa9jEj3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:44.249476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07811","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:790b725b17434b2399035ade7db0e4ed374b4c56b125a9b46e75f6f04051b82a","sha256:2d80481f486ff531e14de159a7fdeaf88f398dfdd1dca049dc957a36eb36d839"],"state_sha256":"4b66899c553dc4d0d58b43b40fde97618244357688f134a8b7e51b37c7779fa4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+fs0dCJ5MgT96oL6OiEZGzsvcoDm1A7UXDipKMT5ng1e2bX6SR6bTHi6mC3LlQq7wg04GMG5VyvvyFqUwpqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:39:21.182356Z","bundle_sha256":"b6573c29dd8fe3c00677087faa69b0ac92bb0e86b0ab8e06881b3e5a4dcd1cef"}}