{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KCMCGQ2JK72XA4I2TDSSAM5FTW","short_pith_number":"pith:KCMCGQ2J","schema_version":"1.0","canonical_sha256":"509823434957f570711a98e52033a59d9b9a52b9b8527587405d1249f6469ebd","source":{"kind":"arxiv","id":"2404.16267","version":2},"attestation_state":"computed","paper":{"title":"Dynamic PageRank: Algorithms and Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub {\\L}\\k{a}cki, Krzysztof Onak, Piotr Sankowski, Rajesh Jayaram, Slobodan Mitrovi\\'c","submitted_at":"2024-04-25T00:30:28Z","abstract_excerpt":"We consider the PageRank problem in the dynamic setting, where the goal is to explicitly maintain an approximate PageRank vector $\\pi \\in \\mathbb{R}^n$ for a graph under a sequence of edge insertions and deletions. Our main result is a complete characterization of the complexity of dynamic PageRank maintenance for both multiplicative and additive ($L_1$) approximations.\n  First, we establish matching lower and upper bounds for maintaining additive approximate PageRank in both incremental and decremental settings. In particular, we demonstrate that in the worst-case $(1/\\alpha)^{\\Theta(\\log \\lo"},"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":"2404.16267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-25T00:30:28Z","cross_cats_sorted":[],"title_canon_sha256":"fc411d61bf5f66cec134c637859b4b3ebb5e13e6f52fa1582bd3012a604df663","abstract_canon_sha256":"0dc0eacaf15dd073cda5c16e7e58305269ba31fc6e6a313c6774b5b21580d3b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:11.168088Z","signature_b64":"F3+HHjmI8hCM+Q65n5+rVPZts5mGf6nhnLhpN9zd7LGzr6PgqzBtOG9ezUUZJgsNYL76iKy2uDa/zxIO6QVtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"509823434957f570711a98e52033a59d9b9a52b9b8527587405d1249f6469ebd","last_reissued_at":"2026-07-05T08:20:11.167688Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:11.167688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic PageRank: Algorithms and Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub {\\L}\\k{a}cki, Krzysztof Onak, Piotr Sankowski, Rajesh Jayaram, Slobodan Mitrovi\\'c","submitted_at":"2024-04-25T00:30:28Z","abstract_excerpt":"We consider the PageRank problem in the dynamic setting, where the goal is to explicitly maintain an approximate PageRank vector $\\pi \\in \\mathbb{R}^n$ for a graph under a sequence of edge insertions and deletions. Our main result is a complete characterization of the complexity of dynamic PageRank maintenance for both multiplicative and additive ($L_1$) approximations.\n  First, we establish matching lower and upper bounds for maintaining additive approximate PageRank in both incremental and decremental settings. In particular, we demonstrate that in the worst-case $(1/\\alpha)^{\\Theta(\\log \\lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.16267","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.16267/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.16267","created_at":"2026-07-05T08:20:11.167749+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.16267v2","created_at":"2026-07-05T08:20:11.167749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16267","created_at":"2026-07-05T08:20:11.167749+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCMCGQ2JK72X","created_at":"2026-07-05T08:20:11.167749+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCMCGQ2JK72XA4I2","created_at":"2026-07-05T08:20:11.167749+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCMCGQ2J","created_at":"2026-07-05T08:20:11.167749+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/KCMCGQ2JK72XA4I2TDSSAM5FTW","json":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW.json","graph_json":"https://pith.science/api/pith-number/KCMCGQ2JK72XA4I2TDSSAM5FTW/graph.json","events_json":"https://pith.science/api/pith-number/KCMCGQ2JK72XA4I2TDSSAM5FTW/events.json","paper":"https://pith.science/paper/KCMCGQ2J"},"agent_actions":{"view_html":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW","download_json":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW.json","view_paper":"https://pith.science/paper/KCMCGQ2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.16267&json=true","fetch_graph":"https://pith.science/api/pith-number/KCMCGQ2JK72XA4I2TDSSAM5FTW/graph.json","fetch_events":"https://pith.science/api/pith-number/KCMCGQ2JK72XA4I2TDSSAM5FTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW/action/storage_attestation","attest_author":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW/action/author_attestation","sign_citation":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW/action/citation_signature","submit_replication":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW/action/replication_record"}},"created_at":"2026-07-05T08:20:11.167749+00:00","updated_at":"2026-07-05T08:20:11.167749+00:00"}