{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3D44FNQIBI4ZGU6T3XG3TJ7H65","short_pith_number":"pith:3D44FNQI","canonical_record":{"source":{"id":"1512.00184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-01T09:17:10Z","cross_cats_sorted":[],"title_canon_sha256":"f803a1b9fc8faf7b18bf746de10644be776f433896aeb12230cdd97869ef22d6","abstract_canon_sha256":"b2d297881b65fc564611f3c9645b610ac0d2247a63d6d50b3bbb4771a57289d2"},"schema_version":"1.0"},"canonical_sha256":"d8f9c2b6080a399353d3ddcdb9a7e7f753d812cb1f795fbdc9139f941ff11ec8","source":{"kind":"arxiv","id":"1512.00184","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00184","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00184v1","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00184","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"3D44FNQIBI4Z","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3D44FNQIBI4ZGU6T","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3D44FNQI","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3D44FNQIBI4ZGU6T3XG3TJ7H65","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-01T09:17:10Z","cross_cats_sorted":[],"title_canon_sha256":"f803a1b9fc8faf7b18bf746de10644be776f433896aeb12230cdd97869ef22d6","abstract_canon_sha256":"b2d297881b65fc564611f3c9645b610ac0d2247a63d6d50b3bbb4771a57289d2"},"schema_version":"1.0"},"canonical_sha256":"d8f9c2b6080a399353d3ddcdb9a7e7f753d812cb1f795fbdc9139f941ff11ec8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:25.913772Z","signature_b64":"OII9cpv6A5TkmamyVvD0bHsFViA7xItRBRJb+DV9xStQoXPkTWRCRaM8Mg0KcNyOqVjocUuRR7ZCWqMO/jZQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8f9c2b6080a399353d3ddcdb9a7e7f753d812cb1f795fbdc9139f941ff11ec8","last_reissued_at":"2026-05-18T01:25:25.913249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:25.913249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00184","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-05-18T01:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D82BX2AYl58QY6PZ4SAlwFqZ+tr6pOZIcfRrKbrufQl8c3/Z+vqIL3cxf05g0N9MVzp8/pKSQBQqoT+2xsXlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:46:54.332617Z"},"content_sha256":"3f55bc813ee6a1b4e4d2c5271ecb905b2e2d375528ef11da2f117dee4c45e1e9","schema_version":"1.0","event_id":"sha256:3f55bc813ee6a1b4e4d2c5271ecb905b2e2d375528ef11da2f117dee4c45e1e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3D44FNQIBI4ZGU6T3XG3TJ7H65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the diameter of hyperbolic random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Anton Krohmer, Tobias Friedrich","submitted_at":"2015-12-01T09:17:10Z","abstract_excerpt":"Large real-world networks are typically scale-free. Recent research has shown that such graphs are described best in a geometric space. More precisely, the internet can be mapped to a hyperbolic space such that geometric greedy routing performs close to optimal (Bogun\\'a, Papadopoulos, and Krioukov. Nature Communications, 1:62, 2010). This observation pushed the interest in hyperbolic networks as a natural model for scale-free networks. Hyperbolic random graphs follow a power-law degree distribution with controllable exponent $\\beta$ and show high clustering (Gugelmann, Panagiotou, and Peter. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00184","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"},"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-18T01:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKWk7Z3GUd5mLBH9swIAgpZ0MgiIJWOF1lamhdJnc1g63XO7pS9OwtDWuxa2kxFuJ7EhT1QfBKPqC6hEaqatDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T02:46:54.332950Z"},"content_sha256":"063a51152afa69ff783d2cb4fb6e75e0fcdada41e7023a14b63d222903293c3b","schema_version":"1.0","event_id":"sha256:063a51152afa69ff783d2cb4fb6e75e0fcdada41e7023a14b63d222903293c3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3D44FNQIBI4ZGU6T3XG3TJ7H65/bundle.json","state_url":"https://pith.science/pith/3D44FNQIBI4ZGU6T3XG3TJ7H65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3D44FNQIBI4ZGU6T3XG3TJ7H65/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-21T02:46:54Z","links":{"resolver":"https://pith.science/pith/3D44FNQIBI4ZGU6T3XG3TJ7H65","bundle":"https://pith.science/pith/3D44FNQIBI4ZGU6T3XG3TJ7H65/bundle.json","state":"https://pith.science/pith/3D44FNQIBI4ZGU6T3XG3TJ7H65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3D44FNQIBI4ZGU6T3XG3TJ7H65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3D44FNQIBI4ZGU6T3XG3TJ7H65","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":"b2d297881b65fc564611f3c9645b610ac0d2247a63d6d50b3bbb4771a57289d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-01T09:17:10Z","title_canon_sha256":"f803a1b9fc8faf7b18bf746de10644be776f433896aeb12230cdd97869ef22d6"},"schema_version":"1.0","source":{"id":"1512.00184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00184","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00184v1","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00184","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"3D44FNQIBI4Z","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3D44FNQIBI4ZGU6T","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3D44FNQI","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:063a51152afa69ff783d2cb4fb6e75e0fcdada41e7023a14b63d222903293c3b","target":"graph","created_at":"2026-05-18T01:25:25Z","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":"Large real-world networks are typically scale-free. Recent research has shown that such graphs are described best in a geometric space. More precisely, the internet can be mapped to a hyperbolic space such that geometric greedy routing performs close to optimal (Bogun\\'a, Papadopoulos, and Krioukov. Nature Communications, 1:62, 2010). This observation pushed the interest in hyperbolic networks as a natural model for scale-free networks. Hyperbolic random graphs follow a power-law degree distribution with controllable exponent $\\beta$ and show high clustering (Gugelmann, Panagiotou, and Peter. ","authors_text":"Anton Krohmer, Tobias Friedrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-01T09:17:10Z","title":"On the diameter of hyperbolic random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00184","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:3f55bc813ee6a1b4e4d2c5271ecb905b2e2d375528ef11da2f117dee4c45e1e9","target":"record","created_at":"2026-05-18T01:25:25Z","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":"b2d297881b65fc564611f3c9645b610ac0d2247a63d6d50b3bbb4771a57289d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-01T09:17:10Z","title_canon_sha256":"f803a1b9fc8faf7b18bf746de10644be776f433896aeb12230cdd97869ef22d6"},"schema_version":"1.0","source":{"id":"1512.00184","kind":"arxiv","version":1}},"canonical_sha256":"d8f9c2b6080a399353d3ddcdb9a7e7f753d812cb1f795fbdc9139f941ff11ec8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8f9c2b6080a399353d3ddcdb9a7e7f753d812cb1f795fbdc9139f941ff11ec8","first_computed_at":"2026-05-18T01:25:25.913249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:25.913249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OII9cpv6A5TkmamyVvD0bHsFViA7xItRBRJb+DV9xStQoXPkTWRCRaM8Mg0KcNyOqVjocUuRR7ZCWqMO/jZQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:25.913772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f55bc813ee6a1b4e4d2c5271ecb905b2e2d375528ef11da2f117dee4c45e1e9","sha256:063a51152afa69ff783d2cb4fb6e75e0fcdada41e7023a14b63d222903293c3b"],"state_sha256":"4669d281f580826f32fe0324a3978a2be96718a3f72ecf7cbd6a7e9a0dedb53d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9JJennAvaV9Gr839uuBRbpDFAV6jCXsMlbnTkgbKsqW6HYB31kBIoTb1hAQjT04fDLyT05LP7pIwDuj5FevhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T02:46:54.335043Z","bundle_sha256":"bb0a328a2d81bcdfd5ea7610c597f6547272eb8002a6cd20beff2e75d7236f8e"}}