{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D3N64SMKNZEODUDL4423Q47STS","short_pith_number":"pith:D3N64SMK","schema_version":"1.0","canonical_sha256":"1edbee498a6e48e1d06be735b873f29c8db00b43579740a25b63b233a38bc68d","source":{"kind":"arxiv","id":"1501.03545","version":3},"attestation_state":"computed","paper":{"title":"Fast generation of complex networks with underlying hyperbolic geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian L. Staudt, Henning Meyerhenke, Moritz von Looz, Roman Prutkin","submitted_at":"2015-01-15T00:52:44Z","abstract_excerpt":"Complex networks have become increasingly popular for modeling various real-world phenomena. Realistic generative network models are important in this context as they avoid privacy concerns of real data and simplify complex network research regarding data sharing, reproducibility, and scalability studies. \\emph{Random hyperbolic graphs} are a well-analyzed family of geometric graphs. Previous work provided empirical and theoretical evidence that this generative graph model creates networks with non-vanishing clustering and other realistic features. However, the investigated networks in previou"},"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":"1501.03545","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-15T00:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"b972558ba4ef635669f7d0c81eaa38ef72056c6ec9cf5cbd060f76588c70e018","abstract_canon_sha256":"788c5a233dffb76967a7a45c3f10aab70d9da0ad50b1dad4c99027b149389721"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:03.578567Z","signature_b64":"DEkiq99+xzMjOkQPF2UBHmuc/17/VcL5aKth18qcLjwL1we7Bob7gWRuITceuLT/CaianMNTfddxVS0C6G3BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1edbee498a6e48e1d06be735b873f29c8db00b43579740a25b63b233a38bc68d","last_reissued_at":"2026-05-18T02:18:03.577757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:03.577757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast generation of complex networks with underlying hyperbolic geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian L. Staudt, Henning Meyerhenke, Moritz von Looz, Roman Prutkin","submitted_at":"2015-01-15T00:52:44Z","abstract_excerpt":"Complex networks have become increasingly popular for modeling various real-world phenomena. Realistic generative network models are important in this context as they avoid privacy concerns of real data and simplify complex network research regarding data sharing, reproducibility, and scalability studies. \\emph{Random hyperbolic graphs} are a well-analyzed family of geometric graphs. Previous work provided empirical and theoretical evidence that this generative graph model creates networks with non-vanishing clustering and other realistic features. However, the investigated networks in previou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03545","kind":"arxiv","version":3},"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":"1501.03545","created_at":"2026-05-18T02:18:03.577885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03545v3","created_at":"2026-05-18T02:18:03.577885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03545","created_at":"2026-05-18T02:18:03.577885+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3N64SMKNZEO","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3N64SMKNZEODUDL","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3N64SMK","created_at":"2026-05-18T12:29:17.054201+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/D3N64SMKNZEODUDL4423Q47STS","json":"https://pith.science/pith/D3N64SMKNZEODUDL4423Q47STS.json","graph_json":"https://pith.science/api/pith-number/D3N64SMKNZEODUDL4423Q47STS/graph.json","events_json":"https://pith.science/api/pith-number/D3N64SMKNZEODUDL4423Q47STS/events.json","paper":"https://pith.science/paper/D3N64SMK"},"agent_actions":{"view_html":"https://pith.science/pith/D3N64SMKNZEODUDL4423Q47STS","download_json":"https://pith.science/pith/D3N64SMKNZEODUDL4423Q47STS.json","view_paper":"https://pith.science/paper/D3N64SMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03545&json=true","fetch_graph":"https://pith.science/api/pith-number/D3N64SMKNZEODUDL4423Q47STS/graph.json","fetch_events":"https://pith.science/api/pith-number/D3N64SMKNZEODUDL4423Q47STS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3N64SMKNZEODUDL4423Q47STS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3N64SMKNZEODUDL4423Q47STS/action/storage_attestation","attest_author":"https://pith.science/pith/D3N64SMKNZEODUDL4423Q47STS/action/author_attestation","sign_citation":"https://pith.science/pith/D3N64SMKNZEODUDL4423Q47STS/action/citation_signature","submit_replication":"https://pith.science/pith/D3N64SMKNZEODUDL4423Q47STS/action/replication_record"}},"created_at":"2026-05-18T02:18:03.577885+00:00","updated_at":"2026-05-18T02:18:03.577885+00:00"}