{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:Y6ZJKJIZOK7ZSAQDZ4KO5TGHCM","short_pith_number":"pith:Y6ZJKJIZ","canonical_record":{"source":{"id":"1008.4889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-28T20:00:24Z","cross_cats_sorted":[],"title_canon_sha256":"4ae4ae20b516c2271bcc4517b47e0e911d90e81c0fdb140f9301635f23e71636","abstract_canon_sha256":"73b1631a59f1bd151258e32746dc8e397e17a0958d999c9b5f01a5e5eebff762"},"schema_version":"1.0"},"canonical_sha256":"c7b295251972bf990203cf14eeccc7130f135ab9950f78ea5d5befa0647f3505","source":{"kind":"arxiv","id":"1008.4889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4889","created_at":"2026-05-18T04:41:43Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4889v1","created_at":"2026-05-18T04:41:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4889","created_at":"2026-05-18T04:41:43Z"},{"alias_kind":"pith_short_12","alias_value":"Y6ZJKJIZOK7Z","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Y6ZJKJIZOK7ZSAQD","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Y6ZJKJIZ","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:Y6ZJKJIZOK7ZSAQDZ4KO5TGHCM","target":"record","payload":{"canonical_record":{"source":{"id":"1008.4889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-28T20:00:24Z","cross_cats_sorted":[],"title_canon_sha256":"4ae4ae20b516c2271bcc4517b47e0e911d90e81c0fdb140f9301635f23e71636","abstract_canon_sha256":"73b1631a59f1bd151258e32746dc8e397e17a0958d999c9b5f01a5e5eebff762"},"schema_version":"1.0"},"canonical_sha256":"c7b295251972bf990203cf14eeccc7130f135ab9950f78ea5d5befa0647f3505","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:43.480608Z","signature_b64":"atUoNzPcktwHqMpjM/dotTX2k0QyptEFZFht0Jo9oVLChnAJcuJoWt84GtgtVwF8jMnO5SS0D+AbCT9cbFecAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7b295251972bf990203cf14eeccc7130f135ab9950f78ea5d5befa0647f3505","last_reissued_at":"2026-05-18T04:41:43.480101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:43.480101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.4889","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-18T04:41:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3/hIJiKbI3wjECNGxi90ed9GZ+G3WiHAjbFYD3553E2TBo30OuFJ2sslu5Kn1T7F70hOvclO7iS8zWEjfreUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:29:48.806297Z"},"content_sha256":"2b48c6d5f0c79b1cb79b09f9be459de87107e9ce5378521056b2ec3f9fa62faa","schema_version":"1.0","event_id":"sha256:2b48c6d5f0c79b1cb79b09f9be459de87107e9ce5378521056b2ec3f9fa62faa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:Y6ZJKJIZOK7ZSAQDZ4KO5TGHCM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Geometry of Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kirk Pruhs, Nikhil Bansal","submitted_at":"2010-08-28T20:00:24Z","abstract_excerpt":"We consider the following general scheduling problem: The input consists of n jobs, each with an arbitrary release time, size, and a monotone function specifying the cost incurred when the job is completed at a particular time. The objective is to find a preemptive schedule of minimum aggregate cost. This problem formulation is general enough to include many natural scheduling objectives, such as weighted flow, weighted tardiness, and sum of flow squared. Our main result is a randomized polynomial-time algorithm with an approximation ratio O(log log nP), where P is the maximum job size. We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4889","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-18T04:41:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PHhORv6xxRp2aQ6rBUZHpH44PkTb9ky4CATQ7AA4/UGKQlTZTIc1wiNZp1AKIhgIcNxSmq5f1OcpaCq0KH8fDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:29:48.806655Z"},"content_sha256":"f6c2b0394404d7184a5f35c183d8d4e0c4bff88b0cc984300e78fca70fda94ec","schema_version":"1.0","event_id":"sha256:f6c2b0394404d7184a5f35c183d8d4e0c4bff88b0cc984300e78fca70fda94ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6ZJKJIZOK7ZSAQDZ4KO5TGHCM/bundle.json","state_url":"https://pith.science/pith/Y6ZJKJIZOK7ZSAQDZ4KO5TGHCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6ZJKJIZOK7ZSAQDZ4KO5TGHCM/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-05-31T12:29:48Z","links":{"resolver":"https://pith.science/pith/Y6ZJKJIZOK7ZSAQDZ4KO5TGHCM","bundle":"https://pith.science/pith/Y6ZJKJIZOK7ZSAQDZ4KO5TGHCM/bundle.json","state":"https://pith.science/pith/Y6ZJKJIZOK7ZSAQDZ4KO5TGHCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6ZJKJIZOK7ZSAQDZ4KO5TGHCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:Y6ZJKJIZOK7ZSAQDZ4KO5TGHCM","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":"73b1631a59f1bd151258e32746dc8e397e17a0958d999c9b5f01a5e5eebff762","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-28T20:00:24Z","title_canon_sha256":"4ae4ae20b516c2271bcc4517b47e0e911d90e81c0fdb140f9301635f23e71636"},"schema_version":"1.0","source":{"id":"1008.4889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4889","created_at":"2026-05-18T04:41:43Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4889v1","created_at":"2026-05-18T04:41:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4889","created_at":"2026-05-18T04:41:43Z"},{"alias_kind":"pith_short_12","alias_value":"Y6ZJKJIZOK7Z","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Y6ZJKJIZOK7ZSAQD","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Y6ZJKJIZ","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:f6c2b0394404d7184a5f35c183d8d4e0c4bff88b0cc984300e78fca70fda94ec","target":"graph","created_at":"2026-05-18T04:41:43Z","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 consider the following general scheduling problem: The input consists of n jobs, each with an arbitrary release time, size, and a monotone function specifying the cost incurred when the job is completed at a particular time. The objective is to find a preemptive schedule of minimum aggregate cost. This problem formulation is general enough to include many natural scheduling objectives, such as weighted flow, weighted tardiness, and sum of flow squared. Our main result is a randomized polynomial-time algorithm with an approximation ratio O(log log nP), where P is the maximum job size. We als","authors_text":"Kirk Pruhs, Nikhil Bansal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-28T20:00:24Z","title":"The Geometry of Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4889","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:2b48c6d5f0c79b1cb79b09f9be459de87107e9ce5378521056b2ec3f9fa62faa","target":"record","created_at":"2026-05-18T04:41:43Z","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":"73b1631a59f1bd151258e32746dc8e397e17a0958d999c9b5f01a5e5eebff762","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-28T20:00:24Z","title_canon_sha256":"4ae4ae20b516c2271bcc4517b47e0e911d90e81c0fdb140f9301635f23e71636"},"schema_version":"1.0","source":{"id":"1008.4889","kind":"arxiv","version":1}},"canonical_sha256":"c7b295251972bf990203cf14eeccc7130f135ab9950f78ea5d5befa0647f3505","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7b295251972bf990203cf14eeccc7130f135ab9950f78ea5d5befa0647f3505","first_computed_at":"2026-05-18T04:41:43.480101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:43.480101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"atUoNzPcktwHqMpjM/dotTX2k0QyptEFZFht0Jo9oVLChnAJcuJoWt84GtgtVwF8jMnO5SS0D+AbCT9cbFecAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:43.480608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.4889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b48c6d5f0c79b1cb79b09f9be459de87107e9ce5378521056b2ec3f9fa62faa","sha256:f6c2b0394404d7184a5f35c183d8d4e0c4bff88b0cc984300e78fca70fda94ec"],"state_sha256":"487f7c109f192f6dfcbde80fbd5f3eda5aaf70df9c2ad908370d841d087f5955"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OdhC8H+/e8c7MTQNPIaFv2J3IDSFzwpnXj2j/XzAO+rWWzHmGyNlCoqthbkFBRwCmwv4eus2lEWtvcYCFV/PDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:29:48.809499Z","bundle_sha256":"a608116c371b20b3fbec665586517c4a484e444c92854fe4a0fb0d9f0d3f529a"}}