{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QMTL5LVCHW5HFODPJRJWZ63U6Q","short_pith_number":"pith:QMTL5LVC","canonical_record":{"source":{"id":"1302.2805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-12T14:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"ac2a7bd776fab2c10d07f4ca37fc988f831b2e684ba6d9deb0eca175f6e2cf11","abstract_canon_sha256":"af59311dcb0a9e23221ff7d0ab25d0481ac18cc0c332d07d1f0b09dd3056c38f"},"schema_version":"1.0"},"canonical_sha256":"8326beaea23dba72b86f4c536cfb74f42f0af39b70d026ad5281257342b93703","source":{"kind":"arxiv","id":"1302.2805","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2805","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2805v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2805","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"QMTL5LVCHW5H","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QMTL5LVCHW5HFODP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QMTL5LVC","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QMTL5LVCHW5HFODPJRJWZ63U6Q","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-12T14:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"ac2a7bd776fab2c10d07f4ca37fc988f831b2e684ba6d9deb0eca175f6e2cf11","abstract_canon_sha256":"af59311dcb0a9e23221ff7d0ab25d0481ac18cc0c332d07d1f0b09dd3056c38f"},"schema_version":"1.0"},"canonical_sha256":"8326beaea23dba72b86f4c536cfb74f42f0af39b70d026ad5281257342b93703","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:38.542236Z","signature_b64":"8wNvj69X1sfynuOj0dvvrrvX4JY/oL8nM4vyE2F6NP7625YbhZiK28U1sGxts1OAuYLx3DfyMXYVHqPQDC1hAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8326beaea23dba72b86f4c536cfb74f42f0af39b70d026ad5281257342b93703","last_reissued_at":"2026-05-18T03:33:38.541731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:38.541731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2805","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:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jyELMz3M84goGMIHyfgjK2NiALay5TkXR+1sI5tORSjmAURRLZQbcN5/4tM/SFNFGGfF++vohtf9eDU8nb+SBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:57:32.155351Z"},"content_sha256":"fcff5a05a018f23fa23ea4b50c92c7e6a1ad29257e5f3505b28c9d1e2f0dee6f","schema_version":"1.0","event_id":"sha256:fcff5a05a018f23fa23ea4b50c92c7e6a1ad29257e5f3505b28c9d1e2f0dee6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QMTL5LVCHW5HFODPJRJWZ63U6Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized online computation with high probability guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dennis Komm, Rastislav Kr\\'alovi\\v{c}, Richard Kr\\'alovi\\v{c}, Tobias M\\\"omke","submitted_at":"2013-02-12T14:29:05Z","abstract_excerpt":"We study the relationship between the competitive ratio and the tail distribution of randomized online minimization problems. To this end, we define a broad class of online problems that includes some of the well-studied problems like paging, k-server and metrical task systems on finite metrics, and show that for these problems it is possible to obtain, given an algorithm with constant expected competitive ratio, another algorithm that achieves the same solution quality up to an arbitrarily small constant error a with high probability; the \"high probability\" statement is in terms of the optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2805","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:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1T3D3BGjKEuS6MAIN8zbUHqKUC+VrUwHGfqXGzcN8DGgcwqzEMK11zYwWSl5EJn1F8CdMCvn+An0qOMvW8QRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:57:32.155720Z"},"content_sha256":"5977eaa1ce307b714aba7a65318b5ed3098e775a1ae48265c564616c7dafd8f2","schema_version":"1.0","event_id":"sha256:5977eaa1ce307b714aba7a65318b5ed3098e775a1ae48265c564616c7dafd8f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMTL5LVCHW5HFODPJRJWZ63U6Q/bundle.json","state_url":"https://pith.science/pith/QMTL5LVCHW5HFODPJRJWZ63U6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMTL5LVCHW5HFODPJRJWZ63U6Q/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-28T16:57:32Z","links":{"resolver":"https://pith.science/pith/QMTL5LVCHW5HFODPJRJWZ63U6Q","bundle":"https://pith.science/pith/QMTL5LVCHW5HFODPJRJWZ63U6Q/bundle.json","state":"https://pith.science/pith/QMTL5LVCHW5HFODPJRJWZ63U6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMTL5LVCHW5HFODPJRJWZ63U6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QMTL5LVCHW5HFODPJRJWZ63U6Q","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":"af59311dcb0a9e23221ff7d0ab25d0481ac18cc0c332d07d1f0b09dd3056c38f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-12T14:29:05Z","title_canon_sha256":"ac2a7bd776fab2c10d07f4ca37fc988f831b2e684ba6d9deb0eca175f6e2cf11"},"schema_version":"1.0","source":{"id":"1302.2805","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2805","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2805v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2805","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"QMTL5LVCHW5H","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QMTL5LVCHW5HFODP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QMTL5LVC","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:5977eaa1ce307b714aba7a65318b5ed3098e775a1ae48265c564616c7dafd8f2","target":"graph","created_at":"2026-05-18T03:33:38Z","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 study the relationship between the competitive ratio and the tail distribution of randomized online minimization problems. To this end, we define a broad class of online problems that includes some of the well-studied problems like paging, k-server and metrical task systems on finite metrics, and show that for these problems it is possible to obtain, given an algorithm with constant expected competitive ratio, another algorithm that achieves the same solution quality up to an arbitrarily small constant error a with high probability; the \"high probability\" statement is in terms of the optima","authors_text":"Dennis Komm, Rastislav Kr\\'alovi\\v{c}, Richard Kr\\'alovi\\v{c}, Tobias M\\\"omke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-12T14:29:05Z","title":"Randomized online computation with high probability guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2805","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:fcff5a05a018f23fa23ea4b50c92c7e6a1ad29257e5f3505b28c9d1e2f0dee6f","target":"record","created_at":"2026-05-18T03:33:38Z","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":"af59311dcb0a9e23221ff7d0ab25d0481ac18cc0c332d07d1f0b09dd3056c38f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-12T14:29:05Z","title_canon_sha256":"ac2a7bd776fab2c10d07f4ca37fc988f831b2e684ba6d9deb0eca175f6e2cf11"},"schema_version":"1.0","source":{"id":"1302.2805","kind":"arxiv","version":1}},"canonical_sha256":"8326beaea23dba72b86f4c536cfb74f42f0af39b70d026ad5281257342b93703","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8326beaea23dba72b86f4c536cfb74f42f0af39b70d026ad5281257342b93703","first_computed_at":"2026-05-18T03:33:38.541731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:38.541731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8wNvj69X1sfynuOj0dvvrrvX4JY/oL8nM4vyE2F6NP7625YbhZiK28U1sGxts1OAuYLx3DfyMXYVHqPQDC1hAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:38.542236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2805","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcff5a05a018f23fa23ea4b50c92c7e6a1ad29257e5f3505b28c9d1e2f0dee6f","sha256:5977eaa1ce307b714aba7a65318b5ed3098e775a1ae48265c564616c7dafd8f2"],"state_sha256":"020327bd1245b6778ed922db6303806232c33afbd094c519be015e0825515dc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Idl6O1wfhftVs3i6jEOZXKOlMhHs4OPaRwZxflSWlsmgUMxLmDlm7E/CaEntIhikRLJN0gxwl42RdppF5JUsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:57:32.157590Z","bundle_sha256":"093530fb3ef3f3df825e34fed24a4eb673abc654bb0e8b03b3a5aa8a0e8b4a1a"}}