{"as_of":"2026-08-21T15:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e559820e5b50fea3304f01ad9e8c61147ff3c8239cf903e5e34aa20b8189a627","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:49:00.279928Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:28:04.896644Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T18:28:05.060216Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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"}}],"links":{"evidence":"/evidence","html":"/paper/2411.16030/citation-record","integrity":"/paper/2411.16030/integrity","json":"/paper/2411.16030/citation-record.json","paper":"/paper/2411.16030"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:49:00.109427Z","title":"Learning- augmented mechanism design: Leveraging predictions for facility location","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.109427Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:c01ca6282509b628626d4fd99e1568034ec053ecfc27aa366305147cfb68388d","observation_id":"78f5f2a0-7f14-484e-ab12-6aba96e1f281","resolution":{"observed_at":"2026-08-12T13:49:00.109427Z","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-12T13:49:00.993028Z","title":"Two-stage stochastic integer programming: A brief introduction","venue":null,"work_id":"d862807f-2382-4a9c-ab2d-60c09192f18e","year":2010},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.115595Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:6afdb742a491be01ee2dc2b42975bec096010aa7c7e0253afa3f3b328e169959","observation_id":"a58e5f15-a064-452a-bca0-4602a53bc4bd","resolution":{"observed_at":"2026-08-12T13:49:00.999855Z","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":"2210.11222","last_updated":"2023-05-08T16:29:34Z","snapshot_observed_at":"2026-08-18T10:07:54.524664Z","submitted_at":"2022-10-20T12:59:00Z","title":"Learning-Augmented Private Algorithms for Multiple Quantile Release","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.11222","snapshot_observed_at":"2026-08-12T13:49:00.121090Z","title":"Private algorithms with private predictions","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.121090Z"},"links":{"cited_paper":"/paper/2210.11222","citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:aeffc7eb5327e9014fb3fd3631709884975391f0ce9a6339d08e78b9ebba6844","observation_id":"d6b1d6b0-e7f8-45ed-8705-ce95629b2e76","resolution":{"observed_at":"2026-08-12T13:49:00.121090Z","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-12T13:49:00.969192Z","title":"Online algorithms with multiple predictions","venue":null,"work_id":"12d2b0e5-993c-4954-83ae-3742d0f85597","year":2022},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.127008Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:1eeca95625433301e1d7031e0e601d3947420249c6eb8b2f6a7f459e979205fd","observation_id":"d07e507c-84a6-4a57-ad48-ba5464ee8e53","resolution":{"observed_at":"2026-08-12T13:49:00.975358Z","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":"10.24963/ijcai.2024/404","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:49:00.374624Z","title":"Contract scheduling with distributional and multiple advice","venue":null,"work_id":"458c4557-a863-4a22-913a-64c3e5cdcbca","year":2024},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.132877Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:e064754a7635d41987f7f7b67aec723e295ae92630154012a2da11496171423c","observation_id":"ccea667b-c64b-4e54-b979-ed9e31207bed","resolution":{"observed_at":"2026-08-12T13:49:00.382106Z","resolver_source":"doi","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-12T13:49:00.948909Z","title":"Generalization in portfolio- based algorithm selection","venue":null,"work_id":"818479e2-e058-4b86-a512-0dafb05ec629","year":2021},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.139030Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:c2d85b7dd70fd2101f829c557c4f6eccefb3300a924e1caadbb5a860f318c189","observation_id":"34e27aaa-ca58-4ec3-a2a1-128bd908dec9","resolution":{"observed_at":"2026-08-12T13:49:00.955099Z","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-12T13:49:00.925260Z","title":"The primal-dual method for learning augmented algorithms","venue":null,"work_id":"e24739bb-a223-497b-a372-eb7efd2618fc","year":2020},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.144697Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:a2beca6f3fb21de802d75a8c18a4a71627c3104316c600c13be89717b9254dea","observation_id":"a938a852-0759-4d71-a5fe-a1f53ead87a2","resolution":{"observed_at":"2026-08-12T13:49:00.932909Z","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-12T13:49:00.904047Z","title":"On the power of robust solutions in two-stage stochastic and adaptive optimization problems.Mathematics of Operations Research, 35(2):284–305, 2010","venue":null,"work_id":"b179012b-9ca8-4940-a5b3-22ef2fc9f1eb","year":2010},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.150422Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:ba54803591f0f9d74bac6dc38ee261b161a0df90c1c9884d669ddbd52832332f","observation_id":"fe9edc0f-aefd-407b-8009-9fd6d29f1442","resolution":{"observed_at":"2026-08-12T13:49:00.909724Z","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-12T13:49:00.883929Z","title":"Two-stage sample robust optimization","venue":null,"work_id":"ed373604-13f6-4acf-8411-b86743c893db","year":2022},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.155325Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:300d2b4480c9cb0f3fd12660b802dbce046c44e714360c27f8246cd12486a3ab","observation_id":"2a328e0e-c6d4-4ffb-a8ad-0f952977612b","resolution":{"observed_at":"2026-08-12T13:49:00.889952Z","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-12T13:49:00.862694Z","title":"Beyond IID: data-driven decision-making in heterogeneous environments","venue":null,"work_id":"405be4fc-579d-4657-8f10-95e6f1217818","year":2022},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.160604Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:bdff1c940d6170d0d425b1544a377a2f9678357e83634c442727e8dc4c6c7312","observation_id":"08a3030b-029b-4daf-aff8-4ea72ad8ba76","resolution":{"observed_at":"2026-08-12T13:49:00.868659Z","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-12T13:49:00.830870Z","title":"Predictive flows for faster ford-fulkerson","venue":null,"work_id":"7061b24b-85ec-4d29-9206-72958db5ac8a","year":2023},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.165856Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:67a865eba7df3a3c2795ceb88a14e817b78761bc924bef58b23e13d19e759996","observation_id":"b058a631-f295-4057-8336-4cfb23ae67ad","resolution":{"observed_at":"2026-08-12T13:49:00.840666Z","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-12T13:49:00.800335Z","title":"Learning online algorithms with distributional advice","venue":null,"work_id":"ed49aecc-515c-456a-9531-7338b2c69687","year":2021},"citing_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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.171120Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:20f4dd6ce0e2b299585e59f9bc9dbd6bafd9ec9861c82a539684986dea2b2ae7","observation_id":"51557004-60b6-42e9-8a20-fdbe3bdd4e19","resolution":{"observed_at":"2026-08-12T13:49:00.809066Z","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-12T13:49:00.776895Z","title":"Faster matchings via learned duals","venue":null,"work_id":"cd7e5e9c-4037-4eb7-b8c0-b15e589f623a","year":2021},"citing_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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.177202Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:9b04fa69f127bc857b808d539eb8eb1159ef06665d3c05fda2e08c801c568b06","observation_id":"66cb89c6-145d-4301-8c88-d752d3b047ce","resolution":{"observed_at":"2026-08-12T13:49:00.784159Z","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-12T13:49:00.754800Z","title":"Algorithms with prediction portfolios","venue":null,"work_id":"22478e3f-5658-4d01-904b-ce2e3cc14648","year":2022},"citing_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},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.182912Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:67ea140dd4cc2f92010e800fbb60c0aae63dfd1d360f9732ef178bd0b2894966","observation_id":"801da375-c97b-486c-b5ae-689856b12cc9","resolution":{"observed_at":"2026-08-12T13:49:00.761840Z","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-12T13:49:00.189789Z","title":"Posted pricing and prophet inequalities with inaccurate priors","venue":null,"work_id":null,"year":2019},"citing_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},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.189789Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:cfc1e2602de34e0261faff94303675073ba31d635d7d569c3b4162efb10e4f5c","observation_id":"2c9ea76d-9f29-4d09-879c-5911f3c9b3e0","resolution":{"observed_at":"2026-08-12T13:49:00.189789Z","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-12T13:49:00.734040Z","title":"Online knapsack with frequency predictions","venue":null,"work_id":"7c098e82-a5f8-4999-b9a9-9dedb9bfa2f3","year":2021},"citing_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},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.195337Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:37670d15b52386b71d401625a0792b7786356fd723c0f5a69c4097acb7f3c109","observation_id":"19fbc4ab-1326-451c-829a-ba6358019622","resolution":{"observed_at":"2026-08-12T13:49:00.741246Z","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":"2312.14564","last_updated":"2023-12-22T09:48:45Z","snapshot_observed_at":"2026-08-19T02:01:23.110974Z","submitted_at":"2023-12-22T09:48:45Z","title":"Online Covering with Multiple Experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14564","snapshot_observed_at":"2026-08-12T13:49:00.200958Z","title":"Online covering with multiple experts","venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.200958Z"},"links":{"cited_paper":"/paper/2312.14564","citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:90341741de4af05f8a7080af7a04cdbcc1e4b2e807a2d054b5fa301387a66c7a","observation_id":"49834b5d-d787-4051-817e-e7db23b51081","resolution":{"observed_at":"2026-08-12T13:49:00.200958Z","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-12T13:49:00.716091Z","title":"A guide to sample average approximation","venue":null,"work_id":"3b31195a-63f1-4688-9e69-88602fec4275","year":2015},"citing_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},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.206787Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:8def83c728c6b40e17a403ec3eb3792d1d6a0337cf29393199ee3101dd23f968","observation_id":"34ede6a1-3539-4040-9499-eae738f7cbeb","resolution":{"observed_at":"2026-08-12T13:49:00.721565Z","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-12T13:49:00.212410Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_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},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.212410Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:6aaa90c1af12b431fdb69869703183e3df7b2dad71cdedf261c25ca1a858680e","observation_id":"ff652799-24bf-4951-a358-0bfd4588cdc7","resolution":{"observed_at":"2026-08-12T13:49:00.212410Z","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-12T13:49:00.697488Z","title":"The case for learned index structures","venue":null,"work_id":"2ac5b0b5-7c4c-459d-9800-fd3ec1faf15f","year":2018},"citing_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},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.217373Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:ba3d50cd3e2eb709b6a2831974d4b2c2ef21a4e51c6d5a838b74092e5dab1f89","observation_id":"a5bbbd97-a43d-4c0d-b6dd-2b4629bf05fd","resolution":{"observed_at":"2026-08-12T13:49:00.704746Z","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-12T13:49:00.222262Z","title":"Online scheduling via learned weights","venue":null,"work_id":null,"year":2020},"citing_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},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.222262Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:48e15e80dc3fc1e139f9fb532862ede234bde678b84b89963388f9b0b21ee6f6","observation_id":"6c5d10bc-b506-4af9-858b-6efc341f685d","resolution":{"observed_at":"2026-08-12T13:49:00.222262Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:49:00.227605Z","title":"Learning augmented binary search trees","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.227605Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:26a5b530774d901802dcd410e14d6ba82ad1a10d14910dbb9afe6404ee6f2a30","observation_id":"8c9b1997-0ce2-4b31-9fa3-8f842df7ba17","resolution":{"observed_at":"2026-08-12T13:49:00.227605Z","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-12T13:49:00.657928Z","title":"Algorithms with predictions","venue":null,"work_id":"313ee7e6-178f-4260-88c7-4b1087fc9fa6","year":2022},"citing_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},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.232647Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:abbd1f235827b75b2f9b27f45f2e3f735054de2eede9589fc237bbdbeb7db2d5","observation_id":"51c64986-36e1-46b3-91c3-c26db923dad1","resolution":{"observed_at":"2026-08-12T13:49:00.665221Z","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-12T13:49:00.237879Z","title":"Competitive caching with machine learned advice","venue":null,"work_id":null,"year":2021},"citing_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},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.237879Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:fc65c579e76753a998302529742b5d19924ba19b0fd4d14c5b4832d00df0bcef","observation_id":"5cb167f4-c38c-4444-9a83-77e771446ba4","resolution":{"observed_at":"2026-08-12T13:49:00.237879Z","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-12T13:49:00.622340Z","title":"Online list labeling with predictions","venue":null,"work_id":"ab835049-739d-452e-b5f7-760a4a7ed4e5","year":2024},"citing_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},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.242739Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:6e9a8e156cdeb8d3d28fc337f2f11691be776bdb00257becee0d3f09b3d169e2","observation_id":"d7eff8fc-5190-4c1c-8b6a-cdcc6a8526ed","resolution":{"observed_at":"2026-08-12T13:49:00.628350Z","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-12T13:49:00.602724Z","title":"Incremental topo- logical ordering and cycle detection with predictions","venue":null,"work_id":"7ac7d068-0343-43c1-a6e2-646813de9f53","year":2024},"citing_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},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.247956Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:7120a829e2d58fb51581eea817b989b89f30a7c796da7d4ddad5fe06b32debe2","observation_id":"f78af362-6078-4686-9f5e-ac343fd1f651","resolution":{"observed_at":"2026-08-12T13:49:00.608159Z","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-12T13:49:00.582053Z","title":"Nearly optimal binary search trees.Acta Informatica, 5:287–295, 1975","venue":null,"work_id":"09f81b7e-f4a5-484c-9b6f-8ad1f94ae11d","year":1975},"citing_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},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.252858Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:117c1ebf022c309be470ca3b0ca48af15ef18f61cd0855eb26c6f7b8460f3f08","observation_id":"97b6c38b-2ae1-481a-b233-641700717f98","resolution":{"observed_at":"2026-08-12T13:49:00.588173Z","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-12T13:49:00.258776Z","title":"Cambridge University Press, 2021","venue":null,"work_id":null,"year":2021},"citing_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},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.258776Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:11dc395b6a470ca1d87ac0c63432818f9210949ef8830fbfa965a8c22c755b35","observation_id":"076411b0-7525-4754-8dfa-17b544cf9a2c","resolution":{"observed_at":"2026-08-12T13:49:00.258776Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:49:00.264638Z","title":"Motifs in temporal networks","venue":null,"work_id":null,"year":2017},"citing_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},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.264638Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:8235a1fb6190cdf88f83e63bb3c5ca1c73fb3e1977857173f9e5b7450fa174d3","observation_id":"a9d0830a-d2c1-4cc1-a27e-5f7232d81250","resolution":{"observed_at":"2026-08-12T13:49:00.264638Z","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-12T13:49:00.546759Z","title":"Improving online algorithms via ml predictions","venue":null,"work_id":"e09c6bba-11a0-4df3-94e6-1143af5eed55","year":2018},"citing_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},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.269654Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:27780ae73550f47633c9e329e9ea4f3019d528580eb0763b83a672c2032b793a","observation_id":"0b5d6ce1-9d1e-4494-9e88-237cf84e4c9d","resolution":{"observed_at":"2026-08-12T13:49:00.553149Z","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-12T13:49:00.528177Z","title":"Approximation algorithms for 2-stage stochastic optimization problems","venue":null,"work_id":"8169229b-5a5f-4184-9c8c-d6008e246500","year":2006},"citing_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},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.274926Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:bded117d366e13cfd1283fe48a2209689369811d3929350009099d1c77471a6a","observation_id":"98d4c21a-edec-4251-baa8-23b0ed8ad516","resolution":{"observed_at":"2026-08-12T13:49:00.534310Z","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-12T13:49:00.509146Z","title":"Partitioned learned bloom filters","venue":null,"work_id":"66ee763d-839b-43d3-a3c7-062c04327dfc","year":2021},"citing_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},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T13:49:00.279928Z"},"links":{"citing_paper":"/paper/2411.16030"},"observation_digest":"sha256:98f7cf26a3399c452e5d12dbefd12775b904022ef279706f148e2d64328f30f7","observation_id":"75895aca-a39d-4047-b889-211483bc1b87","resolution":{"observed_at":"2026-08-12T13:49:00.515114Z","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":"2411.16030","last_updated":"2024-11-25T01:15:31Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T05:52:11.672639Z","submitted_at":"2024-11-25T01:15:31Z","title":"Binary Search with Distributional Predictions"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":21},"total_outbound_references":32},"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 32 of 32 outbound references and 1 inbound Pith citation observation for arXiv:2411.16030."}