{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TLLPE6IKIQO5S6QP2DJ3TBO64T","short_pith_number":"pith:TLLPE6IK","canonical_record":{"source":{"id":"1806.00762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-03T10:17:08Z","cross_cats_sorted":[],"title_canon_sha256":"5b55a64f2ace46b05df07af0816583b581c3e2366ee067d113f30201b0930059","abstract_canon_sha256":"f6425ef760b09d092fafb405b5a201854f34a6a7412778254aed7b579013186c"},"schema_version":"1.0"},"canonical_sha256":"9ad6f2790a441dd97a0fd0d3b985dee4efee17c8d05d3b12841ae3bf0f3de22b","source":{"kind":"arxiv","id":"1806.00762","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00762","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00762v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00762","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"TLLPE6IKIQO5","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TLLPE6IKIQO5S6QP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TLLPE6IK","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TLLPE6IKIQO5S6QP2DJ3TBO64T","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-03T10:17:08Z","cross_cats_sorted":[],"title_canon_sha256":"5b55a64f2ace46b05df07af0816583b581c3e2366ee067d113f30201b0930059","abstract_canon_sha256":"f6425ef760b09d092fafb405b5a201854f34a6a7412778254aed7b579013186c"},"schema_version":"1.0"},"canonical_sha256":"9ad6f2790a441dd97a0fd0d3b985dee4efee17c8d05d3b12841ae3bf0f3de22b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:18.520275Z","signature_b64":"mgW3Pw0kxq4U5iNBlRp/gUXPY6FlHzqVQcDzAudbbfHZ/ljY57m00kZZc3LJvkBmwGzMn0EmKZIMckumSwiABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ad6f2790a441dd97a0fd0d3b985dee4efee17c8d05d3b12841ae3bf0f3de22b","last_reissued_at":"2026-05-18T00:14:18.519839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:18.519839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00762","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-18T00:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pM2b4Lgi64GOIfDTr/EjnhIIZNJpARYEVNoPeR1T2ISRSAbna5OzvmSxs/fPYVObAjvsDMUel+MueF7lWAavAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:02:45.709021Z"},"content_sha256":"3e63702542ff1217c1b04fcace2a4f35b9682bedc597e0eec0b84cfb1e231924","schema_version":"1.0","event_id":"sha256:3e63702542ff1217c1b04fcace2a4f35b9682bedc597e0eec0b84cfb1e231924"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TLLPE6IKIQO5S6QP2DJ3TBO64T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Up Large-Scale Graph Processing for GPU-Accelerated Heterogeneous Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Xianliang Li","submitted_at":"2018-06-03T10:17:08Z","abstract_excerpt":"Not only with the large host memory for supporting large scale graph processing, GPU-accelerated heterogeneous architecture can also provide a great potential for high-performance computing. However, few existing heterogeneous systems can exploit both hardware advantages to enable the scale-up performance for graph processing due to the limited CPU-GPU transmission efficiency.\n  In this paper, we investigate the transmission inefficiency problem of heterogeneous graph systems. Our key insight is that the transmission efficiency for heterogeneous graph processing can be greatly improved by simp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00762","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-18T00:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcOoE96h1yW8mv8k5msccc7HRm/GmJF/BT3T6JzSCoDqcCgfnl6RiCGZ5SoLoq4Xv4yVyLJ0DypmWzcxRsjqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:02:45.709371Z"},"content_sha256":"b550346fcf1ef397334d482650987581d5b04e037579254d5941b193e57a5c25","schema_version":"1.0","event_id":"sha256:b550346fcf1ef397334d482650987581d5b04e037579254d5941b193e57a5c25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLLPE6IKIQO5S6QP2DJ3TBO64T/bundle.json","state_url":"https://pith.science/pith/TLLPE6IKIQO5S6QP2DJ3TBO64T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLLPE6IKIQO5S6QP2DJ3TBO64T/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-07-02T21:02:45Z","links":{"resolver":"https://pith.science/pith/TLLPE6IKIQO5S6QP2DJ3TBO64T","bundle":"https://pith.science/pith/TLLPE6IKIQO5S6QP2DJ3TBO64T/bundle.json","state":"https://pith.science/pith/TLLPE6IKIQO5S6QP2DJ3TBO64T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLLPE6IKIQO5S6QP2DJ3TBO64T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TLLPE6IKIQO5S6QP2DJ3TBO64T","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":"f6425ef760b09d092fafb405b5a201854f34a6a7412778254aed7b579013186c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-03T10:17:08Z","title_canon_sha256":"5b55a64f2ace46b05df07af0816583b581c3e2366ee067d113f30201b0930059"},"schema_version":"1.0","source":{"id":"1806.00762","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00762","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00762v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00762","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"TLLPE6IKIQO5","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TLLPE6IKIQO5S6QP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TLLPE6IK","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:b550346fcf1ef397334d482650987581d5b04e037579254d5941b193e57a5c25","target":"graph","created_at":"2026-05-18T00:14:18Z","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":"Not only with the large host memory for supporting large scale graph processing, GPU-accelerated heterogeneous architecture can also provide a great potential for high-performance computing. However, few existing heterogeneous systems can exploit both hardware advantages to enable the scale-up performance for graph processing due to the limited CPU-GPU transmission efficiency.\n  In this paper, we investigate the transmission inefficiency problem of heterogeneous graph systems. Our key insight is that the transmission efficiency for heterogeneous graph processing can be greatly improved by simp","authors_text":"Xianliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-03T10:17:08Z","title":"Scaling Up Large-Scale Graph Processing for GPU-Accelerated Heterogeneous Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00762","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:3e63702542ff1217c1b04fcace2a4f35b9682bedc597e0eec0b84cfb1e231924","target":"record","created_at":"2026-05-18T00:14:18Z","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":"f6425ef760b09d092fafb405b5a201854f34a6a7412778254aed7b579013186c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-03T10:17:08Z","title_canon_sha256":"5b55a64f2ace46b05df07af0816583b581c3e2366ee067d113f30201b0930059"},"schema_version":"1.0","source":{"id":"1806.00762","kind":"arxiv","version":1}},"canonical_sha256":"9ad6f2790a441dd97a0fd0d3b985dee4efee17c8d05d3b12841ae3bf0f3de22b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ad6f2790a441dd97a0fd0d3b985dee4efee17c8d05d3b12841ae3bf0f3de22b","first_computed_at":"2026-05-18T00:14:18.519839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:18.519839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mgW3Pw0kxq4U5iNBlRp/gUXPY6FlHzqVQcDzAudbbfHZ/ljY57m00kZZc3LJvkBmwGzMn0EmKZIMckumSwiABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:18.520275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00762","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e63702542ff1217c1b04fcace2a4f35b9682bedc597e0eec0b84cfb1e231924","sha256:b550346fcf1ef397334d482650987581d5b04e037579254d5941b193e57a5c25"],"state_sha256":"cdda9a926a922f7233a60b1fbe23c6fa00c9f359dc3da013931e1d16d629d6df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvS8kW637JYEBv7WesnGO0PBXf7rqqAdYzqwIAWstk9xjKwxLg8RrhZcoWdEY13MROIK4SSEy47N8GImxot+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T21:02:45.711270Z","bundle_sha256":"b82b5acd8c25591cb89166b9689c0921cade4c3b8d0fb4983bfa8da39135e4e5"}}