{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PGJMNFGIRUDII35A2IF4IKHI7L","short_pith_number":"pith:PGJMNFGI","canonical_record":{"source":{"id":"1801.03578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-10T22:50:01Z","cross_cats_sorted":["cs.CE","cs.PF"],"title_canon_sha256":"76f0ab156aac87d8995437769cf7570825be6171ecdfdf61c11532f7dd3d5675","abstract_canon_sha256":"8929491e9e1e0a0b4ea234a7d386e8c65690e88310a1f8046aa2c810e4b85178"},"schema_version":"1.0"},"canonical_sha256":"7992c694c88d06846fa0d20bc428e8faceba906fbcb8e06a1db172a737fde02d","source":{"kind":"arxiv","id":"1801.03578","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03578","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03578v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03578","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"PGJMNFGIRUDI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGJMNFGIRUDII35A","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGJMNFGI","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PGJMNFGIRUDII35A2IF4IKHI7L","target":"record","payload":{"canonical_record":{"source":{"id":"1801.03578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-10T22:50:01Z","cross_cats_sorted":["cs.CE","cs.PF"],"title_canon_sha256":"76f0ab156aac87d8995437769cf7570825be6171ecdfdf61c11532f7dd3d5675","abstract_canon_sha256":"8929491e9e1e0a0b4ea234a7d386e8c65690e88310a1f8046aa2c810e4b85178"},"schema_version":"1.0"},"canonical_sha256":"7992c694c88d06846fa0d20bc428e8faceba906fbcb8e06a1db172a737fde02d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:13.213753Z","signature_b64":"AQYSzbCUJ9GXy2vCwX267p3xBmCddw+06jp0Z4o6D4xC4wQY+I2xrrrxusqApWoKfAiEM8QS9Qfae3KfU8f5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7992c694c88d06846fa0d20bc428e8faceba906fbcb8e06a1db172a737fde02d","last_reissued_at":"2026-05-18T00:26:13.213282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:13.213282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.03578","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-18T00:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L5vCbjGUk3cvKVku5TJFFOMYKFjaekVIyjewKTI3U9cewF8JnrKzGFpLooP2Ea/fpdgPlg0VnJ9ZRxCIeLqzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:16:51.064182Z"},"content_sha256":"f7a1e200d06a1c7c6a140abae353dc09528e2557a6bff924b1750206f801ab73","schema_version":"1.0","event_id":"sha256:f7a1e200d06a1c7c6a140abae353dc09528e2557a6bff924b1750206f801ab73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PGJMNFGIRUDII35A2IF4IKHI7L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DuctTeip: An efficient programming model for distributed task based parallel computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.PF"],"primary_cat":"cs.DC","authors_text":"Afshin Zafari, Elisabeth Larsson, Martin Tillenius","submitted_at":"2018-01-10T22:50:01Z","abstract_excerpt":"Current high-performance computer systems used for scientific computing typically combine shared memory computational nodes in a distributed memory environment. Extracting high performance from these complex systems requires tailored approaches. Task based parallel programming has been successful both in simplifying the programming and in exploiting the available hardware parallelism for shared memory systems. In this paper we focus on how to extend task parallel programming to distributed memory systems. We use a hierarchical decomposition of tasks and data in order to accommodate the differe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03578","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-18T00:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1bFdMNDOFwVVRmXfEM2RAxuLijx3pqf4PhBGpbTRQzYIaU4r6dJzH7Orf7CSfN1Yql0bR0ddrFORmDtZI1czBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:16:51.064830Z"},"content_sha256":"ddc11e8be9aaf0cda105ececd77aa71e3930f67988c1965dbf9b5d9256a872d0","schema_version":"1.0","event_id":"sha256:ddc11e8be9aaf0cda105ececd77aa71e3930f67988c1965dbf9b5d9256a872d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGJMNFGIRUDII35A2IF4IKHI7L/bundle.json","state_url":"https://pith.science/pith/PGJMNFGIRUDII35A2IF4IKHI7L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGJMNFGIRUDII35A2IF4IKHI7L/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-06T21:16:51Z","links":{"resolver":"https://pith.science/pith/PGJMNFGIRUDII35A2IF4IKHI7L","bundle":"https://pith.science/pith/PGJMNFGIRUDII35A2IF4IKHI7L/bundle.json","state":"https://pith.science/pith/PGJMNFGIRUDII35A2IF4IKHI7L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGJMNFGIRUDII35A2IF4IKHI7L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PGJMNFGIRUDII35A2IF4IKHI7L","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":"8929491e9e1e0a0b4ea234a7d386e8c65690e88310a1f8046aa2c810e4b85178","cross_cats_sorted":["cs.CE","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-10T22:50:01Z","title_canon_sha256":"76f0ab156aac87d8995437769cf7570825be6171ecdfdf61c11532f7dd3d5675"},"schema_version":"1.0","source":{"id":"1801.03578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03578","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03578v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03578","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"PGJMNFGIRUDI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGJMNFGIRUDII35A","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGJMNFGI","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:ddc11e8be9aaf0cda105ececd77aa71e3930f67988c1965dbf9b5d9256a872d0","target":"graph","created_at":"2026-05-18T00:26: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":"Current high-performance computer systems used for scientific computing typically combine shared memory computational nodes in a distributed memory environment. Extracting high performance from these complex systems requires tailored approaches. Task based parallel programming has been successful both in simplifying the programming and in exploiting the available hardware parallelism for shared memory systems. In this paper we focus on how to extend task parallel programming to distributed memory systems. We use a hierarchical decomposition of tasks and data in order to accommodate the differe","authors_text":"Afshin Zafari, Elisabeth Larsson, Martin Tillenius","cross_cats":["cs.CE","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-10T22:50:01Z","title":"DuctTeip: An efficient programming model for distributed task based parallel computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03578","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:f7a1e200d06a1c7c6a140abae353dc09528e2557a6bff924b1750206f801ab73","target":"record","created_at":"2026-05-18T00:26: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":"8929491e9e1e0a0b4ea234a7d386e8c65690e88310a1f8046aa2c810e4b85178","cross_cats_sorted":["cs.CE","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-10T22:50:01Z","title_canon_sha256":"76f0ab156aac87d8995437769cf7570825be6171ecdfdf61c11532f7dd3d5675"},"schema_version":"1.0","source":{"id":"1801.03578","kind":"arxiv","version":1}},"canonical_sha256":"7992c694c88d06846fa0d20bc428e8faceba906fbcb8e06a1db172a737fde02d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7992c694c88d06846fa0d20bc428e8faceba906fbcb8e06a1db172a737fde02d","first_computed_at":"2026-05-18T00:26:13.213282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:13.213282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AQYSzbCUJ9GXy2vCwX267p3xBmCddw+06jp0Z4o6D4xC4wQY+I2xrrrxusqApWoKfAiEM8QS9Qfae3KfU8f5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:13.213753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03578","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7a1e200d06a1c7c6a140abae353dc09528e2557a6bff924b1750206f801ab73","sha256:ddc11e8be9aaf0cda105ececd77aa71e3930f67988c1965dbf9b5d9256a872d0"],"state_sha256":"f4910bd0d7a78d67442894b286f076837312b73c5461a051ea91db62f7726622"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qzsxAzAHj06gc8z426qfakC4ptpWfn4FLDB5zP2O0UY+GlIBeZFYPKCSc83tgB/WwM70vHZtJrwWRX3y1SyWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:16:51.067790Z","bundle_sha256":"b04105e7f86bb040009e9d0e54c9aae9a6f1f982b4f99c916ddb6411cecd7c0d"}}