{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KULKRF7FDZBSW25NI5XRT5GCIL","short_pith_number":"pith:KULKRF7F","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"},"canonical_sha256":"5516a897e51e432b6bad476f19f4c242d45c7ff3059e69056be3df6118ac85c2","source":{"kind":"arxiv","id":"1904.07271","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07271","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07271v1","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07271","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"KULKRF7FDZBS","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KULKRF7FDZBSW25N","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KULKRF7F","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KULKRF7FDZBSW25NI5XRT5GCIL","target":"record","payload":{"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"},"canonical_sha256":"5516a897e51e432b6bad476f19f4c242d45c7ff3059e69056be3df6118ac85c2","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"},"source_kind":"arxiv","source_id":"1904.07271","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:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s1v8+K+Qex8IVW01hvkPcEOc5HMtcIIB9KThG3fH0otwRu16+wm7F+Fh2ghH14/3L0VAlNL1GUc6Z6/83pPpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:33:46.935703Z"},"content_sha256":"fb2e13b1e9379538657b222a343a53951578da10df3ffaf4a1e86102d138c3b1","schema_version":"1.0","event_id":"sha256:fb2e13b1e9379538657b222a343a53951578da10df3ffaf4a1e86102d138c3b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KULKRF7FDZBSW25NI5XRT5GCIL","target":"graph","payload":{"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"},"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:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ylv25WrPx/0QmcdAvWyiEwW2bpzgvJVt8Sbjh8o8qadWDisrqOgH/L5KiVIq5WTq6Xzid9au4jjSOlYj7xjPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:33:46.936039Z"},"content_sha256":"5db9f80b89557d9025e193cf225b097c97668ae29dc75b7f7b9be492596a0380","schema_version":"1.0","event_id":"sha256:5db9f80b89557d9025e193cf225b097c97668ae29dc75b7f7b9be492596a0380"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL/bundle.json","state_url":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KULKRF7FDZBSW25NI5XRT5GCIL/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-01T21:33:46Z","links":{"resolver":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL","bundle":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL/bundle.json","state":"https://pith.science/pith/KULKRF7FDZBSW25NI5XRT5GCIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KULKRF7FDZBSW25NI5XRT5GCIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KULKRF7FDZBSW25NI5XRT5GCIL","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":"763194a7043de6a48d18bb0baf5d25ea068b6ddce43e6d65f10f252cea713bca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T18:16:37Z","title_canon_sha256":"95caba3af04861d02c1e93ec98cfd9bcd8685421961c88e21ff799c74d5d82ff"},"schema_version":"1.0","source":{"id":"1904.07271","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07271","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07271v1","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07271","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"KULKRF7FDZBS","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KULKRF7FDZBSW25N","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KULKRF7F","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:5db9f80b89557d9025e193cf225b097c97668ae29dc75b7f7b9be492596a0380","target":"graph","created_at":"2026-05-17T23:48:29Z","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 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","authors_text":"Amit Kumar, Anupam Gupta, Viswanath Nagarajan, Xiangkun Shen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T18:16:37Z","title":"Stochastic Load Balancing on Unrelated Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07271","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:fb2e13b1e9379538657b222a343a53951578da10df3ffaf4a1e86102d138c3b1","target":"record","created_at":"2026-05-17T23:48:29Z","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":"763194a7043de6a48d18bb0baf5d25ea068b6ddce43e6d65f10f252cea713bca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T18:16:37Z","title_canon_sha256":"95caba3af04861d02c1e93ec98cfd9bcd8685421961c88e21ff799c74d5d82ff"},"schema_version":"1.0","source":{"id":"1904.07271","kind":"arxiv","version":1}},"canonical_sha256":"5516a897e51e432b6bad476f19f4c242d45c7ff3059e69056be3df6118ac85c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5516a897e51e432b6bad476f19f4c242d45c7ff3059e69056be3df6118ac85c2","first_computed_at":"2026-05-17T23:48:29.126805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:29.126805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Arz7ZFpDFpB7HL3vzkYCszZLC5D++g7FWZp5UMvWK6wvMASJtbCglkPj98Dv7UWKGYeZgvZa8pQw8WMHFFrBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:29.127290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07271","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb2e13b1e9379538657b222a343a53951578da10df3ffaf4a1e86102d138c3b1","sha256:5db9f80b89557d9025e193cf225b097c97668ae29dc75b7f7b9be492596a0380"],"state_sha256":"ac8afc285cd8309642b0699b9add80428cfb4360dc13db3039b0412951e95a19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAAGZvdmXor/sv/RhK2OmY9lF4kBtI+ko+asR++ukq6Pb999/vJhkHYQYq2WjBk+ZEekyhHKKnEZI8ygtFTPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:33:46.937927Z","bundle_sha256":"b1c14ba8f236878d1f6c0273a0c86a2cbbc9fd0e4743227d34281c86425e6301"}}