{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XYQLCRUALO437R42HQ7R2JT236","short_pith_number":"pith:XYQLCRUA","canonical_record":{"source":{"id":"1712.03246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-08T19:02:48Z","cross_cats_sorted":[],"title_canon_sha256":"9a6d391692d2a1aee412a190e48349b72de5833723666eb5e5ab50a794ef989c","abstract_canon_sha256":"09cac8366ec1d320c3771c9c5d93ebefde5d99afac7d74681fab29cb820df45d"},"schema_version":"1.0"},"canonical_sha256":"be20b146805bb9bfc79a3c3f1d267adf9e1b9b0508671bd2a2c979506344a385","source":{"kind":"arxiv","id":"1712.03246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03246","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03246v1","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03246","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"XYQLCRUALO43","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XYQLCRUALO437R42","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XYQLCRUA","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XYQLCRUALO437R42HQ7R2JT236","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-08T19:02:48Z","cross_cats_sorted":[],"title_canon_sha256":"9a6d391692d2a1aee412a190e48349b72de5833723666eb5e5ab50a794ef989c","abstract_canon_sha256":"09cac8366ec1d320c3771c9c5d93ebefde5d99afac7d74681fab29cb820df45d"},"schema_version":"1.0"},"canonical_sha256":"be20b146805bb9bfc79a3c3f1d267adf9e1b9b0508671bd2a2c979506344a385","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:21.902704Z","signature_b64":"11h/87SWvTtXXxzMPYvVEtEujXhsep0ScQ8l2bF/flNtrTu+35IBu3++VBFCTXf6nVcqPty/2rdWRtAmVNmXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be20b146805bb9bfc79a3c3f1d267adf9e1b9b0508671bd2a2c979506344a385","last_reissued_at":"2026-05-18T00:28:21.902014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:21.902014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03246","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:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IEEpmXOB3R5ctde5/936IwIXYW9UUXgtWeRA01Ssea89RWy2b3n3f+zwZ3WAUz/mue3xTTBVhhyIjmteCNofCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:24:18.008805Z"},"content_sha256":"a38893a3cc0935507e3c261c01be0e872c41cc0911ff51e255f644341caf91f3","schema_version":"1.0","event_id":"sha256:a38893a3cc0935507e3c261c01be0e872c41cc0911ff51e255f644341caf91f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XYQLCRUALO437R42HQ7R2JT236","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Priority-Aware Near-Optimal Scheduling for Heterogeneous Multi-Core Systems with Specialized Accelerators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Diana Marculescu, Zhuo Chen","submitted_at":"2017-12-08T19:02:48Z","abstract_excerpt":"To deliver high performance in power limited systems, architects have turned to using heterogeneous systems, either CPU+GPU or mixed CPU-hardware systems. However, in systems with different processor types and task affinities, scheduling tasks becomes more challenging than in homogeneous multi-core systems or systems without task affinities. The problem is even more complex when specialized accelerators and task priorities are included. In this paper, we provide a formal proof for the optimal scheduling policy for heterogeneous systems with arbitrary number of resource types, including special"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03246","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:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H6nAVD3SIxIVPczVXuCgHqp9FbPGG6yoPfES7FEg3UWjYyb80dyZQJ8GqFiR8tlGvcmxZweqLjKJ/tBgTY8wBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:24:18.009456Z"},"content_sha256":"68db930d3af6c59176e718a3a55d930de408dfe126b07ec7d86e63d79ebe333d","schema_version":"1.0","event_id":"sha256:68db930d3af6c59176e718a3a55d930de408dfe126b07ec7d86e63d79ebe333d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYQLCRUALO437R42HQ7R2JT236/bundle.json","state_url":"https://pith.science/pith/XYQLCRUALO437R42HQ7R2JT236/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYQLCRUALO437R42HQ7R2JT236/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-06T19:24:18Z","links":{"resolver":"https://pith.science/pith/XYQLCRUALO437R42HQ7R2JT236","bundle":"https://pith.science/pith/XYQLCRUALO437R42HQ7R2JT236/bundle.json","state":"https://pith.science/pith/XYQLCRUALO437R42HQ7R2JT236/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYQLCRUALO437R42HQ7R2JT236/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XYQLCRUALO437R42HQ7R2JT236","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":"09cac8366ec1d320c3771c9c5d93ebefde5d99afac7d74681fab29cb820df45d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-08T19:02:48Z","title_canon_sha256":"9a6d391692d2a1aee412a190e48349b72de5833723666eb5e5ab50a794ef989c"},"schema_version":"1.0","source":{"id":"1712.03246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03246","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03246v1","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03246","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"XYQLCRUALO43","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XYQLCRUALO437R42","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XYQLCRUA","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:68db930d3af6c59176e718a3a55d930de408dfe126b07ec7d86e63d79ebe333d","target":"graph","created_at":"2026-05-18T00:28:21Z","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":"To deliver high performance in power limited systems, architects have turned to using heterogeneous systems, either CPU+GPU or mixed CPU-hardware systems. However, in systems with different processor types and task affinities, scheduling tasks becomes more challenging than in homogeneous multi-core systems or systems without task affinities. The problem is even more complex when specialized accelerators and task priorities are included. In this paper, we provide a formal proof for the optimal scheduling policy for heterogeneous systems with arbitrary number of resource types, including special","authors_text":"Diana Marculescu, Zhuo Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-08T19:02:48Z","title":"Priority-Aware Near-Optimal Scheduling for Heterogeneous Multi-Core Systems with Specialized Accelerators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03246","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:a38893a3cc0935507e3c261c01be0e872c41cc0911ff51e255f644341caf91f3","target":"record","created_at":"2026-05-18T00:28:21Z","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":"09cac8366ec1d320c3771c9c5d93ebefde5d99afac7d74681fab29cb820df45d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-08T19:02:48Z","title_canon_sha256":"9a6d391692d2a1aee412a190e48349b72de5833723666eb5e5ab50a794ef989c"},"schema_version":"1.0","source":{"id":"1712.03246","kind":"arxiv","version":1}},"canonical_sha256":"be20b146805bb9bfc79a3c3f1d267adf9e1b9b0508671bd2a2c979506344a385","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be20b146805bb9bfc79a3c3f1d267adf9e1b9b0508671bd2a2c979506344a385","first_computed_at":"2026-05-18T00:28:21.902014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:21.902014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"11h/87SWvTtXXxzMPYvVEtEujXhsep0ScQ8l2bF/flNtrTu+35IBu3++VBFCTXf6nVcqPty/2rdWRtAmVNmXAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:21.902704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a38893a3cc0935507e3c261c01be0e872c41cc0911ff51e255f644341caf91f3","sha256:68db930d3af6c59176e718a3a55d930de408dfe126b07ec7d86e63d79ebe333d"],"state_sha256":"05395d2d3f03b598f50208bf1119e123d672c5de1c3ac998d748bf0f5f44d6cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vm7YkLCvd3aRoAJjSXhJRL1v72lvGY9VQiuC1JH5QkkaDGh3htM3EkjnTLclFJq3uEs6kbRqrsjZmLoKTB0/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:24:18.013122Z","bundle_sha256":"88c6136866d3b6e1c7778c844d63a5c214f164e6c47e82e45b2d07c9ac9f2f42"}}