{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:US3APPO3DFEFEOHO64WWB4QNUS","short_pith_number":"pith:US3APPO3","schema_version":"1.0","canonical_sha256":"a4b607bddb19485238eef72d60f20da4a43a83506605ecc73781667bff069249","source":{"kind":"arxiv","id":"2601.14608","version":2},"attestation_state":"computed","paper":{"title":"Exploring Performance-Productivity Trade-offs in AMT Runtimes: A Task Bench Study of Itoyori, ItoyoriFBC, HPX, and MPI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jonas Posner, Mia Reitz, Patrick Diehl, Torben R. Lahnor","submitted_at":"2026-01-21T02:57:36Z","abstract_excerpt":"Asynchronous Many-Task (AMT) runtimes offer a productive alternative to the Message Passing Interface (MPI). However, the diverse AMT landscape makes fair comparisons challenging. Task Bench, proposed by Slaughter et al., addresses this challenge through a parameterized framework for evaluating parallel programming systems. This work integrates two recent cluster AMTs, Itoyori and ItoyoriFBC, into Task Bench for comprehensive evaluation against MPI and HPX. Itoyori employs a Partitioned Global Address Space (PGAS) model with RDMA-based work stealing, while ItoyoriFBC extends it with futurebase"},"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":"2601.14608","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-01-21T02:57:36Z","cross_cats_sorted":[],"title_canon_sha256":"b4200841756fd2c7339bafd25f79ed16bc3d4a28b2622a33cdb1194015d1f250","abstract_canon_sha256":"01796fbf2278c1452369e29b6bf3f2e25758cae542b531d3764129861e5c5a4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-20T02:19:17.437747Z","signature_b64":"UNhtk64cnknDFjoxuU6bOuet2kjrlqawKSKRuyzegN/ljimhWRk2pkSak8k3DIuzHyADnyPx6cscKQjko5cjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4b607bddb19485238eef72d60f20da4a43a83506605ecc73781667bff069249","last_reissued_at":"2026-07-20T02:19:17.436768Z","signature_status":"signed_v1","first_computed_at":"2026-07-20T02:19:17.436768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Performance-Productivity Trade-offs in AMT Runtimes: A Task Bench Study of Itoyori, ItoyoriFBC, HPX, and MPI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jonas Posner, Mia Reitz, Patrick Diehl, Torben R. Lahnor","submitted_at":"2026-01-21T02:57:36Z","abstract_excerpt":"Asynchronous Many-Task (AMT) runtimes offer a productive alternative to the Message Passing Interface (MPI). However, the diverse AMT landscape makes fair comparisons challenging. Task Bench, proposed by Slaughter et al., addresses this challenge through a parameterized framework for evaluating parallel programming systems. This work integrates two recent cluster AMTs, Itoyori and ItoyoriFBC, into Task Bench for comprehensive evaluation against MPI and HPX. Itoyori employs a Partitioned Global Address Space (PGAS) model with RDMA-based work stealing, while ItoyoriFBC extends it with futurebase"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.14608","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.14608/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":"2601.14608","created_at":"2026-07-20T02:19:17.437216+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.14608v2","created_at":"2026-07-20T02:19:17.437216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.14608","created_at":"2026-07-20T02:19:17.437216+00:00"},{"alias_kind":"pith_short_12","alias_value":"US3APPO3DFEF","created_at":"2026-07-20T02:19:17.437216+00:00"},{"alias_kind":"pith_short_16","alias_value":"US3APPO3DFEFEOHO","created_at":"2026-07-20T02:19:17.437216+00:00"},{"alias_kind":"pith_short_8","alias_value":"US3APPO3","created_at":"2026-07-20T02:19:17.437216+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.11937","citing_title":"From Fork-Join to Asynchronous Tasks: Parallelizing Tiled Cholesky Decomposition with OpenMP and HPX","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/US3APPO3DFEFEOHO64WWB4QNUS","json":"https://pith.science/pith/US3APPO3DFEFEOHO64WWB4QNUS.json","graph_json":"https://pith.science/api/pith-number/US3APPO3DFEFEOHO64WWB4QNUS/graph.json","events_json":"https://pith.science/api/pith-number/US3APPO3DFEFEOHO64WWB4QNUS/events.json","paper":"https://pith.science/paper/US3APPO3"},"agent_actions":{"view_html":"https://pith.science/pith/US3APPO3DFEFEOHO64WWB4QNUS","download_json":"https://pith.science/pith/US3APPO3DFEFEOHO64WWB4QNUS.json","view_paper":"https://pith.science/paper/US3APPO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.14608&json=true","fetch_graph":"https://pith.science/api/pith-number/US3APPO3DFEFEOHO64WWB4QNUS/graph.json","fetch_events":"https://pith.science/api/pith-number/US3APPO3DFEFEOHO64WWB4QNUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/US3APPO3DFEFEOHO64WWB4QNUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/US3APPO3DFEFEOHO64WWB4QNUS/action/storage_attestation","attest_author":"https://pith.science/pith/US3APPO3DFEFEOHO64WWB4QNUS/action/author_attestation","sign_citation":"https://pith.science/pith/US3APPO3DFEFEOHO64WWB4QNUS/action/citation_signature","submit_replication":"https://pith.science/pith/US3APPO3DFEFEOHO64WWB4QNUS/action/replication_record"}},"created_at":"2026-07-20T02:19:17.437216+00:00","updated_at":"2026-07-20T02:19:17.437216+00:00"}