Pith. sign in

Paper Citation Record · LEDGER

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2110.15587 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T04:21:05.775524Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-02T13:36:58.679742Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 6c7fa6e1-0b0b-47f9-80a2-4008cd17dd1c · inbound

Quantum Speedup for Hypergraph Sparsification cites this paper.

Quantum Speedup for Hypergraph Sparsification A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-16T04:21:05.775524Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T04:21:05.775524Z digest=sha256:c79a9f8fd8e502319efadb654637022886a0b867b125c03ad4ccf307db622d01

Observation 4325e125-af71-4ea0-a48d-2effd8355efa · inbound

Quantum Algorithms for Triangle Cut Sparsification cites this paper.

Quantum Algorithms for Triangle Cut Sparsification A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs

Reference 10

Resolution
verified exact
arxiv_id, observed 2026-07-02T13:36:58.681442Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-06-28T01:15:05.106785Z digest=sha256:010313c28a559522f1a0d7dcb1fd5b5a2cbe5ff6dfddce1f034d340017aa6e3c