{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OIFYQ3YO3M6CMUXDFAJWYDKJMP","short_pith_number":"pith:OIFYQ3YO","schema_version":"1.0","canonical_sha256":"720b886f0edb3c2652e328136c0d4963ee7e98354849ba5cbaf0c3752154fb39","source":{"kind":"arxiv","id":"2502.05720","version":1},"attestation_state":"computed","paper":{"title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Lorenzo Croissant, Spyros Angelopoulos, Vianney Perchet, Ziyad Benomar","submitted_at":"2025-02-08T23:25:52Z","abstract_excerpt":"One-max search is a classic problem in online decision-making, in which a trader acts on a sequence of revealed prices and accepts one of them irrevocably to maximise its profit. The problem has been studied both in probabilistic and in worst-case settings, notably through competitive analysis, and more recently in learning-augmented settings in which the trader has access to a prediction on the sequence. However, existing approaches either lack smoothness, or do not achieve optimal worst-case guarantees: they do not attain the best possible trade-off between the consistency and the robustness"},"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":"2502.05720","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-08T23:25:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5cfc5aa9bed1fc3c9267f44a4630758ff98f0d84e9c897f3a5c1009f1b74e678","abstract_canon_sha256":"0a37a268b8c6d7c73a350e96263cfff42b1a266946e28535c28f0f45cde5b3e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:42.540954Z","signature_b64":"Ujz4uhAgK7H8PxeA5DvVjm8/hwAcTMC5/vHBIm68xdN45meJ0ZMJHto/5j1vxgyT7UOgbuzacXLjK36MJosmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"720b886f0edb3c2652e328136c0d4963ee7e98354849ba5cbaf0c3752154fb39","last_reissued_at":"2026-07-05T10:11:42.540526Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:42.540526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Lorenzo Croissant, Spyros Angelopoulos, Vianney Perchet, Ziyad Benomar","submitted_at":"2025-02-08T23:25:52Z","abstract_excerpt":"One-max search is a classic problem in online decision-making, in which a trader acts on a sequence of revealed prices and accepts one of them irrevocably to maximise its profit. The problem has been studied both in probabilistic and in worst-case settings, notably through competitive analysis, and more recently in learning-augmented settings in which the trader has access to a prediction on the sequence. However, existing approaches either lack smoothness, or do not achieve optimal worst-case guarantees: they do not attain the best possible trade-off between the consistency and the robustness"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05720","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/2502.05720/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":"2502.05720","created_at":"2026-07-05T10:11:42.540577+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.05720v1","created_at":"2026-07-05T10:11:42.540577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05720","created_at":"2026-07-05T10:11:42.540577+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIFYQ3YO3M6C","created_at":"2026-07-05T10:11:42.540577+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIFYQ3YO3M6CMUXD","created_at":"2026-07-05T10:11:42.540577+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIFYQ3YO","created_at":"2026-07-05T10:11:42.540577+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06106","citing_title":"The Pareto Frontier of Randomized Learning-Augmented Online Bidding","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06106","citing_title":"The Pareto Frontier of Randomized Learning-Augmented Online Bidding","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OIFYQ3YO3M6CMUXDFAJWYDKJMP","json":"https://pith.science/pith/OIFYQ3YO3M6CMUXDFAJWYDKJMP.json","graph_json":"https://pith.science/api/pith-number/OIFYQ3YO3M6CMUXDFAJWYDKJMP/graph.json","events_json":"https://pith.science/api/pith-number/OIFYQ3YO3M6CMUXDFAJWYDKJMP/events.json","paper":"https://pith.science/paper/OIFYQ3YO"},"agent_actions":{"view_html":"https://pith.science/pith/OIFYQ3YO3M6CMUXDFAJWYDKJMP","download_json":"https://pith.science/pith/OIFYQ3YO3M6CMUXDFAJWYDKJMP.json","view_paper":"https://pith.science/paper/OIFYQ3YO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.05720&json=true","fetch_graph":"https://pith.science/api/pith-number/OIFYQ3YO3M6CMUXDFAJWYDKJMP/graph.json","fetch_events":"https://pith.science/api/pith-number/OIFYQ3YO3M6CMUXDFAJWYDKJMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIFYQ3YO3M6CMUXDFAJWYDKJMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIFYQ3YO3M6CMUXDFAJWYDKJMP/action/storage_attestation","attest_author":"https://pith.science/pith/OIFYQ3YO3M6CMUXDFAJWYDKJMP/action/author_attestation","sign_citation":"https://pith.science/pith/OIFYQ3YO3M6CMUXDFAJWYDKJMP/action/citation_signature","submit_replication":"https://pith.science/pith/OIFYQ3YO3M6CMUXDFAJWYDKJMP/action/replication_record"}},"created_at":"2026-07-05T10:11:42.540577+00:00","updated_at":"2026-07-05T10:11:42.540577+00:00"}