{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:E7DJBTGDQLP5GIKUXUL22YHO4Z","short_pith_number":"pith:E7DJBTGD","schema_version":"1.0","canonical_sha256":"27c690ccc382dfd32154bd17ad60eee65c29595d5fa340e8c830af4523774aa3","source":{"kind":"arxiv","id":"2112.03082","version":1},"attestation_state":"computed","paper":{"title":"A Novel Prediction Setup for Online Speed-Scaling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Antonios Antoniadis, Golnoosh Shahkarami, Peyman Jabbarzade Ganje","submitted_at":"2021-12-06T14:46:20Z","abstract_excerpt":"Given the rapid rise in energy demand by data centers and computing systems in general, it is fundamental to incorporate energy considerations when designing (scheduling) algorithms. Machine learning can be a useful approach in practice by predicting the future load of the system based on, for example, historical data. However, the effectiveness of such an approach highly depends on the quality of the predictions and can be quite far from optimal when predictions are sub-par. On the other hand, while providing a worst-case guarantee, classical online algorithms can be pessimistic for large cla"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2112.03082","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-06T14:46:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bd281bc12bd6c5285dd3d0e8656e6dd8b1e582bde156b79e5b9440f1c8ab55b4","abstract_canon_sha256":"d20de34c0929f297f6ee4728bb300fd668a8fd3f41b28330c50816a0ef9986c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:38:01.772785Z","signature_b64":"Kdw2MZO/X0FBMHCcPWasZ8IgnIrY9nhbx601twWxTd3urfY9EtlHy+6oAvmfNchPEIPGBY9KRNrF6T/L6bAZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27c690ccc382dfd32154bd17ad60eee65c29595d5fa340e8c830af4523774aa3","last_reissued_at":"2026-07-05T03:38:01.772388Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:38:01.772388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Prediction Setup for Online Speed-Scaling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Antonios Antoniadis, Golnoosh Shahkarami, Peyman Jabbarzade Ganje","submitted_at":"2021-12-06T14:46:20Z","abstract_excerpt":"Given the rapid rise in energy demand by data centers and computing systems in general, it is fundamental to incorporate energy considerations when designing (scheduling) algorithms. Machine learning can be a useful approach in practice by predicting the future load of the system based on, for example, historical data. However, the effectiveness of such an approach highly depends on the quality of the predictions and can be quite far from optimal when predictions are sub-par. On the other hand, while providing a worst-case guarantee, classical online algorithms can be pessimistic for large cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.03082","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.03082/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2112.03082","created_at":"2026-07-05T03:38:01.772441+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.03082v1","created_at":"2026-07-05T03:38:01.772441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.03082","created_at":"2026-07-05T03:38:01.772441+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7DJBTGDQLP5","created_at":"2026-07-05T03:38:01.772441+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7DJBTGDQLP5GIKU","created_at":"2026-07-05T03:38:01.772441+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7DJBTGD","created_at":"2026-07-05T03:38:01.772441+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E7DJBTGDQLP5GIKUXUL22YHO4Z","json":"https://pith.science/pith/E7DJBTGDQLP5GIKUXUL22YHO4Z.json","graph_json":"https://pith.science/api/pith-number/E7DJBTGDQLP5GIKUXUL22YHO4Z/graph.json","events_json":"https://pith.science/api/pith-number/E7DJBTGDQLP5GIKUXUL22YHO4Z/events.json","paper":"https://pith.science/paper/E7DJBTGD"},"agent_actions":{"view_html":"https://pith.science/pith/E7DJBTGDQLP5GIKUXUL22YHO4Z","download_json":"https://pith.science/pith/E7DJBTGDQLP5GIKUXUL22YHO4Z.json","view_paper":"https://pith.science/paper/E7DJBTGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.03082&json=true","fetch_graph":"https://pith.science/api/pith-number/E7DJBTGDQLP5GIKUXUL22YHO4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/E7DJBTGDQLP5GIKUXUL22YHO4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7DJBTGDQLP5GIKUXUL22YHO4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7DJBTGDQLP5GIKUXUL22YHO4Z/action/storage_attestation","attest_author":"https://pith.science/pith/E7DJBTGDQLP5GIKUXUL22YHO4Z/action/author_attestation","sign_citation":"https://pith.science/pith/E7DJBTGDQLP5GIKUXUL22YHO4Z/action/citation_signature","submit_replication":"https://pith.science/pith/E7DJBTGDQLP5GIKUXUL22YHO4Z/action/replication_record"}},"created_at":"2026-07-05T03:38:01.772441+00:00","updated_at":"2026-07-05T03:38:01.772441+00:00"}