{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KRA2NUPQ7NUG5R36ZJ7S2CI7IB","short_pith_number":"pith:KRA2NUPQ","schema_version":"1.0","canonical_sha256":"5441a6d1f0fb686ec77eca7f2d091f404b4e865de885b846a7379a136d2afd99","source":{"kind":"arxiv","id":"1511.05886","version":2},"attestation_state":"computed","paper":{"title":"Randomization can be as helpful as a glimpse of the future in online computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jesper W. Mikkelsen","submitted_at":"2015-11-18T17:20:34Z","abstract_excerpt":"We provide simple but surprisingly useful direct product theorems for proving lower bounds on online algorithms with a limited amount of advice about the future. As a consequence, we are able to translate decades of research on randomized online algorithms to the advice complexity model. Doing so improves significantly on the previous best advice complexity lower bounds for many online problems, or provides the first known lower bounds. For example, if $n$ is the number of requests, we show that:\n  (1) A paging algorithm needs $\\Omega(n)$ bits of advice to achieve a competitive ratio better th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1511.05886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-18T17:20:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9b385b8d17a5342cb38d60521e49aa6c548073bc57d4ed060638b42c9df1a402","abstract_canon_sha256":"f56c53f6747f79afd7c2ab7bec875b844b4b57c4bfb37516396036ba703f259f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:28.943014Z","signature_b64":"iESddqwA9n+tX8+WwFPQt2ouo96uvumO9aBZYVAAr+va8bkm2jOjkrka1xSDEMDUTUVAU+eAsY774LFNRd2eAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5441a6d1f0fb686ec77eca7f2d091f404b4e865de885b846a7379a136d2afd99","last_reissued_at":"2026-05-18T01:08:28.942399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:28.942399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomization can be as helpful as a glimpse of the future in online computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jesper W. Mikkelsen","submitted_at":"2015-11-18T17:20:34Z","abstract_excerpt":"We provide simple but surprisingly useful direct product theorems for proving lower bounds on online algorithms with a limited amount of advice about the future. As a consequence, we are able to translate decades of research on randomized online algorithms to the advice complexity model. Doing so improves significantly on the previous best advice complexity lower bounds for many online problems, or provides the first known lower bounds. For example, if $n$ is the number of requests, we show that:\n  (1) A paging algorithm needs $\\Omega(n)$ bits of advice to achieve a competitive ratio better th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05886","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.05886","created_at":"2026-05-18T01:08:28.942483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05886v2","created_at":"2026-05-18T01:08:28.942483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05886","created_at":"2026-05-18T01:08:28.942483+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRA2NUPQ7NUG","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRA2NUPQ7NUG5R36","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRA2NUPQ","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB","json":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB.json","graph_json":"https://pith.science/api/pith-number/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/graph.json","events_json":"https://pith.science/api/pith-number/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/events.json","paper":"https://pith.science/paper/KRA2NUPQ"},"agent_actions":{"view_html":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB","download_json":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB.json","view_paper":"https://pith.science/paper/KRA2NUPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05886&json=true","fetch_graph":"https://pith.science/api/pith-number/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/graph.json","fetch_events":"https://pith.science/api/pith-number/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/action/storage_attestation","attest_author":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/action/author_attestation","sign_citation":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/action/citation_signature","submit_replication":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/action/replication_record"}},"created_at":"2026-05-18T01:08:28.942483+00:00","updated_at":"2026-05-18T01:08:28.942483+00:00"}