{"as_of":"2026-08-11T13:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:12414e227dc4b6faf8bf63bdca8a17559dcb402838465b2168996d471573cc45","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T00:46:43.150210Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.03817/citation-record","integrity":"/paper/2502.03817/integrity","json":"/paper/2502.03817/citation-record.json","paper":"/paper/2502.03817"},"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-09T00:46:43.246291Z","title":"Online bin packing with predic- tions","venue":null,"work_id":"2aba8759-e07b-40d8-83e4-b866f28ae18e","year":2023},"citing_paper":{"arxiv_id":"2502.03817","last_updated":"2025-02-06T07:06:06Z","snapshot_observed_at":"2026-08-11T04:38:37.129154Z","submitted_at":"2025-02-06T07:06:06Z","title":"Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T00:46:42.977449Z"},"links":{"citing_paper":"/paper/2502.03817"},"observation_digest":"sha256:079416f45f9f3d144efa59e5746d11fc78af4adf35f2776e98024a92831673f7","observation_id":"8b4fe6cd-4ce1-40d4-ae4c-0385c94381aa","resolution":{"observed_at":"2026-08-09T00:46:43.249756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04122","last_updated":"2024-08-07T23:15:21Z","snapshot_observed_at":"2026-08-11T04:53:16.503788Z","submitted_at":"2024-08-07T23:15:21Z","title":"Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms","version":1},"cited_work":{"arxiv_id":"2408.04122","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.04122","snapshot_observed_at":"2026-08-09T00:46:43.174532Z","title":"Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms","venue":"cs.LG","work_id":"951c23db-309f-4866-84b7-e76abcd8a602","year":2024},"citing_paper":{"arxiv_id":"2502.03817","last_updated":"2025-02-06T07:06:06Z","snapshot_observed_at":"2026-08-11T04:38:37.129154Z","submitted_at":"2025-02-06T07:06:06Z","title":"Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T00:46:42.981233Z"},"links":{"cited_paper":"/paper/2408.04122","citing_paper":"/paper/2502.03817"},"observation_digest":"sha256:a623f3aaf955c76cd5223d52d799827e3381028dfc0ce04b8956c18e8ce42ab7","observation_id":"b566b810-5db8-4d76-90fa-65912861f3b9","resolution":{"observed_at":"2026-08-09T00:46:43.179799Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T00:46:43.187758Z","title":"Optimal search and one-way trading online algorithms","venue":null,"work_id":"cb3a04ad-995e-431e-ba0c-af2bc76f99f7","year":2001},"citing_paper":{"arxiv_id":"2502.03817","last_updated":"2025-02-06T07:06:06Z","snapshot_observed_at":"2026-08-11T04:38:37.129154Z","submitted_at":"2025-02-06T07:06:06Z","title":"Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T00:46:43.150210Z"},"links":{"citing_paper":"/paper/2502.03817"},"observation_digest":"sha256:b2426d822e21555cb7e15f401b1a0623ea578c8da6eb68bffbae0973802d1693","observation_id":"dbaac2d7-64c5-41ae-90d3-06aca71aad44","resolution":{"observed_at":"2026-08-09T00:46:43.191239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T00:46:43.213704Z","title":"Online Conversion with Switching Costs: Robust and Learning-augmented Algorithms","venue":null,"work_id":"ec4417bb-0d9e-45ad-9fa4-9e648cb0fd69","year":2024},"citing_paper":{"arxiv_id":"2502.03817","last_updated":"2025-02-06T07:06:06Z","snapshot_observed_at":"2026-08-11T04:38:37.129154Z","submitted_at":"2025-02-06T07:06:06Z","title":"Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-09T00:46:43.072110Z"},"links":{"citing_paper":"/paper/2502.03817"},"observation_digest":"sha256:555c19df8e6b81b64226d2f2ac6328fa95040082e102e373a034405c2973e367","observation_id":"142e287b-8c73-4523-a965-1b201565d208","resolution":{"observed_at":"2026-08-09T00:46:43.233262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3428336","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Algorithms with predictions","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","work_id":"cc594e7c-6631-4821-831d-2ac3e4b386fa","year":2022},"citing_paper":{"arxiv_id":"2502.03817","last_updated":"2025-02-06T07:06:06Z","snapshot_observed_at":"2026-08-11T04:38:37.129154Z","submitted_at":"2025-02-06T07:06:06Z","title":"Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-09T00:46:43.125585Z"},"links":{"citing_paper":"/paper/2502.03817"},"observation_digest":"sha256:95b3dff4d558c727cb85cd6fe90013ef60d03fa5d3a8f757be96a758eba30669","observation_id":"7211baf0-3aa7-42e2-828a-9d859ff52950","resolution":{"observed_at":"2026-08-09T00:46:43.201200Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-09T00:46:43.238586Z","title":"Online selection problems against constrained adversary","venue":null,"work_id":"fb385f10-eda9-4f72-b282-3b81b8d12725","year":1964},"citing_paper":{"arxiv_id":"2502.03817","last_updated":"2025-02-06T07:06:06Z","snapshot_observed_at":"2026-08-11T04:38:37.129154Z","submitted_at":"2025-02-06T07:06:06Z","title":"Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-09T00:46:42.989281Z"},"links":{"citing_paper":"/paper/2502.03817"},"observation_digest":"sha256:bb592e1f3321e1b85296b58f6f2ab97fe0a13a3bd5a0869c0bef8ab5423ee6a7","observation_id":"50efc9aa-8667-44e4-baf5-949a54c75629","resolution":{"observed_at":"2026-08-09T00:46:43.241571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.03817","last_updated":"2025-02-06T07:06:06Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T04:38:37.129154Z","submitted_at":"2025-02-06T07:06:06Z","title":"Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":4},"total_outbound_references":6},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2502.03817."}