{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:5GDLNQCQR4FB7I55CD4FWCYDVR","short_pith_number":"pith:5GDLNQCQ","schema_version":"1.0","canonical_sha256":"e986b6c0508f0a1fa3bd10f85b0b03ac6599ab05dbaa733c0ece0d50d004dcf2","source":{"kind":"arxiv","id":"2006.05028","version":1},"attestation_state":"computed","paper":{"title":"Online Page Migration with ML Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Frederik Mallmann-Trenn, Piotr Indyk, Ronitt Rubinfeld, Slobodan Mitrovi\\'c","submitted_at":"2020-06-09T03:15:34Z","abstract_excerpt":"We consider online algorithms for the {\\em page migration problem} that use predictions, potentially imperfect, to improve their performance. The best known online algorithms for this problem, due to Westbrook'94 and Bienkowski et al'17, have competitive ratios strictly bounded away from 1. In contrast, we show that if the algorithm is given a prediction of the input sequence, then it can achieve a competitive ratio that tends to $1$ as the prediction error rate tends to $0$. Specifically, the competitive ratio is equal to $1+O(q)$, where $q$ is the prediction error rate. We also design a ``fa"},"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":"2006.05028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-09T03:15:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9c45b5f410cde85febc70210e641fc4402a067dab1072a8ebf73471d2e3c2571","abstract_canon_sha256":"325d02bd2ffe89e323646bd03c0f79e4c3c95a8c00cd50001b06667c5d2fb7db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:09.991203Z","signature_b64":"uE1UrgacSlDblO0+VxxkA7JUFgHIayXp6+ld0yF1uXnq0ueK+bZo7n5HUmpd7NIT5nFEMvckK6u5bCxHJlQPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e986b6c0508f0a1fa3bd10f85b0b03ac6599ab05dbaa733c0ece0d50d004dcf2","last_reissued_at":"2026-07-05T01:09:09.990827Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:09.990827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Page Migration with ML Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Frederik Mallmann-Trenn, Piotr Indyk, Ronitt Rubinfeld, Slobodan Mitrovi\\'c","submitted_at":"2020-06-09T03:15:34Z","abstract_excerpt":"We consider online algorithms for the {\\em page migration problem} that use predictions, potentially imperfect, to improve their performance. The best known online algorithms for this problem, due to Westbrook'94 and Bienkowski et al'17, have competitive ratios strictly bounded away from 1. In contrast, we show that if the algorithm is given a prediction of the input sequence, then it can achieve a competitive ratio that tends to $1$ as the prediction error rate tends to $0$. Specifically, the competitive ratio is equal to $1+O(q)$, where $q$ is the prediction error rate. We also design a ``fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05028","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/2006.05028/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":"2006.05028","created_at":"2026-07-05T01:09:09.990890+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.05028v1","created_at":"2026-07-05T01:09:09.990890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05028","created_at":"2026-07-05T01:09:09.990890+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GDLNQCQR4FB","created_at":"2026-07-05T01:09:09.990890+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GDLNQCQR4FB7I55","created_at":"2026-07-05T01:09:09.990890+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GDLNQCQ","created_at":"2026-07-05T01:09:09.990890+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02894","citing_title":"How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5GDLNQCQR4FB7I55CD4FWCYDVR","json":"https://pith.science/pith/5GDLNQCQR4FB7I55CD4FWCYDVR.json","graph_json":"https://pith.science/api/pith-number/5GDLNQCQR4FB7I55CD4FWCYDVR/graph.json","events_json":"https://pith.science/api/pith-number/5GDLNQCQR4FB7I55CD4FWCYDVR/events.json","paper":"https://pith.science/paper/5GDLNQCQ"},"agent_actions":{"view_html":"https://pith.science/pith/5GDLNQCQR4FB7I55CD4FWCYDVR","download_json":"https://pith.science/pith/5GDLNQCQR4FB7I55CD4FWCYDVR.json","view_paper":"https://pith.science/paper/5GDLNQCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.05028&json=true","fetch_graph":"https://pith.science/api/pith-number/5GDLNQCQR4FB7I55CD4FWCYDVR/graph.json","fetch_events":"https://pith.science/api/pith-number/5GDLNQCQR4FB7I55CD4FWCYDVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GDLNQCQR4FB7I55CD4FWCYDVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GDLNQCQR4FB7I55CD4FWCYDVR/action/storage_attestation","attest_author":"https://pith.science/pith/5GDLNQCQR4FB7I55CD4FWCYDVR/action/author_attestation","sign_citation":"https://pith.science/pith/5GDLNQCQR4FB7I55CD4FWCYDVR/action/citation_signature","submit_replication":"https://pith.science/pith/5GDLNQCQR4FB7I55CD4FWCYDVR/action/replication_record"}},"created_at":"2026-07-05T01:09:09.990890+00:00","updated_at":"2026-07-05T01:09:09.990890+00:00"}