{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HXU4IKAWLM2CHXOOPPXJWNWAZC","short_pith_number":"pith:HXU4IKAW","schema_version":"1.0","canonical_sha256":"3de9c428165b3423ddce7bee9b36c0c8ab84dc2910f3718585bae22a4ac6b702","source":{"kind":"arxiv","id":"1601.05590","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.05590","created_at":"2026-05-18T01:22:13.435120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05590v1","created_at":"2026-05-18T01:22:13.435120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05590","created_at":"2026-05-18T01:22:13.435120+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXU4IKAWLM2C","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXU4IKAWLM2CHXOO","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXU4IKAW","created_at":"2026-05-18T12:30:22.444734+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/HXU4IKAWLM2CHXOOPPXJWNWAZC","json":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC.json","graph_json":"https://pith.science/api/pith-number/HXU4IKAWLM2CHXOOPPXJWNWAZC/graph.json","events_json":"https://pith.science/api/pith-number/HXU4IKAWLM2CHXOOPPXJWNWAZC/events.json","paper":"https://pith.science/paper/HXU4IKAW"},"agent_actions":{"view_html":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC","download_json":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC.json","view_paper":"https://pith.science/paper/HXU4IKAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05590&json=true","fetch_graph":"https://pith.science/api/pith-number/HXU4IKAWLM2CHXOOPPXJWNWAZC/graph.json","fetch_events":"https://pith.science/api/pith-number/HXU4IKAWLM2CHXOOPPXJWNWAZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC/action/storage_attestation","attest_author":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC/action/author_attestation","sign_citation":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC/action/citation_signature","submit_replication":"https://pith.science/pith/HXU4IKAWLM2CHXOOPPXJWNWAZC/action/replication_record"}},"created_at":"2026-05-18T01:22:13.435120+00:00","updated_at":"2026-05-18T01:22:13.435120+00:00"}