{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7VBMEBSHSVPCFO6KZGHN3GQ5UQ","short_pith_number":"pith:7VBMEBSH","canonical_record":{"source":{"id":"1711.00231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-01T07:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"356a93cc29c47cc592259731dbe20c6991fe66c2a8e9748daf555e7f5bdf3e1d","abstract_canon_sha256":"4e7c975a99384a86f5acbcc7b45ed609e37676a05bcd3b9fcddccdfe2c20b3a3"},"schema_version":"1.0"},"canonical_sha256":"fd42c20647955e22bbcac98edd9a1da40e971bda98772a94fc2c86e24b901156","source":{"kind":"arxiv","id":"1711.00231","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00231","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00231v1","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00231","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"pith_short_12","alias_value":"7VBMEBSHSVPC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7VBMEBSHSVPCFO6K","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7VBMEBSH","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7VBMEBSHSVPCFO6KZGHN3GQ5UQ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-01T07:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"356a93cc29c47cc592259731dbe20c6991fe66c2a8e9748daf555e7f5bdf3e1d","abstract_canon_sha256":"4e7c975a99384a86f5acbcc7b45ed609e37676a05bcd3b9fcddccdfe2c20b3a3"},"schema_version":"1.0"},"canonical_sha256":"fd42c20647955e22bbcac98edd9a1da40e971bda98772a94fc2c86e24b901156","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:34.720776Z","signature_b64":"kbpgi8shlDTrZK6vHu7/JhqxVsGhrLRQesMa+TGFi0iVwulzk9acdL3InEaneNlIHJ9ekRoGDlOWb8n87dQdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd42c20647955e22bbcac98edd9a1da40e971bda98772a94fc2c86e24b901156","last_reissued_at":"2026-05-18T00:31:34.720199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:34.720199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00231","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:31:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trBFlJIDB5WGEM+9n+FacBkrulCnx4ly6ka8V+cV84tl4atFWRH8N1W1u7taDEx7KIqkdnkrumc2B420fQ1pCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:33:51.661278Z"},"content_sha256":"6745b9e62a67bc714aaa25a8143028207904a99ca083f7f4ce1b37989844038b","schema_version":"1.0","event_id":"sha256:6745b9e62a67bc714aaa25a8143028207904a99ca083f7f4ce1b37989844038b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7VBMEBSHSVPCFO6KZGHN3GQ5UQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Load Balancing Strategies for Graph Applications on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ananya Raval, Keshav Pingali, Rupesh Nasre, Sathish Vadhiyar, Vasudevan R, Vivek Kumar","submitted_at":"2017-11-01T07:24:24Z","abstract_excerpt":"Acceleration of graph applications on GPUs has found large interest due to the ubiquitous use of graph processing in various domains. The inherent \\textit{irregularity} in graph applications leads to several challenges for parallelization. A key challenge, which we address in this paper, is that of load-imbalance. If the work-assignment to threads uses node-based graph partitioning, it can result in skewed task-distribution, leading to poor load-balance. In contrast, if the work-assignment uses edge-based graph partitioning, the load-balancing is better, but the memory requirement is relativel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00231","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:31:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owbZnY41K1ldUAWLrLmQUKut5l2xkkglUHJ4ykc3m0zoFM0fHOHeEjDWzEcr/eS7pai1EAQXdH0dVqYG4AfPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:33:51.661737Z"},"content_sha256":"10de33dd26751a627d6013f814d43a890d8327414fa916ca46e2bb20c75da943","schema_version":"1.0","event_id":"sha256:10de33dd26751a627d6013f814d43a890d8327414fa916ca46e2bb20c75da943"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/bundle.json","state_url":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/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-23T06:33:51Z","links":{"resolver":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ","bundle":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/bundle.json","state":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7VBMEBSHSVPCFO6KZGHN3GQ5UQ","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":"4e7c975a99384a86f5acbcc7b45ed609e37676a05bcd3b9fcddccdfe2c20b3a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-01T07:24:24Z","title_canon_sha256":"356a93cc29c47cc592259731dbe20c6991fe66c2a8e9748daf555e7f5bdf3e1d"},"schema_version":"1.0","source":{"id":"1711.00231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00231","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00231v1","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00231","created_at":"2026-05-18T00:31:34Z"},{"alias_kind":"pith_short_12","alias_value":"7VBMEBSHSVPC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7VBMEBSHSVPCFO6K","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7VBMEBSH","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:10de33dd26751a627d6013f814d43a890d8327414fa916ca46e2bb20c75da943","target":"graph","created_at":"2026-05-18T00:31: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":"Acceleration of graph applications on GPUs has found large interest due to the ubiquitous use of graph processing in various domains. The inherent \\textit{irregularity} in graph applications leads to several challenges for parallelization. A key challenge, which we address in this paper, is that of load-imbalance. If the work-assignment to threads uses node-based graph partitioning, it can result in skewed task-distribution, leading to poor load-balance. In contrast, if the work-assignment uses edge-based graph partitioning, the load-balancing is better, but the memory requirement is relativel","authors_text":"Ananya Raval, Keshav Pingali, Rupesh Nasre, Sathish Vadhiyar, Vasudevan R, Vivek Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-01T07:24:24Z","title":"Dynamic Load Balancing Strategies for Graph Applications on GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00231","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:6745b9e62a67bc714aaa25a8143028207904a99ca083f7f4ce1b37989844038b","target":"record","created_at":"2026-05-18T00:31: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":"4e7c975a99384a86f5acbcc7b45ed609e37676a05bcd3b9fcddccdfe2c20b3a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-01T07:24:24Z","title_canon_sha256":"356a93cc29c47cc592259731dbe20c6991fe66c2a8e9748daf555e7f5bdf3e1d"},"schema_version":"1.0","source":{"id":"1711.00231","kind":"arxiv","version":1}},"canonical_sha256":"fd42c20647955e22bbcac98edd9a1da40e971bda98772a94fc2c86e24b901156","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd42c20647955e22bbcac98edd9a1da40e971bda98772a94fc2c86e24b901156","first_computed_at":"2026-05-18T00:31:34.720199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:34.720199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kbpgi8shlDTrZK6vHu7/JhqxVsGhrLRQesMa+TGFi0iVwulzk9acdL3InEaneNlIHJ9ekRoGDlOWb8n87dQdCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:34.720776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6745b9e62a67bc714aaa25a8143028207904a99ca083f7f4ce1b37989844038b","sha256:10de33dd26751a627d6013f814d43a890d8327414fa916ca46e2bb20c75da943"],"state_sha256":"37856ad8be5689caaef84afad78ac659241e5300418da7422b153a7a82f5d331"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KapbBdCrD1/ATEbCTt1SlyzfTb2qaexYlCcteNoW5siaNAu6SQrrnGEj9icasLBoPINYLSMxElt0vrIqQUJrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T06:33:51.664901Z","bundle_sha256":"091b17808ee0639cce75d3ba93724216920852e6fee831bf2d7ce3e513d530ea"}}