{"as_of":"2026-08-19T05:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d63c672c5d3930809d18718852c78f3f07b1f667aab4f20fa2990abcf09e7d55","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:21:05.775524Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T13:36:58.679742Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.15587","last_updated":"2024-02-05T01:45:51Z","snapshot_observed_at":"2026-08-19T03:07:50.920147Z","submitted_at":"2021-10-29T07:35:46Z","title":"A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.15587","snapshot_observed_at":"2026-08-16T04:21:05.775524Z","title":"A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.01763","last_updated":"2025-05-03T09:33:46Z","snapshot_observed_at":"2026-08-16T04:08:49.091758Z","submitted_at":"2025-05-03T09:33:46Z","title":"Quantum Speedup for Hypergraph Sparsification","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:05.775524Z"},"links":{"cited_paper":"/paper/2110.15587","citing_paper":"/paper/2505.01763"},"observation_digest":"sha256:c79a9f8fd8e502319efadb654637022886a0b867b125c03ad4ccf307db622d01","observation_id":"6c7fa6e1-0b0b-47f9-80a2-4008cd17dd1c","resolution":{"observed_at":"2026-08-16T04:21:05.775524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.15587","last_updated":"2024-02-05T01:45:51Z","snapshot_observed_at":"2026-08-19T03:07:50.920147Z","submitted_at":"2021-10-29T07:35:46Z","title":"A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs","version":2},"cited_work":{"arxiv_id":"2110.15587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.15587","snapshot_observed_at":"2026-07-02T13:36:58.679742Z","title":"A sublinear query quantum algorithm for st minimum cut on dense simple graphs","venue":null,"work_id":"fbefaea5-ce66-449f-bb3d-e4b03a0b306c","year":2021},"citing_paper":{"arxiv_id":"2606.06287","last_updated":"2026-06-05T03:00:06Z","snapshot_observed_at":"2026-08-14T16:59:28.965834Z","submitted_at":"2026-06-04T15:25:34Z","title":"Quantum Algorithms for Triangle Cut Sparsification","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-28T01:15:05.106785Z"},"links":{"cited_paper":"/paper/2110.15587","citing_paper":"/paper/2606.06287"},"observation_digest":"sha256:a5c82d5f81fa741fea578841da522540d9c7a7263ed488af285f96389356272d","observation_id":"4325e125-af71-4ea0-a48d-2effd8355efa","resolution":{"observed_at":"2026-07-02T13:36:58.681442Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.15587/citation-record","integrity":"/paper/2110.15587/integrity","json":"/paper/2110.15587/citation-record.json","paper":"/paper/2110.15587"},"outbound":[],"paper":{"arxiv_id":"2110.15587","last_updated":"2024-02-05T01:45:51Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-19T03:07:50.920147Z","submitted_at":"2021-10-29T07:35:46Z","title":"A sublinear query quantum algorithm for s-t minimum cut on dense simple 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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2110.15587."}