{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XMYHPTKCXBZOJFHQ7HA7PMRFRC","short_pith_number":"pith:XMYHPTKC","canonical_record":{"source":{"id":"1301.4131","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-17T15:48:55Z","cross_cats_sorted":[],"title_canon_sha256":"d3b1903b0b2df1dd2a8fa5a5a2c1b8a57a31115496ab487370738468acddbd0b","abstract_canon_sha256":"fc46878d81060242a59599c2f1403231e3fd4ab8dd036490592fa4366a1826a0"},"schema_version":"1.0"},"canonical_sha256":"bb3077cd42b872e494f0f9c1f7b22588ad923356a45b9b8acbe77d89b20c61c7","source":{"kind":"arxiv","id":"1301.4131","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4131","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4131v3","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4131","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"XMYHPTKCXBZO","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XMYHPTKCXBZOJFHQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XMYHPTKC","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XMYHPTKCXBZOJFHQ7HA7PMRFRC","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4131","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-17T15:48:55Z","cross_cats_sorted":[],"title_canon_sha256":"d3b1903b0b2df1dd2a8fa5a5a2c1b8a57a31115496ab487370738468acddbd0b","abstract_canon_sha256":"fc46878d81060242a59599c2f1403231e3fd4ab8dd036490592fa4366a1826a0"},"schema_version":"1.0"},"canonical_sha256":"bb3077cd42b872e494f0f9c1f7b22588ad923356a45b9b8acbe77d89b20c61c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:21.657567Z","signature_b64":"+RTpU5BiuKsRzVX6uwZ3v2TuKBO6cGaHQ4l/vBZxVYCoOaimzAcHH/8N6/y9OOy0SgnM9tzC2dhWnWfmIxP/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb3077cd42b872e494f0f9c1f7b22588ad923356a45b9b8acbe77d89b20c61c7","last_reissued_at":"2026-05-18T03:13:21.656839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:21.656839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4131","source_version":3,"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-18T03:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pik9cnDsX9oJ6fAfN/NuSRc7UsIK3P0tDi7MzVLrIfPA/ZK6puv8M6LbeOjz9WG/7MnhsVdppaINXk4xZ5bkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:04:10.449395Z"},"content_sha256":"2558ea2b183b133a942de00728d6663f13210763814d7b84612469672ac7f9fd","schema_version":"1.0","event_id":"sha256:2558ea2b183b133a942de00728d6663f13210763814d7b84612469672ac7f9fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XMYHPTKCXBZOJFHQ7HA7PMRFRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Efficient Scheduling with Time and Processors Eligibility Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fa Zhang, Liya Fan, Xibo Jin, Ying Song, Zhiyong Liu","submitted_at":"2013-01-17T15:48:55Z","abstract_excerpt":"While previous work on energy-efficient algorithms focused on assumption that tasks can be assigned to any processor, we initially study the problem of task scheduling on restricted parallel processors. The objective is to minimize the overall energy consumption while speed scaling (SS) method is used to reduce energy consumption under the execution time constraint (Makespan $C_{max}$). In this work, we discuss the speed setting in the continuous model that processors can run at arbitrary speed in $[s_{min},s_{max}]$. The energy-efficient scheduling problem, involving task assignment and speed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4131","kind":"arxiv","version":3},"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-18T03:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jcG8noT251es3oishSyOnposKrMm1Z2lHOnqmYgFLgLM+MrpV9PIbIxxyS91J+kQfLNplympFOEkuZ//7/yICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:04:10.450125Z"},"content_sha256":"218dd0d1206bfb6219a485df46fd8be638b64fc0a10a00643e21266bfbe6c1b7","schema_version":"1.0","event_id":"sha256:218dd0d1206bfb6219a485df46fd8be638b64fc0a10a00643e21266bfbe6c1b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMYHPTKCXBZOJFHQ7HA7PMRFRC/bundle.json","state_url":"https://pith.science/pith/XMYHPTKCXBZOJFHQ7HA7PMRFRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMYHPTKCXBZOJFHQ7HA7PMRFRC/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-06T13:04:10Z","links":{"resolver":"https://pith.science/pith/XMYHPTKCXBZOJFHQ7HA7PMRFRC","bundle":"https://pith.science/pith/XMYHPTKCXBZOJFHQ7HA7PMRFRC/bundle.json","state":"https://pith.science/pith/XMYHPTKCXBZOJFHQ7HA7PMRFRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMYHPTKCXBZOJFHQ7HA7PMRFRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XMYHPTKCXBZOJFHQ7HA7PMRFRC","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":"fc46878d81060242a59599c2f1403231e3fd4ab8dd036490592fa4366a1826a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-17T15:48:55Z","title_canon_sha256":"d3b1903b0b2df1dd2a8fa5a5a2c1b8a57a31115496ab487370738468acddbd0b"},"schema_version":"1.0","source":{"id":"1301.4131","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4131","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4131v3","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4131","created_at":"2026-05-18T03:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"XMYHPTKCXBZO","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XMYHPTKCXBZOJFHQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XMYHPTKC","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:218dd0d1206bfb6219a485df46fd8be638b64fc0a10a00643e21266bfbe6c1b7","target":"graph","created_at":"2026-05-18T03:13: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":"While previous work on energy-efficient algorithms focused on assumption that tasks can be assigned to any processor, we initially study the problem of task scheduling on restricted parallel processors. The objective is to minimize the overall energy consumption while speed scaling (SS) method is used to reduce energy consumption under the execution time constraint (Makespan $C_{max}$). In this work, we discuss the speed setting in the continuous model that processors can run at arbitrary speed in $[s_{min},s_{max}]$. The energy-efficient scheduling problem, involving task assignment and speed","authors_text":"Fa Zhang, Liya Fan, Xibo Jin, Ying Song, Zhiyong Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-17T15:48:55Z","title":"Energy-Efficient Scheduling with Time and Processors Eligibility Restrictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4131","kind":"arxiv","version":3},"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:2558ea2b183b133a942de00728d6663f13210763814d7b84612469672ac7f9fd","target":"record","created_at":"2026-05-18T03:13: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":"fc46878d81060242a59599c2f1403231e3fd4ab8dd036490592fa4366a1826a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-17T15:48:55Z","title_canon_sha256":"d3b1903b0b2df1dd2a8fa5a5a2c1b8a57a31115496ab487370738468acddbd0b"},"schema_version":"1.0","source":{"id":"1301.4131","kind":"arxiv","version":3}},"canonical_sha256":"bb3077cd42b872e494f0f9c1f7b22588ad923356a45b9b8acbe77d89b20c61c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb3077cd42b872e494f0f9c1f7b22588ad923356a45b9b8acbe77d89b20c61c7","first_computed_at":"2026-05-18T03:13:21.656839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:21.656839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+RTpU5BiuKsRzVX6uwZ3v2TuKBO6cGaHQ4l/vBZxVYCoOaimzAcHH/8N6/y9OOy0SgnM9tzC2dhWnWfmIxP/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:21.657567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4131","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2558ea2b183b133a942de00728d6663f13210763814d7b84612469672ac7f9fd","sha256:218dd0d1206bfb6219a485df46fd8be638b64fc0a10a00643e21266bfbe6c1b7"],"state_sha256":"f3ab4630cc82abe78cc861f7a5e253ad64a0a26b3c220dbd776b10f37965f967"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFtAl15u0/7Lg1DYyQJBCjgIlBSZTTwsKjBWGx+XuuT+Dhktt4z3/WOq+HVNOJBOQmYt7nKCrqiIl9GkYuDxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:04:10.454081Z","bundle_sha256":"35e550269f669480036242e2b16cef67ecaf5674b5f2a68d119c7cd47700aa6f"}}