{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KRA2NUPQ7NUG5R36ZJ7S2CI7IB","short_pith_number":"pith:KRA2NUPQ","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"},"canonical_sha256":"5441a6d1f0fb686ec77eca7f2d091f404b4e865de885b846a7379a136d2afd99","source":{"kind":"arxiv","id":"1511.05886","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05886","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05886v2","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05886","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"KRA2NUPQ7NUG","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRA2NUPQ7NUG5R36","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRA2NUPQ","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KRA2NUPQ7NUG5R36ZJ7S2CI7IB","target":"record","payload":{"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"},"canonical_sha256":"5441a6d1f0fb686ec77eca7f2d091f404b4e865de885b846a7379a136d2afd99","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"},"source_kind":"arxiv","source_id":"1511.05886","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-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2+eeJl9GHyiknnma+VvuHBeNnnscx5gaSfIzTfzt1JfFmIHbkpmbAysNcjIhg1yi32Xl4qzVftIrPUzRWiGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:26:11.094008Z"},"content_sha256":"41e6929f73339b31d0074e76c1b577058382e68b98e8d060d4079ad5273c9baa","schema_version":"1.0","event_id":"sha256:41e6929f73339b31d0074e76c1b577058382e68b98e8d060d4079ad5273c9baa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KRA2NUPQ7NUG5R36ZJ7S2CI7IB","target":"graph","payload":{"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"},"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-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"apODq+aWYgD82gHv+Gq0lGaQpWl1RAfNJiSbGPG4WSKKA79YghpZGfk9YxbOab6J6BfXT2GapPg5UIbPB42sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:26:11.094569Z"},"content_sha256":"0a54f0bd6f8746e241254395f004c81d4ef7da57c612d927e18f2bf5cf68d393","schema_version":"1.0","event_id":"sha256:0a54f0bd6f8746e241254395f004c81d4ef7da57c612d927e18f2bf5cf68d393"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/bundle.json","state_url":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/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-27T04:26:11Z","links":{"resolver":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB","bundle":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/bundle.json","state":"https://pith.science/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRA2NUPQ7NUG5R36ZJ7S2CI7IB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KRA2NUPQ7NUG5R36ZJ7S2CI7IB","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":"f56c53f6747f79afd7c2ab7bec875b844b4b57c4bfb37516396036ba703f259f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-18T17:20:34Z","title_canon_sha256":"9b385b8d17a5342cb38d60521e49aa6c548073bc57d4ed060638b42c9df1a402"},"schema_version":"1.0","source":{"id":"1511.05886","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05886","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05886v2","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05886","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"KRA2NUPQ7NUG","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRA2NUPQ7NUG5R36","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRA2NUPQ","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:0a54f0bd6f8746e241254395f004c81d4ef7da57c612d927e18f2bf5cf68d393","target":"graph","created_at":"2026-05-18T01:08:28Z","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 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","authors_text":"Jesper W. Mikkelsen","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-18T17:20:34Z","title":"Randomization can be as helpful as a glimpse of the future in online computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05886","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:41e6929f73339b31d0074e76c1b577058382e68b98e8d060d4079ad5273c9baa","target":"record","created_at":"2026-05-18T01:08:28Z","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":"f56c53f6747f79afd7c2ab7bec875b844b4b57c4bfb37516396036ba703f259f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-18T17:20:34Z","title_canon_sha256":"9b385b8d17a5342cb38d60521e49aa6c548073bc57d4ed060638b42c9df1a402"},"schema_version":"1.0","source":{"id":"1511.05886","kind":"arxiv","version":2}},"canonical_sha256":"5441a6d1f0fb686ec77eca7f2d091f404b4e865de885b846a7379a136d2afd99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5441a6d1f0fb686ec77eca7f2d091f404b4e865de885b846a7379a136d2afd99","first_computed_at":"2026-05-18T01:08:28.942399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:28.942399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iESddqwA9n+tX8+WwFPQt2ouo96uvumO9aBZYVAAr+va8bkm2jOjkrka1xSDEMDUTUVAU+eAsY774LFNRd2eAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:28.943014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05886","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41e6929f73339b31d0074e76c1b577058382e68b98e8d060d4079ad5273c9baa","sha256:0a54f0bd6f8746e241254395f004c81d4ef7da57c612d927e18f2bf5cf68d393"],"state_sha256":"6dbff3656e35c244282134f8c3032b120e005d0f81ef47a1f4a75aed711a9669"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iw2cFOANjDHXoXcOBGqMJrkMQ1NId13zaEOc4LmNdhWjxJwSSHLNs1f93y3TllWr8UJwXjGvx3nZZ8J52jorCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:26:11.097212Z","bundle_sha256":"6197d3bfb45980a628939093ed7d548e3348a482c3ecd18fb1102d627c3c8552"}}