{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UNYBII5FVSD23AQJAP5HVOWOKV","short_pith_number":"pith:UNYBII5F","schema_version":"1.0","canonical_sha256":"a3701423a5ac87ad820903fa7abace557d121553689e88c6d4724345951c71e9","source":{"kind":"arxiv","id":"1211.6216","version":3},"attestation_state":"computed","paper":{"title":"Dual techniques for scheduling on a machine with varying speed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jos\\'e Verschae, Nicole Megow","submitted_at":"2012-11-27T05:45:55Z","abstract_excerpt":"We study scheduling problems on a machine with varying speed. Assuming a known speed function we ask for a cost-efficient scheduling solution. Our main result is a PTAS for minimizing the total weighted completion time in this setting. This also implies a PTAS for the closely related problem of scheduling to minimize generalized global cost functions. The key to our results is a re-interpretation of the problem within the well-known two-dimensional Gantt chart: instead of the standard approach of scheduling in the {\\em time-dimension}, we construct scheduling solutions in the weight-dimension."},"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":"1211.6216","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-27T05:45:55Z","cross_cats_sorted":[],"title_canon_sha256":"cde41d53294eee23aa81992322fd526e4fb9cb182cee6aa5b567c36033f87b49","abstract_canon_sha256":"7aa668c61c9ec139b5819636aab5f36a0303ce466d14dc379eecc2b23329121f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:06.850637Z","signature_b64":"GRcK/22qJbrH+05fnI0lvjgD3WyTQmg1L4jH2pd1FlxyTs83e0cFP4Le/N7SAkshB40+Y1VQ02vC2UjWRmNMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3701423a5ac87ad820903fa7abace557d121553689e88c6d4724345951c71e9","last_reissued_at":"2026-05-18T02:57:06.850211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:06.850211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual techniques for scheduling on a machine with varying speed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jos\\'e Verschae, Nicole Megow","submitted_at":"2012-11-27T05:45:55Z","abstract_excerpt":"We study scheduling problems on a machine with varying speed. Assuming a known speed function we ask for a cost-efficient scheduling solution. Our main result is a PTAS for minimizing the total weighted completion time in this setting. This also implies a PTAS for the closely related problem of scheduling to minimize generalized global cost functions. The key to our results is a re-interpretation of the problem within the well-known two-dimensional Gantt chart: instead of the standard approach of scheduling in the {\\em time-dimension}, we construct scheduling solutions in the weight-dimension."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6216","kind":"arxiv","version":3},"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":"1211.6216","created_at":"2026-05-18T02:57:06.850276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.6216v3","created_at":"2026-05-18T02:57:06.850276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6216","created_at":"2026-05-18T02:57:06.850276+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNYBII5FVSD2","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNYBII5FVSD23AQJ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNYBII5F","created_at":"2026-05-18T12:27:23.164592+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/UNYBII5FVSD23AQJAP5HVOWOKV","json":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV.json","graph_json":"https://pith.science/api/pith-number/UNYBII5FVSD23AQJAP5HVOWOKV/graph.json","events_json":"https://pith.science/api/pith-number/UNYBII5FVSD23AQJAP5HVOWOKV/events.json","paper":"https://pith.science/paper/UNYBII5F"},"agent_actions":{"view_html":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV","download_json":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV.json","view_paper":"https://pith.science/paper/UNYBII5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.6216&json=true","fetch_graph":"https://pith.science/api/pith-number/UNYBII5FVSD23AQJAP5HVOWOKV/graph.json","fetch_events":"https://pith.science/api/pith-number/UNYBII5FVSD23AQJAP5HVOWOKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV/action/storage_attestation","attest_author":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV/action/author_attestation","sign_citation":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV/action/citation_signature","submit_replication":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV/action/replication_record"}},"created_at":"2026-05-18T02:57:06.850276+00:00","updated_at":"2026-05-18T02:57:06.850276+00:00"}