{"as_of":"2026-08-09T23:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dfa4765fe62c58fbab77481820c46d2ae11e1bd5f85e1d91eba7a262522f13ec","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-09T06:31:02.800959+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-03T07:11:03.014459Z","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":"2109.03744","last_updated":"2021-09-08T16:05:22Z","snapshot_observed_at":"2026-07-06T11:45:42.672695Z","submitted_at":"2021-09-08T16:05:22Z","title":"Approximately counting independent sets in bipartite graphs via graph containers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.03744","snapshot_observed_at":"2026-08-03T07:11:03.014459Z","title":"Jenssen, W","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.21140","last_updated":"2026-07-14T04:46:06Z","snapshot_observed_at":"2026-08-07T02:41:57.480560Z","submitted_at":"2026-01-29T00:49:31Z","title":"Efficient Algorithms for Weakly-Interacting Quantum Spin Systems","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:03.014459Z"},"links":{"cited_paper":"/paper/2109.03744","citing_paper":"/paper/2601.21140"},"observation_digest":"sha256:ed1c08712313db7e33781670eb0cd49f1ae209885425f0efdc6e258b8c42b4f6","observation_id":"d7f41347-07de-4b46-8b0e-232b04db0b4a","resolution":{"observed_at":"2026-08-03T07:11:03.014459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2109.03744/citation-record","integrity":"/paper/2109.03744/integrity","json":"/paper/2109.03744/citation-record.json","paper":"/paper/2109.03744"},"outbound":[],"paper":{"arxiv_id":"2109.03744","last_updated":"2021-09-08T16:05:22Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T11:45:42.672695Z","submitted_at":"2021-09-08T16:05:22Z","title":"Approximately counting independent sets in bipartite graphs via graph containers"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2109.03744."}