{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZVBLHJ4FSKYWWCGHQIT7BOMWPJ","short_pith_number":"pith:ZVBLHJ4F","schema_version":"1.0","canonical_sha256":"cd42b3a78592b16b08c78227f0b9967a4ee7a0eef39da031f1c977157ce954b4","source":{"kind":"arxiv","id":"1807.03847","version":1},"attestation_state":"computed","paper":{"title":"Scalable Katz Ranking Computation in Large Static and Dynamic Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexander van der Grinten, David A. Bader, Elisabetta Bergamini, Henning Meyerhenke, Oded Green","submitted_at":"2018-07-10T20:18:40Z","abstract_excerpt":"Network analysis defines a number of centrality measures to identify the most central nodes in a network. Fast computation of those measures is a major challenge in algorithmic network analysis. Aside from closeness and betweenness, Katz centrality is one of the established centrality measures. In this paper, we consider the problem of computing rankings for Katz centrality. In particular, we propose upper and lower bounds on the Katz score of a given node. While previous approaches relied on numerical approximation or heuristics to compute Katz centrality rankings, we construct an algorithm t"},"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":"1807.03847","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T20:18:40Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"cd69bbfdfff7a6b912d3a76dc203de72145d66860119178a53580a8ab5ee66e5","abstract_canon_sha256":"7f4a1c7c4f0955698fa566cad70488c4a6894aeb1a5b42ebba307dece25eb33b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:58.863725Z","signature_b64":"FUH/+Xt/2Yblj+HLmyWZLAyWuVo4VTy8xKpFzoiuc3EGKnyFJax3Wziba+a7lu7MzRPJf61iQNIygg5HBrQpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd42b3a78592b16b08c78227f0b9967a4ee7a0eef39da031f1c977157ce954b4","last_reissued_at":"2026-05-18T00:10:58.862988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:58.862988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Katz Ranking Computation in Large Static and Dynamic Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexander van der Grinten, David A. Bader, Elisabetta Bergamini, Henning Meyerhenke, Oded Green","submitted_at":"2018-07-10T20:18:40Z","abstract_excerpt":"Network analysis defines a number of centrality measures to identify the most central nodes in a network. Fast computation of those measures is a major challenge in algorithmic network analysis. Aside from closeness and betweenness, Katz centrality is one of the established centrality measures. In this paper, we consider the problem of computing rankings for Katz centrality. In particular, we propose upper and lower bounds on the Katz score of a given node. While previous approaches relied on numerical approximation or heuristics to compute Katz centrality rankings, we construct an algorithm t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03847","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":"1807.03847","created_at":"2026-05-18T00:10:58.863100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03847v1","created_at":"2026-05-18T00:10:58.863100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03847","created_at":"2026-05-18T00:10:58.863100+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVBLHJ4FSKYW","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVBLHJ4FSKYWWCGH","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVBLHJ4F","created_at":"2026-05-18T12:33:07.085635+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/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ","json":"https://pith.science/pith/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ.json","graph_json":"https://pith.science/api/pith-number/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ/graph.json","events_json":"https://pith.science/api/pith-number/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ/events.json","paper":"https://pith.science/paper/ZVBLHJ4F"},"agent_actions":{"view_html":"https://pith.science/pith/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ","download_json":"https://pith.science/pith/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ.json","view_paper":"https://pith.science/paper/ZVBLHJ4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03847&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZVBLHJ4FSKYWWCGHQIT7BOMWPJ/action/replication_record"}},"created_at":"2026-05-18T00:10:58.863100+00:00","updated_at":"2026-05-18T00:10:58.863100+00:00"}