{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2A2FYCFOXABLGRCUG4MERV5NQC","short_pith_number":"pith:2A2FYCFO","canonical_record":{"source":{"id":"1812.04070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-10T20:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"057b20bde78a9a59b40431cca5c1af3121dde1d28e2f335de0c11d3ecdfe3f05","abstract_canon_sha256":"a02fc0022aa3481e520e7f1a26fa4bcee3f169105a8fe7368761f0121582b5bd"},"schema_version":"1.0"},"canonical_sha256":"d0345c08aeb802b34454371848d7ad80b0c912fbfd82277f399e6d7a80283c11","source":{"kind":"arxiv","id":"1812.04070","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04070","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04070v1","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04070","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"2A2FYCFOXABL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2A2FYCFOXABLGRCU","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2A2FYCFO","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2A2FYCFOXABLGRCUG4MERV5NQC","target":"record","payload":{"canonical_record":{"source":{"id":"1812.04070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-10T20:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"057b20bde78a9a59b40431cca5c1af3121dde1d28e2f335de0c11d3ecdfe3f05","abstract_canon_sha256":"a02fc0022aa3481e520e7f1a26fa4bcee3f169105a8fe7368761f0121582b5bd"},"schema_version":"1.0"},"canonical_sha256":"d0345c08aeb802b34454371848d7ad80b0c912fbfd82277f399e6d7a80283c11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:43.045098Z","signature_b64":"gtRl9QkSpGWBME6kUgvhXt3JEOJwDqbcW7AecaIQcJ2frq1uSwj4eVU/iew9rEzE6uGlImHzPSWlVCkkJZ7cAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0345c08aeb802b34454371848d7ad80b0c912fbfd82277f399e6d7a80283c11","last_reissued_at":"2026-05-17T23:58:43.044298Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:43.044298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.04070","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-17T23:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4ZVP4MmNJN1ebv1EAA7GNMg9oQgZXS4AHXgghrGRiFMgH+NP1MF9x85Xzx/lT7qRR3hQZRPk21DGLTYc33fCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:55:38.834460Z"},"content_sha256":"468afda837e743b7fb719fa41fa90e9cad0f08a06bad02a8224f8cf2d0d3fe34","schema_version":"1.0","event_id":"sha256:468afda837e743b7fb719fa41fa90e9cad0f08a06bad02a8224f8cf2d0d3fe34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2A2FYCFOXABLGRCUG4MERV5NQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SIMD-X: Programming and Processing of Graph Algorithms on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hang Liu, H. Howie Huang","submitted_at":"2018-12-10T20:29:58Z","abstract_excerpt":"With high computation power and memory bandwidth, graphics processing units (GPUs) lend themselves to accelerate data-intensive analytics, especially when such applications fit the single instruction multiple data (SIMD) model. However, graph algorithms such as breadth-first search and k-core, often fail to take full advantage of GPUs, due to irregularity in memory access and control flow. To address this challenge, we have developed SIMD-X, for programming and processing of single instruction multiple, complex, data on GPUs. Specifically, the new Active-Compute-Combine (ACC) model not only pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04070","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-17T23:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fOhAFO8XwpGFoV2gNTsiXHANyYQIKU16mVVZtVIA3eesBCKOJ1MVREnTEfrm4EbTp6iDaVYNwje/oSB8PMQeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:55:38.835098Z"},"content_sha256":"c3441b1f53d550fea9cb9f676f7810eb8853fbb1a563cc82737106a0794e2b65","schema_version":"1.0","event_id":"sha256:c3441b1f53d550fea9cb9f676f7810eb8853fbb1a563cc82737106a0794e2b65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2A2FYCFOXABLGRCUG4MERV5NQC/bundle.json","state_url":"https://pith.science/pith/2A2FYCFOXABLGRCUG4MERV5NQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2A2FYCFOXABLGRCUG4MERV5NQC/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-30T03:55:38Z","links":{"resolver":"https://pith.science/pith/2A2FYCFOXABLGRCUG4MERV5NQC","bundle":"https://pith.science/pith/2A2FYCFOXABLGRCUG4MERV5NQC/bundle.json","state":"https://pith.science/pith/2A2FYCFOXABLGRCUG4MERV5NQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2A2FYCFOXABLGRCUG4MERV5NQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2A2FYCFOXABLGRCUG4MERV5NQC","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":"a02fc0022aa3481e520e7f1a26fa4bcee3f169105a8fe7368761f0121582b5bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-10T20:29:58Z","title_canon_sha256":"057b20bde78a9a59b40431cca5c1af3121dde1d28e2f335de0c11d3ecdfe3f05"},"schema_version":"1.0","source":{"id":"1812.04070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04070","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04070v1","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04070","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"2A2FYCFOXABL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2A2FYCFOXABLGRCU","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2A2FYCFO","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:c3441b1f53d550fea9cb9f676f7810eb8853fbb1a563cc82737106a0794e2b65","target":"graph","created_at":"2026-05-17T23:58:43Z","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":"With high computation power and memory bandwidth, graphics processing units (GPUs) lend themselves to accelerate data-intensive analytics, especially when such applications fit the single instruction multiple data (SIMD) model. However, graph algorithms such as breadth-first search and k-core, often fail to take full advantage of GPUs, due to irregularity in memory access and control flow. To address this challenge, we have developed SIMD-X, for programming and processing of single instruction multiple, complex, data on GPUs. Specifically, the new Active-Compute-Combine (ACC) model not only pr","authors_text":"Hang Liu, H. Howie Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-10T20:29:58Z","title":"SIMD-X: Programming and Processing of Graph Algorithms on GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04070","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:468afda837e743b7fb719fa41fa90e9cad0f08a06bad02a8224f8cf2d0d3fe34","target":"record","created_at":"2026-05-17T23:58:43Z","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":"a02fc0022aa3481e520e7f1a26fa4bcee3f169105a8fe7368761f0121582b5bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-10T20:29:58Z","title_canon_sha256":"057b20bde78a9a59b40431cca5c1af3121dde1d28e2f335de0c11d3ecdfe3f05"},"schema_version":"1.0","source":{"id":"1812.04070","kind":"arxiv","version":1}},"canonical_sha256":"d0345c08aeb802b34454371848d7ad80b0c912fbfd82277f399e6d7a80283c11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0345c08aeb802b34454371848d7ad80b0c912fbfd82277f399e6d7a80283c11","first_computed_at":"2026-05-17T23:58:43.044298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:43.044298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gtRl9QkSpGWBME6kUgvhXt3JEOJwDqbcW7AecaIQcJ2frq1uSwj4eVU/iew9rEzE6uGlImHzPSWlVCkkJZ7cAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:43.045098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.04070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:468afda837e743b7fb719fa41fa90e9cad0f08a06bad02a8224f8cf2d0d3fe34","sha256:c3441b1f53d550fea9cb9f676f7810eb8853fbb1a563cc82737106a0794e2b65"],"state_sha256":"d436ce6510a3459f8f4e654c6ad4b274197358219e9cce2146e9707d08baec61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZaNpOeQM5sFdwC2U3fpJev6wPg0GxThYOJ/xlvMw5EsCAJPg26dzp7DRS9Zj3+JM+jybmxm5kPCIxyqBkBUiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:55:38.838448Z","bundle_sha256":"e4bfc041bcd41fc3fecbef744df005b883e8db43487a9c47c856bff26f00b1fa"}}