{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GTRQODAAYA3MCG3FAAXSZQCPAN","short_pith_number":"pith:GTRQODAA","schema_version":"1.0","canonical_sha256":"34e3070c00c036c11b65002f2cc04f03621072cc05ede7fa4968764f2b5815d7","source":{"kind":"arxiv","id":"1304.4658","version":2},"attestation_state":"computed","paper":{"title":"Personalized PageRank to a Target Node","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Ashish Goel, Peter Lofgren","submitted_at":"2013-04-17T00:49:25Z","abstract_excerpt":"Personalalized PageRank uses random walks to determine the importance or authority of nodes in a graph from the point of view of a given source node. Much past work has considered how to compute personalized PageRank from a given source node to other nodes. In this work we consider the problem of computing personalized PageRanks to a given target node from all source nodes. This problem can be interpreted as finding who supports the target or who is interested in the target.\n  We present an efficient algorithm for computing personalized PageRank to a given target up to any given accuracy. We g"},"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":"1304.4658","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-17T00:49:25Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"1dcf3383b285ee08a55bc573668bb56dda9ffada4408f35676dc0abbaf67f310","abstract_canon_sha256":"09ee39ba8e62154bcd8250960e1269368a7b710575b481e5645f5cd774c180e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:21.513697Z","signature_b64":"sILRPP1GqobRWTKFBtLUT7cJ3upA5qgjkQLuhKeKxPnWB54nqvf6P/mqtMqzeFHsWu+MrUeLOUply6YbXtDSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34e3070c00c036c11b65002f2cc04f03621072cc05ede7fa4968764f2b5815d7","last_reissued_at":"2026-05-18T02:54:21.513341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:21.513341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Personalized PageRank to a Target Node","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Ashish Goel, Peter Lofgren","submitted_at":"2013-04-17T00:49:25Z","abstract_excerpt":"Personalalized PageRank uses random walks to determine the importance or authority of nodes in a graph from the point of view of a given source node. Much past work has considered how to compute personalized PageRank from a given source node to other nodes. In this work we consider the problem of computing personalized PageRanks to a given target node from all source nodes. This problem can be interpreted as finding who supports the target or who is interested in the target.\n  We present an efficient algorithm for computing personalized PageRank to a given target up to any given accuracy. We g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4658","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":""},"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":"1304.4658","created_at":"2026-05-18T02:54:21.513398+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4658v2","created_at":"2026-05-18T02:54:21.513398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4658","created_at":"2026-05-18T02:54:21.513398+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTRQODAAYA3M","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTRQODAAYA3MCG3F","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTRQODAA","created_at":"2026-05-18T12:27:45.050594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2504.16481","citing_title":"Estimating Random-Walk Probabilities in Directed Graphs","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2507.14462","citing_title":"Near-Optimality for Single-Source Personalized PageRank","ref_index":108,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GTRQODAAYA3MCG3FAAXSZQCPAN","json":"https://pith.science/pith/GTRQODAAYA3MCG3FAAXSZQCPAN.json","graph_json":"https://pith.science/api/pith-number/GTRQODAAYA3MCG3FAAXSZQCPAN/graph.json","events_json":"https://pith.science/api/pith-number/GTRQODAAYA3MCG3FAAXSZQCPAN/events.json","paper":"https://pith.science/paper/GTRQODAA"},"agent_actions":{"view_html":"https://pith.science/pith/GTRQODAAYA3MCG3FAAXSZQCPAN","download_json":"https://pith.science/pith/GTRQODAAYA3MCG3FAAXSZQCPAN.json","view_paper":"https://pith.science/paper/GTRQODAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4658&json=true","fetch_graph":"https://pith.science/api/pith-number/GTRQODAAYA3MCG3FAAXSZQCPAN/graph.json","fetch_events":"https://pith.science/api/pith-number/GTRQODAAYA3MCG3FAAXSZQCPAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTRQODAAYA3MCG3FAAXSZQCPAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTRQODAAYA3MCG3FAAXSZQCPAN/action/storage_attestation","attest_author":"https://pith.science/pith/GTRQODAAYA3MCG3FAAXSZQCPAN/action/author_attestation","sign_citation":"https://pith.science/pith/GTRQODAAYA3MCG3FAAXSZQCPAN/action/citation_signature","submit_replication":"https://pith.science/pith/GTRQODAAYA3MCG3FAAXSZQCPAN/action/replication_record"}},"created_at":"2026-05-18T02:54:21.513398+00:00","updated_at":"2026-05-18T02:54:21.513398+00:00"}