{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SVNL3OGXQODY2J3XK25PMTVFUO","short_pith_number":"pith:SVNL3OGX","canonical_record":{"source":{"id":"1209.3868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-18T08:17:21Z","cross_cats_sorted":[],"title_canon_sha256":"cddc6f0499f287ec5b51cdbb966d956103fd6a08e966ee1976e35eaa56bfbdbe","abstract_canon_sha256":"6f17fe8be249ba75fba36f7a882d1259bc261444d6e5f64f4c3af0e63373022c"},"schema_version":"1.0"},"canonical_sha256":"955abdb8d783878d277756baf64ea5a39c4e6384cf7a2db5ee3cc55dccf3ea18","source":{"kind":"arxiv","id":"1209.3868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3868","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3868v1","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3868","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"SVNL3OGXQODY","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"SVNL3OGXQODY2J3X","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"SVNL3OGX","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SVNL3OGXQODY2J3XK25PMTVFUO","target":"record","payload":{"canonical_record":{"source":{"id":"1209.3868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-18T08:17:21Z","cross_cats_sorted":[],"title_canon_sha256":"cddc6f0499f287ec5b51cdbb966d956103fd6a08e966ee1976e35eaa56bfbdbe","abstract_canon_sha256":"6f17fe8be249ba75fba36f7a882d1259bc261444d6e5f64f4c3af0e63373022c"},"schema_version":"1.0"},"canonical_sha256":"955abdb8d783878d277756baf64ea5a39c4e6384cf7a2db5ee3cc55dccf3ea18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:22.339174Z","signature_b64":"x1lwE9Gf1tP7Hde2E+v/kTdqiJrJ+nYrxOgsYOCMwgi5AgyAQhoNFa/sTKfSLAJYREhonJ7lwN0UAQ9O23uDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"955abdb8d783878d277756baf64ea5a39c4e6384cf7a2db5ee3cc55dccf3ea18","last_reissued_at":"2026-05-18T03:45:22.338549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:22.338549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.3868","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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JE2u3LT8xELFtmj76+s8Xy1WelPPDOilh9vBgLbNXn9VWtwTg79tbRUF573yv3QWY3156jyn5sDALkFwpLdEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:50:00.328004Z"},"content_sha256":"16a60fa5b416047c9ab32376209fa6e68c9ff1df56d411508ceab7bdfef13090","schema_version":"1.0","event_id":"sha256:16a60fa5b416047c9ab32376209fa6e68c9ff1df56d411508ceab7bdfef13090"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SVNL3OGXQODY2J3XK25PMTVFUO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Profitable Scheduling on Multiple Speed-Scalable Processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Peter Kling, Peter Pietrzyk","submitted_at":"2012-09-18T08:17:21Z","abstract_excerpt":"We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors. Moreover, we provide a tight analysis of the algorithm's competitiveness. Our results generalize and improve upon work by \\textcite{Chan:2010}, which considers a single speed-scalable processor. Using significantly different techniques, we can not only extend their model to multiprocessors but also prove an enhanced and tight competitive ratio for our algorithm.\n  In our scheduling problem, jobs arrive over time and are preemptable. They have different workloads, values, and deadlines. The s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3868","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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+NYtpgSpDQ0IPPfIPm8H3MBwxG/AriCc9wphBQWOAg6HdodLnfdej+X+nJeahqAHAZU109oO+WHH/iBj5B+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:50:00.328352Z"},"content_sha256":"8bba9fa907643cab3c7ca09b4b79180b9993eb062ba13f75100b9b9537bf3640","schema_version":"1.0","event_id":"sha256:8bba9fa907643cab3c7ca09b4b79180b9993eb062ba13f75100b9b9537bf3640"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVNL3OGXQODY2J3XK25PMTVFUO/bundle.json","state_url":"https://pith.science/pith/SVNL3OGXQODY2J3XK25PMTVFUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVNL3OGXQODY2J3XK25PMTVFUO/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-20T16:50:00Z","links":{"resolver":"https://pith.science/pith/SVNL3OGXQODY2J3XK25PMTVFUO","bundle":"https://pith.science/pith/SVNL3OGXQODY2J3XK25PMTVFUO/bundle.json","state":"https://pith.science/pith/SVNL3OGXQODY2J3XK25PMTVFUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVNL3OGXQODY2J3XK25PMTVFUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SVNL3OGXQODY2J3XK25PMTVFUO","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":"6f17fe8be249ba75fba36f7a882d1259bc261444d6e5f64f4c3af0e63373022c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-18T08:17:21Z","title_canon_sha256":"cddc6f0499f287ec5b51cdbb966d956103fd6a08e966ee1976e35eaa56bfbdbe"},"schema_version":"1.0","source":{"id":"1209.3868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3868","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3868v1","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3868","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"SVNL3OGXQODY","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"SVNL3OGXQODY2J3X","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"SVNL3OGX","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:8bba9fa907643cab3c7ca09b4b79180b9993eb062ba13f75100b9b9537bf3640","target":"graph","created_at":"2026-05-18T03:45:22Z","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 present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors. Moreover, we provide a tight analysis of the algorithm's competitiveness. Our results generalize and improve upon work by \\textcite{Chan:2010}, which considers a single speed-scalable processor. Using significantly different techniques, we can not only extend their model to multiprocessors but also prove an enhanced and tight competitive ratio for our algorithm.\n  In our scheduling problem, jobs arrive over time and are preemptable. They have different workloads, values, and deadlines. The s","authors_text":"Peter Kling, Peter Pietrzyk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-18T08:17:21Z","title":"Profitable Scheduling on Multiple Speed-Scalable Processors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3868","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:16a60fa5b416047c9ab32376209fa6e68c9ff1df56d411508ceab7bdfef13090","target":"record","created_at":"2026-05-18T03:45:22Z","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":"6f17fe8be249ba75fba36f7a882d1259bc261444d6e5f64f4c3af0e63373022c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-18T08:17:21Z","title_canon_sha256":"cddc6f0499f287ec5b51cdbb966d956103fd6a08e966ee1976e35eaa56bfbdbe"},"schema_version":"1.0","source":{"id":"1209.3868","kind":"arxiv","version":1}},"canonical_sha256":"955abdb8d783878d277756baf64ea5a39c4e6384cf7a2db5ee3cc55dccf3ea18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"955abdb8d783878d277756baf64ea5a39c4e6384cf7a2db5ee3cc55dccf3ea18","first_computed_at":"2026-05-18T03:45:22.338549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:22.338549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x1lwE9Gf1tP7Hde2E+v/kTdqiJrJ+nYrxOgsYOCMwgi5AgyAQhoNFa/sTKfSLAJYREhonJ7lwN0UAQ9O23uDBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:22.339174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.3868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16a60fa5b416047c9ab32376209fa6e68c9ff1df56d411508ceab7bdfef13090","sha256:8bba9fa907643cab3c7ca09b4b79180b9993eb062ba13f75100b9b9537bf3640"],"state_sha256":"be8cdba6bbcfafc1ab0a01edaeb9c2a6ad28aa9c57dccb18d900dfc9371ab5dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f25whcsGSC9M7QUcGtr9GZN8efXJrrrM/DcwyZufgyjNyo24MmSjnm0pSRMlEFbXn0TCaEbaerOcdJfFg9/HDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T16:50:00.330232Z","bundle_sha256":"0bcc18a7fad97f82e5154c23faa48a536adf72c804513a1ec86175c552b49658"}}