{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SI4XM6J4MVGIEEUCE5JOFBW2T2","short_pith_number":"pith:SI4XM6J4","canonical_record":{"source":{"id":"1601.05384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-20T19:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"3f61d4baf79fa2bcb9e55cdc52a7185be6f01b0bfac57f3218037a8cec6cc76a","abstract_canon_sha256":"bd3a42fa0ba8fd0d823b35b97b00c978e9c4e43cbfabf4a9ad38c551ab631ac5"},"schema_version":"1.0"},"canonical_sha256":"923976793c654c8212822752e286da9ea1436e0b9f283ab1d6412fa683bff3ac","source":{"kind":"arxiv","id":"1601.05384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05384","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05384v1","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05384","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"pith_short_12","alias_value":"SI4XM6J4MVGI","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SI4XM6J4MVGIEEUC","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SI4XM6J4","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SI4XM6J4MVGIEEUCE5JOFBW2T2","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-20T19:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"3f61d4baf79fa2bcb9e55cdc52a7185be6f01b0bfac57f3218037a8cec6cc76a","abstract_canon_sha256":"bd3a42fa0ba8fd0d823b35b97b00c978e9c4e43cbfabf4a9ad38c551ab631ac5"},"schema_version":"1.0"},"canonical_sha256":"923976793c654c8212822752e286da9ea1436e0b9f283ab1d6412fa683bff3ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:15.294571Z","signature_b64":"g81RG1dfEqAXnn/q6zLECgUdtpg8/7fAndjzVY5X+DUyMlm20IWXGAqvDXLrzF2KMSJbBfnDCtcily3FSgDvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"923976793c654c8212822752e286da9ea1436e0b9f283ab1d6412fa683bff3ac","last_reissued_at":"2026-05-18T01:22:15.293899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:15.293899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05384","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-18T01:22:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+k74iVp8+8UihPVChTjFfciFih7x8KfW5MewBtM4SjcLJPziNkGtJ2ETI3P4UaLMisMQdXvzSCpnTevJxXGJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:15:25.242611Z"},"content_sha256":"bc46b39d9d3e9a9f01ab5448918b4455e568967a2c896a351a4a1284073e28ee","schema_version":"1.0","event_id":"sha256:bc46b39d9d3e9a9f01ab5448918b4455e568967a2c896a351a4a1284073e28ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SI4XM6J4MVGIEEUCE5JOFBW2T2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QuickSched: Task-based parallelism with dependencies and conflicts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aidan B. G. Chalk, Matthieu Schaller, Pedro Gonnet","submitted_at":"2016-01-20T19:41:17Z","abstract_excerpt":"This paper describes QuickSched, a compact and efficient Open-Source C-language library for task-based shared-memory parallel programming. QuickSched extends the standard dependency-only scheme of task-based programming with the concept of task conflicts, i.e.~sets of tasks that can be executed in any order, yet not concurrently. These conflicts are modelled using exclusively lockable hierarchical resources. The scheduler itself prioritizes tasks along the critical path of execution and is shown to perform and scale well on a 64-core parallel shared-memory machine for two example problems: A t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05384","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-18T01:22:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiutQOzqEeUF+yeTnmOQwnj9G5UmtdlEX/2l2W0NrV47H4uwmCCN4Uw12ft8RYfTUpWRnXZIsVWdYalSTc3jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:15:25.242961Z"},"content_sha256":"7c826e2c6bcdfa16983cff65c0c68a993f405a9111c779a42acc1ec1400cf411","schema_version":"1.0","event_id":"sha256:7c826e2c6bcdfa16983cff65c0c68a993f405a9111c779a42acc1ec1400cf411"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SI4XM6J4MVGIEEUCE5JOFBW2T2/bundle.json","state_url":"https://pith.science/pith/SI4XM6J4MVGIEEUCE5JOFBW2T2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SI4XM6J4MVGIEEUCE5JOFBW2T2/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-02T04:15:25Z","links":{"resolver":"https://pith.science/pith/SI4XM6J4MVGIEEUCE5JOFBW2T2","bundle":"https://pith.science/pith/SI4XM6J4MVGIEEUCE5JOFBW2T2/bundle.json","state":"https://pith.science/pith/SI4XM6J4MVGIEEUCE5JOFBW2T2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SI4XM6J4MVGIEEUCE5JOFBW2T2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SI4XM6J4MVGIEEUCE5JOFBW2T2","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":"bd3a42fa0ba8fd0d823b35b97b00c978e9c4e43cbfabf4a9ad38c551ab631ac5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-20T19:41:17Z","title_canon_sha256":"3f61d4baf79fa2bcb9e55cdc52a7185be6f01b0bfac57f3218037a8cec6cc76a"},"schema_version":"1.0","source":{"id":"1601.05384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05384","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05384v1","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05384","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"pith_short_12","alias_value":"SI4XM6J4MVGI","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SI4XM6J4MVGIEEUC","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SI4XM6J4","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:7c826e2c6bcdfa16983cff65c0c68a993f405a9111c779a42acc1ec1400cf411","target":"graph","created_at":"2026-05-18T01:22:15Z","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":"This paper describes QuickSched, a compact and efficient Open-Source C-language library for task-based shared-memory parallel programming. QuickSched extends the standard dependency-only scheme of task-based programming with the concept of task conflicts, i.e.~sets of tasks that can be executed in any order, yet not concurrently. These conflicts are modelled using exclusively lockable hierarchical resources. The scheduler itself prioritizes tasks along the critical path of execution and is shown to perform and scale well on a 64-core parallel shared-memory machine for two example problems: A t","authors_text":"Aidan B. G. Chalk, Matthieu Schaller, Pedro Gonnet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-20T19:41:17Z","title":"QuickSched: Task-based parallelism with dependencies and conflicts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05384","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:bc46b39d9d3e9a9f01ab5448918b4455e568967a2c896a351a4a1284073e28ee","target":"record","created_at":"2026-05-18T01:22:15Z","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":"bd3a42fa0ba8fd0d823b35b97b00c978e9c4e43cbfabf4a9ad38c551ab631ac5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-20T19:41:17Z","title_canon_sha256":"3f61d4baf79fa2bcb9e55cdc52a7185be6f01b0bfac57f3218037a8cec6cc76a"},"schema_version":"1.0","source":{"id":"1601.05384","kind":"arxiv","version":1}},"canonical_sha256":"923976793c654c8212822752e286da9ea1436e0b9f283ab1d6412fa683bff3ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"923976793c654c8212822752e286da9ea1436e0b9f283ab1d6412fa683bff3ac","first_computed_at":"2026-05-18T01:22:15.293899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:15.293899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g81RG1dfEqAXnn/q6zLECgUdtpg8/7fAndjzVY5X+DUyMlm20IWXGAqvDXLrzF2KMSJbBfnDCtcily3FSgDvBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:15.294571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc46b39d9d3e9a9f01ab5448918b4455e568967a2c896a351a4a1284073e28ee","sha256:7c826e2c6bcdfa16983cff65c0c68a993f405a9111c779a42acc1ec1400cf411"],"state_sha256":"c1b58a5847f5c4ca9eb668e914191dbe06cb2ea5dc35736e238c422c0756d1f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYhX5+PfWWcgjUmKZezo/2qpACfBlNwiwab/NsNVvuKpli0n/RxcLNIVl16xG8KVB4yB1TMDx8PhSdKe6G6xBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:15:25.245257Z","bundle_sha256":"b5100082932f1da6ca1086200e30af975cbff474b7ddd629345f88a4b20f797a"}}