{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DPC6SAYAWXZYOC6CY3BHMINAXM","short_pith_number":"pith:DPC6SAYA","schema_version":"1.0","canonical_sha256":"1bc5e90300b5f3870bc2c6c27621a0bb2f0872ecd63fd60db0a51a56a8ffa5d5","source":{"kind":"arxiv","id":"1504.01650","version":1},"attestation_state":"computed","paper":{"title":"Benchmarking the cost of thread divergence in CUDA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Adam Strzelecki, Piotr Bialas","submitted_at":"2015-04-07T15:53:48Z","abstract_excerpt":"All modern processors include a set of vector instructions. While this gives a tremendous boost to the performance, it requires a vectorized code that can take advantage of such instructions. As an ideal vectorization is hard to achieve in practice, one has to decide when different instructions may be applied to different elements of the vector operand. This is especially important in implicit vectorization as in NVIDIA CUDA Single Instruction Multiple Threads (SIMT) model, where the vectorization details are hidden from the programmer. In order to assess the costs incurred by incompletely vec"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1504.01650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-04-07T15:53:48Z","cross_cats_sorted":[],"title_canon_sha256":"0e7291dbd392cae1fbb7423efb40566b86e72a67a7abb9cf5acdc78e7c8a0160","abstract_canon_sha256":"59412d93642b2ef45cf459fe1ef78ee217ad40aedc48078f24534911eaf70598"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:26.573499Z","signature_b64":"SXKpp1i3wTC94S17PVPbmhTIgOmiXeDx8rGHSR4WK0sYVJQS3b4vbyk3RiH7+JA5gYzakRHkrzOfOwoSzfGUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bc5e90300b5f3870bc2c6c27621a0bb2f0872ecd63fd60db0a51a56a8ffa5d5","last_reissued_at":"2026-05-18T02:19:26.572838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:26.572838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarking the cost of thread divergence in CUDA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Adam Strzelecki, Piotr Bialas","submitted_at":"2015-04-07T15:53:48Z","abstract_excerpt":"All modern processors include a set of vector instructions. While this gives a tremendous boost to the performance, it requires a vectorized code that can take advantage of such instructions. As an ideal vectorization is hard to achieve in practice, one has to decide when different instructions may be applied to different elements of the vector operand. This is especially important in implicit vectorization as in NVIDIA CUDA Single Instruction Multiple Threads (SIMT) model, where the vectorization details are hidden from the programmer. In order to assess the costs incurred by incompletely vec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01650","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.01650","created_at":"2026-05-18T02:19:26.572930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01650v1","created_at":"2026-05-18T02:19:26.572930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01650","created_at":"2026-05-18T02:19:26.572930+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPC6SAYAWXZY","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPC6SAYAWXZYOC6C","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPC6SAYA","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DPC6SAYAWXZYOC6CY3BHMINAXM","json":"https://pith.science/pith/DPC6SAYAWXZYOC6CY3BHMINAXM.json","graph_json":"https://pith.science/api/pith-number/DPC6SAYAWXZYOC6CY3BHMINAXM/graph.json","events_json":"https://pith.science/api/pith-number/DPC6SAYAWXZYOC6CY3BHMINAXM/events.json","paper":"https://pith.science/paper/DPC6SAYA"},"agent_actions":{"view_html":"https://pith.science/pith/DPC6SAYAWXZYOC6CY3BHMINAXM","download_json":"https://pith.science/pith/DPC6SAYAWXZYOC6CY3BHMINAXM.json","view_paper":"https://pith.science/paper/DPC6SAYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01650&json=true","fetch_graph":"https://pith.science/api/pith-number/DPC6SAYAWXZYOC6CY3BHMINAXM/graph.json","fetch_events":"https://pith.science/api/pith-number/DPC6SAYAWXZYOC6CY3BHMINAXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPC6SAYAWXZYOC6CY3BHMINAXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPC6SAYAWXZYOC6CY3BHMINAXM/action/storage_attestation","attest_author":"https://pith.science/pith/DPC6SAYAWXZYOC6CY3BHMINAXM/action/author_attestation","sign_citation":"https://pith.science/pith/DPC6SAYAWXZYOC6CY3BHMINAXM/action/citation_signature","submit_replication":"https://pith.science/pith/DPC6SAYAWXZYOC6CY3BHMINAXM/action/replication_record"}},"created_at":"2026-05-18T02:19:26.572930+00:00","updated_at":"2026-05-18T02:19:26.572930+00:00"}