{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WZE6YFVGNF3UPTXJJVYYI6LYOF","short_pith_number":"pith:WZE6YFVG","schema_version":"1.0","canonical_sha256":"b649ec16a6697747cee94d718479787176d890af52f882108a9302c1af668b76","source":{"kind":"arxiv","id":"1208.0312","version":1},"attestation_state":"computed","paper":{"title":"A Model for Minimizing Active Processor Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Harold N. Gabow, Jessica Chang, Samir Khuller","submitted_at":"2012-08-01T18:34:36Z","abstract_excerpt":"We introduce the following elementary scheduling problem. We are given a collection of n jobs, where each job has an integer length as well as a set Ti of time intervals in which it can be feasibly scheduled. Given a parameter B, the processor can schedule up to B jobs at a timeslot t so long as it is \"active\" at t. The goal is to schedule all the jobs in the fewest number of active timeslots. The machine consumes a fixed amount of energy per active timeslot, regardless of the number of jobs scheduled in that slot (as long as the number of jobs is non-zero). In other words, subject to all unit"},"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":"1208.0312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-01T18:34:36Z","cross_cats_sorted":[],"title_canon_sha256":"3fa5dc57b8d51b36e96ef8533ba3b276ab7e63f477baba3b259c620b79fa5b68","abstract_canon_sha256":"f02c0e69eb67e40ff045dd35b72fb601d07ae6093357c5310d637ed8b657779c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:35.368024Z","signature_b64":"heCYOMKPd5/U/e4H6+JK9i3XGgtEUUDsXWxspAisTNl9zMEFKwg3DRzB9UzZrVgFhlr89baxhm7LDbsPxW8vDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b649ec16a6697747cee94d718479787176d890af52f882108a9302c1af668b76","last_reissued_at":"2026-05-18T03:49:35.367373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:35.367373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Model for Minimizing Active Processor Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Harold N. Gabow, Jessica Chang, Samir Khuller","submitted_at":"2012-08-01T18:34:36Z","abstract_excerpt":"We introduce the following elementary scheduling problem. We are given a collection of n jobs, where each job has an integer length as well as a set Ti of time intervals in which it can be feasibly scheduled. Given a parameter B, the processor can schedule up to B jobs at a timeslot t so long as it is \"active\" at t. The goal is to schedule all the jobs in the fewest number of active timeslots. The machine consumes a fixed amount of energy per active timeslot, regardless of the number of jobs scheduled in that slot (as long as the number of jobs is non-zero). In other words, subject to all unit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0312","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":"1208.0312","created_at":"2026-05-18T03:49:35.367471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0312v1","created_at":"2026-05-18T03:49:35.367471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0312","created_at":"2026-05-18T03:49:35.367471+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZE6YFVGNF3U","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZE6YFVGNF3UPTXJ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZE6YFVG","created_at":"2026-05-18T12:27:27.928770+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/WZE6YFVGNF3UPTXJJVYYI6LYOF","json":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF.json","graph_json":"https://pith.science/api/pith-number/WZE6YFVGNF3UPTXJJVYYI6LYOF/graph.json","events_json":"https://pith.science/api/pith-number/WZE6YFVGNF3UPTXJJVYYI6LYOF/events.json","paper":"https://pith.science/paper/WZE6YFVG"},"agent_actions":{"view_html":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF","download_json":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF.json","view_paper":"https://pith.science/paper/WZE6YFVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0312&json=true","fetch_graph":"https://pith.science/api/pith-number/WZE6YFVGNF3UPTXJJVYYI6LYOF/graph.json","fetch_events":"https://pith.science/api/pith-number/WZE6YFVGNF3UPTXJJVYYI6LYOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF/action/storage_attestation","attest_author":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF/action/author_attestation","sign_citation":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF/action/citation_signature","submit_replication":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF/action/replication_record"}},"created_at":"2026-05-18T03:49:35.367471+00:00","updated_at":"2026-05-18T03:49:35.367471+00:00"}