{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IMGYQCT6V46DGX2YVCIOHACJNK","short_pith_number":"pith:IMGYQCT6","schema_version":"1.0","canonical_sha256":"430d880a7eaf3c335f58a890e380496a84fd03257f751b0503b9d28aa0f26573","source":{"kind":"arxiv","id":"2501.12770","version":1},"attestation_state":"computed","paper":{"title":"On Tradeoffs in Learning-Augmented Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DS","authors_text":"Vianney Perchet, Ziyad Benomar","submitted_at":"2025-01-22T10:12:18Z","abstract_excerpt":"The field of learning-augmented algorithms has gained significant attention in recent years. These algorithms, using potentially inaccurate predictions, must exhibit three key properties: consistency, robustness, and smoothness. In scenarios where distributional information about predictions is available, a strong expected performance is required. Typically, the design of these algorithms involves a natural tradeoff between consistency and robustness, and previous works aimed to achieve Pareto-optimal tradeoffs for specific problems. However, in some settings, this comes at the expense of smoo"},"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":"2501.12770","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-22T10:12:18Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"e46e3bcb2b81870149d95511f1252ab5723d4405a71d4457ea1343c9fc161738","abstract_canon_sha256":"0af579b6195e072119ebb9a00fa2567763384a4c92a144d7fcc5e8fdc7d3946c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:58.390078Z","signature_b64":"xymo+QvwvrXzLCx1LWIiCs1DKyHbD7foUTGNktnVRDUaScXhSgSyffZ5KUaj/7g2xt+E8AU6sK1mzIuq9rHBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"430d880a7eaf3c335f58a890e380496a84fd03257f751b0503b9d28aa0f26573","last_reissued_at":"2026-07-05T10:03:58.389668Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:58.389668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Tradeoffs in Learning-Augmented Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DS","authors_text":"Vianney Perchet, Ziyad Benomar","submitted_at":"2025-01-22T10:12:18Z","abstract_excerpt":"The field of learning-augmented algorithms has gained significant attention in recent years. These algorithms, using potentially inaccurate predictions, must exhibit three key properties: consistency, robustness, and smoothness. In scenarios where distributional information about predictions is available, a strong expected performance is required. Typically, the design of these algorithms involves a natural tradeoff between consistency and robustness, and previous works aimed to achieve Pareto-optimal tradeoffs for specific problems. However, in some settings, this comes at the expense of smoo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12770","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/2501.12770/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":"2501.12770","created_at":"2026-07-05T10:03:58.389732+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.12770v1","created_at":"2026-07-05T10:03:58.389732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12770","created_at":"2026-07-05T10:03:58.389732+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMGYQCT6V46D","created_at":"2026-07-05T10:03:58.389732+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMGYQCT6V46DGX2Y","created_at":"2026-07-05T10:03:58.389732+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMGYQCT6","created_at":"2026-07-05T10:03:58.389732+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05720","citing_title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IMGYQCT6V46DGX2YVCIOHACJNK","json":"https://pith.science/pith/IMGYQCT6V46DGX2YVCIOHACJNK.json","graph_json":"https://pith.science/api/pith-number/IMGYQCT6V46DGX2YVCIOHACJNK/graph.json","events_json":"https://pith.science/api/pith-number/IMGYQCT6V46DGX2YVCIOHACJNK/events.json","paper":"https://pith.science/paper/IMGYQCT6"},"agent_actions":{"view_html":"https://pith.science/pith/IMGYQCT6V46DGX2YVCIOHACJNK","download_json":"https://pith.science/pith/IMGYQCT6V46DGX2YVCIOHACJNK.json","view_paper":"https://pith.science/paper/IMGYQCT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.12770&json=true","fetch_graph":"https://pith.science/api/pith-number/IMGYQCT6V46DGX2YVCIOHACJNK/graph.json","fetch_events":"https://pith.science/api/pith-number/IMGYQCT6V46DGX2YVCIOHACJNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMGYQCT6V46DGX2YVCIOHACJNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMGYQCT6V46DGX2YVCIOHACJNK/action/storage_attestation","attest_author":"https://pith.science/pith/IMGYQCT6V46DGX2YVCIOHACJNK/action/author_attestation","sign_citation":"https://pith.science/pith/IMGYQCT6V46DGX2YVCIOHACJNK/action/citation_signature","submit_replication":"https://pith.science/pith/IMGYQCT6V46DGX2YVCIOHACJNK/action/replication_record"}},"created_at":"2026-07-05T10:03:58.389732+00:00","updated_at":"2026-07-05T10:03:58.389732+00:00"}