{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WZE6YFVGNF3UPTXJJVYYI6LYOF","short_pith_number":"pith:WZE6YFVG","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"},"canonical_sha256":"b649ec16a6697747cee94d718479787176d890af52f882108a9302c1af668b76","source":{"kind":"arxiv","id":"1208.0312","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0312","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0312v1","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0312","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"WZE6YFVGNF3U","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WZE6YFVGNF3UPTXJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WZE6YFVG","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WZE6YFVGNF3UPTXJJVYYI6LYOF","target":"record","payload":{"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"},"canonical_sha256":"b649ec16a6697747cee94d718479787176d890af52f882108a9302c1af668b76","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"},"source_kind":"arxiv","source_id":"1208.0312","source_version":1,"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-18T03:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7z1AIM9V0CeXrwjURirvbzejw+jx/XxgmOROswxKsgNTcUafYwcxPKEmVLrzb0gEZ40jt93d8F4EQrN5SMIlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:19:39.763960Z"},"content_sha256":"7bbc7afeb851d02b3d315663a7b9d65418bf2165dcfe8174af37b4c8e9dd6daf","schema_version":"1.0","event_id":"sha256:7bbc7afeb851d02b3d315663a7b9d65418bf2165dcfe8174af37b4c8e9dd6daf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WZE6YFVGNF3UPTXJJVYYI6LYOF","target":"graph","payload":{"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"},"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-18T03:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hG+0EcrCjDrisYIHYLCrZWaH7C0lAoHd+xKnUxI5jzZ+ypZBLhUfigGASXDzitFygNJW3f6XOKiBTkab6cNUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:19:39.764349Z"},"content_sha256":"87fbbc88f40c52d460da1894eb6a2ae46826dea7438714557b20a6bad67cf4e0","schema_version":"1.0","event_id":"sha256:87fbbc88f40c52d460da1894eb6a2ae46826dea7438714557b20a6bad67cf4e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF/bundle.json","state_url":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF/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-01T02:19:39Z","links":{"resolver":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF","bundle":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF/bundle.json","state":"https://pith.science/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZE6YFVGNF3UPTXJJVYYI6LYOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WZE6YFVGNF3UPTXJJVYYI6LYOF","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":"f02c0e69eb67e40ff045dd35b72fb601d07ae6093357c5310d637ed8b657779c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-01T18:34:36Z","title_canon_sha256":"3fa5dc57b8d51b36e96ef8533ba3b276ab7e63f477baba3b259c620b79fa5b68"},"schema_version":"1.0","source":{"id":"1208.0312","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0312","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0312v1","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0312","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"WZE6YFVGNF3U","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WZE6YFVGNF3UPTXJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WZE6YFVG","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:87fbbc88f40c52d460da1894eb6a2ae46826dea7438714557b20a6bad67cf4e0","target":"graph","created_at":"2026-05-18T03:49:35Z","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 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","authors_text":"Harold N. Gabow, Jessica Chang, Samir Khuller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-01T18:34:36Z","title":"A Model for Minimizing Active Processor Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0312","kind":"arxiv","version":1},"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:7bbc7afeb851d02b3d315663a7b9d65418bf2165dcfe8174af37b4c8e9dd6daf","target":"record","created_at":"2026-05-18T03:49:35Z","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":"f02c0e69eb67e40ff045dd35b72fb601d07ae6093357c5310d637ed8b657779c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-01T18:34:36Z","title_canon_sha256":"3fa5dc57b8d51b36e96ef8533ba3b276ab7e63f477baba3b259c620b79fa5b68"},"schema_version":"1.0","source":{"id":"1208.0312","kind":"arxiv","version":1}},"canonical_sha256":"b649ec16a6697747cee94d718479787176d890af52f882108a9302c1af668b76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b649ec16a6697747cee94d718479787176d890af52f882108a9302c1af668b76","first_computed_at":"2026-05-18T03:49:35.367373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:35.367373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"heCYOMKPd5/U/e4H6+JK9i3XGgtEUUDsXWxspAisTNl9zMEFKwg3DRzB9UzZrVgFhlr89baxhm7LDbsPxW8vDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:35.368024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0312","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bbc7afeb851d02b3d315663a7b9d65418bf2165dcfe8174af37b4c8e9dd6daf","sha256:87fbbc88f40c52d460da1894eb6a2ae46826dea7438714557b20a6bad67cf4e0"],"state_sha256":"4f39d347613e5312b759d4a64696dd5bfff69d7ed4c79953cf7836ff921ca26a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mj9IEhi0p5PxepJt6LuCAJLyajdYVya8pOQDJhn9+y6IdT2sBFMywQWKu7XjF+f3tFf8lAgCbFr0NVIhBxP9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:19:39.766868Z","bundle_sha256":"f9862e2dc9a201812b93d7f165a454f49654a1ea7915e0d0c06608df0e4f2cde"}}