{"as_of":"2026-08-08T17:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb04785d482d6e8f12a3df6d659e439fe8fc39b86f5810f734501f0fda8db370","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:40:43.630481Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.13530","last_updated":"2024-06-22T21:24:15Z","snapshot_observed_at":"2026-08-05T13:10:52.642719Z","submitted_at":"2024-02-21T04:57:32Z","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13530","snapshot_observed_at":"2026-08-07T12:40:43.630481Z","title":"Li, Benjamin Moseley, and Gabriel Visotsky","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24503","last_updated":"2026-05-28T08:22:09Z","snapshot_observed_at":"2026-08-08T09:07:41.442171Z","submitted_at":"2025-05-30T12:06:16Z","title":"Online Fair Division with Additional Information","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:40:43.630481Z"},"links":{"cited_paper":"/paper/2402.13530","citing_paper":"/paper/2505.24503"},"observation_digest":"sha256:ba2771b2e1c50d5d1726e570ade48e2c41f75db31c1d90f7d60b265a05cbd079","observation_id":"db8957e0-7981-432c-a143-6fb27b1bf50d","resolution":{"observed_at":"2026-08-07T12:40:43.630481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13530","last_updated":"2024-06-22T21:24:15Z","snapshot_observed_at":"2026-08-05T13:10:52.642719Z","submitted_at":"2024-02-21T04:57:32Z","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","version":2},"cited_work":{"arxiv_id":"2402.13530","doi":"10.48550/arxiv.2402.13530","metadata_source":"pith","pith_arxiv_id":"2402.13530","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","venue":"math.OC","work_id":"518546dd-4ffc-4bf6-9751-2956c03a04f3","year":2024},"citing_paper":{"arxiv_id":"2606.05380","last_updated":"2026-06-03T19:29:31Z","snapshot_observed_at":"2026-08-07T01:25:27.815270Z","submitted_at":"2026-06-03T19:29:31Z","title":"Learning-Augmented Online Minimization with Dual Predictions","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-28T03:24:27.313367Z"},"links":{"cited_paper":"/paper/2402.13530","citing_paper":"/paper/2606.05380"},"observation_digest":"sha256:363b1b0bf7b72e16920da4ae2fe61109ce9de4dbdb0434371c88c46daf39fe08","observation_id":"b50fe46b-f7da-4277-9b3f-82917ec584e6","resolution":{"observed_at":"2026-07-02T11:36:55.028499Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13530","last_updated":"2024-06-22T21:24:15Z","snapshot_observed_at":"2026-08-05T13:10:52.642719Z","submitted_at":"2024-02-21T04:57:32Z","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","version":2},"cited_work":{"arxiv_id":"2402.13530","doi":"10.48550/arxiv.2402.13530","metadata_source":"pith","pith_arxiv_id":"2402.13530","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","venue":"math.OC","work_id":"518546dd-4ffc-4bf6-9751-2956c03a04f3","year":2024},"citing_paper":{"arxiv_id":"2607.08262","last_updated":"2026-07-09T09:05:59Z","snapshot_observed_at":"2026-08-05T23:47:21.085997Z","submitted_at":"2026-07-09T09:05:59Z","title":"Primal-Dual Online Algorithms for the Parking Permit Problem","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-10T10:26:00.195413Z"},"links":{"cited_paper":"/paper/2402.13530","citing_paper":"/paper/2607.08262"},"observation_digest":"sha256:8be1ca4442d5829ba399b620cbc1a26591dc2ffd61694f631baedfc3e1eda22f","observation_id":"6c31acdd-be80-4eeb-bc7b-7cff3eb781dd","resolution":{"observed_at":"2026-07-10T10:27:01.327795Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13530","last_updated":"2024-06-22T21:24:15Z","snapshot_observed_at":"2026-08-05T13:10:52.642719Z","submitted_at":"2024-02-21T04:57:32Z","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13530","snapshot_observed_at":"2026-08-01T17:38:03.524221Z","title":"arXiv preprint arXiv:2402.13530 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17607","last_updated":"2026-08-05T04:57:10Z","snapshot_observed_at":"2026-08-08T17:10:56.111198Z","submitted_at":"2026-07-20T06:53:59Z","title":"Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles","version":1},"reference_index":152,"source":"arxiv_source","source_observed_at":"2026-08-01T17:38:03.524221Z"},"links":{"cited_paper":"/paper/2402.13530","citing_paper":"/paper/2607.17607"},"observation_digest":"sha256:93321578b54fe35eb59a45f9cb2c50854ce2299e33e65b2abe9b4c1ea925fbd2","observation_id":"5b8cb361-a33a-451a-9daf-26d23c806d26","resolution":{"observed_at":"2026-08-01T17:38:03.524221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13530","last_updated":"2024-06-22T21:24:15Z","snapshot_observed_at":"2026-08-05T13:10:52.642719Z","submitted_at":"2024-02-21T04:57:32Z","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13530","snapshot_observed_at":"2026-07-31T23:55:45.425931Z","title":"Best of many in both worlds: Online resource allocation with predictions under unknown arrival model.arXiv preprint arXiv:2402.13530, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23310","last_updated":"2026-07-25T17:53:10Z","snapshot_observed_at":"2026-07-31T23:55:43.711297Z","submitted_at":"2026-07-25T17:53:10Z","title":"Online Fair Division with Budget Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T23:55:45.425931Z"},"links":{"cited_paper":"/paper/2402.13530","citing_paper":"/paper/2607.23310"},"observation_digest":"sha256:ad0a8ea6cea29035c989bea3b16dc3af04b5bb0f25eec3eab9bfbe0446f6b194","observation_id":"f15339c7-4d07-490f-998a-3a274d3ca378","resolution":{"observed_at":"2026-07-31T23:55:45.425931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.13530/citation-record","integrity":"/paper/2402.13530/integrity","json":"/paper/2402.13530/citation-record.json","paper":"/paper/2402.13530"},"outbound":[],"paper":{"arxiv_id":"2402.13530","last_updated":"2024-06-22T21:24:15Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-05T13:10:52.642719Z","submitted_at":"2024-02-21T04:57:32Z","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2402.13530."}