{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VPIHEHTF3NCZ66NZ2ABGDEUG2K","short_pith_number":"pith:VPIHEHTF","schema_version":"1.0","canonical_sha256":"abd0721e65db459f79b9d002619286d2b56a07f50d062f96319de536789521fb","source":{"kind":"arxiv","id":"1509.00016","version":4},"attestation_state":"computed","paper":{"title":"Localization in Seeded PageRank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"David F. Gleich, Huda Nassar, Kyle Kloster","submitted_at":"2015-08-31T20:10:24Z","abstract_excerpt":"Seeded PageRank is an important network analysis tool for identifying and studying regions nearby a given set of nodes, which are called seeds. The seeded PageRank vector is the stationary distribution of a random walk that randomly resets at the seed nodes. Intuitively, this vector is concentrated nearby the given seeds, but is mathematically non-zero for all nodes in a connected graph. We study this concentration, or localization, and show a sublinear upper bound on the number of entries required to approximate seeded PageRank on all graphs with a natural type of skewed-degree sequence---sim"},"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":"1509.00016","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2015-08-31T20:10:24Z","cross_cats_sorted":[],"title_canon_sha256":"cee0929b87fb47bae73af4c5bb885af4d4dab96e5905d955af099e64e7dd92eb","abstract_canon_sha256":"0c18bf085fb518113e52916667141ff17d9cafa4d266f3e76250e84af6c6c0a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:10.015870Z","signature_b64":"39mLAvSHBRaUzyu22cDZ5DcUOXPan8MoDLc1qHTsGgfBiWIgKtqg4t1smw4h4U/1DuYN7+B6MFwmIrbpzZzxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abd0721e65db459f79b9d002619286d2b56a07f50d062f96319de536789521fb","last_reissued_at":"2026-05-18T00:44:10.015378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:10.015378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Localization in Seeded PageRank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"David F. Gleich, Huda Nassar, Kyle Kloster","submitted_at":"2015-08-31T20:10:24Z","abstract_excerpt":"Seeded PageRank is an important network analysis tool for identifying and studying regions nearby a given set of nodes, which are called seeds. The seeded PageRank vector is the stationary distribution of a random walk that randomly resets at the seed nodes. Intuitively, this vector is concentrated nearby the given seeds, but is mathematically non-zero for all nodes in a connected graph. We study this concentration, or localization, and show a sublinear upper bound on the number of entries required to approximate seeded PageRank on all graphs with a natural type of skewed-degree sequence---sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00016","kind":"arxiv","version":4},"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":"1509.00016","created_at":"2026-05-18T00:44:10.015447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00016v4","created_at":"2026-05-18T00:44:10.015447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00016","created_at":"2026-05-18T00:44:10.015447+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPIHEHTF3NCZ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPIHEHTF3NCZ66NZ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPIHEHTF","created_at":"2026-05-18T12:29:47.479230+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/VPIHEHTF3NCZ66NZ2ABGDEUG2K","json":"https://pith.science/pith/VPIHEHTF3NCZ66NZ2ABGDEUG2K.json","graph_json":"https://pith.science/api/pith-number/VPIHEHTF3NCZ66NZ2ABGDEUG2K/graph.json","events_json":"https://pith.science/api/pith-number/VPIHEHTF3NCZ66NZ2ABGDEUG2K/events.json","paper":"https://pith.science/paper/VPIHEHTF"},"agent_actions":{"view_html":"https://pith.science/pith/VPIHEHTF3NCZ66NZ2ABGDEUG2K","download_json":"https://pith.science/pith/VPIHEHTF3NCZ66NZ2ABGDEUG2K.json","view_paper":"https://pith.science/paper/VPIHEHTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00016&json=true","fetch_graph":"https://pith.science/api/pith-number/VPIHEHTF3NCZ66NZ2ABGDEUG2K/graph.json","fetch_events":"https://pith.science/api/pith-number/VPIHEHTF3NCZ66NZ2ABGDEUG2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPIHEHTF3NCZ66NZ2ABGDEUG2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPIHEHTF3NCZ66NZ2ABGDEUG2K/action/storage_attestation","attest_author":"https://pith.science/pith/VPIHEHTF3NCZ66NZ2ABGDEUG2K/action/author_attestation","sign_citation":"https://pith.science/pith/VPIHEHTF3NCZ66NZ2ABGDEUG2K/action/citation_signature","submit_replication":"https://pith.science/pith/VPIHEHTF3NCZ66NZ2ABGDEUG2K/action/replication_record"}},"created_at":"2026-05-18T00:44:10.015447+00:00","updated_at":"2026-05-18T00:44:10.015447+00:00"}