{"as_of":"2026-08-09T20:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a066b3152c33a1768b9f5b95b22b598b6a19eb8c9d51db4e60f6b4ec7f5f0843","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.001950Z","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":"1807.04804","last_updated":"2020-03-23T20:38:10Z","snapshot_observed_at":"2026-08-08T23:11:58.468004Z","submitted_at":"2018-07-12T20:00:05Z","title":"Algorithms for #BIS-hard problems on expander graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.04804","snapshot_observed_at":"2026-08-03T07:11:03.001950Z","title":"Jenssen, P","venue":null,"work_id":null,"year":2020},"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":2,"source":"pdf_text","source_observed_at":"2026-08-03T07:11:03.001950Z"},"links":{"cited_paper":"/paper/1807.04804","citing_paper":"/paper/2601.21140"},"observation_digest":"sha256:b453fd9ad7e787716bddcc2d25ac0ed1ec03d6aa7c4ffec10e8f925c54475201","observation_id":"e42aa43a-a7fa-4578-a12c-90214915d36c","resolution":{"observed_at":"2026-08-03T07:11:03.001950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1807.04804/citation-record","integrity":"/paper/1807.04804/integrity","json":"/paper/1807.04804/citation-record.json","paper":"/paper/1807.04804"},"outbound":[],"paper":{"arxiv_id":"1807.04804","last_updated":"2020-03-23T20:38:10Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-08T23:11:58.468004Z","submitted_at":"2018-07-12T20:00:05Z","title":"Algorithms for #BIS-hard problems on expander graphs"},"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:1807.04804."}