{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:E7MR4Q2SPGNW5QD6P6V5AG7KQE","short_pith_number":"pith:E7MR4Q2S","canonical_record":{"source":{"id":"2404.06037","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-04-09T05:53:33Z","cross_cats_sorted":[],"title_canon_sha256":"aaae7c8a159520d49a48659bff37109727e74146a0a86406e85108f3e4dc7f7a","abstract_canon_sha256":"be7f1af12f21e5c22c2d39e0ce0f66ab0963782eed5070fb3286cc1ac50f91fa"},"schema_version":"1.0"},"canonical_sha256":"27d91e4352799b6ec07e7fabd01bea8101d33ab7eef47f50e0bb3201cce0fc4a","source":{"kind":"arxiv","id":"2404.06037","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06037","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06037v2","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06037","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"E7MR4Q2SPGNW","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_16","alias_value":"E7MR4Q2SPGNW5QD6","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_8","alias_value":"E7MR4Q2S","created_at":"2026-07-05T09:26:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:E7MR4Q2SPGNW5QD6P6V5AG7KQE","target":"record","payload":{"canonical_record":{"source":{"id":"2404.06037","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-04-09T05:53:33Z","cross_cats_sorted":[],"title_canon_sha256":"aaae7c8a159520d49a48659bff37109727e74146a0a86406e85108f3e4dc7f7a","abstract_canon_sha256":"be7f1af12f21e5c22c2d39e0ce0f66ab0963782eed5070fb3286cc1ac50f91fa"},"schema_version":"1.0"},"canonical_sha256":"27d91e4352799b6ec07e7fabd01bea8101d33ab7eef47f50e0bb3201cce0fc4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:59.367364Z","signature_b64":"1Ncv3kSrrNTWsie8N3zqMh1iFkL4GcAh9yrNHZE4NL7Ihn9D8MgFlBprbs8OWkM3N+Qoz0O+IKJYr1/+9qITCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d91e4352799b6ec07e7fabd01bea8101d33ab7eef47f50e0bb3201cce0fc4a","last_reissued_at":"2026-07-05T09:26:59.366908Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:59.366908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.06037","source_version":2,"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-07-05T09:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"220cJPrRJEwv5IqS9QxijnbPx0O5LPmcpjjcKhvRvN8SzbYHLlIS7OjJZAYLJfPglmEeiRCThiOtmwxZ8xTqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:20:55.813146Z"},"content_sha256":"66f44f03bc2237e08f3fd4a4cabb3ca9269e742f8e4839b07be09386b395c796","schema_version":"1.0","event_id":"sha256:66f44f03bc2237e08f3fd4a4cabb3ca9269e742f8e4839b07be09386b395c796"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:E7MR4Q2SPGNW5QD6P6V5AG7KQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Survey of Distributed Graph Algorithms on Massive Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jingren Zhou, Lingkai Meng, Longbin Lai, Long Yuan, Peng Cheng, Wenjie Zhang, Wenyuan Yu, Xue Li, Xuemin Lin, Yu Shao","submitted_at":"2024-04-09T05:53:33Z","abstract_excerpt":"Distributed processing of large-scale graph data has many practical applications and has been widely studied. In recent years, a lot of distributed graph processing frameworks and algorithms have been proposed. While many efforts have been devoted to analyzing these, with most analyzing them based on programming models, less research focuses on understanding their challenges in distributed environments. Applying graph tasks to distributed environments is not easy, often facing numerous challenges through our analysis, including parallelism, load balancing, communication overhead, and bandwidth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06037","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.06037/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"chwqUpN9Pbi/k0ERwx4iYQyau1HBpN8qLrdNq89HiIFiNHe4o2Qye6rA6xJL5oTqnuv5kC/L0RHACaSxu/w5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:20:55.813878Z"},"content_sha256":"417f6c08861ae9fca0480da9af9b10f00194a787b50b49ba46b02afe7f5e69bd","schema_version":"1.0","event_id":"sha256:417f6c08861ae9fca0480da9af9b10f00194a787b50b49ba46b02afe7f5e69bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7MR4Q2SPGNW5QD6P6V5AG7KQE/bundle.json","state_url":"https://pith.science/pith/E7MR4Q2SPGNW5QD6P6V5AG7KQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7MR4Q2SPGNW5QD6P6V5AG7KQE/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-15T17:20:55Z","links":{"resolver":"https://pith.science/pith/E7MR4Q2SPGNW5QD6P6V5AG7KQE","bundle":"https://pith.science/pith/E7MR4Q2SPGNW5QD6P6V5AG7KQE/bundle.json","state":"https://pith.science/pith/E7MR4Q2SPGNW5QD6P6V5AG7KQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7MR4Q2SPGNW5QD6P6V5AG7KQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:E7MR4Q2SPGNW5QD6P6V5AG7KQE","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":"be7f1af12f21e5c22c2d39e0ce0f66ab0963782eed5070fb3286cc1ac50f91fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-04-09T05:53:33Z","title_canon_sha256":"aaae7c8a159520d49a48659bff37109727e74146a0a86406e85108f3e4dc7f7a"},"schema_version":"1.0","source":{"id":"2404.06037","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06037","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06037v2","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06037","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"E7MR4Q2SPGNW","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_16","alias_value":"E7MR4Q2SPGNW5QD6","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_8","alias_value":"E7MR4Q2S","created_at":"2026-07-05T09:26:59Z"}],"graph_snapshots":[{"event_id":"sha256:417f6c08861ae9fca0480da9af9b10f00194a787b50b49ba46b02afe7f5e69bd","target":"graph","created_at":"2026-07-05T09:26:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.06037/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Distributed processing of large-scale graph data has many practical applications and has been widely studied. In recent years, a lot of distributed graph processing frameworks and algorithms have been proposed. While many efforts have been devoted to analyzing these, with most analyzing them based on programming models, less research focuses on understanding their challenges in distributed environments. Applying graph tasks to distributed environments is not easy, often facing numerous challenges through our analysis, including parallelism, load balancing, communication overhead, and bandwidth","authors_text":"Jingren Zhou, Lingkai Meng, Longbin Lai, Long Yuan, Peng Cheng, Wenjie Zhang, Wenyuan Yu, Xue Li, Xuemin Lin, Yu Shao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-04-09T05:53:33Z","title":"A Survey of Distributed Graph Algorithms on Massive Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06037","kind":"arxiv","version":2},"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:66f44f03bc2237e08f3fd4a4cabb3ca9269e742f8e4839b07be09386b395c796","target":"record","created_at":"2026-07-05T09:26:59Z","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":"be7f1af12f21e5c22c2d39e0ce0f66ab0963782eed5070fb3286cc1ac50f91fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-04-09T05:53:33Z","title_canon_sha256":"aaae7c8a159520d49a48659bff37109727e74146a0a86406e85108f3e4dc7f7a"},"schema_version":"1.0","source":{"id":"2404.06037","kind":"arxiv","version":2}},"canonical_sha256":"27d91e4352799b6ec07e7fabd01bea8101d33ab7eef47f50e0bb3201cce0fc4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d91e4352799b6ec07e7fabd01bea8101d33ab7eef47f50e0bb3201cce0fc4a","first_computed_at":"2026-07-05T09:26:59.366908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:26:59.366908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Ncv3kSrrNTWsie8N3zqMh1iFkL4GcAh9yrNHZE4NL7Ihn9D8MgFlBprbs8OWkM3N+Qoz0O+IKJYr1/+9qITCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:26:59.367364Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.06037","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66f44f03bc2237e08f3fd4a4cabb3ca9269e742f8e4839b07be09386b395c796","sha256:417f6c08861ae9fca0480da9af9b10f00194a787b50b49ba46b02afe7f5e69bd"],"state_sha256":"91bce049fb5365d27478a1fdeb9cfce0148665560cded6e46e5ec83e775cc5ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IjmN7mWkmCX8CiSEWTF20fpPZvyISxS41TXHTxXTO2+FCWnMd7QRtu+PkXj/5IJDvkDewATD6J2IrXPWkGd6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T17:20:55.819675Z","bundle_sha256":"cab9a2e938e07a5f5a4d7474c9553537a87e67a272386d087f4aa2e4666356a7"}}