{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HF6F4OCZZJ5QQA3ZST5BQDEIDH","short_pith_number":"pith:HF6F4OCZ","schema_version":"1.0","canonical_sha256":"397c5e3859ca7b08037994fa180c8819dfa6b8fb1ef486155c6ead3b869226ec","source":{"kind":"arxiv","id":"1802.02919","version":1},"attestation_state":"computed","paper":{"title":"Adaptive online scheduling of tasks with anytime property on heterogeneous resources","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Istv\\'an M\\'odos, Jan Smejkal, P\\v{r}emysl \\v{S}\\r{u}cha, Roman V\\'aclav\\'ik, Zden\\v{e}k Hanz\\'alek","submitted_at":"2018-02-08T15:27:19Z","abstract_excerpt":"An acceptable response time of a server is an important aspect in many client-server applications; this is evident in situations in which the server is overloaded by many computationally intensive requests. In this work, we consider that the requests, or in this case tasks, generated by the clients are instances of optimization problems solved by anytime algorithms, i.e. the quality of the solution increases with the processing time of a task. These tasks are submitted to the server which schedules them to the available computational resources where the tasks are processed. To tackle the overl"},"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":"1802.02919","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2018-02-08T15:27:19Z","cross_cats_sorted":[],"title_canon_sha256":"0c9c1d7b821ca5bc281ea3d1a7853d93e77128b11af666cb8978cdeb86728551","abstract_canon_sha256":"d1d70f4fd67cf0edf8a90ca5e78e03e17dd52d4c1b931a8a4716cc8630ef4b5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:02.805410Z","signature_b64":"UurdqJrGPbLeDfxQ53Gs6NqULmrfNfkCalyUe5i7+WCd4H49bOLotoT2hAPu/MXOtfeqYxQeOfCyfyBOrNmwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"397c5e3859ca7b08037994fa180c8819dfa6b8fb1ef486155c6ead3b869226ec","last_reissued_at":"2026-05-18T00:24:02.804951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:02.804951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive online scheduling of tasks with anytime property on heterogeneous resources","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Istv\\'an M\\'odos, Jan Smejkal, P\\v{r}emysl \\v{S}\\r{u}cha, Roman V\\'aclav\\'ik, Zden\\v{e}k Hanz\\'alek","submitted_at":"2018-02-08T15:27:19Z","abstract_excerpt":"An acceptable response time of a server is an important aspect in many client-server applications; this is evident in situations in which the server is overloaded by many computationally intensive requests. In this work, we consider that the requests, or in this case tasks, generated by the clients are instances of optimization problems solved by anytime algorithms, i.e. the quality of the solution increases with the processing time of a task. These tasks are submitted to the server which schedules them to the available computational resources where the tasks are processed. To tackle the overl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02919","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.02919","created_at":"2026-05-18T00:24:02.805026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02919v1","created_at":"2026-05-18T00:24:02.805026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02919","created_at":"2026-05-18T00:24:02.805026+00:00"},{"alias_kind":"pith_short_12","alias_value":"HF6F4OCZZJ5Q","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HF6F4OCZZJ5QQA3Z","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HF6F4OCZ","created_at":"2026-05-18T12:32:28.185984+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/HF6F4OCZZJ5QQA3ZST5BQDEIDH","json":"https://pith.science/pith/HF6F4OCZZJ5QQA3ZST5BQDEIDH.json","graph_json":"https://pith.science/api/pith-number/HF6F4OCZZJ5QQA3ZST5BQDEIDH/graph.json","events_json":"https://pith.science/api/pith-number/HF6F4OCZZJ5QQA3ZST5BQDEIDH/events.json","paper":"https://pith.science/paper/HF6F4OCZ"},"agent_actions":{"view_html":"https://pith.science/pith/HF6F4OCZZJ5QQA3ZST5BQDEIDH","download_json":"https://pith.science/pith/HF6F4OCZZJ5QQA3ZST5BQDEIDH.json","view_paper":"https://pith.science/paper/HF6F4OCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02919&json=true","fetch_graph":"https://pith.science/api/pith-number/HF6F4OCZZJ5QQA3ZST5BQDEIDH/graph.json","fetch_events":"https://pith.science/api/pith-number/HF6F4OCZZJ5QQA3ZST5BQDEIDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HF6F4OCZZJ5QQA3ZST5BQDEIDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HF6F4OCZZJ5QQA3ZST5BQDEIDH/action/storage_attestation","attest_author":"https://pith.science/pith/HF6F4OCZZJ5QQA3ZST5BQDEIDH/action/author_attestation","sign_citation":"https://pith.science/pith/HF6F4OCZZJ5QQA3ZST5BQDEIDH/action/citation_signature","submit_replication":"https://pith.science/pith/HF6F4OCZZJ5QQA3ZST5BQDEIDH/action/replication_record"}},"created_at":"2026-05-18T00:24:02.805026+00:00","updated_at":"2026-05-18T00:24:02.805026+00:00"}