{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:PDD543HBDPRJGDKYUSMGHM2XBB","short_pith_number":"pith:PDD543HB","canonical_record":{"source":{"id":"2208.06332","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2022-08-12T15:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"25b9e4a549784bc1a0a5a2c8c3c0591a11ffb80c5371ab22f95c30def75b9711","abstract_canon_sha256":"a2bfc6f55ff52305cca9fab591c88520798285c023d52a91f9b70fd259e59dde"},"schema_version":"1.0"},"canonical_sha256":"78c7de6ce11be2930d58a49863b357084a16b06cde816642483c123a53bb2618","source":{"kind":"arxiv","id":"2208.06332","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.06332","created_at":"2026-07-05T04:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"2208.06332v1","created_at":"2026-07-05T04:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06332","created_at":"2026-07-05T04:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"PDD543HBDPRJ","created_at":"2026-07-05T04:48:03Z"},{"alias_kind":"pith_short_16","alias_value":"PDD543HBDPRJGDKY","created_at":"2026-07-05T04:48:03Z"},{"alias_kind":"pith_short_8","alias_value":"PDD543HB","created_at":"2026-07-05T04:48:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:PDD543HBDPRJGDKYUSMGHM2XBB","target":"record","payload":{"canonical_record":{"source":{"id":"2208.06332","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2022-08-12T15:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"25b9e4a549784bc1a0a5a2c8c3c0591a11ffb80c5371ab22f95c30def75b9711","abstract_canon_sha256":"a2bfc6f55ff52305cca9fab591c88520798285c023d52a91f9b70fd259e59dde"},"schema_version":"1.0"},"canonical_sha256":"78c7de6ce11be2930d58a49863b357084a16b06cde816642483c123a53bb2618","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:03.566941Z","signature_b64":"07P3D5qtCfMDv1LrFT9JCI5O85Ky9EUhNE833iqALzlvn+a0a9tcczIlJKerow9NCIZcVLBq+AMYLPioTlxjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78c7de6ce11be2930d58a49863b357084a16b06cde816642483c123a53bb2618","last_reissued_at":"2026-07-05T04:48:03.566557Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:03.566557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.06332","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-05T04:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ABcxUoUTFa750DSnACG1kL5JoGnZ0kseiRPKCcP7MCPNSwwQSuhUZIuLv6oi+lF9MXR/jUOC+KgDgbAeL8iCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:10:04.174874Z"},"content_sha256":"08c892280faed37d87d80357f66c6f1202e0c58803fa012c5bd0006521354bbf","schema_version":"1.0","event_id":"sha256:08c892280faed37d87d80357f66c6f1202e0c58803fa012c5bd0006521354bbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:PDD543HBDPRJGDKYUSMGHM2XBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Task-based Iterative Applications","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"David \\'Alvarez, Vicen\\c{c} Beltran","submitted_at":"2022-08-12T15:41:34Z","abstract_excerpt":"Task-based programming models have risen in popularity as an alternative to traditional fork-join parallelism. They are better suited to write applications with irregular parallelism that can present load imbalance. However, these programming models suffer from overheads related to task creation, scheduling and dependency management, limiting performance and scalability when tasks become too small. At the same time, many HPC applications implement iterative methods or multi-step simulations that create the same directed acyclic graphs of tasks on each iteration.\n  By giving application program"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.06332","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/2208.06332/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-05T04:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5lq2uCqAxObLWSI2l+4nDjDEcfxdZOWgHVrsqTg9P1Ue7z//2S4KVHECu84BGiNnHSi+4nzbvnePKSL5ArClDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:10:04.175250Z"},"content_sha256":"e119ad88147abfeb6fa717108df6059fcf324783d6cc76ae35ad160f28658a7f","schema_version":"1.0","event_id":"sha256:e119ad88147abfeb6fa717108df6059fcf324783d6cc76ae35ad160f28658a7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB/bundle.json","state_url":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDD543HBDPRJGDKYUSMGHM2XBB/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-07-06T23:10:04Z","links":{"resolver":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB","bundle":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB/bundle.json","state":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDD543HBDPRJGDKYUSMGHM2XBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:PDD543HBDPRJGDKYUSMGHM2XBB","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":"a2bfc6f55ff52305cca9fab591c88520798285c023d52a91f9b70fd259e59dde","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2022-08-12T15:41:34Z","title_canon_sha256":"25b9e4a549784bc1a0a5a2c8c3c0591a11ffb80c5371ab22f95c30def75b9711"},"schema_version":"1.0","source":{"id":"2208.06332","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.06332","created_at":"2026-07-05T04:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"2208.06332v1","created_at":"2026-07-05T04:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06332","created_at":"2026-07-05T04:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"PDD543HBDPRJ","created_at":"2026-07-05T04:48:03Z"},{"alias_kind":"pith_short_16","alias_value":"PDD543HBDPRJGDKY","created_at":"2026-07-05T04:48:03Z"},{"alias_kind":"pith_short_8","alias_value":"PDD543HB","created_at":"2026-07-05T04:48:03Z"}],"graph_snapshots":[{"event_id":"sha256:e119ad88147abfeb6fa717108df6059fcf324783d6cc76ae35ad160f28658a7f","target":"graph","created_at":"2026-07-05T04:48:03Z","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/2208.06332/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Task-based programming models have risen in popularity as an alternative to traditional fork-join parallelism. They are better suited to write applications with irregular parallelism that can present load imbalance. However, these programming models suffer from overheads related to task creation, scheduling and dependency management, limiting performance and scalability when tasks become too small. At the same time, many HPC applications implement iterative methods or multi-step simulations that create the same directed acyclic graphs of tasks on each iteration.\n  By giving application program","authors_text":"David \\'Alvarez, Vicen\\c{c} Beltran","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2022-08-12T15:41:34Z","title":"Accelerating Task-based Iterative Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.06332","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:08c892280faed37d87d80357f66c6f1202e0c58803fa012c5bd0006521354bbf","target":"record","created_at":"2026-07-05T04:48:03Z","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":"a2bfc6f55ff52305cca9fab591c88520798285c023d52a91f9b70fd259e59dde","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2022-08-12T15:41:34Z","title_canon_sha256":"25b9e4a549784bc1a0a5a2c8c3c0591a11ffb80c5371ab22f95c30def75b9711"},"schema_version":"1.0","source":{"id":"2208.06332","kind":"arxiv","version":1}},"canonical_sha256":"78c7de6ce11be2930d58a49863b357084a16b06cde816642483c123a53bb2618","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78c7de6ce11be2930d58a49863b357084a16b06cde816642483c123a53bb2618","first_computed_at":"2026-07-05T04:48:03.566557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:48:03.566557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"07P3D5qtCfMDv1LrFT9JCI5O85Ky9EUhNE833iqALzlvn+a0a9tcczIlJKerow9NCIZcVLBq+AMYLPioTlxjBw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:48:03.566941Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.06332","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08c892280faed37d87d80357f66c6f1202e0c58803fa012c5bd0006521354bbf","sha256:e119ad88147abfeb6fa717108df6059fcf324783d6cc76ae35ad160f28658a7f"],"state_sha256":"110bce1e56f1408bccdb18d473b1366bbe680bc63daaabbdaee8ff31509835a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxMGmkmaaOt+CoNeGdfAKcqPqkdFSlb0hnCm4ZugJSEHPiJ8Fong/ULgsUoWugzma38hRpY4A6O+jN+ZBScYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:10:04.177462Z","bundle_sha256":"342066dcd336eba9e2f2babcb7d6274749f9b4bc47983e42a835759f70e62b77"}}