{"as_of":"2026-08-17T23:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5159f468eb4ab365e03e70ab3611f9ef52201f12c4661d681291fc020f505c0b","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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-08-14T15:10:51.475372Z","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-25T18:16:07.587761Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1807.02227","last_updated":"2024-05-14T23:24:31Z","snapshot_observed_at":"2026-08-16T04:12:59.298237Z","submitted_at":"2018-07-06T02:53:45Z","title":"Polynomial time algorithm for optimal stopping with fixed accuracy","version":3},"cited_work":{"arxiv_id":"1807.02227","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1807.02227","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Beating the curse of dimensionality in options pricing and optimal stopping","venue":null,"work_id":"aaf2524d-d2dc-4c29-be6a-2e346eb0f7f2","year":2018},"citing_paper":{"arxiv_id":"1906.09431","last_updated":"2019-06-22T10:53:47Z","snapshot_observed_at":"2026-08-02T18:48:17.909722Z","submitted_at":"2019-06-22T10:53:47Z","title":"Semi-tractability of optimal stopping problems via a weighted stochastic mesh algorithm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T18:13:22.235996Z"},"links":{"cited_paper":"/paper/1807.02227","citing_paper":"/paper/1906.09431"},"observation_digest":"sha256:913fe5281bd36f93caf1c8e156f6feafc360b9d3c40bc11747c1b87c506a3ef7","observation_id":"25407890-23bc-497e-9e0c-a72be2d1cf8d","resolution":{"observed_at":"2026-05-25T18:16:07.591978Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.02227","last_updated":"2024-05-14T23:24:31Z","snapshot_observed_at":"2026-08-16T04:12:59.298237Z","submitted_at":"2018-07-06T02:53:45Z","title":"Polynomial time algorithm for optimal stopping with fixed accuracy","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.02227","snapshot_observed_at":"2026-08-14T15:10:51.475372Z","title":"A., and Chen, Y","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.01602","last_updated":"2021-08-08T22:09:32Z","snapshot_observed_at":"2026-08-16T03:49:28.628548Z","submitted_at":"2019-08-05T13:11:28Z","title":"Solving high-dimensional optimal stopping problems using deep learning","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T15:10:51.475372Z"},"links":{"cited_paper":"/paper/1807.02227","citing_paper":"/paper/1908.01602"},"observation_digest":"sha256:db47d99e33cb25bfc69824905e711f8cfdbb3ce5c7850cb915ca507ac7e43984","observation_id":"e585cd05-3961-4f15-b68b-ed8a10ef300b","resolution":{"observed_at":"2026-08-14T15:10:51.475372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1807.02227/citation-record","integrity":"/paper/1807.02227/integrity","json":"/paper/1807.02227/citation-record.json","paper":"/paper/1807.02227"},"outbound":[],"paper":{"arxiv_id":"1807.02227","last_updated":"2024-05-14T23:24:31Z","latest_version":3,"primary_category":"math.PR","snapshot_observed_at":"2026-08-16T04:12:59.298237Z","submitted_at":"2018-07-06T02:53:45Z","title":"Polynomial time algorithm for optimal stopping with fixed accuracy"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1807.02227."}