{"as_of":"2026-08-14T02:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c1c72d9620748ffe90e72d1b2d1840148b1a978832522e50c2ab4b4196d0d4f4","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:04.058929Z","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":"2105.11992","last_updated":"2023-01-30T12:56:40Z","snapshot_observed_at":"2026-08-13T19:17:01.804824Z","submitted_at":"2021-05-25T14:55:37Z","title":"A Simple Optimal Contention Resolution Scheme for Uniform Matroids","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.11992","snapshot_observed_at":"2026-08-02T00:29:04.058929Z","title":"Theoretical Computer Science 940, 81–96","venue":null,"work_id":null,"year":2022},"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":2023,"source":"pdf_text","source_observed_at":"2026-08-02T00:29:04.058929Z"},"links":{"cited_paper":"/paper/2105.11992","citing_paper":"/paper/2607.15035"},"observation_digest":"sha256:493fe96174b59e0e98c45a20ae8a7e72389d23f98905ac4eec95bfd5ef63b459","observation_id":"a8a65a3d-e347-4f2d-9e58-be4d7f890886","resolution":{"observed_at":"2026-08-02T00:29:04.058929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2105.11992/citation-record","integrity":"/paper/2105.11992/integrity","json":"/paper/2105.11992/citation-record.json","paper":"/paper/2105.11992"},"outbound":[],"paper":{"arxiv_id":"2105.11992","last_updated":"2023-01-30T12:56:40Z","latest_version":5,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T19:17:01.804824Z","submitted_at":"2021-05-25T14:55:37Z","title":"A Simple Optimal Contention Resolution Scheme for 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:2105.11992."}