{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NX7NFZRRQRLEK7ZEDIG4CR62AM","short_pith_number":"pith:NX7NFZRR","canonical_record":{"source":{"id":"1502.07451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-26T06:19:32Z","cross_cats_sorted":[],"title_canon_sha256":"3fd55efd096f6222b8a208ca00971a060a655b15813592c57dd27c87d1db1998","abstract_canon_sha256":"cd379988a249069960d00a1b79aaf84f645f8474ce58e9257d27e2010ab19be4"},"schema_version":"1.0"},"canonical_sha256":"6dfed2e6318456457f241a0dc147da0317bd9303a2c967eab5fe42240ba05a63","source":{"kind":"arxiv","id":"1502.07451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07451","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07451v1","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07451","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"NX7NFZRRQRLE","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NX7NFZRRQRLEK7ZE","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NX7NFZRR","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NX7NFZRRQRLEK7ZEDIG4CR62AM","target":"record","payload":{"canonical_record":{"source":{"id":"1502.07451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-26T06:19:32Z","cross_cats_sorted":[],"title_canon_sha256":"3fd55efd096f6222b8a208ca00971a060a655b15813592c57dd27c87d1db1998","abstract_canon_sha256":"cd379988a249069960d00a1b79aaf84f645f8474ce58e9257d27e2010ab19be4"},"schema_version":"1.0"},"canonical_sha256":"6dfed2e6318456457f241a0dc147da0317bd9303a2c967eab5fe42240ba05a63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:09.715460Z","signature_b64":"SyyOBgNjpIH2Ifrau1UAOjqDhsFNobsqjYeYnpZiDXP4X+eDFh1mSHdqPx+JxUjPkvUmkNBgijyt4LgrWhQ2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dfed2e6318456457f241a0dc147da0317bd9303a2c967eab5fe42240ba05a63","last_reissued_at":"2026-05-18T02:26:09.714901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:09.714901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.07451","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-18T02:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2MoyKzI7ht7X8gWbPo4DYuiaPoAot1ZJIpX+OAdsDxmQrhvx9DXt0K8/l5FYhde7+MT9084ToFSLI+SbNG1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:42:04.455896Z"},"content_sha256":"64d6aaae052e5f8adf2fae204fce3b15f370cba46d1a118a70071f7ffd253989","schema_version":"1.0","event_id":"sha256:64d6aaae052e5f8adf2fae204fce3b15f370cba46d1a118a70071f7ffd253989"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NX7NFZRRQRLEK7ZEDIG4CR62AM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Graph-Partition-Based Scheduling Policy for Heterogeneous Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Daniel Lohmann, Hao Wu, Wolfgang Schr\\\"oder-Preikschat","submitted_at":"2015-02-26T06:19:32Z","abstract_excerpt":"In order to improve system performance efficiently, a number of systems choose to equip multi-core and many-core processors (such as GPUs). Due to their discrete memory these heterogeneous architectures comprise a distributed system within a computer. A data-flow programming model is attractive in this setting for its ease of expressing concurrency. Programmers only need to define task dependencies without considering how to schedule them on the hardware. However, mapping the resulting task graph onto hardware efficiently remains a challenge. In this paper, we propose a graph-partition schedul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07451","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-18T02:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHWnG9Kbov0vMTGew03zHTtQMFa6RHWjhbpEX+rtrHqSdmYT7jEX0DbsoLWuDxJkauSBHw8CfTLzBDIyHGL+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:42:04.456651Z"},"content_sha256":"39d4e541607b3f453a2527aac1da58c96d73546b83839bc8e75c91295c9f3a74","schema_version":"1.0","event_id":"sha256:39d4e541607b3f453a2527aac1da58c96d73546b83839bc8e75c91295c9f3a74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NX7NFZRRQRLEK7ZEDIG4CR62AM/bundle.json","state_url":"https://pith.science/pith/NX7NFZRRQRLEK7ZEDIG4CR62AM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NX7NFZRRQRLEK7ZEDIG4CR62AM/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-05-26T17:42:04Z","links":{"resolver":"https://pith.science/pith/NX7NFZRRQRLEK7ZEDIG4CR62AM","bundle":"https://pith.science/pith/NX7NFZRRQRLEK7ZEDIG4CR62AM/bundle.json","state":"https://pith.science/pith/NX7NFZRRQRLEK7ZEDIG4CR62AM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NX7NFZRRQRLEK7ZEDIG4CR62AM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NX7NFZRRQRLEK7ZEDIG4CR62AM","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":"cd379988a249069960d00a1b79aaf84f645f8474ce58e9257d27e2010ab19be4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-26T06:19:32Z","title_canon_sha256":"3fd55efd096f6222b8a208ca00971a060a655b15813592c57dd27c87d1db1998"},"schema_version":"1.0","source":{"id":"1502.07451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07451","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07451v1","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07451","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"NX7NFZRRQRLE","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NX7NFZRRQRLEK7ZE","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NX7NFZRR","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:39d4e541607b3f453a2527aac1da58c96d73546b83839bc8e75c91295c9f3a74","target":"graph","created_at":"2026-05-18T02:26:09Z","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":"In order to improve system performance efficiently, a number of systems choose to equip multi-core and many-core processors (such as GPUs). Due to their discrete memory these heterogeneous architectures comprise a distributed system within a computer. A data-flow programming model is attractive in this setting for its ease of expressing concurrency. Programmers only need to define task dependencies without considering how to schedule them on the hardware. However, mapping the resulting task graph onto hardware efficiently remains a challenge. In this paper, we propose a graph-partition schedul","authors_text":"Daniel Lohmann, Hao Wu, Wolfgang Schr\\\"oder-Preikschat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-26T06:19:32Z","title":"A Graph-Partition-Based Scheduling Policy for Heterogeneous Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07451","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:64d6aaae052e5f8adf2fae204fce3b15f370cba46d1a118a70071f7ffd253989","target":"record","created_at":"2026-05-18T02:26:09Z","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":"cd379988a249069960d00a1b79aaf84f645f8474ce58e9257d27e2010ab19be4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-26T06:19:32Z","title_canon_sha256":"3fd55efd096f6222b8a208ca00971a060a655b15813592c57dd27c87d1db1998"},"schema_version":"1.0","source":{"id":"1502.07451","kind":"arxiv","version":1}},"canonical_sha256":"6dfed2e6318456457f241a0dc147da0317bd9303a2c967eab5fe42240ba05a63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dfed2e6318456457f241a0dc147da0317bd9303a2c967eab5fe42240ba05a63","first_computed_at":"2026-05-18T02:26:09.714901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:09.714901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SyyOBgNjpIH2Ifrau1UAOjqDhsFNobsqjYeYnpZiDXP4X+eDFh1mSHdqPx+JxUjPkvUmkNBgijyt4LgrWhQ2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:09.715460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64d6aaae052e5f8adf2fae204fce3b15f370cba46d1a118a70071f7ffd253989","sha256:39d4e541607b3f453a2527aac1da58c96d73546b83839bc8e75c91295c9f3a74"],"state_sha256":"4ab5f2453625881d11cee6a1ad38e5ec62e590763781f3086351f4613a733acd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A05mqCfCBwQd1JPNUnHGKmKOknjSyxIMzLRjNfhYCA8U5x6kwnaxnJDivWpfMW54nVn0acIQ0wYV+TQ4LBZoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:42:04.460594Z","bundle_sha256":"1b17d661c07975cfb7509cbaa287018b95ca07bbc80e9ef0b78607e90bb4d1bb"}}