{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KCMCGQ2JK72XA4I2TDSSAM5FTW","short_pith_number":"pith:KCMCGQ2J","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"},"canonical_sha256":"509823434957f570711a98e52033a59d9b9a52b9b8527587405d1249f6469ebd","source":{"kind":"arxiv","id":"2404.16267","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.16267","created_at":"2026-07-05T08:20:11Z"},{"alias_kind":"arxiv_version","alias_value":"2404.16267v2","created_at":"2026-07-05T08:20:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16267","created_at":"2026-07-05T08:20:11Z"},{"alias_kind":"pith_short_12","alias_value":"KCMCGQ2JK72X","created_at":"2026-07-05T08:20:11Z"},{"alias_kind":"pith_short_16","alias_value":"KCMCGQ2JK72XA4I2","created_at":"2026-07-05T08:20:11Z"},{"alias_kind":"pith_short_8","alias_value":"KCMCGQ2J","created_at":"2026-07-05T08:20:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KCMCGQ2JK72XA4I2TDSSAM5FTW","target":"record","payload":{"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"},"canonical_sha256":"509823434957f570711a98e52033a59d9b9a52b9b8527587405d1249f6469ebd","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"},"source_kind":"arxiv","source_id":"2404.16267","source_version":2,"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-07-05T08:20:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cg8lr/Z1GVwwgDoV9OdtwewqH7kAYhrHS8oMCecqw4BC6Ez1kGoW5T7Sb+LZHAD22uwu0Ff3K/Gi8rHqXrkPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T04:22:25.865044Z"},"content_sha256":"3491c835abf6ef380f50b08c2257916bbe6c325d8b285e91976360e9714e1910","schema_version":"1.0","event_id":"sha256:3491c835abf6ef380f50b08c2257916bbe6c325d8b285e91976360e9714e1910"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KCMCGQ2JK72XA4I2TDSSAM5FTW","target":"graph","payload":{"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"},"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-07-05T08:20:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2wE4wXwYF0PENGw/ksd49wNxbrV51jB4Q+D0wRaSWPHWZ2H95giKRIakQFOlqbofgCawC2RxqUzzZFc3+ywAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T04:22:25.865684Z"},"content_sha256":"9c160d9a1a0086ac14739c351e4d29459e7c0428703278a71956d6018b3c2468","schema_version":"1.0","event_id":"sha256:9c160d9a1a0086ac14739c351e4d29459e7c0428703278a71956d6018b3c2468"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW/bundle.json","state_url":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW/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-08-12T04:22:25Z","links":{"resolver":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW","bundle":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW/bundle.json","state":"https://pith.science/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCMCGQ2JK72XA4I2TDSSAM5FTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KCMCGQ2JK72XA4I2TDSSAM5FTW","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":"0dc0eacaf15dd073cda5c16e7e58305269ba31fc6e6a313c6774b5b21580d3b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-25T00:30:28Z","title_canon_sha256":"fc411d61bf5f66cec134c637859b4b3ebb5e13e6f52fa1582bd3012a604df663"},"schema_version":"1.0","source":{"id":"2404.16267","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.16267","created_at":"2026-07-05T08:20:11Z"},{"alias_kind":"arxiv_version","alias_value":"2404.16267v2","created_at":"2026-07-05T08:20:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16267","created_at":"2026-07-05T08:20:11Z"},{"alias_kind":"pith_short_12","alias_value":"KCMCGQ2JK72X","created_at":"2026-07-05T08:20:11Z"},{"alias_kind":"pith_short_16","alias_value":"KCMCGQ2JK72XA4I2","created_at":"2026-07-05T08:20:11Z"},{"alias_kind":"pith_short_8","alias_value":"KCMCGQ2J","created_at":"2026-07-05T08:20:11Z"}],"graph_snapshots":[{"event_id":"sha256:9c160d9a1a0086ac14739c351e4d29459e7c0428703278a71956d6018b3c2468","target":"graph","created_at":"2026-07-05T08:20:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.16267/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jakub {\\L}\\k{a}cki, Krzysztof Onak, Piotr Sankowski, Rajesh Jayaram, Slobodan Mitrovi\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-25T00:30:28Z","title":"Dynamic PageRank: Algorithms and Lower Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.16267","kind":"arxiv","version":2},"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:3491c835abf6ef380f50b08c2257916bbe6c325d8b285e91976360e9714e1910","target":"record","created_at":"2026-07-05T08:20:11Z","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":"0dc0eacaf15dd073cda5c16e7e58305269ba31fc6e6a313c6774b5b21580d3b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-25T00:30:28Z","title_canon_sha256":"fc411d61bf5f66cec134c637859b4b3ebb5e13e6f52fa1582bd3012a604df663"},"schema_version":"1.0","source":{"id":"2404.16267","kind":"arxiv","version":2}},"canonical_sha256":"509823434957f570711a98e52033a59d9b9a52b9b8527587405d1249f6469ebd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"509823434957f570711a98e52033a59d9b9a52b9b8527587405d1249f6469ebd","first_computed_at":"2026-07-05T08:20:11.167688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:20:11.167688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F3+HHjmI8hCM+Q65n5+rVPZts5mGf6nhnLhpN9zd7LGzr6PgqzBtOG9ezUUZJgsNYL76iKy2uDa/zxIO6QVtDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:20:11.168088Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.16267","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3491c835abf6ef380f50b08c2257916bbe6c325d8b285e91976360e9714e1910","sha256:9c160d9a1a0086ac14739c351e4d29459e7c0428703278a71956d6018b3c2468"],"state_sha256":"7ae156a2d06fac00c79d0f53c48128918cf4fa830e902f058fefebb31d861be4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7d+ZE5gnbg/eG/6vZkrMErlQieWQPh9bC11adfHacPfi5EpxdLhh9vFbcE59snfHk3P+uejeVLyK8yXRhK0QDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T04:22:25.871408Z","bundle_sha256":"cc6c014c7bac48ef8236d7f75d03663ebe5b75e9e4fe6820f944cf82cc0e6409"}}