{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OCGHUDOISLXOXOVDZE2LPC32WZ","short_pith_number":"pith:OCGHUDOI","schema_version":"1.0","canonical_sha256":"708c7a0dc892eeebbaa3c934b78b7ab65988694ad9706487a16853373e696a93","source":{"kind":"arxiv","id":"1501.06350","version":3},"attestation_state":"computed","paper":{"title":"D-Iteration: diffusion approach for solving PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dohy Hong, Fabien Mathieu, The Dang Huynh","submitted_at":"2015-01-26T11:51:27Z","abstract_excerpt":"In this paper we present a new method that can accelerate the computation of the PageRank importance vector. Our method, called D-Iteration (DI), is based on the decomposition of the matrix-vector product that can be seen as a fluid diffusion model and is potentially adapted to asynchronous implementation. We give theoretical results about the convergence of our algorithm and we show through experimentations on a real Web graph that DI can improve the computation efficiency compared to other classical algorithm like Power Iteration, Gauss-Seidel or OPIC."},"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":"1501.06350","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-26T11:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"65e2dd1a24aa54cd7265b7cd49c2b798df92a922c619e9633ae7048da255bb5f","abstract_canon_sha256":"1254a2b4f11583a5d44efa7cfb9e2e96938454671400be6a0ab5c8b7753f405a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:50.860578Z","signature_b64":"C9cgPErXfa9gOFbZQAaWtnd/dDdbgOmbufrVuX6dsZnmkj4Y9mgUDYYOChaMIeJAXtE+PbandyRsx0yzEC9sAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"708c7a0dc892eeebbaa3c934b78b7ab65988694ad9706487a16853373e696a93","last_reissued_at":"2026-05-18T02:16:50.859906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:50.859906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"D-Iteration: diffusion approach for solving PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dohy Hong, Fabien Mathieu, The Dang Huynh","submitted_at":"2015-01-26T11:51:27Z","abstract_excerpt":"In this paper we present a new method that can accelerate the computation of the PageRank importance vector. Our method, called D-Iteration (DI), is based on the decomposition of the matrix-vector product that can be seen as a fluid diffusion model and is potentially adapted to asynchronous implementation. We give theoretical results about the convergence of our algorithm and we show through experimentations on a real Web graph that DI can improve the computation efficiency compared to other classical algorithm like Power Iteration, Gauss-Seidel or OPIC."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06350","kind":"arxiv","version":3},"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":"1501.06350","created_at":"2026-05-18T02:16:50.860001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06350v3","created_at":"2026-05-18T02:16:50.860001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06350","created_at":"2026-05-18T02:16:50.860001+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCGHUDOISLXO","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCGHUDOISLXOXOVD","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCGHUDOI","created_at":"2026-05-18T12:29:34.919912+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/OCGHUDOISLXOXOVDZE2LPC32WZ","json":"https://pith.science/pith/OCGHUDOISLXOXOVDZE2LPC32WZ.json","graph_json":"https://pith.science/api/pith-number/OCGHUDOISLXOXOVDZE2LPC32WZ/graph.json","events_json":"https://pith.science/api/pith-number/OCGHUDOISLXOXOVDZE2LPC32WZ/events.json","paper":"https://pith.science/paper/OCGHUDOI"},"agent_actions":{"view_html":"https://pith.science/pith/OCGHUDOISLXOXOVDZE2LPC32WZ","download_json":"https://pith.science/pith/OCGHUDOISLXOXOVDZE2LPC32WZ.json","view_paper":"https://pith.science/paper/OCGHUDOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06350&json=true","fetch_graph":"https://pith.science/api/pith-number/OCGHUDOISLXOXOVDZE2LPC32WZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OCGHUDOISLXOXOVDZE2LPC32WZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCGHUDOISLXOXOVDZE2LPC32WZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCGHUDOISLXOXOVDZE2LPC32WZ/action/storage_attestation","attest_author":"https://pith.science/pith/OCGHUDOISLXOXOVDZE2LPC32WZ/action/author_attestation","sign_citation":"https://pith.science/pith/OCGHUDOISLXOXOVDZE2LPC32WZ/action/citation_signature","submit_replication":"https://pith.science/pith/OCGHUDOISLXOXOVDZE2LPC32WZ/action/replication_record"}},"created_at":"2026-05-18T02:16:50.860001+00:00","updated_at":"2026-05-18T02:16:50.860001+00:00"}