{"as_of":"2026-08-21T19:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3e333c97420d008e6bef97a071a33d4367c4b5cd66ac2ed4e118f617fa527d23","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:28:05.005341Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T07:04:30.521371Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-15T07:05:11.159981Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"cited_work":{"arxiv_id":"2502.05720","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05720","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pareto- optimality, smoothness, and stochasticity in learning-augmented one-max-search","venue":null,"work_id":"690511b5-b44b-4495-9134-4a036590ad43","year":2025},"citing_paper":{"arxiv_id":"2605.06106","last_updated":"2026-05-14T01:19:54Z","snapshot_observed_at":"2026-08-20T02:16:58.533418Z","submitted_at":"2026-05-07T12:21:40Z","title":"The Pareto Frontier of Randomized Learning-Augmented Online Bidding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-08T06:04:38.090781Z"},"links":{"cited_paper":"/paper/2502.05720","citing_paper":"/paper/2605.06106"},"observation_digest":"sha256:b8bf65dc6ef007d111cc48e5754125d14d4ec848b488c8dcfda1466b7f780d2b","observation_id":"54186fa1-1c87-4417-bf5a-c27f56650ff8","resolution":{"observed_at":"2026-05-11T21:16:27.376268Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"cited_work":{"arxiv_id":"2502.05720","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05720","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pareto- optimality, smoothness, and stochasticity in learning-augmented one-max-search","venue":null,"work_id":"690511b5-b44b-4495-9134-4a036590ad43","year":2025},"citing_paper":{"arxiv_id":"2605.06106","last_updated":"2026-05-14T01:19:54Z","snapshot_observed_at":"2026-08-20T02:16:58.533418Z","submitted_at":"2026-05-07T12:21:40Z","title":"The Pareto Frontier of Randomized Learning-Augmented Online Bidding","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-15T07:04:30.521371Z"},"links":{"cited_paper":"/paper/2502.05720","citing_paper":"/paper/2605.06106"},"observation_digest":"sha256:84286c88305ef8e30b654e6453d84619e25c1847bf92cab984e83891535ea604","observation_id":"aa123287-9747-4505-9f57-99e2f443402b","resolution":{"observed_at":"2026-05-15T07:05:11.164643Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05720/citation-record","integrity":"/paper/2502.05720/integrity","json":"/paper/2502.05720/citation-record.json","paper":"/paper/2502.05720"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.627084Z","title":"Online facility location with multiple advice","venue":null,"work_id":"8bcc9881-d7cf-4dca-9fca-c2eb0caa6804","year":2021},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.824566Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:77cadaf5e81ba074cd5a1585fac5f7f24ddc6cae0848c3f365861fece3e3f07f","observation_id":"ffddff8c-801c-4d72-b7ea-8428adf486c1","resolution":{"observed_at":"2026-08-08T18:28:05.632278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.610875Z","title":"Online search with a hint","venue":null,"work_id":"ca616e7b-3cce-45c2-9fd6-6bf870406690","year":2023},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.830292Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:eedd77ca673a7125c8f3bc9d844f04b43a8454f8dd3e0dfb1efb4466e094a6c3","observation_id":"6d09db8d-1026-47bf-82f9-638183e4d929","resolution":{"observed_at":"2026-08-08T18:28:05.615578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.594864Z","title":"Online search with best-price and query-based predictions","venue":null,"work_id":"efed8a2b-2ba3-46e7-b289-c579935916f7","year":2022},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.835246Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:aaf3c24e95c8676d8bb64040972f59561f78de17fa9ab8b0300011d2e89bb5db","observation_id":"e8c8a826-aae3-4feb-856a-567ab3909ec9","resolution":{"observed_at":"2026-08-08T18:28:05.599949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.579117Z","title":"Contract scheduling with distributional and multiple advice","venue":null,"work_id":"1190628d-5475-4c8a-9b93-628014368b39","year":2024},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.840788Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:90c523676e62c9e22ae10d1eb02461bcc1911a1b025e808a41cbae56909cb00e","observation_id":"9b878d17-8058-451c-aae7-a93d263e79c4","resolution":{"observed_at":"2026-08-08T18:28:05.584422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.562650Z","title":"Secretary and online matching problems with machine learned advice","venue":null,"work_id":"36a5ba4c-c8df-46a2-b5be-6d47568f5a54","year":2020},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.846469Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:6d9176eeac1570ae55165c9b8f1f6d52ffd0facfb66b5559420c9664d158be98","observation_id":"66f0903b-c9fd-4a10-b6d3-14e1783ed700","resolution":{"observed_at":"2026-08-08T18:28:05.568279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.545099Z","title":"Online graph algorithms with predictions","venue":null,"work_id":"26219b01-6832-44a5-a693-f5fb5667541e","year":2022},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.851647Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:5ca359e3cd29b4c590bfa329e50ff4755f3ebfcb19550927187ade0ae5fd93c6","observation_id":"8f0e0487-4e3e-4417-83e5-8c0d6b10e591","resolution":{"observed_at":"2026-08-08T18:28:05.550730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.526635Z","title":"Sorting with predictions","venue":null,"work_id":"916cc7eb-0549-46ff-b545-e34fe5574044","year":2023},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.857378Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:3593bc5145c28a0b827cd543aa647d9716fc17b324b9c4b5fb909cbe54c10f0e","observation_id":"f4c4efe0-1ab9-441c-a901-01b3f3c4e813","resolution":{"observed_at":"2026-08-08T18:28:05.531631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.510242Z","title":"The primal-dual method for learning augmented algorithms","venue":null,"work_id":"b25d5d05-59c7-4eb9-9826-2be119eada91","year":2020},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.862517Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:80fd93bd894e61dcfe9b315ee217c4f872ab17a393490592216220619117fecf","observation_id":"865c1074-90da-45e5-8f60-776065ece794","resolution":{"observed_at":"2026-08-08T18:28:05.515504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04793","last_updated":"2024-11-17T21:13:54Z","snapshot_observed_at":"2026-08-17T12:31:09.783382Z","submitted_at":"2024-06-07T09:40:09Z","title":"Learning-Augmented Priority Queues","version":2},"cited_work":{"arxiv_id":"2406.04793","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.04793","snapshot_observed_at":"2026-08-08T18:28:05.110332Z","title":"Learning-Augmented Priority Queues","venue":"cs.DS","work_id":"73817e5d-4370-4c1f-b287-6ae987e2e833","year":2024},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.868190Z"},"links":{"cited_paper":"/paper/2406.04793","citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:8fa622dc1f44a158319258ea30958d48f42d9e18eb66ba6a4a3fc7ff5d62b439","observation_id":"28608350-6044-4dc8-94eb-d8f0c7a595fa","resolution":{"observed_at":"2026-08-08T18:28:05.115933Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-19T20:22:00.222544Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"cited_work":{"arxiv_id":"2501.12770","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.12770","snapshot_observed_at":"2026-08-08T18:28:05.087085Z","title":"On Tradeoffs in Learning-Augmented Algorithms","venue":"cs.DS","work_id":"44a18a2e-f5c2-4d0b-bb65-d1a1d9334466","year":2025},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.874218Z"},"links":{"cited_paper":"/paper/2501.12770","citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:c78043369d743c21809c746d4a84ffbfef59a842a069fa5628c6b59debe75d7e","observation_id":"e563865a-b86c-43e6-a8ca-c967eb2a2b80","resolution":{"observed_at":"2026-08-08T18:28:05.092639Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.494032Z","title":"Online computation and competitive analysis","venue":null,"work_id":"a2c16526-8d21-4b9d-9dc4-9250959a4bfc","year":2005},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.879989Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:80318583a13eed020226dec92c0eddb7b27fd2d7bfc582497ace6edb1eb07400","observation_id":"fbdd32c9-924f-451e-aa8f-eb35ae939c36","resolution":{"observed_at":"2026-08-08T18:28:05.499264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.477640Z","title":"Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems","venue":null,"work_id":"3b552873-9bee-42cf-82b4-c35f9c75ee50","year":2023},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.886331Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:08eaed9fe3090bc38a40f5a91135af8e8ac2ef4ed65688c7117c7af21e06370c","observation_id":"fe27cece-af71-440e-afaf-4d444a14c2fd","resolution":{"observed_at":"2026-08-08T18:28:05.482968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.459897Z","title":"Financial modelling with jump processes","venue":null,"work_id":"af88a2e7-3feb-46b1-8b4e-27184ddfbafa","year":2004},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.891709Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:934225a0cdf0103834bdc0cd2debb87767a0493a5e90c829d7c7df48f6c068f0","observation_id":"a5294571-1904-4295-9671-b9ed49fcbd17","resolution":{"observed_at":"2026-08-08T18:28:05.465218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16030","last_updated":"2024-11-25T01:15:31Z","snapshot_observed_at":"2026-08-19T05:52:11.672639Z","submitted_at":"2024-11-25T01:15:31Z","title":"Binary Search with Distributional Predictions","version":1},"cited_work":{"arxiv_id":"2411.16030","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.16030","snapshot_observed_at":"2026-08-08T18:28:05.060216Z","title":"Binary Search with Distributional Predictions","venue":"cs.LG","work_id":"0fce18ef-7010-4433-9243-c6c1deb6fdc2","year":2024},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.896644Z"},"links":{"cited_paper":"/paper/2411.16030","citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:e60f4b165d1edfbdbb8c849d886b25fa632cfe75ed3a19b9b45e1f889e3d5299","observation_id":"ded252d5-28e7-4f8c-91c1-59326a264226","resolution":{"observed_at":"2026-08-08T18:28:05.068088Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.443749Z","title":"Optimal Execution : A Review","venue":null,"work_id":"eecf91a0-9d8e-4d38-8f49-01d7ac256c33","year":2022},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.902124Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:ec51f197ab738e650d184be67e1ef90bd1fb9f60543115e742ee068f88f8ba6b","observation_id":"943a8559-df08-4d55-a7f3-a31ae6985f89","resolution":{"observed_at":"2026-08-08T18:28:05.449302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.427713Z","title":"Secretaries with advice","venue":null,"work_id":"85af16d3-6c3a-4409-84ef-ff76eed391e4","year":2024},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.907517Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:826dbd45a54c204d5e04ed32408a0711deb898b453f5d4633b9f2da2fbc2f16e","observation_id":"c9264edb-d2ab-4855-86ea-9b94429c928b","resolution":{"observed_at":"2026-08-08T18:28:05.432714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.409712Z","title":"Competitive solutions for online financial problems","venue":null,"work_id":"7706d6a1-80f2-41ac-87be-b4ae9efe758a","year":1998},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.912496Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:23d6c92717dad6e5e0f35952517ceacd61ffc758e61ad381a60d79114302f44f","observation_id":"efefb96f-757e-4e31-b4da-2c2f45eac19d","resolution":{"observed_at":"2026-08-08T18:28:05.414861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.393826Z","title":"Overcoming brittleness in pareto-optimal learning augmented algorithms","venue":null,"work_id":"842c7618-2d57-46ae-b4a0-d146c3af623a","year":2024},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.917331Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:0135f5aefaddd58465817b69fc97c2c782fdbe31b4fbd352b990579848da2f9e","observation_id":"23e24c8c-dbfe-46fc-8458-1bc91f4467f1","resolution":{"observed_at":"2026-08-08T18:28:05.399009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.377774Z","title":"Online algorithms for rent-or-buy with expert advice","venue":null,"work_id":"65f3141b-ca82-4dc9-9a98-294e9d10ec1e","year":2019},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.922364Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:918e272e935a113175f5955b13d92d3c58691b4e91add95b66b02c7f45457d99","observation_id":"91baa488-63f7-4eab-ba1d-9d97b1802df4","resolution":{"observed_at":"2026-08-08T18:28:05.382710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.361697Z","title":"Online knapsack with frequency predictions","venue":null,"work_id":"ab01a5ab-eae7-4556-838b-ea0c31be56cd","year":2021},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.927267Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:807f4f5a0c1d878b016e9bda9a12942c808c65ac846af52435430827e97a117a","observation_id":"fcc3c739-d4b4-44d4-9fab-481e6570d930","resolution":{"observed_at":"2026-08-08T18:28:05.366982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.344494Z","title":"Online scheduling via learned weights","venue":null,"work_id":"663e4557-cf99-46ae-94e1-9da055f0552d","year":2020},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.932291Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:b6db760c5f086ab5ab2bdb604fb24ecf6bcfd58818a30340ec479a7a047bbcde","observation_id":"a2520ce0-e2f6-416d-acef-df817f3b52da","resolution":{"observed_at":"2026-08-08T18:28:05.350109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.327334Z","title":null,"venue":null,"work_id":"bfcc74b3-a160-439f-82c7-7b76bd238cc1","year":2024},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.937316Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:488659c0c671fe3dbec8dff54caea4ecd359763dd73433721426c309b6ec5b8b","observation_id":"bf64bb2c-2247-4d67-b65d-5e0685c51e7d","resolution":{"observed_at":"2026-08-08T18:28:05.332516Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.310753Z","title":"Learning augmented binary search trees","venue":null,"work_id":"6031e1bb-3a59-4a5c-bba3-c067908edeff","year":2022},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.942619Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:503e5c4363563e22676e85b996d0703e3c28c144f5def6cae7da9b38b8afc049","observation_id":"beb8fbe3-d1fe-43a3-bf0a-13fb55a0284e","resolution":{"observed_at":"2026-08-08T18:28:05.316150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.294348Z","title":"Repository of works on algorithms with predictions","venue":null,"work_id":"a625b973-df22-4e37-96cc-929d1aa1a3a6","year":2025},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.947997Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:a26bcf65a882b08dae9ce681e4cb8c391a2ccbb185dc9694deac991985032caf","observation_id":"5dc1226e-2605-47a0-90ed-9e5fe54cad42","resolution":{"observed_at":"2026-08-08T18:28:05.299505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.278291Z","title":"Optimal algorithms for k-search with application in option pricing","venue":null,"work_id":"12d82082-48b4-426a-94f8-1d60e3ca1c85","year":2009},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.953350Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:f3ce8d0a5f781f8e920c87d6c4d3c976c98f8974c21b60fa11ad682a5604985b","observation_id":"ce3d2f58-ba23-41fa-b6da-59b02b1ed3a1","resolution":{"observed_at":"2026-08-08T18:28:05.283554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.261302Z","title":"Competitive caching with machine learned advice","venue":null,"work_id":"165cb5c6-c8d7-4fa8-a50d-be335d197224","year":2018},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.958445Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:e529e907ad7ed0510b5823e7d618623b50061f4dce38966eccc4abe106492671","observation_id":"06d6a102-c41d-4743-adab-9a0f03c17723","resolution":{"observed_at":"2026-08-08T18:28:05.266678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.244960Z","title":null,"venue":null,"work_id":"38932d51-b473-4d06-a8d8-143f75beb9c9","year":1975},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.963386Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:e8964d453b62c93250f2123102b933cf741b7b89daf4380035302562e591ad31","observation_id":"31621b0f-f41f-479f-83c6-caa41619e3f0","resolution":{"observed_at":"2026-08-08T18:28:05.250433Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.228795Z","title":"Online algorithms for conversion problems: a survey","venue":null,"work_id":"7b2f39f2-97c8-495a-b12d-4a72286637ea","year":2014},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.969474Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:ed9d5e7ad5cf69fdda80335ab134191868ae3fb3f2aee0f50d5cc8e3e0ef2051","observation_id":"b9825795-bcd2-4cc6-9ef9-9d5c1d21b33b","resolution":{"observed_at":"2026-08-08T18:28:05.234191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.213784Z","title":"Improving online algorithms via ML predictions","venue":null,"work_id":"acf21b5b-3527-4a23-899a-4a7f8d061d69","year":2018},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.976049Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:c16571e2a0f959a19ca5e1b3dd5dfa23b92898385a33e99faaf0fa40b961a98c","observation_id":"0c63296b-4ebe-4405-86d1-a3b475e63213","resolution":{"observed_at":"2026-08-08T18:28:05.218630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.197138Z","title":"Optimal adaptive price search","venue":null,"work_id":"00b754b2-0509-4bdb-83c3-6b59b076e9a8","year":1981},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.980590Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:f85593f2c6f020d5518c0394353e3004617b7ac48ec36bb177b17bae70e2f020","observation_id":"cad5d9d5-241f-40c4-ba91-a103910f7d38","resolution":{"observed_at":"2026-08-08T18:28:05.202308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.179909Z","title":"Pareto- Optimal Learning - Augmented Algorithms for Online Conversion Problems","venue":null,"work_id":"95562c63-7f2a-4f38-9dee-7884ea4326c2","year":2021},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.985291Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:da1037b6ce4bca36e764128b5d51f142263d7a6b9e3e6e8eea0cc675057325b9","observation_id":"40fa4156-4d6c-4e94-9ee1-b8076e964007","resolution":{"observed_at":"2026-08-08T18:28:05.186133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.161789Z","title":"Online algorithms with uncertainty-quantified predictions","venue":null,"work_id":"1b156db9-a806-4504-b4bc-6a6aaf205770","year":2024},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.990016Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:49f5c4dfdfc2aeb90f70b92340ac01a9253459429e843ed094152eb0a444565b","observation_id":"44e953f6-56bf-403a-8a15-e46ee4a1790e","resolution":{"observed_at":"2026-08-08T18:28:05.167615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:04.994747Z","title":"Optimal Transport , volume 338 of Grundlehren der mathematischen Wissenschaften","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:04.994747Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:a262cd252914378a7afd4510ce3f8fffa208eee0f27cb37b65145bff5de70802","observation_id":"9e7dc5b7-e127-4482-a91a-65139bb934b5","resolution":{"observed_at":"2026-08-08T18:28:04.994747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.144614Z","title":"Optimal robustness-consistency trade-offs for learning-augmented online algorithms","venue":null,"work_id":"86325cbb-496d-4037-9270-8d61810132f0","year":2020},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:05.000163Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:ec539495e88fbbb3b72934909348c0516c03eb3c493f9ffd842054542c8a3652","observation_id":"3517bbcd-b38e-4828-a3fb-24abef10f9e5","resolution":{"observed_at":"2026-08-08T18:28:05.150024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:28:05.127926Z","title":"Robust learning-augmented dictionaries","venue":null,"work_id":"14724718-076b-4d4a-923f-a6872d56dd9b","year":2024},"citing_paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T18:28:05.005341Z"},"links":{"citing_paper":"/paper/2502.05720"},"observation_digest":"sha256:df90275f0c7ae9f5681a177ebdfc4320d6bd05d568349d250b330343eeff842f","observation_id":"0c4d68d4-8b09-4c70-b433-a782b292ebb8","resolution":{"observed_at":"2026-08-08T18:28:05.133100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.05720","last_updated":"2025-02-08T23:25:52Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T20:22:13.432646Z","submitted_at":"2025-02-08T23:25:52Z","title":"Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":3,"verified_fuzzy":29},"total_outbound_references":35},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 2 inbound Pith citation observations for arXiv:2502.05720."}