{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:BMOMD7QSY2XEPS3W4DSPXZV5EA","short_pith_number":"pith:BMOMD7QS","schema_version":"1.0","canonical_sha256":"0b1cc1fe12c6ae47cb76e0e4fbe6bd202eb4159a1b1e6e9e8c132e0f678f82e8","source":{"kind":"arxiv","id":"1012.5030","version":1},"attestation_state":"computed","paper":{"title":"Work-stealing for mixed-mode parallelism by deterministic team-building","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jesper Larsson Tr\\\"aff, Martin Wimmer","submitted_at":"2010-12-22T16:43:12Z","abstract_excerpt":"We show how to extend classical work-stealing to deal also with data parallel tasks that can require any number of threads r >= 1 for their execution. We explain in detail the so introduced idea of work-stealing with deterministic team-building which in a natural way generalizes classical work-stealing. A prototype C++ implementation of the generalized work-stealing algorithm has been given and is briefly described. Building on this, a serious, well-known contender for a best parallel Quicksort algorithm has been implemented, which naturally relies on both task and data parallelism. For instan"},"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":"1012.5030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-12-22T16:43:12Z","cross_cats_sorted":[],"title_canon_sha256":"2d43ee64f0d612cf2ac9e6b9fb25415502c62ce5d75976788db0ca57f92bec49","abstract_canon_sha256":"baeda85daae6ff6a906edafea6907c7e8ead3f712d36edbffaf4687db2245543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:44.640371Z","signature_b64":"IdvPok+C5PCIhlg5HEXBuItxJgS6K0BDkDvgqhpp8pF7D3LcT0n4/uyyhGFowTgHpD5j08OeCPzNehhIr5+cBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b1cc1fe12c6ae47cb76e0e4fbe6bd202eb4159a1b1e6e9e8c132e0f678f82e8","last_reissued_at":"2026-05-18T04:32:44.639772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:44.639772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Work-stealing for mixed-mode parallelism by deterministic team-building","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jesper Larsson Tr\\\"aff, Martin Wimmer","submitted_at":"2010-12-22T16:43:12Z","abstract_excerpt":"We show how to extend classical work-stealing to deal also with data parallel tasks that can require any number of threads r >= 1 for their execution. We explain in detail the so introduced idea of work-stealing with deterministic team-building which in a natural way generalizes classical work-stealing. A prototype C++ implementation of the generalized work-stealing algorithm has been given and is briefly described. Building on this, a serious, well-known contender for a best parallel Quicksort algorithm has been implemented, which naturally relies on both task and data parallelism. For instan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5030","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":"1012.5030","created_at":"2026-05-18T04:32:44.639870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5030v1","created_at":"2026-05-18T04:32:44.639870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5030","created_at":"2026-05-18T04:32:44.639870+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMOMD7QSY2XE","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMOMD7QSY2XEPS3W","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMOMD7QS","created_at":"2026-05-18T12:26:05.355336+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/BMOMD7QSY2XEPS3W4DSPXZV5EA","json":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA.json","graph_json":"https://pith.science/api/pith-number/BMOMD7QSY2XEPS3W4DSPXZV5EA/graph.json","events_json":"https://pith.science/api/pith-number/BMOMD7QSY2XEPS3W4DSPXZV5EA/events.json","paper":"https://pith.science/paper/BMOMD7QS"},"agent_actions":{"view_html":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA","download_json":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA.json","view_paper":"https://pith.science/paper/BMOMD7QS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5030&json=true","fetch_graph":"https://pith.science/api/pith-number/BMOMD7QSY2XEPS3W4DSPXZV5EA/graph.json","fetch_events":"https://pith.science/api/pith-number/BMOMD7QSY2XEPS3W4DSPXZV5EA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA/action/storage_attestation","attest_author":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA/action/author_attestation","sign_citation":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA/action/citation_signature","submit_replication":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA/action/replication_record"}},"created_at":"2026-05-18T04:32:44.639870+00:00","updated_at":"2026-05-18T04:32:44.639870+00:00"}