{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I7VBBRTSJVL4TPFNCSTUXTT5AB","short_pith_number":"pith:I7VBBRTS","canonical_record":{"source":{"id":"1310.5603","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2013-10-21T15:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"4072567bf0f8bc76755e4a90b1c3693e2d7018e3540aedcbed23ccbabb32a9a3","abstract_canon_sha256":"be60a92f0dcf3445e40e7e6e6a54ff212a21bfde4e6b6c482640d5f1a766cdc1"},"schema_version":"1.0"},"canonical_sha256":"47ea10c6724d57c9bcad14a74bce7d0045bd21dc36545314c02fe7d17c1725e7","source":{"kind":"arxiv","id":"1310.5603","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5603","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5603v1","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5603","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"I7VBBRTSJVL4","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I7VBBRTSJVL4TPFN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I7VBBRTS","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I7VBBRTSJVL4TPFNCSTUXTT5AB","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5603","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2013-10-21T15:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"4072567bf0f8bc76755e4a90b1c3693e2d7018e3540aedcbed23ccbabb32a9a3","abstract_canon_sha256":"be60a92f0dcf3445e40e7e6e6a54ff212a21bfde4e6b6c482640d5f1a766cdc1"},"schema_version":"1.0"},"canonical_sha256":"47ea10c6724d57c9bcad14a74bce7d0045bd21dc36545314c02fe7d17c1725e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:34.827912Z","signature_b64":"fubst4TFVYTgLl7cRyrwn5QQ0pXqE7VB/uJhPuWbRBzA2X2uCHvUGHuoyiUPD/YN9UAJXwxb33lOWXPv/0ffAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47ea10c6724d57c9bcad14a74bce7d0045bd21dc36545314c02fe7d17c1725e7","last_reissued_at":"2026-05-18T03:09:34.827095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:34.827095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5603","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:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bjQZm7BYpHVnC/7ZEBD6VYvvk5H2LcYOAugWeJsGMKaBYWVTFCX9H68zUIFnL+rOA3P0KrayO+0zm8cTiaZbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:52:56.188765Z"},"content_sha256":"dcae848e8e36db5cec551399c7bb11e55f6dbf935066ac3df670eacb82e22606","schema_version":"1.0","event_id":"sha256:dcae848e8e36db5cec551399c7bb11e55f6dbf935066ac3df670eacb82e22606"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I7VBBRTSJVL4TPFNCSTUXTT5AB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GRE: A Graph Runtime Engine for Large-Scale Distributed Graph-Parallel Applications","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Guangming Tan, Jie Yan, Ninghui Sun","submitted_at":"2013-10-21T15:32:16Z","abstract_excerpt":"Large-scale distributed graph-parallel computing is challenging. On one hand, due to the irregular computation pattern and lack of locality, it is hard to express parallelism efficiently. On the other hand, due to the scale-free nature, real-world graphs are hard to partition in balance with low cut. To address these challenges, several graph-parallel frameworks including Pregel and GraphLab (PowerGraph) have been developed recently. In this paper, we present an alternative framework, Graph Runtime Engine (GRE). While retaining the vertex-centric programming model, GRE proposes two new abstrac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5603","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:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tfxlNTRtEjMJPEaefFMua1LwgXA01lv55PU0Kh1uDwQXoMQTzKqWADslLBXqEbKcFe9SvfScQ6gZklUiLPjKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:52:56.189114Z"},"content_sha256":"1a312d9a72baf333a4bbf60dc34fdc564fdf6fb2c6c2db9a9c89265e46b11f7c","schema_version":"1.0","event_id":"sha256:1a312d9a72baf333a4bbf60dc34fdc564fdf6fb2c6c2db9a9c89265e46b11f7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7VBBRTSJVL4TPFNCSTUXTT5AB/bundle.json","state_url":"https://pith.science/pith/I7VBBRTSJVL4TPFNCSTUXTT5AB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7VBBRTSJVL4TPFNCSTUXTT5AB/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-28T22:52:56Z","links":{"resolver":"https://pith.science/pith/I7VBBRTSJVL4TPFNCSTUXTT5AB","bundle":"https://pith.science/pith/I7VBBRTSJVL4TPFNCSTUXTT5AB/bundle.json","state":"https://pith.science/pith/I7VBBRTSJVL4TPFNCSTUXTT5AB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7VBBRTSJVL4TPFNCSTUXTT5AB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I7VBBRTSJVL4TPFNCSTUXTT5AB","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":"be60a92f0dcf3445e40e7e6e6a54ff212a21bfde4e6b6c482640d5f1a766cdc1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2013-10-21T15:32:16Z","title_canon_sha256":"4072567bf0f8bc76755e4a90b1c3693e2d7018e3540aedcbed23ccbabb32a9a3"},"schema_version":"1.0","source":{"id":"1310.5603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5603","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5603v1","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5603","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"I7VBBRTSJVL4","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I7VBBRTSJVL4TPFN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I7VBBRTS","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:1a312d9a72baf333a4bbf60dc34fdc564fdf6fb2c6c2db9a9c89265e46b11f7c","target":"graph","created_at":"2026-05-18T03:09:34Z","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":"Large-scale distributed graph-parallel computing is challenging. On one hand, due to the irregular computation pattern and lack of locality, it is hard to express parallelism efficiently. On the other hand, due to the scale-free nature, real-world graphs are hard to partition in balance with low cut. To address these challenges, several graph-parallel frameworks including Pregel and GraphLab (PowerGraph) have been developed recently. In this paper, we present an alternative framework, Graph Runtime Engine (GRE). While retaining the vertex-centric programming model, GRE proposes two new abstrac","authors_text":"Guangming Tan, Jie Yan, Ninghui Sun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2013-10-21T15:32:16Z","title":"GRE: A Graph Runtime Engine for Large-Scale Distributed Graph-Parallel Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5603","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:dcae848e8e36db5cec551399c7bb11e55f6dbf935066ac3df670eacb82e22606","target":"record","created_at":"2026-05-18T03:09:34Z","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":"be60a92f0dcf3445e40e7e6e6a54ff212a21bfde4e6b6c482640d5f1a766cdc1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2013-10-21T15:32:16Z","title_canon_sha256":"4072567bf0f8bc76755e4a90b1c3693e2d7018e3540aedcbed23ccbabb32a9a3"},"schema_version":"1.0","source":{"id":"1310.5603","kind":"arxiv","version":1}},"canonical_sha256":"47ea10c6724d57c9bcad14a74bce7d0045bd21dc36545314c02fe7d17c1725e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47ea10c6724d57c9bcad14a74bce7d0045bd21dc36545314c02fe7d17c1725e7","first_computed_at":"2026-05-18T03:09:34.827095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:34.827095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fubst4TFVYTgLl7cRyrwn5QQ0pXqE7VB/uJhPuWbRBzA2X2uCHvUGHuoyiUPD/YN9UAJXwxb33lOWXPv/0ffAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:34.827912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcae848e8e36db5cec551399c7bb11e55f6dbf935066ac3df670eacb82e22606","sha256:1a312d9a72baf333a4bbf60dc34fdc564fdf6fb2c6c2db9a9c89265e46b11f7c"],"state_sha256":"0bb64e7a1924bcdf060b4c08e3d7e5e8f411ef12ad6c131ae013f6bea87c8791"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWgRAaPbvvK7t9xNyc/GYBfLutepK5z1x2WmBb/jiLOQv9gIWyGueC26V2DOZ1nUxesJjM9swh1Pp3UxmGb1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:52:56.191373Z","bundle_sha256":"53bfbb75e264b9b157973ca8863b330c74a55e46c1c9d2f60231d088b6a63afd"}}