Pith. sign in

Paper Citation Record · LEDGER

Graph comparison via nonlinear quantum search

As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1810.01647.

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

pith.paper-citation-record.v1
1810.01647 v1

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-14T06:32:32.682623+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-11T05:41:13.536155Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T23:38:11.977438Z

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 f8914350-e108-400e-a046-dae5b1a41cb4 · inbound

Quantum Approximate Optimisation Applied to Graph Similarity cites this paper.

Quantum Approximate Optimisation Applied to Graph Similarity Graph comparison via nonlinear quantum search

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-11T05:41:13.536155Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T05:41:13.536155Z digest=sha256:9cd0dcc858f346a117765e6bd93a0a5bd8dc483a7b7782974dc2a5b399e6c2b0

Observation fb736e81-6913-4810-8ba6-d77dd9ff65ae · inbound

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits cites this paper.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Graph comparison via nonlinear quantum search

Reference 53

Resolution
verified exact
local_arxiv, observed 2026-08-07T23:38:11.984423Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-07T23:38:11.686044Z digest=sha256:3815f142b22de36e8ed30462a282bfb5a6b72c89b34d44522f1964a0fa94d8b2