{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:M6IPAESCLRVD5FYMY2KDM5TPCF","short_pith_number":"pith:M6IPAESC","canonical_record":{"source":{"id":"1504.05305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-04-21T04:54:49Z","cross_cats_sorted":[],"title_canon_sha256":"6b966b5b3440ac1a1462adbe2309eb3a5a31a3c899a76a35375ef0918006bc1d","abstract_canon_sha256":"73dbb59357e46d9cd522957ce228f5ff362bdc4efdddfd45ab28830a3a4ce8e9"},"schema_version":"1.0"},"canonical_sha256":"6790f012425c6a3e970cc69436766f116a2cc9434d3add104d8969f1bb38d45f","source":{"kind":"arxiv","id":"1504.05305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05305","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05305v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05305","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"M6IPAESCLRVD","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M6IPAESCLRVD5FYM","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M6IPAESC","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:M6IPAESCLRVD5FYMY2KDM5TPCF","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-04-21T04:54:49Z","cross_cats_sorted":[],"title_canon_sha256":"6b966b5b3440ac1a1462adbe2309eb3a5a31a3c899a76a35375ef0918006bc1d","abstract_canon_sha256":"73dbb59357e46d9cd522957ce228f5ff362bdc4efdddfd45ab28830a3a4ce8e9"},"schema_version":"1.0"},"canonical_sha256":"6790f012425c6a3e970cc69436766f116a2cc9434d3add104d8969f1bb38d45f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:14.578971Z","signature_b64":"op3xWSTLbXS+u7HoQ+c923yoaRPPXIh5iCXGTbLv8Wlch5V4n1Fas2qzWhnpDvlDxGSrcc4GUuxijezHJoDcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6790f012425c6a3e970cc69436766f116a2cc9434d3add104d8969f1bb38d45f","last_reissued_at":"2026-05-18T02:18:14.578481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:14.578481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05305","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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MMb1F6ch1w6ueOik+q4QhK+Kq0wjpectghmpKtPvDuC/NcQ17AQMTCZYDr7FiqqYAlVsS0xbP7869teyvALvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:51:01.940380Z"},"content_sha256":"d7903de8d966976c8466b03f1ab8f573e6d95505607146ca89fa406e9f0deb2f","schema_version":"1.0","event_id":"sha256:d7903de8d966976c8466b03f1ab8f573e6d95505607146ca89fa406e9f0deb2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:M6IPAESCLRVD5FYMY2KDM5TPCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple and General Problem and its Optimal Randomized Online Algorithm Design with Competitive Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Ying Zhang","submitted_at":"2015-04-21T04:54:49Z","abstract_excerpt":"The online algorithm design was proposed to handle the caching problem when the future information is unknown. And currently, it draws more and more attentions from the researchers from the areas of microgrid, where the production of renewables are unpredictable.\n  In this note, we present a framework of randomized online algorithm design for the \\textit{simple and tractable} problem. This framework hopes to provide a tractable design to design a randomized online algorithm, which can be proved to achieve the best competitive ratio by \\textit{Yao's Principle}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05305","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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XwEFAgO4CSJiboFq3oxhQ1BFu7zCmOY/EaXrvdJX4U0HcAUlRpA7gKcXcomEf3ofsiODMAg96AK78ecKT7KHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:51:01.940773Z"},"content_sha256":"bc3d14ba7cf6786d9024083166ac17b9d162e069ec650ab5edb3891500896745","schema_version":"1.0","event_id":"sha256:bc3d14ba7cf6786d9024083166ac17b9d162e069ec650ab5edb3891500896745"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6IPAESCLRVD5FYMY2KDM5TPCF/bundle.json","state_url":"https://pith.science/pith/M6IPAESCLRVD5FYMY2KDM5TPCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6IPAESCLRVD5FYMY2KDM5TPCF/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-02T04:51:01Z","links":{"resolver":"https://pith.science/pith/M6IPAESCLRVD5FYMY2KDM5TPCF","bundle":"https://pith.science/pith/M6IPAESCLRVD5FYMY2KDM5TPCF/bundle.json","state":"https://pith.science/pith/M6IPAESCLRVD5FYMY2KDM5TPCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6IPAESCLRVD5FYMY2KDM5TPCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:M6IPAESCLRVD5FYMY2KDM5TPCF","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":"73dbb59357e46d9cd522957ce228f5ff362bdc4efdddfd45ab28830a3a4ce8e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-04-21T04:54:49Z","title_canon_sha256":"6b966b5b3440ac1a1462adbe2309eb3a5a31a3c899a76a35375ef0918006bc1d"},"schema_version":"1.0","source":{"id":"1504.05305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05305","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05305v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05305","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"M6IPAESCLRVD","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M6IPAESCLRVD5FYM","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M6IPAESC","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:bc3d14ba7cf6786d9024083166ac17b9d162e069ec650ab5edb3891500896745","target":"graph","created_at":"2026-05-18T02:18:14Z","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":"The online algorithm design was proposed to handle the caching problem when the future information is unknown. And currently, it draws more and more attentions from the researchers from the areas of microgrid, where the production of renewables are unpredictable.\n  In this note, we present a framework of randomized online algorithm design for the \\textit{simple and tractable} problem. This framework hopes to provide a tractable design to design a randomized online algorithm, which can be proved to achieve the best competitive ratio by \\textit{Yao's Principle}.","authors_text":"Ying Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-04-21T04:54:49Z","title":"A Simple and General Problem and its Optimal Randomized Online Algorithm Design with Competitive Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05305","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:d7903de8d966976c8466b03f1ab8f573e6d95505607146ca89fa406e9f0deb2f","target":"record","created_at":"2026-05-18T02:18:14Z","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":"73dbb59357e46d9cd522957ce228f5ff362bdc4efdddfd45ab28830a3a4ce8e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-04-21T04:54:49Z","title_canon_sha256":"6b966b5b3440ac1a1462adbe2309eb3a5a31a3c899a76a35375ef0918006bc1d"},"schema_version":"1.0","source":{"id":"1504.05305","kind":"arxiv","version":1}},"canonical_sha256":"6790f012425c6a3e970cc69436766f116a2cc9434d3add104d8969f1bb38d45f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6790f012425c6a3e970cc69436766f116a2cc9434d3add104d8969f1bb38d45f","first_computed_at":"2026-05-18T02:18:14.578481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:14.578481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"op3xWSTLbXS+u7HoQ+c923yoaRPPXIh5iCXGTbLv8Wlch5V4n1Fas2qzWhnpDvlDxGSrcc4GUuxijezHJoDcBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:14.578971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7903de8d966976c8466b03f1ab8f573e6d95505607146ca89fa406e9f0deb2f","sha256:bc3d14ba7cf6786d9024083166ac17b9d162e069ec650ab5edb3891500896745"],"state_sha256":"4953561d3f5b72ff79ffbdad333ab1e0c87b5e76f1635fc872caa0724de54806"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wsILsDi0X90YFwV552fffDNCUy51VnDAPlhFEe1L4r0qGeaDH8gFSohXr5lCAPH+DiBB9O7WyOli7SJr0ntAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:51:01.942731Z","bundle_sha256":"bd4899d66dde9d942e4877f58552cf0ca5cb7ca6db72bddf872569a698083882"}}