{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VG5DB45LTGKOQ22YP2NF2CKSVD","short_pith_number":"pith:VG5DB45L","canonical_record":{"source":{"id":"1502.04281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-15T04:33:00Z","cross_cats_sorted":["cs.IT","cs.SI","math.IT"],"title_canon_sha256":"c04da4f727e3be2f3dc876ca397420062b44c536f870284a5395cece9ce7c561","abstract_canon_sha256":"158b227ec59b6a139562ec36150ae6ed05dc7a0b26008294780fbc42c977110d"},"schema_version":"1.0"},"canonical_sha256":"a9ba30f3ab9994e86b587e9a5d0952a8ed9f77c880033f9d475182fdb35a6769","source":{"kind":"arxiv","id":"1502.04281","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04281","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04281v1","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04281","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"VG5DB45LTGKO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VG5DB45LTGKOQ22Y","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VG5DB45L","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VG5DB45LTGKOQ22YP2NF2CKSVD","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-15T04:33:00Z","cross_cats_sorted":["cs.IT","cs.SI","math.IT"],"title_canon_sha256":"c04da4f727e3be2f3dc876ca397420062b44c536f870284a5395cece9ce7c561","abstract_canon_sha256":"158b227ec59b6a139562ec36150ae6ed05dc7a0b26008294780fbc42c977110d"},"schema_version":"1.0"},"canonical_sha256":"a9ba30f3ab9994e86b587e9a5d0952a8ed9f77c880033f9d475182fdb35a6769","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:00.062378Z","signature_b64":"aotdLROgLoXip85/vA62T0fHitnBp2stDaPWxUIsLqvIGOqtcjbmSuRLmPoD9fjxWLk69wOUMMh0ZcAYuFCPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9ba30f3ab9994e86b587e9a5d0952a8ed9f77c880033f9d475182fdb35a6769","last_reissued_at":"2026-05-18T02:27:00.061914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:00.061914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04281","source_version":1,"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:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yHo3zVyfTExJHLr2LAVRUdoGk6Pm+lOPe5Myq9USHco/RyJTPwJoqnnryvB70OzYhG266YUg6RjVTss1Fw3PAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:21:29.906324Z"},"content_sha256":"d9e3e36c3bee8bb7d0d6259993eb404c61104bd4d31744b17e6b02e4cc62203b","schema_version":"1.0","event_id":"sha256:d9e3e36c3bee8bb7d0d6259993eb404c61104bd4d31744b17e6b02e4cc62203b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VG5DB45LTGKOQ22YP2NF2CKSVD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FrogWild! -- Fast PageRank Approximations on Graph Engines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SI","math.IT"],"primary_cat":"cs.DC","authors_text":"Alexandros G. Dimakis, Constantine Caramanis, Ioannis Mitliagkas, Michael Borokhovich","submitted_at":"2015-02-15T04:33:00Z","abstract_excerpt":"We propose FrogWild, a novel algorithm for fast approximation of high PageRank vertices, geared towards reducing network costs of running traditional PageRank algorithms. Our algorithm can be seen as a quantized version of power iteration that performs multiple parallel random walks over a directed graph. One important innovation is that we introduce a modification to the GraphLab framework that only partially synchronizes mirror vertices. This partial synchronization vastly reduces the network traffic generated by traditional PageRank algorithms, thus greatly reducing the per-iteration cost o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04281","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"},"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:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psGbXPYrCez4NVwt9TSy3DBhmqF6Alr9nKgI1rDOetztd+SZE7wfzCha6zWmRd+O2gwucMrFh8yLSjzBOPLJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:21:29.906952Z"},"content_sha256":"feffac919e876ca055833047c908d28a3961c8bb20f013ddf0f23d5484b18dab","schema_version":"1.0","event_id":"sha256:feffac919e876ca055833047c908d28a3961c8bb20f013ddf0f23d5484b18dab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VG5DB45LTGKOQ22YP2NF2CKSVD/bundle.json","state_url":"https://pith.science/pith/VG5DB45LTGKOQ22YP2NF2CKSVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VG5DB45LTGKOQ22YP2NF2CKSVD/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-25T12:21:29Z","links":{"resolver":"https://pith.science/pith/VG5DB45LTGKOQ22YP2NF2CKSVD","bundle":"https://pith.science/pith/VG5DB45LTGKOQ22YP2NF2CKSVD/bundle.json","state":"https://pith.science/pith/VG5DB45LTGKOQ22YP2NF2CKSVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VG5DB45LTGKOQ22YP2NF2CKSVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VG5DB45LTGKOQ22YP2NF2CKSVD","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":"158b227ec59b6a139562ec36150ae6ed05dc7a0b26008294780fbc42c977110d","cross_cats_sorted":["cs.IT","cs.SI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-15T04:33:00Z","title_canon_sha256":"c04da4f727e3be2f3dc876ca397420062b44c536f870284a5395cece9ce7c561"},"schema_version":"1.0","source":{"id":"1502.04281","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04281","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04281v1","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04281","created_at":"2026-05-18T02:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"VG5DB45LTGKO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VG5DB45LTGKOQ22Y","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VG5DB45L","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:feffac919e876ca055833047c908d28a3961c8bb20f013ddf0f23d5484b18dab","target":"graph","created_at":"2026-05-18T02:27:00Z","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":"We propose FrogWild, a novel algorithm for fast approximation of high PageRank vertices, geared towards reducing network costs of running traditional PageRank algorithms. Our algorithm can be seen as a quantized version of power iteration that performs multiple parallel random walks over a directed graph. One important innovation is that we introduce a modification to the GraphLab framework that only partially synchronizes mirror vertices. This partial synchronization vastly reduces the network traffic generated by traditional PageRank algorithms, thus greatly reducing the per-iteration cost o","authors_text":"Alexandros G. Dimakis, Constantine Caramanis, Ioannis Mitliagkas, Michael Borokhovich","cross_cats":["cs.IT","cs.SI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-15T04:33:00Z","title":"FrogWild! -- Fast PageRank Approximations on Graph Engines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04281","kind":"arxiv","version":1},"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:d9e3e36c3bee8bb7d0d6259993eb404c61104bd4d31744b17e6b02e4cc62203b","target":"record","created_at":"2026-05-18T02:27:00Z","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":"158b227ec59b6a139562ec36150ae6ed05dc7a0b26008294780fbc42c977110d","cross_cats_sorted":["cs.IT","cs.SI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-15T04:33:00Z","title_canon_sha256":"c04da4f727e3be2f3dc876ca397420062b44c536f870284a5395cece9ce7c561"},"schema_version":"1.0","source":{"id":"1502.04281","kind":"arxiv","version":1}},"canonical_sha256":"a9ba30f3ab9994e86b587e9a5d0952a8ed9f77c880033f9d475182fdb35a6769","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9ba30f3ab9994e86b587e9a5d0952a8ed9f77c880033f9d475182fdb35a6769","first_computed_at":"2026-05-18T02:27:00.061914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:00.061914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aotdLROgLoXip85/vA62T0fHitnBp2stDaPWxUIsLqvIGOqtcjbmSuRLmPoD9fjxWLk69wOUMMh0ZcAYuFCPBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:00.062378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04281","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9e3e36c3bee8bb7d0d6259993eb404c61104bd4d31744b17e6b02e4cc62203b","sha256:feffac919e876ca055833047c908d28a3961c8bb20f013ddf0f23d5484b18dab"],"state_sha256":"9c8efac5e78f73dc6ca4aa95ce94bcff55ed25dbef7175bd1ed50058145ecf53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEDojEwpjB+mI3Vk4aEVQNTMc7WRSDnckLwTcrknDm30gdUwfeYK1Wvw9T1B9mdPeYf2jra9pSks5JHyGhWnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:21:29.910190Z","bundle_sha256":"e67e427e705015e7946224d5c6b2f3229bf343864802863237108a6a2d59ab3b"}}