{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FUFQIF2I6UAKL3XIORBU3RFPTU","short_pith_number":"pith:FUFQIF2I","schema_version":"1.0","canonical_sha256":"2d0b041748f500a5eee874434dc4af9d3400406f09dd084d9564ed6bfd7df949","source":{"kind":"arxiv","id":"1408.0500","version":3},"attestation_state":"computed","paper":{"title":"FlashGraph: Processing Billion-Node Graphs on an Array of Commodity SSDs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander S. Szalay, Carey E. Priebe, Da Zheng, Disa Mhembere, Joshua Vogelstein, Randal Burns","submitted_at":"2014-08-03T13:44:09Z","abstract_excerpt":"Graph analysis performs many random reads and writes, thus, these workloads are typically performed in memory. Traditionally, analyzing large graphs requires a cluster of machines so the aggregate memory exceeds the graph size. We demonstrate that a multicore server can process graphs with billions of vertices and hundreds of billions of edges, utilizing commodity SSDs with minimal performance loss. We do so by implementing a graph-processing engine on top of a user-space SSD file system designed for high IOPS and extreme parallelism. Our semi-external memory graph engine called FlashGraph sto"},"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":"1408.0500","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-03T13:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"9ea7aef1fd4b5d7b1852d23d5f19ef7349f995020065eb1a2b1abc47cd73039e","abstract_canon_sha256":"87f858d24cf0908f3132db4eb25f7e505cbdd84e374f8c218dbaf4662de59a4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.700259Z","signature_b64":"LTHHbm1Zh5warIwJ4ldKrYFQB79CHagQTsBk5rbDt9/YZ0l3PAviF5hbQPLoSM272cEJkryg0uyf/271JOhGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d0b041748f500a5eee874434dc4af9d3400406f09dd084d9564ed6bfd7df949","last_reissued_at":"2026-05-18T02:28:47.699865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.699865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FlashGraph: Processing Billion-Node Graphs on an Array of Commodity SSDs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander S. Szalay, Carey E. Priebe, Da Zheng, Disa Mhembere, Joshua Vogelstein, Randal Burns","submitted_at":"2014-08-03T13:44:09Z","abstract_excerpt":"Graph analysis performs many random reads and writes, thus, these workloads are typically performed in memory. Traditionally, analyzing large graphs requires a cluster of machines so the aggregate memory exceeds the graph size. We demonstrate that a multicore server can process graphs with billions of vertices and hundreds of billions of edges, utilizing commodity SSDs with minimal performance loss. We do so by implementing a graph-processing engine on top of a user-space SSD file system designed for high IOPS and extreme parallelism. Our semi-external memory graph engine called FlashGraph sto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0500","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":"1408.0500","created_at":"2026-05-18T02:28:47.699923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.0500v3","created_at":"2026-05-18T02:28:47.699923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0500","created_at":"2026-05-18T02:28:47.699923+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUFQIF2I6UAK","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUFQIF2I6UAKL3XI","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUFQIF2I","created_at":"2026-05-18T12:28:28.263976+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/FUFQIF2I6UAKL3XIORBU3RFPTU","json":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU.json","graph_json":"https://pith.science/api/pith-number/FUFQIF2I6UAKL3XIORBU3RFPTU/graph.json","events_json":"https://pith.science/api/pith-number/FUFQIF2I6UAKL3XIORBU3RFPTU/events.json","paper":"https://pith.science/paper/FUFQIF2I"},"agent_actions":{"view_html":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU","download_json":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU.json","view_paper":"https://pith.science/paper/FUFQIF2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.0500&json=true","fetch_graph":"https://pith.science/api/pith-number/FUFQIF2I6UAKL3XIORBU3RFPTU/graph.json","fetch_events":"https://pith.science/api/pith-number/FUFQIF2I6UAKL3XIORBU3RFPTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU/action/storage_attestation","attest_author":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU/action/author_attestation","sign_citation":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU/action/citation_signature","submit_replication":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU/action/replication_record"}},"created_at":"2026-05-18T02:28:47.699923+00:00","updated_at":"2026-05-18T02:28:47.699923+00:00"}