{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CI2QOCEYBEVPWM2ZFCHMVDCYXO","short_pith_number":"pith:CI2QOCEY","schema_version":"1.0","canonical_sha256":"1235070898092afb3359288eca8c58bb8c3506993d3718fa34c5133c085f6dc4","source":{"kind":"arxiv","id":"1601.05458","version":1},"attestation_state":"computed","paper":{"title":"Efficient Compilation to Event-Driven Task Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Benoit Meister, Benoit Pradelle, Muthu Baskaran, Richard Lethin, Thomas Henretty","submitted_at":"2016-01-06T22:26:03Z","abstract_excerpt":"As illustrated by the emergence of a class of new languages and runtimes, it is expected that a large portion of the programs to run on extreme scale computers will need to be written as graphs of event-driven tasks (EDTs). EDT runtime systems, which schedule such collections of tasks, enable more concurrency than traditional runtimes by reducing the amount of inter-task synchronization, improving dynamic load balancing and making more operations asynchronous.\n  We present an efficient technique to generate such task graphs from a polyhedral representation of a program, both in terms of compil"},"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":"1601.05458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-06T22:26:03Z","cross_cats_sorted":[],"title_canon_sha256":"273f22a155a0514366db994048b04a92498c728dee83b42c7e73e4123b7b6479","abstract_canon_sha256":"66e6ce444784c1646f15a834a277ebb938e0fe56b9d5b577479d59d7e1602cf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:13.759847Z","signature_b64":"xWW0cxnCZHq+g9LOYhJm4OU8Vjed6alkBACbXigpOFQyJb7w1eLegFwKjXWc347dAzsHWsbh7y/MoU/KT8PaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1235070898092afb3359288eca8c58bb8c3506993d3718fa34c5133c085f6dc4","last_reissued_at":"2026-05-18T01:22:13.759223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:13.759223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Compilation to Event-Driven Task Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Benoit Meister, Benoit Pradelle, Muthu Baskaran, Richard Lethin, Thomas Henretty","submitted_at":"2016-01-06T22:26:03Z","abstract_excerpt":"As illustrated by the emergence of a class of new languages and runtimes, it is expected that a large portion of the programs to run on extreme scale computers will need to be written as graphs of event-driven tasks (EDTs). EDT runtime systems, which schedule such collections of tasks, enable more concurrency than traditional runtimes by reducing the amount of inter-task synchronization, improving dynamic load balancing and making more operations asynchronous.\n  We present an efficient technique to generate such task graphs from a polyhedral representation of a program, both in terms of compil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05458","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.05458","created_at":"2026-05-18T01:22:13.759338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05458v1","created_at":"2026-05-18T01:22:13.759338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05458","created_at":"2026-05-18T01:22:13.759338+00:00"},{"alias_kind":"pith_short_12","alias_value":"CI2QOCEYBEVP","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CI2QOCEYBEVPWM2Z","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CI2QOCEY","created_at":"2026-05-18T12:30:09.641336+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/CI2QOCEYBEVPWM2ZFCHMVDCYXO","json":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO.json","graph_json":"https://pith.science/api/pith-number/CI2QOCEYBEVPWM2ZFCHMVDCYXO/graph.json","events_json":"https://pith.science/api/pith-number/CI2QOCEYBEVPWM2ZFCHMVDCYXO/events.json","paper":"https://pith.science/paper/CI2QOCEY"},"agent_actions":{"view_html":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO","download_json":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO.json","view_paper":"https://pith.science/paper/CI2QOCEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05458&json=true","fetch_graph":"https://pith.science/api/pith-number/CI2QOCEYBEVPWM2ZFCHMVDCYXO/graph.json","fetch_events":"https://pith.science/api/pith-number/CI2QOCEYBEVPWM2ZFCHMVDCYXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO/action/storage_attestation","attest_author":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO/action/author_attestation","sign_citation":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO/action/citation_signature","submit_replication":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO/action/replication_record"}},"created_at":"2026-05-18T01:22:13.759338+00:00","updated_at":"2026-05-18T01:22:13.759338+00:00"}