{"as_of":"2026-08-14T01:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e3260efdbfe9ccde62b77a52292fbd91532a2f37f17bdfddcdc10e25119e771","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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-02T00:29:03.118090Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2309.10078","last_updated":"2023-11-24T19:50:02Z","snapshot_observed_at":"2026-08-13T10:10:34.285487Z","submitted_at":"2023-09-18T18:46:27Z","title":"Simple and Optimal Online Contention Resolution Schemes for $k$-Uniform Matroids","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10078","snapshot_observed_at":"2026-08-02T00:29:03.118090Z","title":"(Ed.), 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15035","last_updated":"2026-07-16T14:15:55Z","snapshot_observed_at":"2026-08-13T15:12:28.209214Z","submitted_at":"2026-07-16T14:15:55Z","title":"A Correlation-Gap Bound for Nonlinear Gaussian PCA","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T00:29:03.118090Z"},"links":{"cited_paper":"/paper/2309.10078","citing_paper":"/paper/2607.15035"},"observation_digest":"sha256:6b65275624d515c01564a7b208bb38c63b9af0a123d41caf082e1b68c9b17da2","observation_id":"94a04554-4dc9-4459-8a96-177f4055541f","resolution":{"observed_at":"2026-08-02T00:29:03.118090Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2309.10078/citation-record","integrity":"/paper/2309.10078/integrity","json":"/paper/2309.10078/citation-record.json","paper":"/paper/2309.10078"},"outbound":[],"paper":{"arxiv_id":"2309.10078","last_updated":"2023-11-24T19:50:02Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T10:10:34.285487Z","submitted_at":"2023-09-18T18:46:27Z","title":"Simple and Optimal Online Contention Resolution Schemes for $k$-Uniform Matroids"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2309.10078."}