{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QAXAMQG6H5YX73NDIQKCX4374B","short_pith_number":"pith:QAXAMQG6","canonical_record":{"source":{"id":"1510.05567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-10-19T16:26:47Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"6a6c14beea297caa7c4bad6a171ce70ec477ecf5f528d5e2800208e2adbcada8","abstract_canon_sha256":"13b72a7bfb4bc29b3290f8b25090bd46527dc79f7324d44f442c0ee8e27cd9e1"},"schema_version":"1.0"},"canonical_sha256":"802e0640de3f717feda344142bf37fe06d3fdce53a185a9da0edccac246982aa","source":{"kind":"arxiv","id":"1510.05567","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05567","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05567v2","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05567","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"pith_short_12","alias_value":"QAXAMQG6H5YX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QAXAMQG6H5YX73ND","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QAXAMQG6","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QAXAMQG6H5YX73NDIQKCX4374B","target":"record","payload":{"canonical_record":{"source":{"id":"1510.05567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-10-19T16:26:47Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"6a6c14beea297caa7c4bad6a171ce70ec477ecf5f528d5e2800208e2adbcada8","abstract_canon_sha256":"13b72a7bfb4bc29b3290f8b25090bd46527dc79f7324d44f442c0ee8e27cd9e1"},"schema_version":"1.0"},"canonical_sha256":"802e0640de3f717feda344142bf37fe06d3fdce53a185a9da0edccac246982aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:07.272933Z","signature_b64":"LOm8066XTACO0SJyODgnDdRiZOatH3W69mlYbGN9KuAoTdTlu09ROnB7yMgZoUiERcwm88AhFZpTVOHNC6MBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"802e0640de3f717feda344142bf37fe06d3fdce53a185a9da0edccac246982aa","last_reissued_at":"2026-05-18T01:27:07.272226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:07.272226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.05567","source_version":2,"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:27:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spKnmRlq3sNEx2m11Awml39sL8die7xLH3LYPObePc3G5CrDJoQjXUk0jUSDdLxeirOC5VzJmSx6AfMIaPuSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:55:02.159981Z"},"content_sha256":"68b0e8ba1b70314d90855849a364f5c092dcf78a5b3fc6be7341b703d92c3994","schema_version":"1.0","event_id":"sha256:68b0e8ba1b70314d90855849a364f5c092dcf78a5b3fc6be7341b703d92c3994"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QAXAMQG6H5YX73NDIQKCX4374B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Efficient Scheduling for Homogeneous Multiprocessor Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.OS","authors_text":"Eric C. Kerrigan, Mason Thammawichai","submitted_at":"2015-10-19T16:26:47Z","abstract_excerpt":"We present a number of novel algorithms, based on mathematical optimization formulations, in order to solve a homogeneous multiprocessor scheduling problem, while minimizing the total energy consumption. In particular, for a system with a discrete speed set, we propose solving a tractable linear program. Our formulations are based on a fluid model and a global scheduling scheme, i.e. tasks are allowed to migrate between processors. The new methods are compared with three global energy/feasibility optimal workload allocation formulations. Simulation results illustrate that our methods achieve b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05567","kind":"arxiv","version":2},"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:27:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BSjJJFEOwSIrEPz6kuPTN3Iu5hhBZAoOSn/1le36vNRxZe1RwwrGThfwdY6eNRB/qIk+Qd0GU6hEUmBp6zreDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:55:02.160347Z"},"content_sha256":"057e838dcc4a2641f47e732f5ebfa6a8a5bfd007346df71ac7c4c995bcebe6a6","schema_version":"1.0","event_id":"sha256:057e838dcc4a2641f47e732f5ebfa6a8a5bfd007346df71ac7c4c995bcebe6a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAXAMQG6H5YX73NDIQKCX4374B/bundle.json","state_url":"https://pith.science/pith/QAXAMQG6H5YX73NDIQKCX4374B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAXAMQG6H5YX73NDIQKCX4374B/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-24T02:55:02Z","links":{"resolver":"https://pith.science/pith/QAXAMQG6H5YX73NDIQKCX4374B","bundle":"https://pith.science/pith/QAXAMQG6H5YX73NDIQKCX4374B/bundle.json","state":"https://pith.science/pith/QAXAMQG6H5YX73NDIQKCX4374B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAXAMQG6H5YX73NDIQKCX4374B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QAXAMQG6H5YX73NDIQKCX4374B","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":"13b72a7bfb4bc29b3290f8b25090bd46527dc79f7324d44f442c0ee8e27cd9e1","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-10-19T16:26:47Z","title_canon_sha256":"6a6c14beea297caa7c4bad6a171ce70ec477ecf5f528d5e2800208e2adbcada8"},"schema_version":"1.0","source":{"id":"1510.05567","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05567","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05567v2","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05567","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"pith_short_12","alias_value":"QAXAMQG6H5YX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QAXAMQG6H5YX73ND","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QAXAMQG6","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:057e838dcc4a2641f47e732f5ebfa6a8a5bfd007346df71ac7c4c995bcebe6a6","target":"graph","created_at":"2026-05-18T01:27:07Z","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":"We present a number of novel algorithms, based on mathematical optimization formulations, in order to solve a homogeneous multiprocessor scheduling problem, while minimizing the total energy consumption. In particular, for a system with a discrete speed set, we propose solving a tractable linear program. Our formulations are based on a fluid model and a global scheduling scheme, i.e. tasks are allowed to migrate between processors. The new methods are compared with three global energy/feasibility optimal workload allocation formulations. Simulation results illustrate that our methods achieve b","authors_text":"Eric C. Kerrigan, Mason Thammawichai","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-10-19T16:26:47Z","title":"Energy-Efficient Scheduling for Homogeneous Multiprocessor Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05567","kind":"arxiv","version":2},"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:68b0e8ba1b70314d90855849a364f5c092dcf78a5b3fc6be7341b703d92c3994","target":"record","created_at":"2026-05-18T01:27:07Z","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":"13b72a7bfb4bc29b3290f8b25090bd46527dc79f7324d44f442c0ee8e27cd9e1","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2015-10-19T16:26:47Z","title_canon_sha256":"6a6c14beea297caa7c4bad6a171ce70ec477ecf5f528d5e2800208e2adbcada8"},"schema_version":"1.0","source":{"id":"1510.05567","kind":"arxiv","version":2}},"canonical_sha256":"802e0640de3f717feda344142bf37fe06d3fdce53a185a9da0edccac246982aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"802e0640de3f717feda344142bf37fe06d3fdce53a185a9da0edccac246982aa","first_computed_at":"2026-05-18T01:27:07.272226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:07.272226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LOm8066XTACO0SJyODgnDdRiZOatH3W69mlYbGN9KuAoTdTlu09ROnB7yMgZoUiERcwm88AhFZpTVOHNC6MBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:07.272933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05567","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68b0e8ba1b70314d90855849a364f5c092dcf78a5b3fc6be7341b703d92c3994","sha256:057e838dcc4a2641f47e732f5ebfa6a8a5bfd007346df71ac7c4c995bcebe6a6"],"state_sha256":"00f37a39e44012e5d55f18da77abf9bca9fc3b256b6ce7125135f5428724e903"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5zkkuXUlo/eTDlWh9qkkx98Sy+F0+FdrWC/gZ1/M7t4oJ1CmB1UlAaDYFEfJZ+1qjFYnz+0Wve6GCJG2pV5aAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T02:55:02.162308Z","bundle_sha256":"89a3a63c61215b0e960d7cfa1f66e63c5248e75a52f52a86d20e0b8fd4b51bb3"}}