{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WYZQQ4OGLWGXTSJ43L3JSAV3M2","short_pith_number":"pith:WYZQQ4OG","canonical_record":{"source":{"id":"1401.2327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-10T13:36:21Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"2fc522fad9bfbe652ccc7898e1bbc2ca16fd1cb1d191322c6e8e9a4c9b5e601d","abstract_canon_sha256":"29fe47f8f568217c421b90b4e5f37d931b310a8175838cfd3f16eb159e61bcc0"},"schema_version":"1.0"},"canonical_sha256":"b6330871c65d8d79c93cdaf69902bb66b99eb6c16185fa470fb54f945da2ddb0","source":{"kind":"arxiv","id":"1401.2327","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2327","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2327v1","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2327","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"WYZQQ4OGLWGX","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WYZQQ4OGLWGXTSJ4","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WYZQQ4OG","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WYZQQ4OGLWGXTSJ43L3JSAV3M2","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-10T13:36:21Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"2fc522fad9bfbe652ccc7898e1bbc2ca16fd1cb1d191322c6e8e9a4c9b5e601d","abstract_canon_sha256":"29fe47f8f568217c421b90b4e5f37d931b310a8175838cfd3f16eb159e61bcc0"},"schema_version":"1.0"},"canonical_sha256":"b6330871c65d8d79c93cdaf69902bb66b99eb6c16185fa470fb54f945da2ddb0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:45.583552Z","signature_b64":"j9XBbDwljQUSfYv7ojpDhutoQ+gI9HYV/szahyShF63UOvVBofk6hEBUZctFzn2ygQNHRDSEyVFbKDiKwY/TCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6330871c65d8d79c93cdaf69902bb66b99eb6c16185fa470fb54f945da2ddb0","last_reissued_at":"2026-05-18T03:02:45.582887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:45.582887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2327","source_version":1,"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-18T03:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDJD3yZ0W8+21WWveCUDexISEXUAubOVR1AUEBcDMZDbDWLqgB4Ed3KAVS4Iy6pdsuZcHMFzPHQo27AElQKuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:27:00.779701Z"},"content_sha256":"565a5ddedac5bc77b46f4cd796e968db057d0b88148a5ed9a4c737def108ac85","schema_version":"1.0","event_id":"sha256:565a5ddedac5bc77b46f4cd796e968db057d0b88148a5ed9a4c737def108ac85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WYZQQ4OGLWGXTSJ43L3JSAV3M2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BPP: Large Graph Storage for Efficient Disk Based Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Kamran Najeebullah, Kifayat Ullah Khan, Waqas Nawaz, Young-Koo Lee","submitted_at":"2014-01-10T13:36:21Z","abstract_excerpt":"Processing very large graphs like social networks, biological and chemical compounds is a challenging task. Distributed graph processing systems process the billion-scale graphs efficiently but incur overheads of efficient partitioning and distribution of the graph over a cluster of nodes. Distributed processing also requires cluster management and fault tolerance. In order to overcome these problems GraphChi was proposed recently. GraphChi significantly outperformed all the representative distributed processing frameworks. Still, we observe that GraphChi incurs some serious degradation in per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2327","kind":"arxiv","version":1},"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-18T03:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RPdTgXh6awvNBM8+oi2oeLz/V2o3ZaJAM6trjKiSCGVEygzWMsrpeOPYwIz5VIALyMJGsDlMkmcKiD1IFYYUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:27:00.780544Z"},"content_sha256":"c3db38c37f0cd7070ff558b375f9604b157d3b1221a8695ce5c66d57ac393b20","schema_version":"1.0","event_id":"sha256:c3db38c37f0cd7070ff558b375f9604b157d3b1221a8695ce5c66d57ac393b20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WYZQQ4OGLWGXTSJ43L3JSAV3M2/bundle.json","state_url":"https://pith.science/pith/WYZQQ4OGLWGXTSJ43L3JSAV3M2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WYZQQ4OGLWGXTSJ43L3JSAV3M2/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-08-03T17:27:00Z","links":{"resolver":"https://pith.science/pith/WYZQQ4OGLWGXTSJ43L3JSAV3M2","bundle":"https://pith.science/pith/WYZQQ4OGLWGXTSJ43L3JSAV3M2/bundle.json","state":"https://pith.science/pith/WYZQQ4OGLWGXTSJ43L3JSAV3M2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WYZQQ4OGLWGXTSJ43L3JSAV3M2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WYZQQ4OGLWGXTSJ43L3JSAV3M2","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":"29fe47f8f568217c421b90b4e5f37d931b310a8175838cfd3f16eb159e61bcc0","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-10T13:36:21Z","title_canon_sha256":"2fc522fad9bfbe652ccc7898e1bbc2ca16fd1cb1d191322c6e8e9a4c9b5e601d"},"schema_version":"1.0","source":{"id":"1401.2327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2327","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2327v1","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2327","created_at":"2026-05-18T03:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"WYZQQ4OGLWGX","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WYZQQ4OGLWGXTSJ4","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WYZQQ4OG","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:c3db38c37f0cd7070ff558b375f9604b157d3b1221a8695ce5c66d57ac393b20","target":"graph","created_at":"2026-05-18T03:02:45Z","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":"Processing very large graphs like social networks, biological and chemical compounds is a challenging task. Distributed graph processing systems process the billion-scale graphs efficiently but incur overheads of efficient partitioning and distribution of the graph over a cluster of nodes. Distributed processing also requires cluster management and fault tolerance. In order to overcome these problems GraphChi was proposed recently. GraphChi significantly outperformed all the representative distributed processing frameworks. Still, we observe that GraphChi incurs some serious degradation in per","authors_text":"Kamran Najeebullah, Kifayat Ullah Khan, Waqas Nawaz, Young-Koo Lee","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-10T13:36:21Z","title":"BPP: Large Graph Storage for Efficient Disk Based Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2327","kind":"arxiv","version":1},"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:565a5ddedac5bc77b46f4cd796e968db057d0b88148a5ed9a4c737def108ac85","target":"record","created_at":"2026-05-18T03:02:45Z","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":"29fe47f8f568217c421b90b4e5f37d931b310a8175838cfd3f16eb159e61bcc0","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-10T13:36:21Z","title_canon_sha256":"2fc522fad9bfbe652ccc7898e1bbc2ca16fd1cb1d191322c6e8e9a4c9b5e601d"},"schema_version":"1.0","source":{"id":"1401.2327","kind":"arxiv","version":1}},"canonical_sha256":"b6330871c65d8d79c93cdaf69902bb66b99eb6c16185fa470fb54f945da2ddb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6330871c65d8d79c93cdaf69902bb66b99eb6c16185fa470fb54f945da2ddb0","first_computed_at":"2026-05-18T03:02:45.582887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:45.582887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j9XBbDwljQUSfYv7ojpDhutoQ+gI9HYV/szahyShF63UOvVBofk6hEBUZctFzn2ygQNHRDSEyVFbKDiKwY/TCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:45.583552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:565a5ddedac5bc77b46f4cd796e968db057d0b88148a5ed9a4c737def108ac85","sha256:c3db38c37f0cd7070ff558b375f9604b157d3b1221a8695ce5c66d57ac393b20"],"state_sha256":"8a5ca763c75463ff5e7cada83fa83910c7dc33d6f45cc46a993677a4d7f02a74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+oqdHW/ewr6oB6fqRtlRhJ4h84b+T+lxqyDj1tO9Z/daY3UzoY0whX9NBJ7bI+ZXuk893yOzlzTFxEMXpgE9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:27:00.788305Z","bundle_sha256":"d40c2476bcd768bb67aa57495d560ca8f864269dc14961b66b23f36ea7e292c7"}}