{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4V5TT6NBPGGEZFFIUPHTEXUYPQ","short_pith_number":"pith:4V5TT6NB","canonical_record":{"source":{"id":"1607.07763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-15T14:52:57Z","cross_cats_sorted":["cs.OS","cs.SY","math.OC"],"title_canon_sha256":"584d9f08c4187040e974500bd467ee2bf8018c41ebcf20ffe7b14d1eb2a2bbde","abstract_canon_sha256":"e66ddbfb635d13ec25f49085e9e5d4ca6dae3ad124d4a01dc397b66f75c61db1"},"schema_version":"1.0"},"canonical_sha256":"e57b39f9a1798c4c94a8a3cf325e987c024e90a28926648742e51c450a346056","source":{"kind":"arxiv","id":"1607.07763","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07763","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07763v1","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07763","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"pith_short_12","alias_value":"4V5TT6NBPGGE","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4V5TT6NBPGGEZFFI","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4V5TT6NB","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4V5TT6NBPGGEZFFIUPHTEXUYPQ","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-15T14:52:57Z","cross_cats_sorted":["cs.OS","cs.SY","math.OC"],"title_canon_sha256":"584d9f08c4187040e974500bd467ee2bf8018c41ebcf20ffe7b14d1eb2a2bbde","abstract_canon_sha256":"e66ddbfb635d13ec25f49085e9e5d4ca6dae3ad124d4a01dc397b66f75c61db1"},"schema_version":"1.0"},"canonical_sha256":"e57b39f9a1798c4c94a8a3cf325e987c024e90a28926648742e51c450a346056","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:02.396377Z","signature_b64":"/Zw72+ffmv5dyNefopH90Zgx/CpTqa7MXb8+NxAU/ioIb2dDnANB7dw+tJiv66VSzL9gyycS7CLpGIrjrYSzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e57b39f9a1798c4c94a8a3cf325e987c024e90a28926648742e51c450a346056","last_reissued_at":"2026-05-18T00:33:02.395887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:02.395887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07763","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:33:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00A+QmpLaByaCg+cQcGXHNXvszyf+z1srcGRwvlbTeJGdB2oYjDW7ZvMqxO1sAGWfDdYmb0seinLkpmqWVM3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:59:46.150733Z"},"content_sha256":"43fa4641776e46a813442c8850c751919ab2b60399e8c8a7bc03078cddc9ac61","schema_version":"1.0","event_id":"sha256:43fa4641776e46a813442c8850c751919ab2b60399e8c8a7bc03078cddc9ac61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4V5TT6NBPGGEZFFIUPHTEXUYPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Efficient Real-Time Scheduling for Two-Type Heterogeneous Multiprocessors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.OS","cs.SY","math.OC"],"primary_cat":"cs.DC","authors_text":"Eric C. Kerrigan, Mason Thammawichai","submitted_at":"2016-07-15T14:52:57Z","abstract_excerpt":"We propose three novel mathematical optimization formulations that solve the same two-type heterogeneous multiprocessor scheduling problem for a real-time taskset with hard constraints. Our formulations are based on a global scheduling scheme and a fluid model. The first formulation is a mixed-integer nonlinear program, since the scheduling problem is intuitively considered as an assignment problem. However, by changing the scheduling problem to first determine a task workload partition and then to find the execution order of all tasks, the computation time can be significantly reduced. Specif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07763","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:33:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+/cFmihETAsYA9OCrjaFPD/xYRqFYV01OmcDXrkm/zRDv9yKUkyimDoONXFhO3HitMIGqxVQ6AbKIoG8os/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:59:46.151079Z"},"content_sha256":"e0253d1c75f3b705b8e57a73a7ebc7d03553b04f5b9887ba1191d02c58d9c693","schema_version":"1.0","event_id":"sha256:e0253d1c75f3b705b8e57a73a7ebc7d03553b04f5b9887ba1191d02c58d9c693"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ/bundle.json","state_url":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ/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:59:46Z","links":{"resolver":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ","bundle":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ/bundle.json","state":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4V5TT6NBPGGEZFFIUPHTEXUYPQ","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":"e66ddbfb635d13ec25f49085e9e5d4ca6dae3ad124d4a01dc397b66f75c61db1","cross_cats_sorted":["cs.OS","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-15T14:52:57Z","title_canon_sha256":"584d9f08c4187040e974500bd467ee2bf8018c41ebcf20ffe7b14d1eb2a2bbde"},"schema_version":"1.0","source":{"id":"1607.07763","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07763","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07763v1","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07763","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"pith_short_12","alias_value":"4V5TT6NBPGGE","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4V5TT6NBPGGEZFFI","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4V5TT6NB","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:e0253d1c75f3b705b8e57a73a7ebc7d03553b04f5b9887ba1191d02c58d9c693","target":"graph","created_at":"2026-05-18T00:33:02Z","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 propose three novel mathematical optimization formulations that solve the same two-type heterogeneous multiprocessor scheduling problem for a real-time taskset with hard constraints. Our formulations are based on a global scheduling scheme and a fluid model. The first formulation is a mixed-integer nonlinear program, since the scheduling problem is intuitively considered as an assignment problem. However, by changing the scheduling problem to first determine a task workload partition and then to find the execution order of all tasks, the computation time can be significantly reduced. Specif","authors_text":"Eric C. Kerrigan, Mason Thammawichai","cross_cats":["cs.OS","cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-15T14:52:57Z","title":"Energy-Efficient Real-Time Scheduling for Two-Type Heterogeneous Multiprocessors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07763","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:43fa4641776e46a813442c8850c751919ab2b60399e8c8a7bc03078cddc9ac61","target":"record","created_at":"2026-05-18T00:33:02Z","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":"e66ddbfb635d13ec25f49085e9e5d4ca6dae3ad124d4a01dc397b66f75c61db1","cross_cats_sorted":["cs.OS","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-15T14:52:57Z","title_canon_sha256":"584d9f08c4187040e974500bd467ee2bf8018c41ebcf20ffe7b14d1eb2a2bbde"},"schema_version":"1.0","source":{"id":"1607.07763","kind":"arxiv","version":1}},"canonical_sha256":"e57b39f9a1798c4c94a8a3cf325e987c024e90a28926648742e51c450a346056","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e57b39f9a1798c4c94a8a3cf325e987c024e90a28926648742e51c450a346056","first_computed_at":"2026-05-18T00:33:02.395887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:02.395887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Zw72+ffmv5dyNefopH90Zgx/CpTqa7MXb8+NxAU/ioIb2dDnANB7dw+tJiv66VSzL9gyycS7CLpGIrjrYSzDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:02.396377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07763","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43fa4641776e46a813442c8850c751919ab2b60399e8c8a7bc03078cddc9ac61","sha256:e0253d1c75f3b705b8e57a73a7ebc7d03553b04f5b9887ba1191d02c58d9c693"],"state_sha256":"557a14c46c9ecdd36909052e1d28404598dc98259488a01495dfd9baa1619f10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UsvH07enxtuitG4+oRiftCwK25+DThl32/AbRu8eQIybjEP7RnOvOMsrAVwGCw84jo/1JVv7ErnKhSuniieBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T02:59:46.153158Z","bundle_sha256":"fc7ccbe3db8b6c18e40ad0f25b0d4c4c782c994475badbc2d2eeae514623d59a"}}