{"as_of":"2026-08-12T21:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f7e543351c4791f046957c152cbda84811e266c9bdc47ebeeebcc70e49c18ffb","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-12T06:34:41.77262+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-06T16:09:17.309516Z","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-06T16:09:18.308136Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.08775","last_updated":"2024-02-13T20:17:24Z","snapshot_observed_at":"2026-08-10T13:02:07.381338Z","submitted_at":"2024-02-13T20:17:24Z","title":"Almost Tight Bounds for Online Hypergraph Matching","version":1},"cited_work":{"arxiv_id":"2402.08775","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.08775","snapshot_observed_at":"2026-08-06T16:09:18.308136Z","title":"Almost Tight Bounds for Online Hypergraph Matching","venue":"cs.DS","work_id":"c1532385-27e9-466c-a0bb-47f9fbb6e795","year":2024},"citing_paper":{"arxiv_id":"2507.14812","last_updated":"2025-07-20T04:02:18Z","snapshot_observed_at":"2026-08-11T22:52:17.570712Z","submitted_at":"2025-07-20T04:02:18Z","title":"A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:09:17.309516Z"},"links":{"cited_paper":"/paper/2402.08775","citing_paper":"/paper/2507.14812"},"observation_digest":"sha256:7b92d22def929dae8683692583a9bf60eee52f54de8e13da8ab5bb1a9a60500c","observation_id":"ed682636-f2b7-452e-b8d5-df9a8e8f4a30","resolution":{"observed_at":"2026-08-06T16:09:18.392108Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.08775/citation-record","integrity":"/paper/2402.08775/integrity","json":"/paper/2402.08775/citation-record.json","paper":"/paper/2402.08775"},"outbound":[],"paper":{"arxiv_id":"2402.08775","last_updated":"2024-02-13T20:17:24Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T13:02:07.381338Z","submitted_at":"2024-02-13T20:17:24Z","title":"Almost Tight Bounds for Online Hypergraph Matching"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2402.08775."}