{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QERA63OX3US4V7INIHJJ3KI2TI","short_pith_number":"pith:QERA63OX","schema_version":"1.0","canonical_sha256":"81220f6dd7dd25cafd0d41d29da91a9a232749a1c3282ec84ff30b9187c931a4","source":{"kind":"arxiv","id":"1610.08154","version":1},"attestation_state":"computed","paper":{"title":"LP Rounding and Combinatorial Algorithms for Minimizing Active and Busy Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jessica Chang, Koyel Mukherjee, Samir Khuller","submitted_at":"2016-10-26T03:03:57Z","abstract_excerpt":"We consider fundamental scheduling problems motivated by energy issues. In this framework, we are given a set of jobs, each with a release time, deadline and required processing length. The jobs need to be scheduled on a machine so that at most g jobs are active at any given time. The duration for which a machine is active (i.e., \"on\") is referred to as its active time. The goal is to find a feasible schedule for all jobs, minimizing the total active time. When preemption is allowed at integer time points, we show that a minimal feasible schedule already yields a 3-approximation (and this boun"},"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":"1610.08154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-26T03:03:57Z","cross_cats_sorted":[],"title_canon_sha256":"bea7aea4de00315fa0d603d34b04057141711df01ae3a68e7500ad2515313e04","abstract_canon_sha256":"b707ecfd6ae4ac37ff34de4dde278fac580c452c28e33073a0515b2baac50ff9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:14.901185Z","signature_b64":"krFeFGGV2jada0mIuUY3sz4uxWVBkFY8sE9yasSJQ6QRb978K0t7z4gP53V2UnGMCk/WI+/IePmmfm7TVh8AAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81220f6dd7dd25cafd0d41d29da91a9a232749a1c3282ec84ff30b9187c931a4","last_reissued_at":"2026-05-18T01:01:14.900675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:14.900675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LP Rounding and Combinatorial Algorithms for Minimizing Active and Busy Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jessica Chang, Koyel Mukherjee, Samir Khuller","submitted_at":"2016-10-26T03:03:57Z","abstract_excerpt":"We consider fundamental scheduling problems motivated by energy issues. In this framework, we are given a set of jobs, each with a release time, deadline and required processing length. The jobs need to be scheduled on a machine so that at most g jobs are active at any given time. The duration for which a machine is active (i.e., \"on\") is referred to as its active time. The goal is to find a feasible schedule for all jobs, minimizing the total active time. When preemption is allowed at integer time points, we show that a minimal feasible schedule already yields a 3-approximation (and this boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08154","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":"1610.08154","created_at":"2026-05-18T01:01:14.900761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08154v1","created_at":"2026-05-18T01:01:14.900761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08154","created_at":"2026-05-18T01:01:14.900761+00:00"},{"alias_kind":"pith_short_12","alias_value":"QERA63OX3US4","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QERA63OX3US4V7IN","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QERA63OX","created_at":"2026-05-18T12:30:39.010887+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/QERA63OX3US4V7INIHJJ3KI2TI","json":"https://pith.science/pith/QERA63OX3US4V7INIHJJ3KI2TI.json","graph_json":"https://pith.science/api/pith-number/QERA63OX3US4V7INIHJJ3KI2TI/graph.json","events_json":"https://pith.science/api/pith-number/QERA63OX3US4V7INIHJJ3KI2TI/events.json","paper":"https://pith.science/paper/QERA63OX"},"agent_actions":{"view_html":"https://pith.science/pith/QERA63OX3US4V7INIHJJ3KI2TI","download_json":"https://pith.science/pith/QERA63OX3US4V7INIHJJ3KI2TI.json","view_paper":"https://pith.science/paper/QERA63OX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08154&json=true","fetch_graph":"https://pith.science/api/pith-number/QERA63OX3US4V7INIHJJ3KI2TI/graph.json","fetch_events":"https://pith.science/api/pith-number/QERA63OX3US4V7INIHJJ3KI2TI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QERA63OX3US4V7INIHJJ3KI2TI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QERA63OX3US4V7INIHJJ3KI2TI/action/storage_attestation","attest_author":"https://pith.science/pith/QERA63OX3US4V7INIHJJ3KI2TI/action/author_attestation","sign_citation":"https://pith.science/pith/QERA63OX3US4V7INIHJJ3KI2TI/action/citation_signature","submit_replication":"https://pith.science/pith/QERA63OX3US4V7INIHJJ3KI2TI/action/replication_record"}},"created_at":"2026-05-18T01:01:14.900761+00:00","updated_at":"2026-05-18T01:01:14.900761+00:00"}