{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:5NJOJBYJJTKJCYEZU3WERWJCDM","short_pith_number":"pith:5NJOJBYJ","canonical_record":{"source":{"id":"2011.03196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-06T05:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"dd4ec693b0d257abe6f971726e858b4c073455d605986f19edf77bb81c8154c2","abstract_canon_sha256":"df48fc9b62615110d0bcb7f482575fee0c37e7933b9b893de7907a68a194181a"},"schema_version":"1.0"},"canonical_sha256":"eb52e487094cd4916099a6ec48d9221b23b41bd8d590c4b618a76946c2f7873a","source":{"kind":"arxiv","id":"2011.03196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.03196","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"2011.03196v1","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03196","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"5NJOJBYJJTKJ","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_16","alias_value":"5NJOJBYJJTKJCYEZ","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_8","alias_value":"5NJOJBYJ","created_at":"2026-07-05T01:49:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:5NJOJBYJJTKJCYEZU3WERWJCDM","target":"record","payload":{"canonical_record":{"source":{"id":"2011.03196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-06T05:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"dd4ec693b0d257abe6f971726e858b4c073455d605986f19edf77bb81c8154c2","abstract_canon_sha256":"df48fc9b62615110d0bcb7f482575fee0c37e7933b9b893de7907a68a194181a"},"schema_version":"1.0"},"canonical_sha256":"eb52e487094cd4916099a6ec48d9221b23b41bd8d590c4b618a76946c2f7873a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:40.821136Z","signature_b64":"JhSLoEGl9nYbmEvbhN5pcev6O7wcfxLhBxz5OA+ZwZNqyVTIx/vXi+gM8VBJiTqE9MSgGTM9HLRXWTzbZ68WAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb52e487094cd4916099a6ec48d9221b23b41bd8d590c4b618a76946c2f7873a","last_reissued_at":"2026-07-05T01:49:40.820717Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:40.820717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.03196","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-07-05T01:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADjmG4Gpd+6Xp9ii9IoNAhdaGsXDEKg4xllR+RA9hJuEmgctWlk1llw/al4PMarqQTQ08B/F7KqNZn/bUujEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:27:52.225516Z"},"content_sha256":"a10afef08b8b1a9edc31f985a2b4e524cde1bc8732450fc726b5347a5ed86239","schema_version":"1.0","event_id":"sha256:a10afef08b8b1a9edc31f985a2b4e524cde1bc8732450fc726b5347a5ed86239"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:5NJOJBYJJTKJCYEZU3WERWJCDM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Task-Graph Scheduling Extensions for Efficient Synchronization and Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Mark Gates, Oscar Hernandez, Piotr Luszczek, Seonmyeong Bak, Vivek Sarkar","submitted_at":"2020-11-06T05:40:28Z","abstract_excerpt":"Task graphs have been studied for decades as a foundation for scheduling irregular parallel applications and incorporated in programming models such as OpenMP. While many high-performance parallel libraries are based on task graphs, they also have additional scheduling requirements, such as synchronization from inner levels of data parallelism and internal blocking communications. In this paper, we extend task-graph scheduling to support efficient synchronization and communication within tasks. Our scheduler avoids deadlock and oversubscription of worker threads, and refines victim selection t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03196","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.03196/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CC7n3b2Pt14sBPitMD23iJslOLXE4ocZik/hOjySrb82fW3evNFf7mBkcjN6CZCDrbzOySYNHRLPiZGnQVIJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:27:52.226446Z"},"content_sha256":"151e96e5b89fefd1f1bf2d18575dcd7c0ad5e07e0a168976450d714998e3fbb1","schema_version":"1.0","event_id":"sha256:151e96e5b89fefd1f1bf2d18575dcd7c0ad5e07e0a168976450d714998e3fbb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NJOJBYJJTKJCYEZU3WERWJCDM/bundle.json","state_url":"https://pith.science/pith/5NJOJBYJJTKJCYEZU3WERWJCDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NJOJBYJJTKJCYEZU3WERWJCDM/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-08-03T18:27:52Z","links":{"resolver":"https://pith.science/pith/5NJOJBYJJTKJCYEZU3WERWJCDM","bundle":"https://pith.science/pith/5NJOJBYJJTKJCYEZU3WERWJCDM/bundle.json","state":"https://pith.science/pith/5NJOJBYJJTKJCYEZU3WERWJCDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NJOJBYJJTKJCYEZU3WERWJCDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5NJOJBYJJTKJCYEZU3WERWJCDM","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":"df48fc9b62615110d0bcb7f482575fee0c37e7933b9b893de7907a68a194181a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-06T05:40:28Z","title_canon_sha256":"dd4ec693b0d257abe6f971726e858b4c073455d605986f19edf77bb81c8154c2"},"schema_version":"1.0","source":{"id":"2011.03196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.03196","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"2011.03196v1","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03196","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"5NJOJBYJJTKJ","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_16","alias_value":"5NJOJBYJJTKJCYEZ","created_at":"2026-07-05T01:49:40Z"},{"alias_kind":"pith_short_8","alias_value":"5NJOJBYJ","created_at":"2026-07-05T01:49:40Z"}],"graph_snapshots":[{"event_id":"sha256:151e96e5b89fefd1f1bf2d18575dcd7c0ad5e07e0a168976450d714998e3fbb1","target":"graph","created_at":"2026-07-05T01:49:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.03196/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Task graphs have been studied for decades as a foundation for scheduling irregular parallel applications and incorporated in programming models such as OpenMP. While many high-performance parallel libraries are based on task graphs, they also have additional scheduling requirements, such as synchronization from inner levels of data parallelism and internal blocking communications. In this paper, we extend task-graph scheduling to support efficient synchronization and communication within tasks. Our scheduler avoids deadlock and oversubscription of worker threads, and refines victim selection t","authors_text":"Mark Gates, Oscar Hernandez, Piotr Luszczek, Seonmyeong Bak, Vivek Sarkar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-06T05:40:28Z","title":"Task-Graph Scheduling Extensions for Efficient Synchronization and Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03196","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:a10afef08b8b1a9edc31f985a2b4e524cde1bc8732450fc726b5347a5ed86239","target":"record","created_at":"2026-07-05T01:49:40Z","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":"df48fc9b62615110d0bcb7f482575fee0c37e7933b9b893de7907a68a194181a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-06T05:40:28Z","title_canon_sha256":"dd4ec693b0d257abe6f971726e858b4c073455d605986f19edf77bb81c8154c2"},"schema_version":"1.0","source":{"id":"2011.03196","kind":"arxiv","version":1}},"canonical_sha256":"eb52e487094cd4916099a6ec48d9221b23b41bd8d590c4b618a76946c2f7873a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb52e487094cd4916099a6ec48d9221b23b41bd8d590c4b618a76946c2f7873a","first_computed_at":"2026-07-05T01:49:40.820717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:49:40.820717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JhSLoEGl9nYbmEvbhN5pcev6O7wcfxLhBxz5OA+ZwZNqyVTIx/vXi+gM8VBJiTqE9MSgGTM9HLRXWTzbZ68WAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:49:40.821136Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.03196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a10afef08b8b1a9edc31f985a2b4e524cde1bc8732450fc726b5347a5ed86239","sha256:151e96e5b89fefd1f1bf2d18575dcd7c0ad5e07e0a168976450d714998e3fbb1"],"state_sha256":"55a2a97848a4771e72e5a6ea64ebb8de9451f627ca191c53ce6a249b643cdb8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ir8SsiRs8GdNTdowscWONn31bp/nx8JQs9lBI0P1Wcssvsp53dcmbpbuWGOfDkpR/pYpNGPOn9q/Z09euQATCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:27:52.232390Z","bundle_sha256":"f25b4e58181e74dba636d33a0b600be5e2b35d01ad2055536846ad600ecf4967"}}