{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:BMOMD7QSY2XEPS3W4DSPXZV5EA","short_pith_number":"pith:BMOMD7QS","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"},"canonical_sha256":"0b1cc1fe12c6ae47cb76e0e4fbe6bd202eb4159a1b1e6e9e8c132e0f678f82e8","source":{"kind":"arxiv","id":"1012.5030","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5030","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5030v1","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5030","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"BMOMD7QSY2XE","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BMOMD7QSY2XEPS3W","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BMOMD7QS","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:BMOMD7QSY2XEPS3W4DSPXZV5EA","target":"record","payload":{"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"},"canonical_sha256":"0b1cc1fe12c6ae47cb76e0e4fbe6bd202eb4159a1b1e6e9e8c132e0f678f82e8","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"},"source_kind":"arxiv","source_id":"1012.5030","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-18T04:32:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ZdS2JUHcdnN8H7dd3VpB4Yy4JXwn+8QUL+oDh2Y1lrmT0bSOJgGy22pG6mTX06Zelm8hDu3T56YDxpPiGHMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:11:33.432189Z"},"content_sha256":"681a4f2eab5c9a35e4723b7d66ffa0dcebb8d718afb3755e936e8be293c1b61d","schema_version":"1.0","event_id":"sha256:681a4f2eab5c9a35e4723b7d66ffa0dcebb8d718afb3755e936e8be293c1b61d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:BMOMD7QSY2XEPS3W4DSPXZV5EA","target":"graph","payload":{"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"},"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-18T04:32:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vIXE1yV+U3UlWLInkJLDOMT6hvc/uk0AzLAoPYAh//IPodudzLXS4Q3kRJU61UlphJjd2iL8Z2EprZP+pruIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:11:33.432930Z"},"content_sha256":"0d3d46de2916b124f781f5fe8847ab3637eb02ff74efa5f8b52b71f5f73d11a8","schema_version":"1.0","event_id":"sha256:0d3d46de2916b124f781f5fe8847ab3637eb02ff74efa5f8b52b71f5f73d11a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA/bundle.json","state_url":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA/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-06-09T18:11:33Z","links":{"resolver":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA","bundle":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA/bundle.json","state":"https://pith.science/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMOMD7QSY2XEPS3W4DSPXZV5EA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:BMOMD7QSY2XEPS3W4DSPXZV5EA","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":"baeda85daae6ff6a906edafea6907c7e8ead3f712d36edbffaf4687db2245543","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-12-22T16:43:12Z","title_canon_sha256":"2d43ee64f0d612cf2ac9e6b9fb25415502c62ce5d75976788db0ca57f92bec49"},"schema_version":"1.0","source":{"id":"1012.5030","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5030","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5030v1","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5030","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"BMOMD7QSY2XE","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BMOMD7QSY2XEPS3W","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BMOMD7QS","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:0d3d46de2916b124f781f5fe8847ab3637eb02ff74efa5f8b52b71f5f73d11a8","target":"graph","created_at":"2026-05-18T04:32:44Z","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":"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","authors_text":"Jesper Larsson Tr\\\"aff, Martin Wimmer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-12-22T16:43:12Z","title":"Work-stealing for mixed-mode parallelism by deterministic team-building"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5030","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:681a4f2eab5c9a35e4723b7d66ffa0dcebb8d718afb3755e936e8be293c1b61d","target":"record","created_at":"2026-05-18T04:32:44Z","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":"baeda85daae6ff6a906edafea6907c7e8ead3f712d36edbffaf4687db2245543","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-12-22T16:43:12Z","title_canon_sha256":"2d43ee64f0d612cf2ac9e6b9fb25415502c62ce5d75976788db0ca57f92bec49"},"schema_version":"1.0","source":{"id":"1012.5030","kind":"arxiv","version":1}},"canonical_sha256":"0b1cc1fe12c6ae47cb76e0e4fbe6bd202eb4159a1b1e6e9e8c132e0f678f82e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b1cc1fe12c6ae47cb76e0e4fbe6bd202eb4159a1b1e6e9e8c132e0f678f82e8","first_computed_at":"2026-05-18T04:32:44.639772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:44.639772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IdvPok+C5PCIhlg5HEXBuItxJgS6K0BDkDvgqhpp8pF7D3LcT0n4/uyyhGFowTgHpD5j08OeCPzNehhIr5+cBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:44.640371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.5030","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:681a4f2eab5c9a35e4723b7d66ffa0dcebb8d718afb3755e936e8be293c1b61d","sha256:0d3d46de2916b124f781f5fe8847ab3637eb02ff74efa5f8b52b71f5f73d11a8"],"state_sha256":"187d812e3f5571c15267728b81c57a42fbed84efce2a6e8eb7ff6256416b2cc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QB70vtl1L6+QJR4ZovVYsO2NLAOsWv4EKkxFlmwtGv6RpnGrur9pvNpfHqAUfWuuovQbUhzg++Gz/36TcFAOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:11:33.437042Z","bundle_sha256":"55da204297e8a7ee8ffb8fcfbee1cdcde0b9c1be497e4f4684add4126223ad73"}}