{"as_of":"2026-08-20T16:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6711557045468cd77373d2fe0b51742e1fbbb133617e4341965065fad709a66a","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:18:05.918086Z","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-11T21:11:19.635301Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.01406","last_updated":"2023-08-02T20:01:11Z","snapshot_observed_at":"2026-08-20T11:44:39.687575Z","submitted_at":"2023-08-02T20:01:11Z","title":"Optimal Online Discrepancy Minimization","version":1},"cited_work":{"arxiv_id":"2308.01406","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.01406","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal online discrepancy minimiza- tion.In Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC ’2024)","venue":null,"work_id":"c0eed1e7-ed82-45b7-9143-4d4327528c61","year":2024},"citing_paper":{"arxiv_id":"2605.05602","last_updated":"2026-05-07T02:37:57Z","snapshot_observed_at":"2026-08-16T11:34:31.718934Z","submitted_at":"2026-05-07T02:37:57Z","title":"Nearly Optimal Attention Coresets","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-08T06:26:18.204990Z"},"links":{"cited_paper":"/paper/2308.01406","citing_paper":"/paper/2605.05602"},"observation_digest":"sha256:e73fe1b27bd6ff2f793170e81666f5f569d8961b46bbd350cd3da770b35534dd","observation_id":"bf57c8a1-77ad-4130-a73a-bcfb70b80cc4","resolution":{"observed_at":"2026-05-11T21:11:19.641184Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.01406","last_updated":"2023-08-02T20:01:11Z","snapshot_observed_at":"2026-08-20T11:44:39.687575Z","submitted_at":"2023-08-02T20:01:11Z","title":"Optimal Online Discrepancy Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.01406","snapshot_observed_at":"2026-08-02T02:55:26.859404Z","title":"Kulkarni, V","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14238","last_updated":"2026-07-15T18:01:43Z","snapshot_observed_at":"2026-08-20T06:27:26.917711Z","submitted_at":"2026-07-15T18:01:43Z","title":"Online Beck--Fiala Down to Logarithmic Sparsity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T02:55:26.859404Z"},"links":{"cited_paper":"/paper/2308.01406","citing_paper":"/paper/2607.14238"},"observation_digest":"sha256:0235af458c5cb255235a7b9c92a3ea45a636871e7bb88e99a5fe29b11420068a","observation_id":"82a4f530-046c-4548-901d-e1bbd91139a8","resolution":{"observed_at":"2026-08-02T02:55:26.859404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.01406","last_updated":"2023-08-02T20:01:11Z","snapshot_observed_at":"2026-08-20T11:44:39.687575Z","submitted_at":"2023-08-02T20:01:11Z","title":"Optimal Online Discrepancy Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.01406","snapshot_observed_at":"2026-08-16T00:18:05.918086Z","title":"Kulkarni, V","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12490","last_updated":"2026-08-12T18:10:45Z","snapshot_observed_at":"2026-08-19T11:35:32.091779Z","submitted_at":"2026-08-12T18:10:45Z","title":"Online balancing of vectors with small coordinates","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:18:05.918086Z"},"links":{"cited_paper":"/paper/2308.01406","citing_paper":"/paper/2608.12490"},"observation_digest":"sha256:449d0d69d44e836e7a39a18191c4cf57574d5eae0459ae94f558c585c07fc74c","observation_id":"44533c8d-8b1d-482b-ac28-cd77b1bbb0d2","resolution":{"observed_at":"2026-08-16T00:18:05.918086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2308.01406/citation-record","integrity":"/paper/2308.01406/integrity","json":"/paper/2308.01406/citation-record.json","paper":"/paper/2308.01406"},"outbound":[],"paper":{"arxiv_id":"2308.01406","last_updated":"2023-08-02T20:01:11Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-20T11:44:39.687575Z","submitted_at":"2023-08-02T20:01:11Z","title":"Optimal Online Discrepancy Minimization"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2308.01406."}