{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HXU4IKAWLM2CHXOOPPXJWNWAZC","short_pith_number":"pith:HXU4IKAW","canonical_record":{"source":{"id":"1601.05590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-21T11:18:34Z","cross_cats_sorted":[],"title_canon_sha256":"b8438e8ad54281433afa7bebc76f89677099226462b03510eb8da625d1194c85","abstract_canon_sha256":"fc65aeebf1a7879e0fab27412ac993dcbcd433f59938ef9f4f98a7b0bd696954"},"schema_version":"1.0"},"canonical_sha256":"3de9c428165b3423ddce7bee9b36c0c8ab84dc2910f3718585bae22a4ac6b702","source":{"kind":"arxiv","id":"1601.05590","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05590","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05590v1","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05590","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"pith_short_12","alias_value":"HXU4IKAWLM2C","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HXU4IKAWLM2CHXOO","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HXU4IKAW","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HXU4IKAWLM2CHXOOPPXJWNWAZC","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-21T11:18:34Z","cross_cats_sorted":[],"title_canon_sha256":"b8438e8ad54281433afa7bebc76f89677099226462b03510eb8da625d1194c85","abstract_canon_sha256":"fc65aeebf1a7879e0fab27412ac993dcbcd433f59938ef9f4f98a7b0bd696954"},"schema_version":"1.0"},"canonical_sha256":"3de9c428165b3423ddce7bee9b36c0c8ab84dc2910f3718585bae22a4ac6b702","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:13.435771Z","signature_b64":"+u9sVBTWtLDGoxLGZMQT5abqv3zqmabNIM99n/yfRI7PKz6XLOPYCQ8fasoQ23cR5xve4m7eARancKb9i9QzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3de9c428165b3423ddce7bee9b36c0c8ab84dc2910f3718585bae22a4ac6b702","last_reissued_at":"2026-05-18T01:22:13.434990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:13.434990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05590","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-18T01:22:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVzL194AOGTzMNFF3cIKT4DfhQRmJKzpqDCstn3mYhEpeb8D/yht81LXBN/KF0oe9o01AxVeQGcUmzf7kqJ+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:08:26.530206Z"},"content_sha256":"3b9961acd16a734a50e32dab8216f066061ad579c263330d900c44672e56fb52","schema_version":"1.0","event_id":"sha256:3b9961acd16a734a50e32dab8216f066061ad579c263330d900c44672e56fb52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HXU4IKAWLM2CHXOOPPXJWNWAZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Processing of Very Large Graphs in a Small Cluster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Da Yan, Huanhuan Wu, James Cheng, Yuzhen Huang","submitted_at":"2016-01-21T11:18:34Z","abstract_excerpt":"Inspired by the success of Google's Pregel, many systems have been developed recently for iterative computation over big graphs. These systems provide a user-friendly vertex-centric programming interface, where a programmer only needs to specify the behavior of one generic vertex when developing a parallel graph algorithm. However, most existing systems require the input graph to reside in memories of the machines in a cluster, and the few out-of-core systems suffer from problems such as poor efficiency for sparse computation workload, high demand on network bandwidth, and expensive cost incur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05590","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-18T01:22:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARb/ymqQM2Y4zBrqVcNN1og/x4kTHlKfh+zA/1mscOyDbA/URgWjvedR4DQ0SoE1GMvcw5AJCwvlq2IR1YQEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:08:26.530567Z"},"content_sha256":"5fa48c3d9bd04255420c1d41fb93e59bf158ab229e2aab1a1eac0b861bfeb85d","schema_version":"1.0","event_id":"sha256:5fa48c3d9bd04255420c1d41fb93e59bf158ab229e2aab1a1eac0b861bfeb85d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC/bundle.json","state_url":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC/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-06-03T16:08:26Z","links":{"resolver":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC","bundle":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC/bundle.json","state":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HXU4IKAWLM2CHXOOPPXJWNWAZC","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":"fc65aeebf1a7879e0fab27412ac993dcbcd433f59938ef9f4f98a7b0bd696954","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-21T11:18:34Z","title_canon_sha256":"b8438e8ad54281433afa7bebc76f89677099226462b03510eb8da625d1194c85"},"schema_version":"1.0","source":{"id":"1601.05590","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05590","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05590v1","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05590","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"pith_short_12","alias_value":"HXU4IKAWLM2C","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HXU4IKAWLM2CHXOO","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HXU4IKAW","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:5fa48c3d9bd04255420c1d41fb93e59bf158ab229e2aab1a1eac0b861bfeb85d","target":"graph","created_at":"2026-05-18T01:22:13Z","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":"Inspired by the success of Google's Pregel, many systems have been developed recently for iterative computation over big graphs. These systems provide a user-friendly vertex-centric programming interface, where a programmer only needs to specify the behavior of one generic vertex when developing a parallel graph algorithm. However, most existing systems require the input graph to reside in memories of the machines in a cluster, and the few out-of-core systems suffer from problems such as poor efficiency for sparse computation workload, high demand on network bandwidth, and expensive cost incur","authors_text":"Da Yan, Huanhuan Wu, James Cheng, Yuzhen Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-21T11:18:34Z","title":"Efficient Processing of Very Large Graphs in a Small Cluster"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05590","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:3b9961acd16a734a50e32dab8216f066061ad579c263330d900c44672e56fb52","target":"record","created_at":"2026-05-18T01:22:13Z","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":"fc65aeebf1a7879e0fab27412ac993dcbcd433f59938ef9f4f98a7b0bd696954","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-21T11:18:34Z","title_canon_sha256":"b8438e8ad54281433afa7bebc76f89677099226462b03510eb8da625d1194c85"},"schema_version":"1.0","source":{"id":"1601.05590","kind":"arxiv","version":1}},"canonical_sha256":"3de9c428165b3423ddce7bee9b36c0c8ab84dc2910f3718585bae22a4ac6b702","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3de9c428165b3423ddce7bee9b36c0c8ab84dc2910f3718585bae22a4ac6b702","first_computed_at":"2026-05-18T01:22:13.434990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:13.434990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+u9sVBTWtLDGoxLGZMQT5abqv3zqmabNIM99n/yfRI7PKz6XLOPYCQ8fasoQ23cR5xve4m7eARancKb9i9QzCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:13.435771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05590","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b9961acd16a734a50e32dab8216f066061ad579c263330d900c44672e56fb52","sha256:5fa48c3d9bd04255420c1d41fb93e59bf158ab229e2aab1a1eac0b861bfeb85d"],"state_sha256":"797a4ac945a797628efbaeadf3a6dbb1abaad430f6331f1a57caf962cce43427"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8a+N0EyxaEKS3AUzT+axKfwoWXKKc9dHlMYXydA5/IC4SIeDolJtOh2/TJI2EwNT6kY7nLbEc6ebBs61b1K7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:08:26.532587Z","bundle_sha256":"d170ebe9c8a18d9b9ea122e8919378bc8f458824ddcec895ab074b4e52ab86a3"}}