{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:H65A4TABEY2FCK7TPH6XWADHBI","short_pith_number":"pith:H65A4TAB","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"},"canonical_sha256":"3fba0e4c012634512bf379fd7b00670a2813e7d3ada4707717999104ecd39143","source":{"kind":"arxiv","id":"1606.09481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09481","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09481v1","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09481","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"H65A4TABEY2F","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H65A4TABEY2FCK7T","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H65A4TAB","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:H65A4TABEY2FCK7TPH6XWADHBI","target":"record","payload":{"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"},"canonical_sha256":"3fba0e4c012634512bf379fd7b00670a2813e7d3ada4707717999104ecd39143","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"},"source_kind":"arxiv","source_id":"1606.09481","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:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhg/DIUdsZd3Rc+bZGsoCZheJl2Q1lBAEOr0XIcSrGPwJ5n81aT13ENZcQ9VIGNM/StV0Czd610JrQSp09XcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:28:39.081476Z"},"content_sha256":"ff488908135023abcad1df62acda7c7ae3148b66a1d5712dd8146093153a80c4","schema_version":"1.0","event_id":"sha256:ff488908135023abcad1df62acda7c7ae3148b66a1d5712dd8146093153a80c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:H65A4TABEY2FCK7TPH6XWADHBI","target":"graph","payload":{"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"},"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:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"chXO5+6OegGr54X8sy396wNjRHXV2wymxf+hH+6jOM93fhrxdvnnQurGKnVCczCdGNHje5NmWCsDzfWPxUqGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:28:39.081815Z"},"content_sha256":"07e9be95dc416aeba1c104ceb548ca82f0be6861495e0b513fed20d56de3a29b","schema_version":"1.0","event_id":"sha256:07e9be95dc416aeba1c104ceb548ca82f0be6861495e0b513fed20d56de3a29b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI/bundle.json","state_url":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H65A4TABEY2FCK7TPH6XWADHBI/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-24T19:28:39Z","links":{"resolver":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI","bundle":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI/bundle.json","state":"https://pith.science/pith/H65A4TABEY2FCK7TPH6XWADHBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H65A4TABEY2FCK7TPH6XWADHBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:H65A4TABEY2FCK7TPH6XWADHBI","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":"4511b3083af4e924b6c0260cb6d46a93dc1e5145c8595a09461cbbdc9d4acf36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-30T13:28:52Z","title_canon_sha256":"223f37dd2c950272e912a471033da5f881ac40dcd2ae508aa3e620e77fed357a"},"schema_version":"1.0","source":{"id":"1606.09481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09481","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09481v1","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09481","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"H65A4TABEY2F","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H65A4TABEY2FCK7T","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H65A4TAB","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:07e9be95dc416aeba1c104ceb548ca82f0be6861495e0b513fed20d56de3a29b","target":"graph","created_at":"2026-05-18T01:11:40Z","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":"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","authors_text":"Henning Meyerhenke, Moritz von Looz, Mustafa \\\"Ozdayi, S\\\"oren Laue","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-30T13:28:52Z","title":"Generating massive complex networks with hyperbolic geometry faster in practice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09481","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:ff488908135023abcad1df62acda7c7ae3148b66a1d5712dd8146093153a80c4","target":"record","created_at":"2026-05-18T01:11:40Z","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":"4511b3083af4e924b6c0260cb6d46a93dc1e5145c8595a09461cbbdc9d4acf36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-30T13:28:52Z","title_canon_sha256":"223f37dd2c950272e912a471033da5f881ac40dcd2ae508aa3e620e77fed357a"},"schema_version":"1.0","source":{"id":"1606.09481","kind":"arxiv","version":1}},"canonical_sha256":"3fba0e4c012634512bf379fd7b00670a2813e7d3ada4707717999104ecd39143","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fba0e4c012634512bf379fd7b00670a2813e7d3ada4707717999104ecd39143","first_computed_at":"2026-05-18T01:11:40.396245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:40.396245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LArcvyFvcedDUdqrnltoPphW6FPw0iPygitXZMh1oExRAwn6/8Mzgq1WwUc/WSwIUsbMKQhYnP5TS9idCX7pDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:40.396606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.09481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff488908135023abcad1df62acda7c7ae3148b66a1d5712dd8146093153a80c4","sha256:07e9be95dc416aeba1c104ceb548ca82f0be6861495e0b513fed20d56de3a29b"],"state_sha256":"d28c34ccf91e9a9c20fb2081e714339feaffe41638b226d46757a9ad2abc94bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgewyEl0JI+rHZHGitQUNKfNpbIR/HR6fyhuh2dhUf5hnKlOdVAHMijDeKLBmGJxDytFZ8HteBygKc4vbv0oCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:28:39.083635Z","bundle_sha256":"c5ba4f00183d57fa4fbbf6d91b17a67f0299dce8262589edeb4e22b2ed0950ba"}}