{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KULKRF7FDZBSW25NI5XRT5GCIL","short_pith_number":"pith:KULKRF7F","schema_version":"1.0","canonical_sha256":"5516a897e51e432b6bad476f19f4c242d45c7ff3059e69056be3df6118ac85c2","source":{"kind":"arxiv","id":"1904.07271","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Load Balancing on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anupam Gupta, Viswanath Nagarajan, Xiangkun Shen","submitted_at":"2019-04-15T18:16:37Z","abstract_excerpt":"We consider the problem of makespan minimization on unrelated machines when job sizes are stochastic. The goal is to find a fixed assignment of jobs to machines, to minimize the expected value of the maximum load over all the machines. For the identical machines special case when the size of a job is the same across all machines, a constant-factor approximation algorithm has long been known. Our main result is the first constant-factor approximation algorithm for the general case of unrelated machines. This is achieved by (i) formulating a lower bound using an exponential-size linear program t"},"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":"1904.07271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T18:16:37Z","cross_cats_sorted":[],"title_canon_sha256":"95caba3af04861d02c1e93ec98cfd9bcd8685421961c88e21ff799c74d5d82ff","abstract_canon_sha256":"763194a7043de6a48d18bb0baf5d25ea068b6ddce43e6d65f10f252cea713bca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:29.127290Z","signature_b64":"9Arz7ZFpDFpB7HL3vzkYCszZLC5D++g7FWZp5UMvWK6wvMASJtbCglkPj98Dv7UWKGYeZgvZa8pQw8WMHFFrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5516a897e51e432b6bad476f19f4c242d45c7ff3059e69056be3df6118ac85c2","last_reissued_at":"2026-05-17T23:48:29.126805Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:29.126805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Load Balancing on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anupam Gupta, Viswanath Nagarajan, Xiangkun Shen","submitted_at":"2019-04-15T18:16:37Z","abstract_excerpt":"We consider the problem of makespan minimization on unrelated machines when job sizes are stochastic. The goal is to find a fixed assignment of jobs to machines, to minimize the expected value of the maximum load over all the machines. For the identical machines special case when the size of a job is the same across all machines, a constant-factor approximation algorithm has long been known. Our main result is the first constant-factor approximation algorithm for the general case of unrelated machines. This is achieved by (i) formulating a lower bound using an exponential-size linear program t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07271","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":"1904.07271","created_at":"2026-05-17T23:48:29.126876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.07271v1","created_at":"2026-05-17T23:48:29.126876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07271","created_at":"2026-05-17T23:48:29.126876+00:00"},{"alias_kind":"pith_short_12","alias_value":"KULKRF7FDZBS","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KULKRF7FDZBSW25N","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KULKRF7F","created_at":"2026-05-18T12:33:21.387695+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/KULKRF7FDZBSW25NI5XRT5GCIL","json":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL.json","graph_json":"https://pith.science/api/pith-number/KULKRF7FDZBSW25NI5XRT5GCIL/graph.json","events_json":"https://pith.science/api/pith-number/KULKRF7FDZBSW25NI5XRT5GCIL/events.json","paper":"https://pith.science/paper/KULKRF7F"},"agent_actions":{"view_html":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL","download_json":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL.json","view_paper":"https://pith.science/paper/KULKRF7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.07271&json=true","fetch_graph":"https://pith.science/api/pith-number/KULKRF7FDZBSW25NI5XRT5GCIL/graph.json","fetch_events":"https://pith.science/api/pith-number/KULKRF7FDZBSW25NI5XRT5GCIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL/action/storage_attestation","attest_author":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL/action/author_attestation","sign_citation":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL/action/citation_signature","submit_replication":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL/action/replication_record"}},"created_at":"2026-05-17T23:48:29.126876+00:00","updated_at":"2026-05-17T23:48:29.126876+00:00"}