{"as_of":"2026-08-18T15:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ce8324592568396513ab2bfb32d243e2868d63ffe5877d9a3628bdcc9fe844ff","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-18T06:34:40.430872+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-12T22:02:01.694634Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-12T22:02:01.767791Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.02948","last_updated":"2022-02-08T11:52:21Z","snapshot_observed_at":"2026-08-18T10:33:08.667300Z","submitted_at":"2022-02-07T05:12:26Z","title":"Improved Bounds for Fractional Online Matching Problems","version":2},"cited_work":{"arxiv_id":"2202.02948","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.02948","snapshot_observed_at":"2026-08-12T22:02:01.767791Z","title":"Improved Bounds for Fractional Online Matching Problems","venue":"cs.DS","work_id":"8f182b2a-d610-44bc-9c1e-5bc0f4629286","year":2022},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.694634Z"},"links":{"cited_paper":"/paper/2202.02948","citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:79cd359a1297462bca01bfdc76cb46398b848716f59a59ceee63e1fdb4e7d6c5","observation_id":"e56b3de5-524e-488b-bd29-1cad43d1c87a","resolution":{"observed_at":"2026-08-12T22:02:01.772597Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.02948/citation-record","integrity":"/paper/2202.02948/integrity","json":"/paper/2202.02948/citation-record.json","paper":"/paper/2202.02948"},"outbound":[],"paper":{"arxiv_id":"2202.02948","last_updated":"2022-02-08T11:52:21Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T10:33:08.667300Z","submitted_at":"2022-02-07T05:12:26Z","title":"Improved Bounds for Fractional Online Matching Problems"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2202.02948."}