{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6AAB57DUV6UTQQBU2W5C5RFLIP","short_pith_number":"pith:6AAB57DU","schema_version":"1.0","canonical_sha256":"f0001efc74afa9384034d5ba2ec4ab43c39a73e1486b136819e1bed3e223a00c","source":{"kind":"arxiv","id":"1901.05998","version":1},"attestation_state":"computed","paper":{"title":"Scheduling Jobs with Random Resource Requirements in Computing Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Javad Ghaderi, Konstantinos Psychas","submitted_at":"2019-01-17T20:17:33Z","abstract_excerpt":"We consider a natural scheduling problem which arises in many distributed computing frameworks. Jobs with diverse resource requirements (e.g. memory requirements) arrive over time and must be served by a cluster of servers, each with a finite resource capacity. To improve throughput and delay, the scheduler can pack as many jobs as possible in the servers subject to their capacity constraints. Motivated by the ever-increasing complexity of workloads in shared clusters, we consider a setting where the jobs' resource requirements belong to a very large number of diverse types or, in the extreme,"},"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":"1901.05998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-17T20:17:33Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ba9943d020a930418551cfc9d19c33bed05082ea65a6bd2276e197ad9c34a324","abstract_canon_sha256":"c947638f42afe0d5268f5a059ab74f9ac16978b2c2956de82cb56c1aedd7b756"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:04.839192Z","signature_b64":"tMgaN4oPqf/kJpCWotjV1QS88ldTnmJXQ20i2h+QoAc5MWprCGTs/ju6rUydRyMRXg4qzbKQrsC5CuLs3NjODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0001efc74afa9384034d5ba2ec4ab43c39a73e1486b136819e1bed3e223a00c","last_reissued_at":"2026-05-17T23:56:04.838598Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:04.838598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling Jobs with Random Resource Requirements in Computing Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Javad Ghaderi, Konstantinos Psychas","submitted_at":"2019-01-17T20:17:33Z","abstract_excerpt":"We consider a natural scheduling problem which arises in many distributed computing frameworks. Jobs with diverse resource requirements (e.g. memory requirements) arrive over time and must be served by a cluster of servers, each with a finite resource capacity. To improve throughput and delay, the scheduler can pack as many jobs as possible in the servers subject to their capacity constraints. Motivated by the ever-increasing complexity of workloads in shared clusters, we consider a setting where the jobs' resource requirements belong to a very large number of diverse types or, in the extreme,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05998","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":"1901.05998","created_at":"2026-05-17T23:56:04.838683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05998v1","created_at":"2026-05-17T23:56:04.838683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05998","created_at":"2026-05-17T23:56:04.838683+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AAB57DUV6UT","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AAB57DUV6UTQQBU","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AAB57DU","created_at":"2026-05-18T12:33:10.108867+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/6AAB57DUV6UTQQBU2W5C5RFLIP","json":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP.json","graph_json":"https://pith.science/api/pith-number/6AAB57DUV6UTQQBU2W5C5RFLIP/graph.json","events_json":"https://pith.science/api/pith-number/6AAB57DUV6UTQQBU2W5C5RFLIP/events.json","paper":"https://pith.science/paper/6AAB57DU"},"agent_actions":{"view_html":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP","download_json":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP.json","view_paper":"https://pith.science/paper/6AAB57DU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05998&json=true","fetch_graph":"https://pith.science/api/pith-number/6AAB57DUV6UTQQBU2W5C5RFLIP/graph.json","fetch_events":"https://pith.science/api/pith-number/6AAB57DUV6UTQQBU2W5C5RFLIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP/action/storage_attestation","attest_author":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP/action/author_attestation","sign_citation":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP/action/citation_signature","submit_replication":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP/action/replication_record"}},"created_at":"2026-05-17T23:56:04.838683+00:00","updated_at":"2026-05-17T23:56:04.838683+00:00"}