{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UNYBII5FVSD23AQJAP5HVOWOKV","short_pith_number":"pith:UNYBII5F","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"},"canonical_sha256":"a3701423a5ac87ad820903fa7abace557d121553689e88c6d4724345951c71e9","source":{"kind":"arxiv","id":"1211.6216","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6216","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6216v3","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6216","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"pith_short_12","alias_value":"UNYBII5FVSD2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UNYBII5FVSD23AQJ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UNYBII5F","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UNYBII5FVSD23AQJAP5HVOWOKV","target":"record","payload":{"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"},"canonical_sha256":"a3701423a5ac87ad820903fa7abace557d121553689e88c6d4724345951c71e9","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"},"source_kind":"arxiv","source_id":"1211.6216","source_version":3,"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-18T02:57:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xDhx57o8qm55C9v2rvU7BFWpoeEmzQ7xq9hr3KdjKk7I+sIQLISlU0sNEzJT845Kt9vJWtiKfx/oA9HK5XVUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:01:58.349889Z"},"content_sha256":"5ca5aaebba59ef8f234df59e27272d8ba02628a2d763072c8de50d4f09855189","schema_version":"1.0","event_id":"sha256:5ca5aaebba59ef8f234df59e27272d8ba02628a2d763072c8de50d4f09855189"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UNYBII5FVSD23AQJAP5HVOWOKV","target":"graph","payload":{"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"},"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-18T02:57:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gnBuAWtdN/L2sDnqp+95fYSAKv0dFjwwSv/GTTq6NEMYgk8fmJIXOiCWmTB6X/WpjU4UTFHVxkHrvsujhOE9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:01:58.350229Z"},"content_sha256":"5345a68dbce777fe28a37817f2aa4e5281856e0a69fa89f6743e35ecb83304e4","schema_version":"1.0","event_id":"sha256:5345a68dbce777fe28a37817f2aa4e5281856e0a69fa89f6743e35ecb83304e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV/bundle.json","state_url":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNYBII5FVSD23AQJAP5HVOWOKV/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-03T11:01:58Z","links":{"resolver":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV","bundle":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV/bundle.json","state":"https://pith.science/pith/UNYBII5FVSD23AQJAP5HVOWOKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNYBII5FVSD23AQJAP5HVOWOKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UNYBII5FVSD23AQJAP5HVOWOKV","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":"7aa668c61c9ec139b5819636aab5f36a0303ce466d14dc379eecc2b23329121f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-27T05:45:55Z","title_canon_sha256":"cde41d53294eee23aa81992322fd526e4fb9cb182cee6aa5b567c36033f87b49"},"schema_version":"1.0","source":{"id":"1211.6216","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6216","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6216v3","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6216","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"pith_short_12","alias_value":"UNYBII5FVSD2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UNYBII5FVSD23AQJ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UNYBII5F","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:5345a68dbce777fe28a37817f2aa4e5281856e0a69fa89f6743e35ecb83304e4","target":"graph","created_at":"2026-05-18T02:57:06Z","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 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.","authors_text":"Jos\\'e Verschae, Nicole Megow","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-27T05:45:55Z","title":"Dual techniques for scheduling on a machine with varying speed"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6216","kind":"arxiv","version":3},"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:5ca5aaebba59ef8f234df59e27272d8ba02628a2d763072c8de50d4f09855189","target":"record","created_at":"2026-05-18T02:57:06Z","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":"7aa668c61c9ec139b5819636aab5f36a0303ce466d14dc379eecc2b23329121f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-27T05:45:55Z","title_canon_sha256":"cde41d53294eee23aa81992322fd526e4fb9cb182cee6aa5b567c36033f87b49"},"schema_version":"1.0","source":{"id":"1211.6216","kind":"arxiv","version":3}},"canonical_sha256":"a3701423a5ac87ad820903fa7abace557d121553689e88c6d4724345951c71e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3701423a5ac87ad820903fa7abace557d121553689e88c6d4724345951c71e9","first_computed_at":"2026-05-18T02:57:06.850211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:06.850211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GRcK/22qJbrH+05fnI0lvjgD3WyTQmg1L4jH2pd1FlxyTs83e0cFP4Le/N7SAkshB40+Y1VQ02vC2UjWRmNMBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:06.850637Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6216","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ca5aaebba59ef8f234df59e27272d8ba02628a2d763072c8de50d4f09855189","sha256:5345a68dbce777fe28a37817f2aa4e5281856e0a69fa89f6743e35ecb83304e4"],"state_sha256":"570fc6acbb99de5b2ee69a2a89061a301fc352da4e1626e7ef809e6a9d334183"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U661J9Cs6lra+xL4ctD2k0ExGVTDkgn5tu0VLwnjX2KhJoC9jUKQF28c4UJb9Rn7gPuzj2Cf4NJcSqd0NE+DDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:01:58.352142Z","bundle_sha256":"a02555c8631e57b1a555a4d8927788b5b85adb6bca8e5768a1d59c5f103fd98d"}}