{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SC6LJQ7AFEUFUPHNZ7QGLK3EWB","short_pith_number":"pith:SC6LJQ7A","canonical_record":{"source":{"id":"1705.05595","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T08:50:36Z","cross_cats_sorted":[],"title_canon_sha256":"d971962de6ba70fe78fec11ed5acc40d3285721a1f52b4637c9cf0f545a977cd","abstract_canon_sha256":"72c8067eefe563e0a36719f14b27032158758fa9e4d898316ebd893518e2fb4e"},"schema_version":"1.0"},"canonical_sha256":"90bcb4c3e029285a3cedcfe065ab64b067bdddef9bce7fd0c343b9b8c348d12b","source":{"kind":"arxiv","id":"1705.05595","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05595","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05595v5","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05595","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"SC6LJQ7AFEUF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SC6LJQ7AFEUFUPHN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SC6LJQ7A","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SC6LJQ7AFEUFUPHNZ7QGLK3EWB","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05595","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T08:50:36Z","cross_cats_sorted":[],"title_canon_sha256":"d971962de6ba70fe78fec11ed5acc40d3285721a1f52b4637c9cf0f545a977cd","abstract_canon_sha256":"72c8067eefe563e0a36719f14b27032158758fa9e4d898316ebd893518e2fb4e"},"schema_version":"1.0"},"canonical_sha256":"90bcb4c3e029285a3cedcfe065ab64b067bdddef9bce7fd0c343b9b8c348d12b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:35.641172Z","signature_b64":"4diXoZTFNWMcjbxNOsS7BN//m8Ph4Z29iggoc3osdaI2Qb8nErCXBwGkmZ5A74hFX9pNwiriFoiylfqTOiNPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90bcb4c3e029285a3cedcfe065ab64b067bdddef9bce7fd0c343b9b8c348d12b","last_reissued_at":"2026-05-18T00:38:35.639885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:35.639885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05595","source_version":5,"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-18T00:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gT1Cig5zqhu9dky+0dpsLMZZGMIAxpwx5sNUjSdyjaTp2xiijneSpryp4wKP5HsBtVBB5I1nWRca1ezy5PEHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:49:27.430024Z"},"content_sha256":"8a374fe19a0faac169b0f28492c0a9005826045d3eff3a044c1979f6ac28c83b","schema_version":"1.0","event_id":"sha256:8a374fe19a0faac169b0f28492c0a9005826045d3eff3a044c1979f6ac28c83b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SC6LJQ7AFEUFUPHNZ7QGLK3EWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphH: High Performance Big Graph Analytics in Small Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Peng Sun, Ta Nguyen Binh Duong, Xiaokui Xiao, Yonggang Wen","submitted_at":"2017-05-16T08:50:36Z","abstract_excerpt":"It is common for real-world applications to analyze big graphs using distributed graph processing systems. Popular in-memory systems require an enormous amount of resources to handle big graphs. While several out-of-core approaches have been proposed for processing big graphs on disk, the high disk I/O overhead could significantly reduce performance. In this paper, we propose GraphH to enable high-performance big graph analytics in small clusters. Specifically, we design a two-stage graph partition scheme to evenly divide the input graph into partitions, and propose a GAB (Gather-Apply-Broadca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05595","kind":"arxiv","version":5},"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-18T00:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"teCcpDCU8M3l8udgc/sbk0sYs052VzqtyD5SVwJGbCfFdW2YAwXvh73Jqo9UcHfIq2bYUysK2DTveBALZd/iCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:49:27.430574Z"},"content_sha256":"dc24d022b00ebb94250516bd14874fcc14acb2501b24f2483113bdd088f14714","schema_version":"1.0","event_id":"sha256:dc24d022b00ebb94250516bd14874fcc14acb2501b24f2483113bdd088f14714"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SC6LJQ7AFEUFUPHNZ7QGLK3EWB/bundle.json","state_url":"https://pith.science/pith/SC6LJQ7AFEUFUPHNZ7QGLK3EWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SC6LJQ7AFEUFUPHNZ7QGLK3EWB/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-29T22:49:27Z","links":{"resolver":"https://pith.science/pith/SC6LJQ7AFEUFUPHNZ7QGLK3EWB","bundle":"https://pith.science/pith/SC6LJQ7AFEUFUPHNZ7QGLK3EWB/bundle.json","state":"https://pith.science/pith/SC6LJQ7AFEUFUPHNZ7QGLK3EWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SC6LJQ7AFEUFUPHNZ7QGLK3EWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SC6LJQ7AFEUFUPHNZ7QGLK3EWB","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":"72c8067eefe563e0a36719f14b27032158758fa9e4d898316ebd893518e2fb4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T08:50:36Z","title_canon_sha256":"d971962de6ba70fe78fec11ed5acc40d3285721a1f52b4637c9cf0f545a977cd"},"schema_version":"1.0","source":{"id":"1705.05595","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05595","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05595v5","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05595","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"SC6LJQ7AFEUF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SC6LJQ7AFEUFUPHN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SC6LJQ7A","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:dc24d022b00ebb94250516bd14874fcc14acb2501b24f2483113bdd088f14714","target":"graph","created_at":"2026-05-18T00:38:35Z","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":"It is common for real-world applications to analyze big graphs using distributed graph processing systems. Popular in-memory systems require an enormous amount of resources to handle big graphs. While several out-of-core approaches have been proposed for processing big graphs on disk, the high disk I/O overhead could significantly reduce performance. In this paper, we propose GraphH to enable high-performance big graph analytics in small clusters. Specifically, we design a two-stage graph partition scheme to evenly divide the input graph into partitions, and propose a GAB (Gather-Apply-Broadca","authors_text":"Peng Sun, Ta Nguyen Binh Duong, Xiaokui Xiao, Yonggang Wen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T08:50:36Z","title":"GraphH: High Performance Big Graph Analytics in Small Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05595","kind":"arxiv","version":5},"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:8a374fe19a0faac169b0f28492c0a9005826045d3eff3a044c1979f6ac28c83b","target":"record","created_at":"2026-05-18T00:38:35Z","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":"72c8067eefe563e0a36719f14b27032158758fa9e4d898316ebd893518e2fb4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T08:50:36Z","title_canon_sha256":"d971962de6ba70fe78fec11ed5acc40d3285721a1f52b4637c9cf0f545a977cd"},"schema_version":"1.0","source":{"id":"1705.05595","kind":"arxiv","version":5}},"canonical_sha256":"90bcb4c3e029285a3cedcfe065ab64b067bdddef9bce7fd0c343b9b8c348d12b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90bcb4c3e029285a3cedcfe065ab64b067bdddef9bce7fd0c343b9b8c348d12b","first_computed_at":"2026-05-18T00:38:35.639885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:35.639885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4diXoZTFNWMcjbxNOsS7BN//m8Ph4Z29iggoc3osdaI2Qb8nErCXBwGkmZ5A74hFX9pNwiriFoiylfqTOiNPBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:35.641172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05595","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a374fe19a0faac169b0f28492c0a9005826045d3eff3a044c1979f6ac28c83b","sha256:dc24d022b00ebb94250516bd14874fcc14acb2501b24f2483113bdd088f14714"],"state_sha256":"291b1f35304264915e0997bf9cbb718af67d4f3e22be9ba9a294f461f6dc095c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/40tOdxYvGr69pzu0uFDvOBiZGuNQy2Xnjqgot2/7uImi69VgDEeR014zApvjQUeWz0ZduJDKQ5PYElQUEaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:49:27.432841Z","bundle_sha256":"7215f0323ab46a973dd714c263a61469a88efa04ae7384bd469f42be7a670915"}}