{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CI2QOCEYBEVPWM2ZFCHMVDCYXO","short_pith_number":"pith:CI2QOCEY","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"},"canonical_sha256":"1235070898092afb3359288eca8c58bb8c3506993d3718fa34c5133c085f6dc4","source":{"kind":"arxiv","id":"1601.05458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05458","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05458v1","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05458","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"pith_short_12","alias_value":"CI2QOCEYBEVP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CI2QOCEYBEVPWM2Z","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CI2QOCEY","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CI2QOCEYBEVPWM2ZFCHMVDCYXO","target":"record","payload":{"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"},"canonical_sha256":"1235070898092afb3359288eca8c58bb8c3506993d3718fa34c5133c085f6dc4","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"},"source_kind":"arxiv","source_id":"1601.05458","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:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JvcUd0M4Za9dNgr0xEubeknoJAXwT44OF2u7yI6IX3tXl0vvt9uKQ1lxuT/OnWGfxCaZJbdxMrsnzo6VbAadAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:33:54.539164Z"},"content_sha256":"6263bafee3370555b0268a79a8a9bcb7397f1eafc7220faface1aa2e2fce746e","schema_version":"1.0","event_id":"sha256:6263bafee3370555b0268a79a8a9bcb7397f1eafc7220faface1aa2e2fce746e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CI2QOCEYBEVPWM2ZFCHMVDCYXO","target":"graph","payload":{"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"},"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:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krMWbnSj1fvZg4rPZbFqgrAG50whheoBy74phaefiKiVaFLIg8OjfXBYZxGGp7d8PDocnf2q7m6TkrySZpH7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:33:54.539531Z"},"content_sha256":"2b8e14bd43a23dd1c4527fa865e24119faabf919c2d2de3813e4d948436e28ad","schema_version":"1.0","event_id":"sha256:2b8e14bd43a23dd1c4527fa865e24119faabf919c2d2de3813e4d948436e28ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO/bundle.json","state_url":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO/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-03T08:33:54Z","links":{"resolver":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO","bundle":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO/bundle.json","state":"https://pith.science/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CI2QOCEYBEVPWM2ZFCHMVDCYXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CI2QOCEYBEVPWM2ZFCHMVDCYXO","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":"66e6ce444784c1646f15a834a277ebb938e0fe56b9d5b577479d59d7e1602cf8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-06T22:26:03Z","title_canon_sha256":"273f22a155a0514366db994048b04a92498c728dee83b42c7e73e4123b7b6479"},"schema_version":"1.0","source":{"id":"1601.05458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05458","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05458v1","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05458","created_at":"2026-05-18T01:22:13Z"},{"alias_kind":"pith_short_12","alias_value":"CI2QOCEYBEVP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CI2QOCEYBEVPWM2Z","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CI2QOCEY","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:2b8e14bd43a23dd1c4527fa865e24119faabf919c2d2de3813e4d948436e28ad","target":"graph","created_at":"2026-05-18T01:22:13Z","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":"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","authors_text":"Benoit Meister, Benoit Pradelle, Muthu Baskaran, Richard Lethin, Thomas Henretty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-06T22:26:03Z","title":"Efficient Compilation to Event-Driven Task Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05458","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:6263bafee3370555b0268a79a8a9bcb7397f1eafc7220faface1aa2e2fce746e","target":"record","created_at":"2026-05-18T01:22:13Z","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":"66e6ce444784c1646f15a834a277ebb938e0fe56b9d5b577479d59d7e1602cf8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-06T22:26:03Z","title_canon_sha256":"273f22a155a0514366db994048b04a92498c728dee83b42c7e73e4123b7b6479"},"schema_version":"1.0","source":{"id":"1601.05458","kind":"arxiv","version":1}},"canonical_sha256":"1235070898092afb3359288eca8c58bb8c3506993d3718fa34c5133c085f6dc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1235070898092afb3359288eca8c58bb8c3506993d3718fa34c5133c085f6dc4","first_computed_at":"2026-05-18T01:22:13.759223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:13.759223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xWW0cxnCZHq+g9LOYhJm4OU8Vjed6alkBACbXigpOFQyJb7w1eLegFwKjXWc347dAzsHWsbh7y/MoU/KT8PaAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:13.759847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6263bafee3370555b0268a79a8a9bcb7397f1eafc7220faface1aa2e2fce746e","sha256:2b8e14bd43a23dd1c4527fa865e24119faabf919c2d2de3813e4d948436e28ad"],"state_sha256":"da8ac7afe1751cfc8a043289d5a2f27eb33c792ca147acbb06c8f1fd0b3c2e40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npvINmdTPOPu7L6nMLEWbDfkvtHgziYqDisXDyfvPInBdea+5YdScJ//jtx8EIEvmlgyIGJlF0upCOxHtS5/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:33:54.541509Z","bundle_sha256":"97bca102ecc8753a712c77bd1ea15e291493211f1422d46a1825da95bff32d16"}}