{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AI2BJIUZBVQLETETE4MTN2V3C5","short_pith_number":"pith:AI2BJIUZ","schema_version":"1.0","canonical_sha256":"023414a2990d60b24c93271936eabb175822106c89f2e9457b34c3fddbd1b463","source":{"kind":"arxiv","id":"2401.01019","version":1},"attestation_state":"computed","paper":{"title":"Approximating Single-Source Personalized PageRank with Absolute Error Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ji-Rong Wen, Mingji Yang, Zhewei Wei","submitted_at":"2024-01-02T04:07:29Z","abstract_excerpt":"Personalized PageRank (PPR) is an extensively studied and applied node proximity measure in graphs. For a pair of nodes $s$ and $t$ on a graph $G=(V,E)$, the PPR value $\\pi(s,t)$ is defined as the probability that an $\\alpha$-discounted random walk from $s$ terminates at $t$, where the walk terminates with probability $\\alpha$ at each step. We study the classic Single-Source PPR query, which asks for PPR approximations from a given source node $s$ to all nodes in the graph. Specifically, we aim to provide approximations with absolute error guarantees, ensuring that the resultant PPR estimates "},"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":"2401.01019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-01-02T04:07:29Z","cross_cats_sorted":[],"title_canon_sha256":"15b4d1b94cf6df4a31bb09bcc65e4759ee99a0ea4141364c02ceca997ddee092","abstract_canon_sha256":"dbdf6d5372c4a54ae5a3c5511dcd3560989cb8b0f61280500a56892078f5f648"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:26.062670Z","signature_b64":"v/A+evjl5tavsFGwLtCqpqZqHytuF2QGgTUG8KSAB6ZJ/cOQ/GgrOzmZPk5b9v70mVyNaJ78RDvgk+6Lm5lGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"023414a2990d60b24c93271936eabb175822106c89f2e9457b34c3fddbd1b463","last_reissued_at":"2026-07-05T07:58:26.062140Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:26.062140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Single-Source Personalized PageRank with Absolute Error Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ji-Rong Wen, Mingji Yang, Zhewei Wei","submitted_at":"2024-01-02T04:07:29Z","abstract_excerpt":"Personalized PageRank (PPR) is an extensively studied and applied node proximity measure in graphs. For a pair of nodes $s$ and $t$ on a graph $G=(V,E)$, the PPR value $\\pi(s,t)$ is defined as the probability that an $\\alpha$-discounted random walk from $s$ terminates at $t$, where the walk terminates with probability $\\alpha$ at each step. We study the classic Single-Source PPR query, which asks for PPR approximations from a given source node $s$ to all nodes in the graph. Specifically, we aim to provide approximations with absolute error guarantees, ensuring that the resultant PPR estimates "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.01019","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.01019/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":"2401.01019","created_at":"2026-07-05T07:58:26.062202+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.01019v1","created_at":"2026-07-05T07:58:26.062202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.01019","created_at":"2026-07-05T07:58:26.062202+00:00"},{"alias_kind":"pith_short_12","alias_value":"AI2BJIUZBVQL","created_at":"2026-07-05T07:58:26.062202+00:00"},{"alias_kind":"pith_short_16","alias_value":"AI2BJIUZBVQLETET","created_at":"2026-07-05T07:58:26.062202+00:00"},{"alias_kind":"pith_short_8","alias_value":"AI2BJIUZ","created_at":"2026-07-05T07:58:26.062202+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.14462","citing_title":"Near-Optimality for Single-Source Personalized PageRank","ref_index":133,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AI2BJIUZBVQLETETE4MTN2V3C5","json":"https://pith.science/pith/AI2BJIUZBVQLETETE4MTN2V3C5.json","graph_json":"https://pith.science/api/pith-number/AI2BJIUZBVQLETETE4MTN2V3C5/graph.json","events_json":"https://pith.science/api/pith-number/AI2BJIUZBVQLETETE4MTN2V3C5/events.json","paper":"https://pith.science/paper/AI2BJIUZ"},"agent_actions":{"view_html":"https://pith.science/pith/AI2BJIUZBVQLETETE4MTN2V3C5","download_json":"https://pith.science/pith/AI2BJIUZBVQLETETE4MTN2V3C5.json","view_paper":"https://pith.science/paper/AI2BJIUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.01019&json=true","fetch_graph":"https://pith.science/api/pith-number/AI2BJIUZBVQLETETE4MTN2V3C5/graph.json","fetch_events":"https://pith.science/api/pith-number/AI2BJIUZBVQLETETE4MTN2V3C5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AI2BJIUZBVQLETETE4MTN2V3C5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AI2BJIUZBVQLETETE4MTN2V3C5/action/storage_attestation","attest_author":"https://pith.science/pith/AI2BJIUZBVQLETETE4MTN2V3C5/action/author_attestation","sign_citation":"https://pith.science/pith/AI2BJIUZBVQLETETE4MTN2V3C5/action/citation_signature","submit_replication":"https://pith.science/pith/AI2BJIUZBVQLETETE4MTN2V3C5/action/replication_record"}},"created_at":"2026-07-05T07:58:26.062202+00:00","updated_at":"2026-07-05T07:58:26.062202+00:00"}