{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WOW22QSCE53ZHZGW725JU3MYYC","short_pith_number":"pith:WOW22QSC","canonical_record":{"source":{"id":"1810.10615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-24T20:54:48Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9bec7f34af41da4fce01d133de1a1e48be5250c1663b2add69a9ab72d57018f8","abstract_canon_sha256":"b69529ce21541f3432799edc2482bc029a644a6a7dc9bb201c46507579c0be57"},"schema_version":"1.0"},"canonical_sha256":"b3adad4242277793e4d6feba9a6d98c09592c2c489bb6d1cccb491740cf91cb3","source":{"kind":"arxiv","id":"1810.10615","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10615","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10615v2","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10615","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"WOW22QSCE53Z","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WOW22QSCE53ZHZGW","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WOW22QSC","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WOW22QSCE53ZHZGW725JU3MYYC","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-24T20:54:48Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9bec7f34af41da4fce01d133de1a1e48be5250c1663b2add69a9ab72d57018f8","abstract_canon_sha256":"b69529ce21541f3432799edc2482bc029a644a6a7dc9bb201c46507579c0be57"},"schema_version":"1.0"},"canonical_sha256":"b3adad4242277793e4d6feba9a6d98c09592c2c489bb6d1cccb491740cf91cb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:39.737040Z","signature_b64":"txb1Z+nKPCZxeSwplFfMFvwYN/P+I2aM8zrSkm1BvTnKvYsYi4I2zxkh6thIgl8UR4/wRThxZ61pqlMMIaZwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3adad4242277793e4d6feba9a6d98c09592c2c489bb6d1cccb491740cf91cb3","last_reissued_at":"2026-05-17T23:47:39.736439Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:39.736439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10615","source_version":2,"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:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+fPkBg6L49z5+Rndg3UVoS/uKGCCZz3zFI0Gixrm+rjGqdHILsAKO51Gwmy5/LUl2zaOpYHMJEYafgSfzh0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:01:35.015796Z"},"content_sha256":"943b75a35ffb8489adfe1b1b6c43f3dc0d8c51e707437a90118eb64529ad74ee","schema_version":"1.0","event_id":"sha256:943b75a35ffb8489adfe1b1b6c43f3dc0d8c51e707437a90118eb64529ad74ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WOW22QSCE53ZHZGW725JU3MYYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling computations with provably low synchronization overheads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Guilherme Rito, Herv\\'e Paulino","submitted_at":"2018-10-24T20:54:48Z","abstract_excerpt":"Work Stealing has been a very successful algorithm for scheduling parallel computations, and is known to achieve high performances even for computations exhibiting fine-grained parallelism. We present a variant of \\ws\\ that provably avoids most synchronization overheads by keeping processors' deques entirely private by default, and only exposing work when requested by thieves. This is the first paper that obtains bounds on the synchronization overheads that are (essentially) independent of the total amount of work, thus corresponding to a great improvement, in both algorithm design and theory,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10615","kind":"arxiv","version":2},"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:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3VcqBSgWkkgD1DYDHkoMZznF/XjJvon5EuzjSgBHtwUe0xGPaDmFl39SriEZSgqR12TSSvcp4KzOx/PSZs1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:01:35.016157Z"},"content_sha256":"25342225e6b80521800d0864546d6f014534b770b354e75fea5ff86990d69921","schema_version":"1.0","event_id":"sha256:25342225e6b80521800d0864546d6f014534b770b354e75fea5ff86990d69921"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOW22QSCE53ZHZGW725JU3MYYC/bundle.json","state_url":"https://pith.science/pith/WOW22QSCE53ZHZGW725JU3MYYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOW22QSCE53ZHZGW725JU3MYYC/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-23T12:01:35Z","links":{"resolver":"https://pith.science/pith/WOW22QSCE53ZHZGW725JU3MYYC","bundle":"https://pith.science/pith/WOW22QSCE53ZHZGW725JU3MYYC/bundle.json","state":"https://pith.science/pith/WOW22QSCE53ZHZGW725JU3MYYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOW22QSCE53ZHZGW725JU3MYYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WOW22QSCE53ZHZGW725JU3MYYC","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":"b69529ce21541f3432799edc2482bc029a644a6a7dc9bb201c46507579c0be57","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-24T20:54:48Z","title_canon_sha256":"9bec7f34af41da4fce01d133de1a1e48be5250c1663b2add69a9ab72d57018f8"},"schema_version":"1.0","source":{"id":"1810.10615","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10615","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10615v2","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10615","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"WOW22QSCE53Z","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WOW22QSCE53ZHZGW","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WOW22QSC","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:25342225e6b80521800d0864546d6f014534b770b354e75fea5ff86990d69921","target":"graph","created_at":"2026-05-17T23:47:39Z","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":"Work Stealing has been a very successful algorithm for scheduling parallel computations, and is known to achieve high performances even for computations exhibiting fine-grained parallelism. We present a variant of \\ws\\ that provably avoids most synchronization overheads by keeping processors' deques entirely private by default, and only exposing work when requested by thieves. This is the first paper that obtains bounds on the synchronization overheads that are (essentially) independent of the total amount of work, thus corresponding to a great improvement, in both algorithm design and theory,","authors_text":"Guilherme Rito, Herv\\'e Paulino","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-24T20:54:48Z","title":"Scheduling computations with provably low synchronization overheads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10615","kind":"arxiv","version":2},"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:943b75a35ffb8489adfe1b1b6c43f3dc0d8c51e707437a90118eb64529ad74ee","target":"record","created_at":"2026-05-17T23:47:39Z","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":"b69529ce21541f3432799edc2482bc029a644a6a7dc9bb201c46507579c0be57","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-24T20:54:48Z","title_canon_sha256":"9bec7f34af41da4fce01d133de1a1e48be5250c1663b2add69a9ab72d57018f8"},"schema_version":"1.0","source":{"id":"1810.10615","kind":"arxiv","version":2}},"canonical_sha256":"b3adad4242277793e4d6feba9a6d98c09592c2c489bb6d1cccb491740cf91cb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3adad4242277793e4d6feba9a6d98c09592c2c489bb6d1cccb491740cf91cb3","first_computed_at":"2026-05-17T23:47:39.736439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:39.736439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"txb1Z+nKPCZxeSwplFfMFvwYN/P+I2aM8zrSkm1BvTnKvYsYi4I2zxkh6thIgl8UR4/wRThxZ61pqlMMIaZwCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:39.737040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10615","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:943b75a35ffb8489adfe1b1b6c43f3dc0d8c51e707437a90118eb64529ad74ee","sha256:25342225e6b80521800d0864546d6f014534b770b354e75fea5ff86990d69921"],"state_sha256":"06826b63bde3455e7978f77f0cd9c0e347cc4066a905d0a006c30458ff5f81f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/CR8GkXFk4zkljnM7HJ1DsIHJfXd9NLwkLNqz8nIGM13/k/5obEM6Lx4ynytb1p+0eE74JopNOCIcJXEIWtBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:01:35.018407Z","bundle_sha256":"6036de603f384a708988f7c19168aa5744dd801e6746508e3f8ab1eeb8b0df61"}}