{"as_of":"2026-08-15T09:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2283cec45d72000cabc1fed0bc95dad9b7ffbc2f47a0bd2bc7bcaccadf840eb1","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-15T06:32:42.880941+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-14T04:18:59.148239Z","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":"2207.04318","last_updated":"2022-07-09T18:30:17Z","snapshot_observed_at":"2026-08-13T15:07:44.291421Z","submitted_at":"2022-07-09T18:30:17Z","title":"Determinant Maximization via Matroid Intersection Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.04318","snapshot_observed_at":"2026-08-14T04:18:59.148239Z","title":"Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali.https://arxiv.org/abs/2207.04318","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-15T09:15:26.203683Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-14T04:18:59.148239Z"},"links":{"cited_paper":"/paper/2207.04318","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:062d303ff65a7bb54bf5de3c66ce203becf1f4da8c8e73a41aa10f763cdf5ed5","observation_id":"dfbf2f7b-300f-4178-b35c-faf2517f2090","resolution":{"observed_at":"2026-08-14T04:18:59.148239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2207.04318/citation-record","integrity":"/paper/2207.04318/integrity","json":"/paper/2207.04318/citation-record.json","paper":"/paper/2207.04318"},"outbound":[],"paper":{"arxiv_id":"2207.04318","last_updated":"2022-07-09T18:30:17Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T15:07:44.291421Z","submitted_at":"2022-07-09T18:30:17Z","title":"Determinant Maximization via Matroid Intersection Algorithms"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2207.04318."}