{"as_of":"2026-08-23T20:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a7c9c6eb172c81871c4143320dae662762b2b74a3781da09753667e7240cc7fa","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-23T06:30:58.430688+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-07T10:52:50.398844Z","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-07T10:52:50.461260Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.08979","last_updated":"2023-07-18T05:25:32Z","snapshot_observed_at":"2026-08-16T15:15:28.679171Z","submitted_at":"2023-07-18T05:25:32Z","title":"Scalable Auction Algorithms for Bipartite Maximum Matching Problems","version":1},"cited_work":{"arxiv_id":"2307.08979","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.08979","snapshot_observed_at":"2026-08-07T10:52:50.461260Z","title":"Scalable Auction Algorithms for Bipartite Maximum Matching Problems","venue":"cs.DS","work_id":"acae06d7-c033-4a43-b575-c2090f556ab5","year":2023},"citing_paper":{"arxiv_id":"2506.04524","last_updated":"2025-06-05T00:13:25Z","snapshot_observed_at":"2026-08-17T17:58:07.967581Z","submitted_at":"2025-06-05T00:13:25Z","title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:52:50.398844Z"},"links":{"cited_paper":"/paper/2307.08979","citing_paper":"/paper/2506.04524"},"observation_digest":"sha256:3a82446cb45e072960994f4d6f1050e2db3f52066024102a4303c7f3b533456d","observation_id":"63c0f1ae-1905-410e-9f2e-c80027c6086c","resolution":{"observed_at":"2026-08-07T10:52:50.465034Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2307.08979/citation-record","integrity":"/paper/2307.08979/integrity","json":"/paper/2307.08979/citation-record.json","paper":"/paper/2307.08979"},"outbound":[],"paper":{"arxiv_id":"2307.08979","last_updated":"2023-07-18T05:25:32Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T15:15:28.679171Z","submitted_at":"2023-07-18T05:25:32Z","title":"Scalable Auction Algorithms for Bipartite Maximum 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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2307.08979."}