{"as_of":"2026-08-11T04:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:34c3ab1cfc60d72b0b5d32e91cc013871282e376b8b43ae1e5320b6d02d3e9b0","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-10T06:31:04.303077+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-11T01:34:31.654380Z","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-07-06T23:18:36.537416Z","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:5322e99df3b117fd29aa72cd8631fef52d6369cc5a6824fc845dd6210c469353","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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-07-06T23:18:36.537416Z","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:67c29418d225642cc3aea0f766e0d5a6bb01eaa2248500a705ae6bfee877b29f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:78ef9bfc3b00f4ab64a72f785d151bcfa16a02354f031d6c3dfd67eca172da50","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:e89213141dc8dc56da0eaf4eb1c8e27dc7697614886ee8cc4d62f8346928c5e3","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:97d1c8e92dffc9add01de8397c53124700df8d96ebc6eeea345d246d0f857e88","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:ff8f12a1332edfd65c1bd88f351d8261b1c3b7547b5e9177c023e95bfc369bcb","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:6b6417d216375d7814b41163ea3b3c8aa68604d1012b0214e73dcf6df0cadf86","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:e3a1c645499c14a451f36cf46404a4e1bbd8be16aa87f9b8b0f01ceeda393fdc","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:138ecdcf46d75aed5521efe2a6f1f662d7e14da2786ea5726db5c65154b96701","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:6d8c049d68c12572ee92a23a95d46bb9501196dc8bcff2eec47679311e0dfe5e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T16:45:00.337460Z","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-11T01:34:31.654380Z","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:a919e1d3d533f42db11bf47b9dd09825de664295e492a8bcc729ba58525e585e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T16:46:21.941952Z","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-11T01:34:31.654380Z","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:5752105c20a852c2d8843ee19cf8dcf61345ebfd75f7479f1b9d712c20788d69","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:13ad59f75a2d5a1870d97f0c8c18b838092ae6425c16c2c8dc62f1efafab13a9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:999f7daeecbb764d1fb347fbcb4e03828cee5f6fcc6fc4e2b16bcb479690e6d6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:67676863e63fb30e6738a19c8642a86cc65086c1cf70e7371bde85e9ce4dcc52","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T19:56:17.117739Z","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-11T01:34:31.654380Z","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:981495400f67a8addf2360aa8cbae8d57cd3c7daafc556a2703085f821d242fa","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:0f501af32a0a4da2d15509fd6502bda31f9a6064abed3256e80591a938d7ad02","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:6e25e423fcae5d0373f7d97bd822619a0b72ea643a00e7f19134717bb9fdba4b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:dde67eaa1b45dd8660cea06c8eb737cc05f1af8e82950eb77323fb2d68413b4d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:f09e65d4a39af69a77a489e9c7dc894b294bb14ede00485f0f18828d8a215749","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:6ea32bf5c7ca0a4b0669ef1afd3a22a5a7a3cc87598cf1b096d80721731943d5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:5cfced41273a3ce5cc03c4cfcbee5329403143b41e681bcf75852e5a16e5d9d4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:9f40e83b0b1539d26196ac55c62a018ccfd94de9941ea92f84784bbcd06f2d4b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:496ca387f222d7de36466277d08ae92100e032cba768a922544ad2015497b0a0","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:e4b6e4f175be2b2d2e0d8d2ba516ffe044508ba8dff99630f615a2195816b8ee","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:a62683358d39082b5667d2b5b1fee289c4c3cd6bb90fc76cb049771e97b14c1b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:631ff45745472235dbcdce7fd332a2845750ce0dcbf1ab6a9de7e71d8272cee3","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:f9c5aee19aff7daf1631cc9fe52072ade93ab47da1b326cb55af2af7f2979846","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:dee774235005d2e9ed5f0d72142be262125aac2f6ac2afa547864cb07074cea6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:48eb1169279141e8c64cb2934741405c2d20e4a9b28a9195a5e57783d7bdd123","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:eae9c884ba7acd75dcd5b99c055aa20ef9bca1ebbc5b35b93d2ada5972eb238e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:73ed7d479f8b3f315d5f233f1109c6f678f9e5dc5d10c426e3ca61d42f6c928c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:ff68401372cfdd9534616195ae0796b58d2238ccc9b8ec1a3e884861958a37d5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:db89de4f1b1e6721ff91edd22ab08ae76eab97127a75ce88063b2016cf0b6152","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:076131432f8f8cf91923cace5cef29c9607e3d7db03780460564e665b5864a21","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-11T01:34:31.654380Z","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:0252b324a17e8af02e0f55830237f72bdf9bfee1c41ccb8fd828ee1fa1f21d08","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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:ad74ffda99d5e14631eb4e962224e624d0869ad862b840ddcb751fc6c97a1a1e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-11T01:34:31.654380Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 2 inbound Pith citation observations for arXiv:2502.05720."}