{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PAKRMM3B3WQHCBAZNM3BWUDFWL","short_pith_number":"pith:PAKRMM3B","schema_version":"1.0","canonical_sha256":"7815163361dda07104196b361b5065b2d7229005acf998dc7d2b569909c7c11b","source":{"kind":"arxiv","id":"1802.03297","version":1},"attestation_state":"computed","paper":{"title":"Updating Dynamic Random Hyperbolic Graphs in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Henning Meyerhenke, Moritz von Looz","submitted_at":"2018-02-08T16:41:57Z","abstract_excerpt":"Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. 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 with a probability depending on their hyperbolic distance.\n  We present a dynamic extension to model gradual network change, while preserving at each step the point position probabilities. To process the dynamic changes efficiently, we form"},"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":"1802.03297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-08T16:41:57Z","cross_cats_sorted":[],"title_canon_sha256":"0ece2b78d1c0f5b1436dec2e996d8f35f84606d498c94e9e1694f7f66ab794ca","abstract_canon_sha256":"031e3e879f630b3f52df9953ddc83afd7764d21f03df6d4f6196461c6e2b6a18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:58.054775Z","signature_b64":"RbkQhowbtWKHiqR95iH3aKa6YVlIioMVlyeX3vATGqPe5ywCbS9qpjzQLHE6m6sgUII+zpvpX3cu4W+jfoXEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7815163361dda07104196b361b5065b2d7229005acf998dc7d2b569909c7c11b","last_reissued_at":"2026-05-18T00:23:58.054253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:58.054253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Updating Dynamic Random Hyperbolic Graphs in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Henning Meyerhenke, Moritz von Looz","submitted_at":"2018-02-08T16:41:57Z","abstract_excerpt":"Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. 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 with a probability depending on their hyperbolic distance.\n  We present a dynamic extension to model gradual network change, while preserving at each step the point position probabilities. To process the dynamic changes efficiently, we form"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03297","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":"1802.03297","created_at":"2026-05-18T00:23:58.054327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03297v1","created_at":"2026-05-18T00:23:58.054327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03297","created_at":"2026-05-18T00:23:58.054327+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAKRMM3B3WQH","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAKRMM3B3WQHCBAZ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAKRMM3B","created_at":"2026-05-18T12:32:43.782077+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/PAKRMM3B3WQHCBAZNM3BWUDFWL","json":"https://pith.science/pith/PAKRMM3B3WQHCBAZNM3BWUDFWL.json","graph_json":"https://pith.science/api/pith-number/PAKRMM3B3WQHCBAZNM3BWUDFWL/graph.json","events_json":"https://pith.science/api/pith-number/PAKRMM3B3WQHCBAZNM3BWUDFWL/events.json","paper":"https://pith.science/paper/PAKRMM3B"},"agent_actions":{"view_html":"https://pith.science/pith/PAKRMM3B3WQHCBAZNM3BWUDFWL","download_json":"https://pith.science/pith/PAKRMM3B3WQHCBAZNM3BWUDFWL.json","view_paper":"https://pith.science/paper/PAKRMM3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03297&json=true","fetch_graph":"https://pith.science/api/pith-number/PAKRMM3B3WQHCBAZNM3BWUDFWL/graph.json","fetch_events":"https://pith.science/api/pith-number/PAKRMM3B3WQHCBAZNM3BWUDFWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAKRMM3B3WQHCBAZNM3BWUDFWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAKRMM3B3WQHCBAZNM3BWUDFWL/action/storage_attestation","attest_author":"https://pith.science/pith/PAKRMM3B3WQHCBAZNM3BWUDFWL/action/author_attestation","sign_citation":"https://pith.science/pith/PAKRMM3B3WQHCBAZNM3BWUDFWL/action/citation_signature","submit_replication":"https://pith.science/pith/PAKRMM3B3WQHCBAZNM3BWUDFWL/action/replication_record"}},"created_at":"2026-05-18T00:23:58.054327+00:00","updated_at":"2026-05-18T00:23:58.054327+00:00"}