{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RDRB65OOMTVQ5GO3JTNWOIMO46","short_pith_number":"pith:RDRB65OO","canonical_record":{"source":{"id":"1204.0897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T09:17:22Z","cross_cats_sorted":[],"title_canon_sha256":"fa321997998759c3f4060683bff8db22b354b966acec59135f80e5ccc0a3aa84","abstract_canon_sha256":"03df4db52d9776f78df0795279765bb783b18dcebb873697069078969e817cc5"},"schema_version":"1.0"},"canonical_sha256":"88e21f75ce64eb0e99db4cdb67218ee78add0628f5d4e12df003353a90668554","source":{"kind":"arxiv","id":"1204.0897","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0897","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0897v2","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0897","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"RDRB65OOMTVQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RDRB65OOMTVQ5GO3","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RDRB65OO","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RDRB65OOMTVQ5GO3JTNWOIMO46","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T09:17:22Z","cross_cats_sorted":[],"title_canon_sha256":"fa321997998759c3f4060683bff8db22b354b966acec59135f80e5ccc0a3aa84","abstract_canon_sha256":"03df4db52d9776f78df0795279765bb783b18dcebb873697069078969e817cc5"},"schema_version":"1.0"},"canonical_sha256":"88e21f75ce64eb0e99db4cdb67218ee78add0628f5d4e12df003353a90668554","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:56.336432Z","signature_b64":"szy6goQvrbDX91CnqxTvGUWBSq/pNLOS6uaSMba5XeatIJuequHBjkJqU/vCfJHMPoIyY/nfE1cZIXFboSIVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e21f75ce64eb0e99db4cdb67218ee78add0628f5d4e12df003353a90668554","last_reissued_at":"2026-05-18T03:41:56.335462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:56.335462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0897","source_version":2,"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:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KI2kuYtLcDj5Z4FioNWbzD8qE2fF6H45fVWezHCH2e7FPjCUegOdrLnHSma5sbHooQPfWArkNnjCFdgOLUxJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:22:42.940828Z"},"content_sha256":"9a20ad6731b4053a539d093402739fabf03f13d77486037ddfea440f585b7e10","schema_version":"1.0","event_id":"sha256:9a20ad6731b4053a539d093402739fabf03f13d77486037ddfea440f585b7e10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RDRB65OOMTVQ5GO3JTNWOIMO46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Elisabeth G\\\"unther, Nicole Megow, Olaf Maurer","submitted_at":"2012-04-04T09:17:22Z","abstract_excerpt":"We propose a new approach to competitive analysis in online scheduling by introducing the novel concept of competitive-ratio approximation schemes. Such a scheme algorithmically constructs an online algorithm with a competitive ratio arbitrarily close to the best possible competitive ratio for any online algorithm. We study the problem of scheduling jobs online to minimize the weighted sum of completion times on parallel, related, and unrelated machines, and we derive both deterministic and randomized algorithms which are almost best possible among all online algorithms of the respective setti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0897","kind":"arxiv","version":2},"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:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZFdfcY74WuPR2qOWoaRM5xZP02WBLHSqCY3Mz8vrX6MlWXpJ7bcUwhCFtGgVaCKEY/weH/MS32w5S71WbpvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:22:42.941570Z"},"content_sha256":"fe22308f617062107001bf5879c7b7c4a5845125b7f02370185d9a28ea8c9faa","schema_version":"1.0","event_id":"sha256:fe22308f617062107001bf5879c7b7c4a5845125b7f02370185d9a28ea8c9faa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDRB65OOMTVQ5GO3JTNWOIMO46/bundle.json","state_url":"https://pith.science/pith/RDRB65OOMTVQ5GO3JTNWOIMO46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDRB65OOMTVQ5GO3JTNWOIMO46/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-06T23:22:42Z","links":{"resolver":"https://pith.science/pith/RDRB65OOMTVQ5GO3JTNWOIMO46","bundle":"https://pith.science/pith/RDRB65OOMTVQ5GO3JTNWOIMO46/bundle.json","state":"https://pith.science/pith/RDRB65OOMTVQ5GO3JTNWOIMO46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDRB65OOMTVQ5GO3JTNWOIMO46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RDRB65OOMTVQ5GO3JTNWOIMO46","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":"03df4db52d9776f78df0795279765bb783b18dcebb873697069078969e817cc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T09:17:22Z","title_canon_sha256":"fa321997998759c3f4060683bff8db22b354b966acec59135f80e5ccc0a3aa84"},"schema_version":"1.0","source":{"id":"1204.0897","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0897","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0897v2","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0897","created_at":"2026-05-18T03:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"RDRB65OOMTVQ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RDRB65OOMTVQ5GO3","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RDRB65OO","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:fe22308f617062107001bf5879c7b7c4a5845125b7f02370185d9a28ea8c9faa","target":"graph","created_at":"2026-05-18T03:41:56Z","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 propose a new approach to competitive analysis in online scheduling by introducing the novel concept of competitive-ratio approximation schemes. Such a scheme algorithmically constructs an online algorithm with a competitive ratio arbitrarily close to the best possible competitive ratio for any online algorithm. We study the problem of scheduling jobs online to minimize the weighted sum of completion times on parallel, related, and unrelated machines, and we derive both deterministic and randomized algorithms which are almost best possible among all online algorithms of the respective setti","authors_text":"Andreas Wiese, Elisabeth G\\\"unther, Nicole Megow, Olaf Maurer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T09:17:22Z","title":"A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0897","kind":"arxiv","version":2},"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:9a20ad6731b4053a539d093402739fabf03f13d77486037ddfea440f585b7e10","target":"record","created_at":"2026-05-18T03:41:56Z","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":"03df4db52d9776f78df0795279765bb783b18dcebb873697069078969e817cc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T09:17:22Z","title_canon_sha256":"fa321997998759c3f4060683bff8db22b354b966acec59135f80e5ccc0a3aa84"},"schema_version":"1.0","source":{"id":"1204.0897","kind":"arxiv","version":2}},"canonical_sha256":"88e21f75ce64eb0e99db4cdb67218ee78add0628f5d4e12df003353a90668554","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88e21f75ce64eb0e99db4cdb67218ee78add0628f5d4e12df003353a90668554","first_computed_at":"2026-05-18T03:41:56.335462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:56.335462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"szy6goQvrbDX91CnqxTvGUWBSq/pNLOS6uaSMba5XeatIJuequHBjkJqU/vCfJHMPoIyY/nfE1cZIXFboSIVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:56.336432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0897","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a20ad6731b4053a539d093402739fabf03f13d77486037ddfea440f585b7e10","sha256:fe22308f617062107001bf5879c7b7c4a5845125b7f02370185d9a28ea8c9faa"],"state_sha256":"1c1c886ef625527a68d4bf73ff57d4616fdc406fcdca363d177561586bd4c384"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkUWZBFX97XFxUt6AmShUCyMFVeH3ijD/rey0BWIzKAA4dmv9vZdbnPYpud7CWRUcAjVvpp7yVb/hC3YA7ygAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:22:42.945684Z","bundle_sha256":"ecbe5bda5986a2106aa77720cf45ae9360615f20ad5e9f1b26f7b03e91e26274"}}