{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:H65A4TABEY2FCK7TPH6XWADHBI","short_pith_number":"pith:H65A4TAB","schema_version":"1.0","canonical_sha256":"3fba0e4c012634512bf379fd7b00670a2813e7d3ada4707717999104ecd39143","source":{"kind":"arxiv","id":"1606.09481","version":1},"attestation_state":"computed","paper":{"title":"Generating massive complex networks with hyperbolic geometry faster in practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Henning Meyerhenke, Moritz von Looz, Mustafa \\\"Ozdayi, S\\\"oren Laue","submitted_at":"2016-06-30T13:28:52Z","abstract_excerpt":"Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. The commonly used graph-based benchmark model R-MAT has some drawbacks concerning realism and the scaling behavior of network properties. A complex network model gaining considerable popularity builds random hyperbolic graphs, generated by distributing points within a disk in the hyperbolic plane and then adding edges between points whose hyperbolic distance is below a threshold.\n  We present in this paper a fast generation algorithm"},"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":"1606.09481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-30T13:28:52Z","cross_cats_sorted":[],"title_canon_sha256":"223f37dd2c950272e912a471033da5f881ac40dcd2ae508aa3e620e77fed357a","abstract_canon_sha256":"4511b3083af4e924b6c0260cb6d46a93dc1e5145c8595a09461cbbdc9d4acf36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:40.396606Z","signature_b64":"LArcvyFvcedDUdqrnltoPphW6FPw0iPygitXZMh1oExRAwn6/8Mzgq1WwUc/WSwIUsbMKQhYnP5TS9idCX7pDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fba0e4c012634512bf379fd7b00670a2813e7d3ada4707717999104ecd39143","last_reissued_at":"2026-05-18T01:11:40.396245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:40.396245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating massive complex networks with hyperbolic geometry faster in practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Henning Meyerhenke, Moritz von Looz, Mustafa \\\"Ozdayi, S\\\"oren Laue","submitted_at":"2016-06-30T13:28:52Z","abstract_excerpt":"Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. The commonly used graph-based benchmark model R-MAT has some drawbacks concerning realism and the scaling behavior of network properties. A complex network model gaining considerable popularity builds random hyperbolic graphs, generated by distributing points within a disk in the hyperbolic plane and then adding edges between points whose hyperbolic distance is below a threshold.\n  We present in this paper a fast generation algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09481","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":"1606.09481","created_at":"2026-05-18T01:11:40.396305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.09481v1","created_at":"2026-05-18T01:11:40.396305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09481","created_at":"2026-05-18T01:11:40.396305+00:00"},{"alias_kind":"pith_short_12","alias_value":"H65A4TABEY2F","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"H65A4TABEY2FCK7T","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"H65A4TAB","created_at":"2026-05-18T12:30:19.053100+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/H65A4TABEY2FCK7TPH6XWADHBI","json":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI.json","graph_json":"https://pith.science/api/pith-number/H65A4TABEY2FCK7TPH6XWADHBI/graph.json","events_json":"https://pith.science/api/pith-number/H65A4TABEY2FCK7TPH6XWADHBI/events.json","paper":"https://pith.science/paper/H65A4TAB"},"agent_actions":{"view_html":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI","download_json":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI.json","view_paper":"https://pith.science/paper/H65A4TAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.09481&json=true","fetch_graph":"https://pith.science/api/pith-number/H65A4TABEY2FCK7TPH6XWADHBI/graph.json","fetch_events":"https://pith.science/api/pith-number/H65A4TABEY2FCK7TPH6XWADHBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI/action/storage_attestation","attest_author":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI/action/author_attestation","sign_citation":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI/action/citation_signature","submit_replication":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI/action/replication_record"}},"created_at":"2026-05-18T01:11:40.396305+00:00","updated_at":"2026-05-18T01:11:40.396305+00:00"}