{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WI64DCZY6QIMVXLU3A2LSLNW7M","short_pith_number":"pith:WI64DCZY","canonical_record":{"source":{"id":"1202.2771","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2012-02-13T15:49:20Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"687fc329429ae91edb6185525f239c84c4b096f6906215f67373f7332796b792","abstract_canon_sha256":"f1d97d46672d96e6b34eaa83e7c7c968a0a57c1fe979d489cd7ecb7c2f43a36d"},"schema_version":"1.0"},"canonical_sha256":"b23dc18b38f410cadd74d834b92db6fb1b2dc05b0c54a90bbef46ece41676922","source":{"kind":"arxiv","id":"1202.2771","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2771","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2771v5","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2771","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"WI64DCZY6QIM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WI64DCZY6QIMVXLU","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WI64DCZY","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WI64DCZY6QIMVXLU3A2LSLNW7M","target":"record","payload":{"canonical_record":{"source":{"id":"1202.2771","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2012-02-13T15:49:20Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"687fc329429ae91edb6185525f239c84c4b096f6906215f67373f7332796b792","abstract_canon_sha256":"f1d97d46672d96e6b34eaa83e7c7c968a0a57c1fe979d489cd7ecb7c2f43a36d"},"schema_version":"1.0"},"canonical_sha256":"b23dc18b38f410cadd74d834b92db6fb1b2dc05b0c54a90bbef46ece41676922","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.914284Z","signature_b64":"m+4WkCS/rW73hs+2nn6zqu0PWfwkb8bj4ykHlA6JLoPh8E896LGMi3pVPMLLPabHsAlQQw5Hs2VXa61U8U88Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b23dc18b38f410cadd74d834b92db6fb1b2dc05b0c54a90bbef46ece41676922","last_reissued_at":"2026-05-18T02:21:17.913377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.913377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.2771","source_version":5,"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-05-18T02:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WLmp4TkpJOdK8xz1cPLYhmNiN3GSlg7q7TdUtBQBE3nMoAPY9vLdipUMJR11cTqVxib4L41NZqmsdEJoRDLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:24:41.146780Z"},"content_sha256":"ab2e323a81470bd64c95b393e411c08fd606440502134f771ec881aca831ab6d","schema_version":"1.0","event_id":"sha256:ab2e323a81470bd64c95b393e411c08fd606440502134f771ec881aca831ab6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WI64DCZY6QIMVXLU3A2LSLNW7M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Scale Matrix Sampling and Sublinear-Time PageRank Computation","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Christian Borgs, Jennifer Chayes, Michael Brautbar, Shang-Hua Teng","submitted_at":"2012-02-13T15:49:20Z","abstract_excerpt":"A fundamental problem arising in many applications in Web science and social network analysis is, given an arbitrary approximation factor $c>1$, to output a set $S$ of nodes that with high probability contains all nodes of PageRank at least $\\Delta$, and no node of PageRank smaller than $\\Delta/c$. We call this problem {\\sc SignificantPageRanks}. We develop a nearly optimal, local algorithm for the problem with runtime complexity $\\tilde{O}(n/\\Delta)$ on networks with $n$ nodes. We show that any algorithm for solving this problem must have runtime of ${\\Omega}(n/\\Delta)$, rendering our algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2771","kind":"arxiv","version":5},"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"},"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-05-18T02:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1aziInsGSkupM2ZCLdR01XTxek/FzZtrfzl1p62IeI6NJIt4mzzX+LK8NTz/mZK0OFNPVAgdcL4TFWDVWEICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:24:41.147439Z"},"content_sha256":"f8746f1b8b2485ae7b65b76fcb097db9d9e1d3804c9c4848422077115f16abd7","schema_version":"1.0","event_id":"sha256:f8746f1b8b2485ae7b65b76fcb097db9d9e1d3804c9c4848422077115f16abd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WI64DCZY6QIMVXLU3A2LSLNW7M/bundle.json","state_url":"https://pith.science/pith/WI64DCZY6QIMVXLU3A2LSLNW7M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WI64DCZY6QIMVXLU3A2LSLNW7M/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-05-28T17:24:41Z","links":{"resolver":"https://pith.science/pith/WI64DCZY6QIMVXLU3A2LSLNW7M","bundle":"https://pith.science/pith/WI64DCZY6QIMVXLU3A2LSLNW7M/bundle.json","state":"https://pith.science/pith/WI64DCZY6QIMVXLU3A2LSLNW7M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WI64DCZY6QIMVXLU3A2LSLNW7M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WI64DCZY6QIMVXLU3A2LSLNW7M","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":"f1d97d46672d96e6b34eaa83e7c7c968a0a57c1fe979d489cd7ecb7c2f43a36d","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2012-02-13T15:49:20Z","title_canon_sha256":"687fc329429ae91edb6185525f239c84c4b096f6906215f67373f7332796b792"},"schema_version":"1.0","source":{"id":"1202.2771","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2771","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2771v5","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2771","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"WI64DCZY6QIM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WI64DCZY6QIMVXLU","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WI64DCZY","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:f8746f1b8b2485ae7b65b76fcb097db9d9e1d3804c9c4848422077115f16abd7","target":"graph","created_at":"2026-05-18T02:21:17Z","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"},"paper":{"abstract_excerpt":"A fundamental problem arising in many applications in Web science and social network analysis is, given an arbitrary approximation factor $c>1$, to output a set $S$ of nodes that with high probability contains all nodes of PageRank at least $\\Delta$, and no node of PageRank smaller than $\\Delta/c$. We call this problem {\\sc SignificantPageRanks}. We develop a nearly optimal, local algorithm for the problem with runtime complexity $\\tilde{O}(n/\\Delta)$ on networks with $n$ nodes. We show that any algorithm for solving this problem must have runtime of ${\\Omega}(n/\\Delta)$, rendering our algorit","authors_text":"Christian Borgs, Jennifer Chayes, Michael Brautbar, Shang-Hua Teng","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2012-02-13T15:49:20Z","title":"Multi-Scale Matrix Sampling and Sublinear-Time PageRank Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2771","kind":"arxiv","version":5},"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:ab2e323a81470bd64c95b393e411c08fd606440502134f771ec881aca831ab6d","target":"record","created_at":"2026-05-18T02:21:17Z","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":"f1d97d46672d96e6b34eaa83e7c7c968a0a57c1fe979d489cd7ecb7c2f43a36d","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2012-02-13T15:49:20Z","title_canon_sha256":"687fc329429ae91edb6185525f239c84c4b096f6906215f67373f7332796b792"},"schema_version":"1.0","source":{"id":"1202.2771","kind":"arxiv","version":5}},"canonical_sha256":"b23dc18b38f410cadd74d834b92db6fb1b2dc05b0c54a90bbef46ece41676922","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b23dc18b38f410cadd74d834b92db6fb1b2dc05b0c54a90bbef46ece41676922","first_computed_at":"2026-05-18T02:21:17.913377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:17.913377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m+4WkCS/rW73hs+2nn6zqu0PWfwkb8bj4ykHlA6JLoPh8E896LGMi3pVPMLLPabHsAlQQw5Hs2VXa61U8U88Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:17.914284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2771","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab2e323a81470bd64c95b393e411c08fd606440502134f771ec881aca831ab6d","sha256:f8746f1b8b2485ae7b65b76fcb097db9d9e1d3804c9c4848422077115f16abd7"],"state_sha256":"4fa61b8f85cae9d13a792cc42487d9043084a983bcc196f7c4f257879afbee8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkle2G9GPz8mD4//ajQZGs3xQUOgrqkUDPeJ1ZB+cPrAA8jNYL71hMzjPBDdszcoL3bk4OohTdwwVEeKUCKDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:24:41.151204Z","bundle_sha256":"af03e49db680020b1bdaf711bfc47821c1cc00321c2812b8e2f15d3e3966784f"}}