{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IWRU2547UJQSF4VPVG5HERZ2IX","short_pith_number":"pith:IWRU2547","schema_version":"1.0","canonical_sha256":"45a34d779fa26122f2afa9ba72473a45d67edeec4ff2c90134183732e0ffb364","source":{"kind":"arxiv","id":"1604.00202","version":1},"attestation_state":"computed","paper":{"title":"The Power of Local Information in PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DM","authors_text":"Enoch Peserico, Luca Pretto, Marco Bressan","submitted_at":"2016-04-01T10:57:51Z","abstract_excerpt":"How large a fraction of a graph must one explore to rank a small set of nodes according to their PageRank scores? We show that the answer is quite nuanced, and depends crucially on the interplay between the correctness guarantees one requires and the way one can access the graph. On the one hand, assuming the graph can be accessed only via \"natural\" exploration queries that reveal small pieces of its topology, we prove that deterministic and Las Vegas algorithms must in the worst case perform $n - o(n)$ queries and explore essentially the entire graph, independently of the specific types of qu"},"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":"1604.00202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-01T10:57:51Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"e97f66b52bfcbf9d82221a01c95eb00bc204be374638c6bf84491bd57c72dc3b","abstract_canon_sha256":"28b4aa82bd7c674085fbf1f2466a5167ee67c254ce520c0e85302e3f9459e616"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:54.303072Z","signature_b64":"rFowC1FlTRQ7JWs41kxzg8gMnK2RoecZa1X7RcCP4RXmoMppLCJ8gB7FUAubYqXPyhHp0Ovb2zmlu192sEQnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45a34d779fa26122f2afa9ba72473a45d67edeec4ff2c90134183732e0ffb364","last_reissued_at":"2026-05-18T01:17:54.302509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:54.302509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power of Local Information in PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DM","authors_text":"Enoch Peserico, Luca Pretto, Marco Bressan","submitted_at":"2016-04-01T10:57:51Z","abstract_excerpt":"How large a fraction of a graph must one explore to rank a small set of nodes according to their PageRank scores? We show that the answer is quite nuanced, and depends crucially on the interplay between the correctness guarantees one requires and the way one can access the graph. On the one hand, assuming the graph can be accessed only via \"natural\" exploration queries that reveal small pieces of its topology, we prove that deterministic and Las Vegas algorithms must in the worst case perform $n - o(n)$ queries and explore essentially the entire graph, independently of the specific types of qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00202","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":""},"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":"1604.00202","created_at":"2026-05-18T01:17:54.302593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00202v1","created_at":"2026-05-18T01:17:54.302593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00202","created_at":"2026-05-18T01:17:54.302593+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWRU2547UJQS","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWRU2547UJQSF4VP","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWRU2547","created_at":"2026-05-18T12:30:22.444734+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/IWRU2547UJQSF4VPVG5HERZ2IX","json":"https://pith.science/pith/IWRU2547UJQSF4VPVG5HERZ2IX.json","graph_json":"https://pith.science/api/pith-number/IWRU2547UJQSF4VPVG5HERZ2IX/graph.json","events_json":"https://pith.science/api/pith-number/IWRU2547UJQSF4VPVG5HERZ2IX/events.json","paper":"https://pith.science/paper/IWRU2547"},"agent_actions":{"view_html":"https://pith.science/pith/IWRU2547UJQSF4VPVG5HERZ2IX","download_json":"https://pith.science/pith/IWRU2547UJQSF4VPVG5HERZ2IX.json","view_paper":"https://pith.science/paper/IWRU2547","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00202&json=true","fetch_graph":"https://pith.science/api/pith-number/IWRU2547UJQSF4VPVG5HERZ2IX/graph.json","fetch_events":"https://pith.science/api/pith-number/IWRU2547UJQSF4VPVG5HERZ2IX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWRU2547UJQSF4VPVG5HERZ2IX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWRU2547UJQSF4VPVG5HERZ2IX/action/storage_attestation","attest_author":"https://pith.science/pith/IWRU2547UJQSF4VPVG5HERZ2IX/action/author_attestation","sign_citation":"https://pith.science/pith/IWRU2547UJQSF4VPVG5HERZ2IX/action/citation_signature","submit_replication":"https://pith.science/pith/IWRU2547UJQSF4VPVG5HERZ2IX/action/replication_record"}},"created_at":"2026-05-18T01:17:54.302593+00:00","updated_at":"2026-05-18T01:17:54.302593+00:00"}