{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DQNOFIRAEZK4M3DTGGQCXLOTF3","short_pith_number":"pith:DQNOFIRA","schema_version":"1.0","canonical_sha256":"1c1ae2a2202655c66c7331a02badd32ec7f10e1051825389e0435a30a7ccf862","source":{"kind":"arxiv","id":"1506.01406","version":5},"attestation_state":"computed","paper":{"title":"M-Flash: Fast Billion-scale Graph Computation Using a Bimodal Block Processing Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"cs.DB","authors_text":"Duen Chau, Hugo Gualdron, Jose Rodrigues-Jr, Minsuk Kahng, Robson Cordeiro, U Kang","submitted_at":"2015-06-03T20:56:30Z","abstract_excerpt":"Recent graph computation approaches have demonstrated that a single PC can perform efficiently on billion-scale graphs. While these approaches achieve scalability by optimizing I/O operations, they do not fully exploit the capabilities of modern hard drives and processors. To overcome their performance, in this work, we introduce the Bimodal Block Processing (BBP), an innovation that is able to boost the graph computation by minimizing the I/O cost even further. With this strategy, we achieved the following contributions: (1) M-Flash, the fastest graph computation framework to date; (2) a flex"},"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":"1506.01406","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-06-03T20:56:30Z","cross_cats_sorted":["cs.DS","cs.SI"],"title_canon_sha256":"91d345d05abeb1cb94a58acd613de3b655e47e4c6c039bbfdfc768ec252f8fcf","abstract_canon_sha256":"f9e8372c6d7da3d13ac3603dd0a03988c91ae6e5f3b29f18fe9cc3c952600214"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:37.841708Z","signature_b64":"gYTKBv2EfF37luJPmKYo2mB5H/fEfMdNaqv1hx+fjDg2o3FrhR189rb85YPd/JkZeknNHMUg92CsH9D93glECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c1ae2a2202655c66c7331a02badd32ec7f10e1051825389e0435a30a7ccf862","last_reissued_at":"2026-05-18T01:04:37.840989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:37.840989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"M-Flash: Fast Billion-scale Graph Computation Using a Bimodal Block Processing Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"cs.DB","authors_text":"Duen Chau, Hugo Gualdron, Jose Rodrigues-Jr, Minsuk Kahng, Robson Cordeiro, U Kang","submitted_at":"2015-06-03T20:56:30Z","abstract_excerpt":"Recent graph computation approaches have demonstrated that a single PC can perform efficiently on billion-scale graphs. While these approaches achieve scalability by optimizing I/O operations, they do not fully exploit the capabilities of modern hard drives and processors. To overcome their performance, in this work, we introduce the Bimodal Block Processing (BBP), an innovation that is able to boost the graph computation by minimizing the I/O cost even further. With this strategy, we achieved the following contributions: (1) M-Flash, the fastest graph computation framework to date; (2) a flex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01406","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.01406","created_at":"2026-05-18T01:04:37.841096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01406v5","created_at":"2026-05-18T01:04:37.841096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01406","created_at":"2026-05-18T01:04:37.841096+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQNOFIRAEZK4","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQNOFIRAEZK4M3DT","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQNOFIRA","created_at":"2026-05-18T12:29:17.054201+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/DQNOFIRAEZK4M3DTGGQCXLOTF3","json":"https://pith.science/pith/DQNOFIRAEZK4M3DTGGQCXLOTF3.json","graph_json":"https://pith.science/api/pith-number/DQNOFIRAEZK4M3DTGGQCXLOTF3/graph.json","events_json":"https://pith.science/api/pith-number/DQNOFIRAEZK4M3DTGGQCXLOTF3/events.json","paper":"https://pith.science/paper/DQNOFIRA"},"agent_actions":{"view_html":"https://pith.science/pith/DQNOFIRAEZK4M3DTGGQCXLOTF3","download_json":"https://pith.science/pith/DQNOFIRAEZK4M3DTGGQCXLOTF3.json","view_paper":"https://pith.science/paper/DQNOFIRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01406&json=true","fetch_graph":"https://pith.science/api/pith-number/DQNOFIRAEZK4M3DTGGQCXLOTF3/graph.json","fetch_events":"https://pith.science/api/pith-number/DQNOFIRAEZK4M3DTGGQCXLOTF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQNOFIRAEZK4M3DTGGQCXLOTF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQNOFIRAEZK4M3DTGGQCXLOTF3/action/storage_attestation","attest_author":"https://pith.science/pith/DQNOFIRAEZK4M3DTGGQCXLOTF3/action/author_attestation","sign_citation":"https://pith.science/pith/DQNOFIRAEZK4M3DTGGQCXLOTF3/action/citation_signature","submit_replication":"https://pith.science/pith/DQNOFIRAEZK4M3DTGGQCXLOTF3/action/replication_record"}},"created_at":"2026-05-18T01:04:37.841096+00:00","updated_at":"2026-05-18T01:04:37.841096+00:00"}