{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:S7TQTCB3MGKEWTNRGMCU3UGG56","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":"6300ffe356cb27aa7dd9fb3f0aff42a6ea7f4204ff2d89fa0a49b873917d6cf4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-31T16:49:36Z","title_canon_sha256":"afba53d2836a7a11c714021380089402d4a3526495c61b101004f625c0b87544"},"schema_version":"1.0","source":{"id":"2606.01342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01342","created_at":"2026-06-02T02:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01342v1","created_at":"2026-06-02T02:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01342","created_at":"2026-06-02T02:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"S7TQTCB3MGKE","created_at":"2026-06-02T02:04:30Z"},{"alias_kind":"pith_short_16","alias_value":"S7TQTCB3MGKEWTNR","created_at":"2026-06-02T02:04:30Z"},{"alias_kind":"pith_short_8","alias_value":"S7TQTCB3","created_at":"2026-06-02T02:04:30Z"}],"graph_snapshots":[{"event_id":"sha256:1fa75f2baf7544141d0b0a5650c93e740dae28c19a94111bab7ebf22147ebb42","target":"graph","created_at":"2026-06-02T02:04:30Z","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/2606.01342/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning-augmented paging has been extensively studied in recent years. A key advantage over naive ML-based approaches is \\emph{bounded robustness}, which guarantees worst-case performance even when predictions are inaccurate, making these algorithms valuable for real-world systems. Prior work achieves robustness bounds of $2H_k + O(1)$ in the randomized setting, leaving a gap to the optimal competitive ratio $H_k$.\n  In this paper, we study how to close this gap. We begin by reviewing online optimality and proving a new property of the latest $H_k$-competitive algorithm, which facilitates our","authors_text":"Hailiang Zhao, Peng Chen, Shuiguang Deng, Xueyan Tang, Yixuan Wang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-31T16:49:36Z","title":"Towards Optimal Robustness in Learning-Augmented Paging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01342","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:da4823ac28c8d1350bac9ae3c2ecea74bb2d65e1a42e18c9e21fbcbd7115594a","target":"record","created_at":"2026-06-02T02:04:30Z","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":"6300ffe356cb27aa7dd9fb3f0aff42a6ea7f4204ff2d89fa0a49b873917d6cf4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-31T16:49:36Z","title_canon_sha256":"afba53d2836a7a11c714021380089402d4a3526495c61b101004f625c0b87544"},"schema_version":"1.0","source":{"id":"2606.01342","kind":"arxiv","version":1}},"canonical_sha256":"97e709883b61944b4db133054dd0c6efb8db3ed8c80bef0a94b923b2efa961de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97e709883b61944b4db133054dd0c6efb8db3ed8c80bef0a94b923b2efa961de","first_computed_at":"2026-06-02T02:04:30.670664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:30.670664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kXEv5/Eg7k0BUwL1coNysm4knca3ptx+sp7/8T0b3hr2ug2ppVWGONZAlA2K8WsTZ0rUkijPgDIOlCbnyThPDg==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:30.671038Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da4823ac28c8d1350bac9ae3c2ecea74bb2d65e1a42e18c9e21fbcbd7115594a","sha256:1fa75f2baf7544141d0b0a5650c93e740dae28c19a94111bab7ebf22147ebb42"],"state_sha256":"372707c961853a142c27876ca1932b63036846988c70526b1f4ec0c85767e617"}