{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FUFQIF2I6UAKL3XIORBU3RFPTU","short_pith_number":"pith:FUFQIF2I","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"},"canonical_sha256":"2d0b041748f500a5eee874434dc4af9d3400406f09dd084d9564ed6bfd7df949","source":{"kind":"arxiv","id":"1408.0500","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0500","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0500v3","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0500","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"FUFQIF2I6UAK","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FUFQIF2I6UAKL3XI","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FUFQIF2I","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FUFQIF2I6UAKL3XIORBU3RFPTU","target":"record","payload":{"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"},"canonical_sha256":"2d0b041748f500a5eee874434dc4af9d3400406f09dd084d9564ed6bfd7df949","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"},"source_kind":"arxiv","source_id":"1408.0500","source_version":3,"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:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxzwEFTq/4ovjFkEylTZEsxbcEoUyoBTx6C73nuqzdZ/BVEf4+EhYQUx3bslWpJ9Dh7Rfty6QW1bjz4Uhz5vBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:45:37.427254Z"},"content_sha256":"68e9621e3895d8c18b2fd2fb0520ae3b56d3906b600509cf53cb682fe9fc0359","schema_version":"1.0","event_id":"sha256:68e9621e3895d8c18b2fd2fb0520ae3b56d3906b600509cf53cb682fe9fc0359"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FUFQIF2I6UAKL3XIORBU3RFPTU","target":"graph","payload":{"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"},"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:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cGEGr7qqaeDF6MyDwrt+7rbcKtjqegvM9+dVNfQjHzbA7scxw4o3eOcARwQ0jcT+1cSLzmMuF8rullvN42O/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:45:37.428081Z"},"content_sha256":"0df4610ef46726b359febc2de0d6193e5c049635d7d546db20b772e03b151a0b","schema_version":"1.0","event_id":"sha256:0df4610ef46726b359febc2de0d6193e5c049635d7d546db20b772e03b151a0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU/bundle.json","state_url":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUFQIF2I6UAKL3XIORBU3RFPTU/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-31T08:45:37Z","links":{"resolver":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU","bundle":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU/bundle.json","state":"https://pith.science/pith/FUFQIF2I6UAKL3XIORBU3RFPTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUFQIF2I6UAKL3XIORBU3RFPTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FUFQIF2I6UAKL3XIORBU3RFPTU","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":"87f858d24cf0908f3132db4eb25f7e505cbdd84e374f8c218dbaf4662de59a4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-03T13:44:09Z","title_canon_sha256":"9ea7aef1fd4b5d7b1852d23d5f19ef7349f995020065eb1a2b1abc47cd73039e"},"schema_version":"1.0","source":{"id":"1408.0500","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0500","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0500v3","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0500","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"FUFQIF2I6UAK","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FUFQIF2I6UAKL3XI","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FUFQIF2I","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:0df4610ef46726b359febc2de0d6193e5c049635d7d546db20b772e03b151a0b","target":"graph","created_at":"2026-05-18T02:28:47Z","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":"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","authors_text":"Alexander S. Szalay, Carey E. Priebe, Da Zheng, Disa Mhembere, Joshua Vogelstein, Randal Burns","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-03T13:44:09Z","title":"FlashGraph: Processing Billion-Node Graphs on an Array of Commodity SSDs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0500","kind":"arxiv","version":3},"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:68e9621e3895d8c18b2fd2fb0520ae3b56d3906b600509cf53cb682fe9fc0359","target":"record","created_at":"2026-05-18T02:28:47Z","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":"87f858d24cf0908f3132db4eb25f7e505cbdd84e374f8c218dbaf4662de59a4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-03T13:44:09Z","title_canon_sha256":"9ea7aef1fd4b5d7b1852d23d5f19ef7349f995020065eb1a2b1abc47cd73039e"},"schema_version":"1.0","source":{"id":"1408.0500","kind":"arxiv","version":3}},"canonical_sha256":"2d0b041748f500a5eee874434dc4af9d3400406f09dd084d9564ed6bfd7df949","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d0b041748f500a5eee874434dc4af9d3400406f09dd084d9564ed6bfd7df949","first_computed_at":"2026-05-18T02:28:47.699865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:47.699865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LTHHbm1Zh5warIwJ4ldKrYFQB79CHagQTsBk5rbDt9/YZ0l3PAviF5hbQPLoSM272cEJkryg0uyf/271JOhGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:47.700259Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0500","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68e9621e3895d8c18b2fd2fb0520ae3b56d3906b600509cf53cb682fe9fc0359","sha256:0df4610ef46726b359febc2de0d6193e5c049635d7d546db20b772e03b151a0b"],"state_sha256":"72319a7591352c10e9ca458e3f7dc75bf6060e6b1b9ff3bcfcadda24d41f2b0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J5kU/cE9aihfe5jCYGYd7MCgoT+ngKbBSt4ZTKuU0VIGK5Xlq5tDjNfMQAdudj+1V+7toIswq2ImsaS5e/3fBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:45:37.432015Z","bundle_sha256":"bc50427e3dab1c5290e8d57eced8ac8ebf850dda0f54d98b6e4e3a8d5fbd3565"}}