{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:S7TQTCB3MGKEWTNRGMCU3UGG56","short_pith_number":"pith:S7TQTCB3","schema_version":"1.0","canonical_sha256":"97e709883b61944b4db133054dd0c6efb8db3ed8c80bef0a94b923b2efa961de","source":{"kind":"arxiv","id":"2606.01342","version":1},"attestation_state":"computed","paper":{"title":"Towards Optimal Robustness in Learning-Augmented Paging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Hailiang Zhao, Peng Chen, Shuiguang Deng, Xueyan Tang, Yixuan Wang","submitted_at":"2026-05-31T16:49:36Z","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"},"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":"2606.01342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-31T16:49:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"afba53d2836a7a11c714021380089402d4a3526495c61b101004f625c0b87544","abstract_canon_sha256":"6300ffe356cb27aa7dd9fb3f0aff42a6ea7f4204ff2d89fa0a49b873917d6cf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:30.671038Z","signature_b64":"kXEv5/Eg7k0BUwL1coNysm4knca3ptx+sp7/8T0b3hr2ug2ppVWGONZAlA2K8WsTZ0rUkijPgDIOlCbnyThPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97e709883b61944b4db133054dd0c6efb8db3ed8c80bef0a94b923b2efa961de","last_reissued_at":"2026-06-02T02:04:30.670664Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:30.670664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Optimal Robustness in Learning-Augmented Paging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Hailiang Zhao, Peng Chen, Shuiguang Deng, Xueyan Tang, Yixuan Wang","submitted_at":"2026-05-31T16:49:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01342","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.01342/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.01342","created_at":"2026-06-02T02:04:30.670718+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01342v1","created_at":"2026-06-02T02:04:30.670718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01342","created_at":"2026-06-02T02:04:30.670718+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7TQTCB3MGKE","created_at":"2026-06-02T02:04:30.670718+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7TQTCB3MGKEWTNR","created_at":"2026-06-02T02:04:30.670718+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7TQTCB3","created_at":"2026-06-02T02:04:30.670718+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/S7TQTCB3MGKEWTNRGMCU3UGG56","json":"https://pith.science/pith/S7TQTCB3MGKEWTNRGMCU3UGG56.json","graph_json":"https://pith.science/api/pith-number/S7TQTCB3MGKEWTNRGMCU3UGG56/graph.json","events_json":"https://pith.science/api/pith-number/S7TQTCB3MGKEWTNRGMCU3UGG56/events.json","paper":"https://pith.science/paper/S7TQTCB3"},"agent_actions":{"view_html":"https://pith.science/pith/S7TQTCB3MGKEWTNRGMCU3UGG56","download_json":"https://pith.science/pith/S7TQTCB3MGKEWTNRGMCU3UGG56.json","view_paper":"https://pith.science/paper/S7TQTCB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01342&json=true","fetch_graph":"https://pith.science/api/pith-number/S7TQTCB3MGKEWTNRGMCU3UGG56/graph.json","fetch_events":"https://pith.science/api/pith-number/S7TQTCB3MGKEWTNRGMCU3UGG56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7TQTCB3MGKEWTNRGMCU3UGG56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7TQTCB3MGKEWTNRGMCU3UGG56/action/storage_attestation","attest_author":"https://pith.science/pith/S7TQTCB3MGKEWTNRGMCU3UGG56/action/author_attestation","sign_citation":"https://pith.science/pith/S7TQTCB3MGKEWTNRGMCU3UGG56/action/citation_signature","submit_replication":"https://pith.science/pith/S7TQTCB3MGKEWTNRGMCU3UGG56/action/replication_record"}},"created_at":"2026-06-02T02:04:30.670718+00:00","updated_at":"2026-06-02T02:04:30.670718+00:00"}