Pith. sign in

Paper Citation Record · LEDGER

A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem

As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2212.02735.

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

pith.paper-citation-record.v1
2212.02735 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T23:38:11.649359Z

measured 1 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

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

External citation measurements

9
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 830852d5-116a-4638-9ed6-cd0c6a346a25 · 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 A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-07T23:38:11.649359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T23:38:11.649359Z digest=sha256:f420769d3bd2631430d95737c4f038ed845519b4159b20f4edca2e1e7eccd3bc

Observation 428ad41e-c5f5-4528-9c63-2a18c41e1ff5 · inbound

Resource-efficient variational quantum solver for the travelling salesman problem and its silicon photonics implementation cites this paper.

Resource-efficient variational quantum solver for the travelling salesman problem and its silicon photonics implementation A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem

Reference 91

Resolution
unresolved
no resolver link, observed 2026-08-04T00:13:36.786702Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T00:13:36.786702Z digest=sha256:d937d740d253471b35deccb603770a995462d66b4fd3e0babc95f215665a940b

Observation 4c2a76a5-9e3d-4546-a1c0-2298921c6650 · inbound

Quantum Model for CVRPTW cites this paper.

Quantum Model for CVRPTW A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem

Reference 14

Resolution
verified exact
arxiv_id, observed 2026-05-20T09:03:09.218377Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-05-20T09:02:16.910923Z digest=sha256:2a6f32bdd8239ae7f9882f482aa63aa244da5435a9b3be1667d880a27c481292

Observation ee117e50-4f52-44a0-b9e7-977743abeba4 · inbound

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier cites this paper.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem

Reference 24

Resolution
verified exact
arxiv_id, observed 2026-07-02T17:47:17.930809Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-06-27T21:53:02.291743Z digest=sha256:1b3b0195097bb9a9519c5551d96aaea5febfceaa23d50219f6a9813bb51a256e

Observation 61457928-0d45-43fe-b883-cd425b2d67ef · inbound

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier cites this paper.

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem

Reference 41

Resolution
unresolved
no resolver link, observed 2026-07-12T14:53:14.813854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-12T14:53:14.813854Z digest=sha256:0b4e76f4ea50b7d9e21b820c96760eefe3995deed31e753091fd888ebb1e2595