{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PDD543HBDPRJGDKYUSMGHM2XBB","short_pith_number":"pith:PDD543HB","schema_version":"1.0","canonical_sha256":"78c7de6ce11be2930d58a49863b357084a16b06cde816642483c123a53bb2618","source":{"kind":"arxiv","id":"2208.06332","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2208.06332","created_at":"2026-07-05T04:48:03.566630+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.06332v1","created_at":"2026-07-05T04:48:03.566630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06332","created_at":"2026-07-05T04:48:03.566630+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDD543HBDPRJ","created_at":"2026-07-05T04:48:03.566630+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDD543HBDPRJGDKY","created_at":"2026-07-05T04:48:03.566630+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDD543HB","created_at":"2026-07-05T04:48:03.566630+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB","json":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB.json","graph_json":"https://pith.science/api/pith-number/PDD543HBDPRJGDKYUSMGHM2XBB/graph.json","events_json":"https://pith.science/api/pith-number/PDD543HBDPRJGDKYUSMGHM2XBB/events.json","paper":"https://pith.science/paper/PDD543HB"},"agent_actions":{"view_html":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB","download_json":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB.json","view_paper":"https://pith.science/paper/PDD543HB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.06332&json=true","fetch_graph":"https://pith.science/api/pith-number/PDD543HBDPRJGDKYUSMGHM2XBB/graph.json","fetch_events":"https://pith.science/api/pith-number/PDD543HBDPRJGDKYUSMGHM2XBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB/action/storage_attestation","attest_author":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB/action/author_attestation","sign_citation":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB/action/citation_signature","submit_replication":"https://pith.science/pith/PDD543HBDPRJGDKYUSMGHM2XBB/action/replication_record"}},"created_at":"2026-07-05T04:48:03.566630+00:00","updated_at":"2026-07-05T04:48:03.566630+00:00"}