{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3ZQNLOYKDXSGKZMZRJDEKJ22Y6","short_pith_number":"pith:3ZQNLOYK","canonical_record":{"source":{"id":"2410.01760","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-10-02T17:14:47Z","cross_cats_sorted":[],"title_canon_sha256":"88c3ce43c430f0c5df060ca237913b8ebec725fd8e5bde2bd33c1c5090403700","abstract_canon_sha256":"207ec57866e0452c671698aaede4207b9f16836f9feaa9a5e1e2f564e1606a93"},"schema_version":"1.0"},"canonical_sha256":"de60d5bb0a1de46565998a4645275ac7a168da8b4e2bf3457ead0ef86ab8aff2","source":{"kind":"arxiv","id":"2410.01760","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.01760","created_at":"2026-07-05T11:43:57Z"},{"alias_kind":"arxiv_version","alias_value":"2410.01760v2","created_at":"2026-07-05T11:43:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.01760","created_at":"2026-07-05T11:43:57Z"},{"alias_kind":"pith_short_12","alias_value":"3ZQNLOYKDXSG","created_at":"2026-07-05T11:43:57Z"},{"alias_kind":"pith_short_16","alias_value":"3ZQNLOYKDXSGKZMZ","created_at":"2026-07-05T11:43:57Z"},{"alias_kind":"pith_short_8","alias_value":"3ZQNLOYK","created_at":"2026-07-05T11:43:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3ZQNLOYKDXSGKZMZRJDEKJ22Y6","target":"record","payload":{"canonical_record":{"source":{"id":"2410.01760","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-10-02T17:14:47Z","cross_cats_sorted":[],"title_canon_sha256":"88c3ce43c430f0c5df060ca237913b8ebec725fd8e5bde2bd33c1c5090403700","abstract_canon_sha256":"207ec57866e0452c671698aaede4207b9f16836f9feaa9a5e1e2f564e1606a93"},"schema_version":"1.0"},"canonical_sha256":"de60d5bb0a1de46565998a4645275ac7a168da8b4e2bf3457ead0ef86ab8aff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:57.535542Z","signature_b64":"CGp6mr9+Rkz6XKNV0OktrHW8557D2E6WmjkE1L2kQCqmTCDoDyuQ0qkoKhI6CbCvChGgJZANzW5BZR6hBvusAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de60d5bb0a1de46565998a4645275ac7a168da8b4e2bf3457ead0ef86ab8aff2","last_reissued_at":"2026-07-05T11:43:57.534985Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:57.534985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.01760","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-07-05T11:43:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E08G2WffrpG/52J/igP6vp+I7ZdsQWyUCzv7mJTgQbXW5mlHnfPZqhQzEwKn7lt3NPflymtKy8OXQujqUIyfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:53:30.658887Z"},"content_sha256":"622223c306eacb1c8f9ac4a567b5bc0e14f083833e62e5c28809a8f5a945d015","schema_version":"1.0","event_id":"sha256:622223c306eacb1c8f9ac4a567b5bc0e14f083833e62e5c28809a8f5a945d015"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3ZQNLOYKDXSGKZMZRJDEKJ22Y6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-Augmented Online Caching: New Upper Bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alexander Demin, Daniel Skachkov, Denis Ponomaryov, Yuri Dorn","submitted_at":"2024-10-02T17:14:47Z","abstract_excerpt":"We address the problem of learning-augmented online caching in the scenario when each request is accompanied by a prediction of the next occurrence of the requested page. We improve currently known bounds on the competitive ratio of the BlindOracle algorithm, which evicts a page predicted to be requested last. We also prove a lower bound on the competitive ratio of any randomized algorithm and show that a combination of the BlindOracle with the Marker algorithm achieves a competitive ratio that is optimal up to some constant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.01760","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.01760/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:43:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zE32gZ/xe4S+wc46tfhaW/VqWONH+jIlKGpNoUqHimWmikUdbLcKTIXIZEz3u8QJteE98q832k6OS7Chj1iOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:53:30.659395Z"},"content_sha256":"f87b89dabfe045b4b0f9c4b05e9f891724d8a8ecc47f031dca7ba768c2e8d2f9","schema_version":"1.0","event_id":"sha256:f87b89dabfe045b4b0f9c4b05e9f891724d8a8ecc47f031dca7ba768c2e8d2f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZQNLOYKDXSGKZMZRJDEKJ22Y6/bundle.json","state_url":"https://pith.science/pith/3ZQNLOYKDXSGKZMZRJDEKJ22Y6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZQNLOYKDXSGKZMZRJDEKJ22Y6/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-08-21T04:53:30Z","links":{"resolver":"https://pith.science/pith/3ZQNLOYKDXSGKZMZRJDEKJ22Y6","bundle":"https://pith.science/pith/3ZQNLOYKDXSGKZMZRJDEKJ22Y6/bundle.json","state":"https://pith.science/pith/3ZQNLOYKDXSGKZMZRJDEKJ22Y6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZQNLOYKDXSGKZMZRJDEKJ22Y6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3ZQNLOYKDXSGKZMZRJDEKJ22Y6","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":"207ec57866e0452c671698aaede4207b9f16836f9feaa9a5e1e2f564e1606a93","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-10-02T17:14:47Z","title_canon_sha256":"88c3ce43c430f0c5df060ca237913b8ebec725fd8e5bde2bd33c1c5090403700"},"schema_version":"1.0","source":{"id":"2410.01760","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.01760","created_at":"2026-07-05T11:43:57Z"},{"alias_kind":"arxiv_version","alias_value":"2410.01760v2","created_at":"2026-07-05T11:43:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.01760","created_at":"2026-07-05T11:43:57Z"},{"alias_kind":"pith_short_12","alias_value":"3ZQNLOYKDXSG","created_at":"2026-07-05T11:43:57Z"},{"alias_kind":"pith_short_16","alias_value":"3ZQNLOYKDXSGKZMZ","created_at":"2026-07-05T11:43:57Z"},{"alias_kind":"pith_short_8","alias_value":"3ZQNLOYK","created_at":"2026-07-05T11:43:57Z"}],"graph_snapshots":[{"event_id":"sha256:f87b89dabfe045b4b0f9c4b05e9f891724d8a8ecc47f031dca7ba768c2e8d2f9","target":"graph","created_at":"2026-07-05T11:43:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.01760/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the problem of learning-augmented online caching in the scenario when each request is accompanied by a prediction of the next occurrence of the requested page. We improve currently known bounds on the competitive ratio of the BlindOracle algorithm, which evicts a page predicted to be requested last. We also prove a lower bound on the competitive ratio of any randomized algorithm and show that a combination of the BlindOracle with the Marker algorithm achieves a competitive ratio that is optimal up to some constant.","authors_text":"Alexander Demin, Daniel Skachkov, Denis Ponomaryov, Yuri Dorn","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-10-02T17:14:47Z","title":"Learning-Augmented Online Caching: New Upper Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.01760","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:622223c306eacb1c8f9ac4a567b5bc0e14f083833e62e5c28809a8f5a945d015","target":"record","created_at":"2026-07-05T11:43:57Z","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":"207ec57866e0452c671698aaede4207b9f16836f9feaa9a5e1e2f564e1606a93","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-10-02T17:14:47Z","title_canon_sha256":"88c3ce43c430f0c5df060ca237913b8ebec725fd8e5bde2bd33c1c5090403700"},"schema_version":"1.0","source":{"id":"2410.01760","kind":"arxiv","version":2}},"canonical_sha256":"de60d5bb0a1de46565998a4645275ac7a168da8b4e2bf3457ead0ef86ab8aff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de60d5bb0a1de46565998a4645275ac7a168da8b4e2bf3457ead0ef86ab8aff2","first_computed_at":"2026-07-05T11:43:57.534985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:57.534985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CGp6mr9+Rkz6XKNV0OktrHW8557D2E6WmjkE1L2kQCqmTCDoDyuQ0qkoKhI6CbCvChGgJZANzW5BZR6hBvusAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:57.535542Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.01760","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:622223c306eacb1c8f9ac4a567b5bc0e14f083833e62e5c28809a8f5a945d015","sha256:f87b89dabfe045b4b0f9c4b05e9f891724d8a8ecc47f031dca7ba768c2e8d2f9"],"state_sha256":"5268c614a20c2dac84c7876149a6bbc7b2e27c765333778c835def661f4dee21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BGqnoMLGpmKqIFkoRVu4g9+OQTpOqgg0dmgw1Q5YgCoYHyb/VYA3v4mQBfEFhGHiEBAqBo8Q8ce9xR6jD441Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T04:53:30.663536Z","bundle_sha256":"2780de3a8c33bed82772298b37b0ecde47ae0b8ce3e44e73ff17fde9770ea539"}}