{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LKVCWLPSXWVCZK7MJYX2TYW725","short_pith_number":"pith:LKVCWLPS","schema_version":"1.0","canonical_sha256":"5aaa2b2df2bdaa2cabec4e2fa9e2dfd76de723f48c897e55f5b3a190b1b77314","source":{"kind":"arxiv","id":"1709.07122","version":4},"attestation_state":"computed","paper":{"title":"Accelerating PageRank using Partition-Centric Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PF"],"primary_cat":"cs.DC","authors_text":"Kartik Lakhotia, Rajgopal Kannan, Viktor Prasanna","submitted_at":"2017-09-21T01:41:34Z","abstract_excerpt":"PageRank is a fundamental link analysis algorithm that also functions as a key representative of the performance of Sparse Matrix-Vector (SpMV) multiplication. The traditional PageRank implementation generates fine granularity random memory accesses resulting in large amount of wasteful DRAM traffic and poor bandwidth utilization. In this paper, we present a novel Partition-Centric Processing Methodology (PCPM) to compute PageRank, that drastically reduces the amount of DRAM communication while achieving high sustained memory bandwidth. PCPM uses a Partition-centric abstraction coupled with th"},"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":"1709.07122","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-21T01:41:34Z","cross_cats_sorted":["cs.DS","cs.PF"],"title_canon_sha256":"5d0e5d1f92ae30b27513d3e5c1e847f1303456f7799963547c8ee1c1e8672c5d","abstract_canon_sha256":"bbf378fa1cdd3f4699f43fbc503245fa28078f2d8f7b53d9bf473e7aab64e4df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:48.466925Z","signature_b64":"nOEUI5r4iFIREozl42V8m8dVSbY0eH3Ie/FKwsiCmC2VDzr/VdAnavWTGtFgsRPlDf3STNBlXIozfvDS7SrxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aaa2b2df2bdaa2cabec4e2fa9e2dfd76de723f48c897e55f5b3a190b1b77314","last_reissued_at":"2026-05-18T00:08:48.466284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:48.466284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating PageRank using Partition-Centric Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PF"],"primary_cat":"cs.DC","authors_text":"Kartik Lakhotia, Rajgopal Kannan, Viktor Prasanna","submitted_at":"2017-09-21T01:41:34Z","abstract_excerpt":"PageRank is a fundamental link analysis algorithm that also functions as a key representative of the performance of Sparse Matrix-Vector (SpMV) multiplication. The traditional PageRank implementation generates fine granularity random memory accesses resulting in large amount of wasteful DRAM traffic and poor bandwidth utilization. In this paper, we present a novel Partition-Centric Processing Methodology (PCPM) to compute PageRank, that drastically reduces the amount of DRAM communication while achieving high sustained memory bandwidth. PCPM uses a Partition-centric abstraction coupled with th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07122","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":"1709.07122","created_at":"2026-05-18T00:08:48.466413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07122v4","created_at":"2026-05-18T00:08:48.466413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07122","created_at":"2026-05-18T00:08:48.466413+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKVCWLPSXWVC","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKVCWLPSXWVCZK7M","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKVCWLPS","created_at":"2026-05-18T12:31:28.150371+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/LKVCWLPSXWVCZK7MJYX2TYW725","json":"https://pith.science/pith/LKVCWLPSXWVCZK7MJYX2TYW725.json","graph_json":"https://pith.science/api/pith-number/LKVCWLPSXWVCZK7MJYX2TYW725/graph.json","events_json":"https://pith.science/api/pith-number/LKVCWLPSXWVCZK7MJYX2TYW725/events.json","paper":"https://pith.science/paper/LKVCWLPS"},"agent_actions":{"view_html":"https://pith.science/pith/LKVCWLPSXWVCZK7MJYX2TYW725","download_json":"https://pith.science/pith/LKVCWLPSXWVCZK7MJYX2TYW725.json","view_paper":"https://pith.science/paper/LKVCWLPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07122&json=true","fetch_graph":"https://pith.science/api/pith-number/LKVCWLPSXWVCZK7MJYX2TYW725/graph.json","fetch_events":"https://pith.science/api/pith-number/LKVCWLPSXWVCZK7MJYX2TYW725/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKVCWLPSXWVCZK7MJYX2TYW725/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKVCWLPSXWVCZK7MJYX2TYW725/action/storage_attestation","attest_author":"https://pith.science/pith/LKVCWLPSXWVCZK7MJYX2TYW725/action/author_attestation","sign_citation":"https://pith.science/pith/LKVCWLPSXWVCZK7MJYX2TYW725/action/citation_signature","submit_replication":"https://pith.science/pith/LKVCWLPSXWVCZK7MJYX2TYW725/action/replication_record"}},"created_at":"2026-05-18T00:08:48.466413+00:00","updated_at":"2026-05-18T00:08:48.466413+00:00"}