{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RN7PYMOSHDRBS7B4K4NWU34NCS","short_pith_number":"pith:RN7PYMOS","schema_version":"1.0","canonical_sha256":"8b7efc31d238e2197c3c571b6a6f8d148e638f05159f218cefeca3cc85d6caf1","source":{"kind":"arxiv","id":"2304.01781","version":2},"attestation_state":"computed","paper":{"title":"Mixing predictions for online metric algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Adam Polak, Antonios Antoniadis, Bertrand Simon, Christian Coester, Marek Eli\\'a\\v{s}","submitted_at":"2023-04-04T13:18:00Z","abstract_excerpt":"A major technique in learning-augmented online algorithms is combining multiple algorithms or predictors. Since the performance of each predictor may vary over time, it is desirable to use not the single best predictor as a benchmark, but rather a dynamic combination which follows different predictors at different times. We design algorithms that combine predictions and are competitive against such dynamic combinations for a wide class of online problems, namely, metrical task systems. Against the best (in hindsight) unconstrained combination of $\\ell$ predictors, we obtain a competitive ratio"},"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":"2304.01781","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-04-04T13:18:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"76295f869faabfb03aae9c84918c127144db330a0cac7c3b8e06ced7d4e1e921","abstract_canon_sha256":"df09dce6586dc2bd192225259449824a1c234960a861d9349ff73f366b23992e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:24:49.351659Z","signature_b64":"Op6ZVC3H7eY59BJUyFpxmixvaaLK5o+eSh4CsFtOV+i4Ouftdm2lVnTKGVPN0kQIoDvbUkhz8pcAokOXtnijDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b7efc31d238e2197c3c571b6a6f8d148e638f05159f218cefeca3cc85d6caf1","last_reissued_at":"2026-07-05T07:24:49.351233Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:24:49.351233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixing predictions for online metric algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Adam Polak, Antonios Antoniadis, Bertrand Simon, Christian Coester, Marek Eli\\'a\\v{s}","submitted_at":"2023-04-04T13:18:00Z","abstract_excerpt":"A major technique in learning-augmented online algorithms is combining multiple algorithms or predictors. Since the performance of each predictor may vary over time, it is desirable to use not the single best predictor as a benchmark, but rather a dynamic combination which follows different predictors at different times. We design algorithms that combine predictions and are competitive against such dynamic combinations for a wide class of online problems, namely, metrical task systems. Against the best (in hindsight) unconstrained combination of $\\ell$ predictors, we obtain a competitive ratio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.01781","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/2304.01781/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":"2304.01781","created_at":"2026-07-05T07:24:49.351291+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.01781v2","created_at":"2026-07-05T07:24:49.351291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.01781","created_at":"2026-07-05T07:24:49.351291+00:00"},{"alias_kind":"pith_short_12","alias_value":"RN7PYMOSHDRB","created_at":"2026-07-05T07:24:49.351291+00:00"},{"alias_kind":"pith_short_16","alias_value":"RN7PYMOSHDRBS7B4","created_at":"2026-07-05T07:24:49.351291+00:00"},{"alias_kind":"pith_short_8","alias_value":"RN7PYMOS","created_at":"2026-07-05T07:24:49.351291+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05479","citing_title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RN7PYMOSHDRBS7B4K4NWU34NCS","json":"https://pith.science/pith/RN7PYMOSHDRBS7B4K4NWU34NCS.json","graph_json":"https://pith.science/api/pith-number/RN7PYMOSHDRBS7B4K4NWU34NCS/graph.json","events_json":"https://pith.science/api/pith-number/RN7PYMOSHDRBS7B4K4NWU34NCS/events.json","paper":"https://pith.science/paper/RN7PYMOS"},"agent_actions":{"view_html":"https://pith.science/pith/RN7PYMOSHDRBS7B4K4NWU34NCS","download_json":"https://pith.science/pith/RN7PYMOSHDRBS7B4K4NWU34NCS.json","view_paper":"https://pith.science/paper/RN7PYMOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.01781&json=true","fetch_graph":"https://pith.science/api/pith-number/RN7PYMOSHDRBS7B4K4NWU34NCS/graph.json","fetch_events":"https://pith.science/api/pith-number/RN7PYMOSHDRBS7B4K4NWU34NCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RN7PYMOSHDRBS7B4K4NWU34NCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RN7PYMOSHDRBS7B4K4NWU34NCS/action/storage_attestation","attest_author":"https://pith.science/pith/RN7PYMOSHDRBS7B4K4NWU34NCS/action/author_attestation","sign_citation":"https://pith.science/pith/RN7PYMOSHDRBS7B4K4NWU34NCS/action/citation_signature","submit_replication":"https://pith.science/pith/RN7PYMOSHDRBS7B4K4NWU34NCS/action/replication_record"}},"created_at":"2026-07-05T07:24:49.351291+00:00","updated_at":"2026-07-05T07:24:49.351291+00:00"}