{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6AAB57DUV6UTQQBU2W5C5RFLIP","short_pith_number":"pith:6AAB57DU","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"},"canonical_sha256":"f0001efc74afa9384034d5ba2ec4ab43c39a73e1486b136819e1bed3e223a00c","source":{"kind":"arxiv","id":"1901.05998","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05998","created_at":"2026-05-17T23:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05998v1","created_at":"2026-05-17T23:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05998","created_at":"2026-05-17T23:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"6AAB57DUV6UT","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6AAB57DUV6UTQQBU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6AAB57DU","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6AAB57DUV6UTQQBU2W5C5RFLIP","target":"record","payload":{"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"},"canonical_sha256":"f0001efc74afa9384034d5ba2ec4ab43c39a73e1486b136819e1bed3e223a00c","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"},"source_kind":"arxiv","source_id":"1901.05998","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-17T23:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"US7zlFju7koZQ1k+GTtp1hHE2ROW044kx8/oGq/3fCAgd7SxxmRXKA5VXBhUy5sPNXPq4NkbwDycOQUjjoI4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:13:45.026365Z"},"content_sha256":"48658ddce29f2f7d3d21fae8e28aa2f6c015d5c8fd88da4131827f976eda0d65","schema_version":"1.0","event_id":"sha256:48658ddce29f2f7d3d21fae8e28aa2f6c015d5c8fd88da4131827f976eda0d65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6AAB57DUV6UTQQBU2W5C5RFLIP","target":"graph","payload":{"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"},"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-17T23:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PVbtfjVRb7bV//tuLcQy/1NK7MW2+Xn/sNvu2XfhVFHDljG2IdGlTMujlwamX3wI7TqvSgnAnWkLvOg6LZghCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:13:45.027091Z"},"content_sha256":"3ee3caee8fcf0e7f4bfd83bec496ab55c993c0ba192ba4de5f4b6bdca813cc9f","schema_version":"1.0","event_id":"sha256:3ee3caee8fcf0e7f4bfd83bec496ab55c993c0ba192ba4de5f4b6bdca813cc9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP/bundle.json","state_url":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AAB57DUV6UTQQBU2W5C5RFLIP/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-09T06:13:45Z","links":{"resolver":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP","bundle":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP/bundle.json","state":"https://pith.science/pith/6AAB57DUV6UTQQBU2W5C5RFLIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AAB57DUV6UTQQBU2W5C5RFLIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6AAB57DUV6UTQQBU2W5C5RFLIP","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":"c947638f42afe0d5268f5a059ab74f9ac16978b2c2956de82cb56c1aedd7b756","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-17T20:17:33Z","title_canon_sha256":"ba9943d020a930418551cfc9d19c33bed05082ea65a6bd2276e197ad9c34a324"},"schema_version":"1.0","source":{"id":"1901.05998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05998","created_at":"2026-05-17T23:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05998v1","created_at":"2026-05-17T23:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05998","created_at":"2026-05-17T23:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"6AAB57DUV6UT","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6AAB57DUV6UTQQBU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6AAB57DU","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:3ee3caee8fcf0e7f4bfd83bec496ab55c993c0ba192ba4de5f4b6bdca813cc9f","target":"graph","created_at":"2026-05-17T23:56:04Z","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 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,","authors_text":"Javad Ghaderi, Konstantinos Psychas","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-17T20:17:33Z","title":"Scheduling Jobs with Random Resource Requirements in Computing Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05998","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:48658ddce29f2f7d3d21fae8e28aa2f6c015d5c8fd88da4131827f976eda0d65","target":"record","created_at":"2026-05-17T23:56:04Z","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":"c947638f42afe0d5268f5a059ab74f9ac16978b2c2956de82cb56c1aedd7b756","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-17T20:17:33Z","title_canon_sha256":"ba9943d020a930418551cfc9d19c33bed05082ea65a6bd2276e197ad9c34a324"},"schema_version":"1.0","source":{"id":"1901.05998","kind":"arxiv","version":1}},"canonical_sha256":"f0001efc74afa9384034d5ba2ec4ab43c39a73e1486b136819e1bed3e223a00c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0001efc74afa9384034d5ba2ec4ab43c39a73e1486b136819e1bed3e223a00c","first_computed_at":"2026-05-17T23:56:04.838598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:04.838598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tMgaN4oPqf/kJpCWotjV1QS88ldTnmJXQ20i2h+QoAc5MWprCGTs/ju6rUydRyMRXg4qzbKQrsC5CuLs3NjODw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:04.839192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48658ddce29f2f7d3d21fae8e28aa2f6c015d5c8fd88da4131827f976eda0d65","sha256:3ee3caee8fcf0e7f4bfd83bec496ab55c993c0ba192ba4de5f4b6bdca813cc9f"],"state_sha256":"7e56d52d8b098ca4debcfc3618095bea4b097d9ff723748020d9765a4b94090c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRzcemZCdYdKnf6FQ5/rPDLcP8E5FZjjVLaFWGY1r+rSVjIqhZVm4usYPgml5uOeOhZL5oBeweMO3hU6cJ2nCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:13:45.032244Z","bundle_sha256":"7e15703113b28e7b70677885db09b808286d80e01e848ab4f165f7312fe14cb7"}}