{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2ISCCPVF7WT73NEOFKRX2GVUDK","short_pith_number":"pith:2ISCCPVF","schema_version":"1.0","canonical_sha256":"d224213ea5fda7fdb48e2aa37d1ab41a99335e0c09e67c48bd887346c0c98593","source":{"kind":"arxiv","id":"1203.4619","version":1},"attestation_state":"computed","paper":{"title":"Online Load Balancing on Unrelated Machines with Startup Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, Yossi Azar","submitted_at":"2012-03-20T23:06:10Z","abstract_excerpt":"Motivated by applications in energy-efficient scheduling in data centers, Khuller, Li, and Saha introduced the {\\em machine activation} problem as a generalization of the classical optimization problems of set cover and load balancing on unrelated machines. In this problem, a set of $n$ jobs have to be distributed among a set of $m$ (unrelated) machines, given the processing time of each job on each machine, where each machine has a startup cost. The goal is to produce a schedule of minimum total startup cost subject to a constraint $\\bf L$ on its makespan. While Khuller {\\em et al} considered"},"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":"1203.4619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-20T23:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"7c20429745538b9f089a81cbe6fb4228eaf316807b7147aad6db103623d34095","abstract_canon_sha256":"6475644ecd9a5a7f2de18e03e0b4ff74cdc11dfa9c4ed5388fe20a89d07698e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:37.614444Z","signature_b64":"LKbcDj1uLQ3E30Q+nRUH7EdLdZIPCgwDuiG3a8mmfAAKh47Ny2tbGiVGnOY5nMXBes2jHNHALpdMmCLURO3BDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d224213ea5fda7fdb48e2aa37d1ab41a99335e0c09e67c48bd887346c0c98593","last_reissued_at":"2026-05-18T03:59:37.613229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:37.613229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Load Balancing on Unrelated Machines with Startup Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, Yossi Azar","submitted_at":"2012-03-20T23:06:10Z","abstract_excerpt":"Motivated by applications in energy-efficient scheduling in data centers, Khuller, Li, and Saha introduced the {\\em machine activation} problem as a generalization of the classical optimization problems of set cover and load balancing on unrelated machines. In this problem, a set of $n$ jobs have to be distributed among a set of $m$ (unrelated) machines, given the processing time of each job on each machine, where each machine has a startup cost. The goal is to produce a schedule of minimum total startup cost subject to a constraint $\\bf L$ on its makespan. While Khuller {\\em et al} considered"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4619","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":"1203.4619","created_at":"2026-05-18T03:59:37.613379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4619v1","created_at":"2026-05-18T03:59:37.613379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4619","created_at":"2026-05-18T03:59:37.613379+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ISCCPVF7WT7","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ISCCPVF7WT73NEO","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ISCCPVF","created_at":"2026-05-18T12:26:50.516681+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/2ISCCPVF7WT73NEOFKRX2GVUDK","json":"https://pith.science/pith/2ISCCPVF7WT73NEOFKRX2GVUDK.json","graph_json":"https://pith.science/api/pith-number/2ISCCPVF7WT73NEOFKRX2GVUDK/graph.json","events_json":"https://pith.science/api/pith-number/2ISCCPVF7WT73NEOFKRX2GVUDK/events.json","paper":"https://pith.science/paper/2ISCCPVF"},"agent_actions":{"view_html":"https://pith.science/pith/2ISCCPVF7WT73NEOFKRX2GVUDK","download_json":"https://pith.science/pith/2ISCCPVF7WT73NEOFKRX2GVUDK.json","view_paper":"https://pith.science/paper/2ISCCPVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4619&json=true","fetch_graph":"https://pith.science/api/pith-number/2ISCCPVF7WT73NEOFKRX2GVUDK/graph.json","fetch_events":"https://pith.science/api/pith-number/2ISCCPVF7WT73NEOFKRX2GVUDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ISCCPVF7WT73NEOFKRX2GVUDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ISCCPVF7WT73NEOFKRX2GVUDK/action/storage_attestation","attest_author":"https://pith.science/pith/2ISCCPVF7WT73NEOFKRX2GVUDK/action/author_attestation","sign_citation":"https://pith.science/pith/2ISCCPVF7WT73NEOFKRX2GVUDK/action/citation_signature","submit_replication":"https://pith.science/pith/2ISCCPVF7WT73NEOFKRX2GVUDK/action/replication_record"}},"created_at":"2026-05-18T03:59:37.613379+00:00","updated_at":"2026-05-18T03:59:37.613379+00:00"}