Pith. sign in

Paper Citation Record · LEDGER

Simulating Gaussian boson sampling on graphs in polynomial time

As of 9 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 1 inbound Pith citation observation for arXiv:2511.16558.

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

pith.paper-citation-record.v1
2511.16558 v2

Coverage vector

measured 20 of 20 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T21:20:40.657104Z

measured 21 of 21 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-01T12:59:17.348575Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

20 of 20 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 0afd1fcd-b64b-425e-9c61-d522bed50e83 · outbound

This paper cites The computational complexity of linear optics.

Simulating Gaussian boson sampling on graphs in polynomial time The computational complexity of linear optics

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:38.212535Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:38.212535Z digest=sha256:6b3a4e1745253b24accf4bcd87c6bb276d34cd661db309d100327df5af243ee0

Observation 060f6dae-9472-4191-b591-04c4c5e1ac36 · outbound

This paper cites an unresolved cited work.

Simulating Gaussian boson sampling on graphs in polynomial time Unresolved cited work

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:38.285890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:38.285890Z digest=sha256:8a5a2b78f31145028cdfb58a6f7396687da7e2ed07f0523b9ef0df1361da336c

Observation 43c7891e-7ef2-4a47-8b29-949aa0273938 · outbound

This paper cites Gaussian boson sampling for perfect matchings of arbitrary graphs.

Simulating Gaussian boson sampling on graphs in polynomial time Gaussian boson sampling for perfect matchings of arbitrary graphs

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:38.349890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:38.349890Z digest=sha256:04393db046f6e729dd26d6da36e881eb217eee8a9364d95c0f3ee7785dad2e42

Observation b068eafe-dbd0-467f-8423-de88aaccfd62 · outbound

This paper cites Graph isomorphism and G aussian boson sampling.

Simulating Gaussian boson sampling on graphs in polynomial time Graph isomorphism and G aussian boson sampling

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:38.485575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:38.485575Z digest=sha256:7de784433a0b03bc95d2a278cb6f7388dd9554e4a7a9eb27d51ab79767d18cbe

Observation 594bfc77-2352-4317-9b73-462a16fff297 · outbound

This paper cites Vazirani, and Eric Vigoda.

Simulating Gaussian boson sampling on graphs in polynomial time Vazirani, and Eric Vigoda

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:38.663007Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:38.663007Z digest=sha256:3851e8db5f41aac6df9f263d909f376df3632396dfa83afac48f03237cadd0ce

Observation 217a511f-e512-4b03-9087-7193ec554795 · outbound

This paper cites The classical complexity of boson sampling.

Simulating Gaussian boson sampling on graphs in polynomial time The classical complexity of boson sampling

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:38.843701Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:38.843701Z digest=sha256:e01178025a8a6bbf24d6a10577d760032eb7469c8d22fa6b0abcc660ccf15622

Observation d1ba38e2-7efc-42a0-9d90-e0859349225b · outbound

This paper cites Faster classical boson sampling.

Simulating Gaussian boson sampling on graphs in polynomial time Faster classical boson sampling

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:39.045662Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:39.045662Z digest=sha256:22dcc652ddffce3d11efaf9329eab886e953902c3472fe2bd504887d089dd418

Observation a4ca7d1a-2f8d-40ca-b694-f1c4d66eaf62 · outbound

This paper cites Performance of gaussian B oson sampling on planted bipartite clique detection.

Simulating Gaussian boson sampling on graphs in polynomial time Performance of gaussian B oson sampling on planted bipartite clique detection

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:39.175350Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:39.175350Z digest=sha256:2c2f64d1cfa883c020cbd55bae016425f7977fad42839ec6aa772f60a5fd3e59

Observation fc77c5a1-6a63-4fa1-ae49-95226feeb713 · outbound

This paper cites Solving graph problems using G aussian boson sampling.

Simulating Gaussian boson sampling on graphs in polynomial time Solving graph problems using G aussian boson sampling

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:39.365059Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:39.365059Z digest=sha256:a9b638107dfc9c4b4beab2c30dbb4af511fd1772ccd3b440a39a5e8d3bc3c28e

Observation 3d0c6c0b-2d65-4b06-a473-84381b548630 · outbound

This paper cites Hamilton, Regina Kruse, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex.

Simulating Gaussian boson sampling on graphs in polynomial time Hamilton, Regina Kruse, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:39.551210Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:39.551210Z digest=sha256:03d04aced25157d94d604c0c3c26c3c24792d955b29a5b8ae2b2725b51e85d47

Observation 19b74ac5-8142-4308-bae2-f09f2eae47cb · outbound

This paper cites Approximating the permanent.

Simulating Gaussian boson sampling on graphs in polynomial time Approximating the permanent

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:39.676884Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:39.676884Z digest=sha256:5c20f4a80e7308457b9d3327f5e70749bc51f611e13ff615e6c23aff9e2d8f85

Observation bce19ed1-44ec-481a-ba00-1bc0603443d0 · outbound

This paper cites The M arkov chain M onte C arlo method: an approach to approximate counting and integration.

Simulating Gaussian boson sampling on graphs in polynomial time The M arkov chain M onte C arlo method: an approach to approximate counting and integration

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:39.890470Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:39.890470Z digest=sha256:d6596e9cde81705d9f583addd12938ef171aedfce375b93b93a51b06acffaf9e

Observation 68420344-3b2e-4134-9378-496c6c20ee3e · outbound

This paper cites A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.

Simulating Gaussian boson sampling on graphs in polynomial time A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:40.030969Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:40.030969Z digest=sha256:52f276fda1a8408f00dcf801afafa77cd32add5080f91a9541e51c574bc45276

Observation 5e967ebf-6adf-4264-ba74-95c8dbf3c0d2 · outbound

This paper cites Hamilton, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex.

Simulating Gaussian boson sampling on graphs in polynomial time Hamilton, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:40.215323Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:40.215323Z digest=sha256:3fca2ab537a6fde6373a26a3b65391b4a3b5114f64eef1a54aa9d760a425c23d

Observation debb4993-34aa-463c-b48a-aa948436c169 · outbound

This paper cites Inapproximability of positive semidefinite permanents and quantum state tomography.

Simulating Gaussian boson sampling on graphs in polynomial time Inapproximability of positive semidefinite permanents and quantum state tomography

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:40.321024Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:40.321024Z digest=sha256:44642430c48a7f4e28cc6c1be6857bffd4bd0f1b1652914dbe8e4fb4e045e67e

Observation ffcfa250-7537-44c1-a4ab-f2a6b6a5b5aa · outbound

This paper cites Madsen, Fabian Laudenbach, Mohsen Falamarzi.

Simulating Gaussian boson sampling on graphs in polynomial time Madsen, Fabian Laudenbach, Mohsen Falamarzi

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:40.463450Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:40.463450Z digest=sha256:60e7c15ad11a7e4415c01748aee7a7f3a36ec260d28405c7e105a488eb1a9cfb

Observation 4e62765c-940a-4002-a0c8-eee89ac93655 · outbound

This paper cites Quantum-inspired classical algorithm for graph problems by G aussian boson sampling.

Simulating Gaussian boson sampling on graphs in polynomial time Quantum-inspired classical algorithm for graph problems by G aussian boson sampling

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:40.521214Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:40.521214Z digest=sha256:ca92440ca3d776b30ca6e1e99d776dacc3f4f06d0c8d0554709ee9abe9e81a8e

Observation 866a9f1b-8494-49be-913e-2a5173d84b55 · outbound

This paper cites Aghaee Rad, T.

Simulating Gaussian boson sampling on graphs in polynomial time Aghaee Rad, T

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:40.578231Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:40.578231Z digest=sha256:13fb26fbf20cd09f66f3bb1cbbe5d315e9a8bd8565700312a1c0ba0af5501f55

Observation 9dbe9c56-43b6-44f8-8b73-a5b060418502 · outbound

This paper cites Quantum computational advantage using photons.

Simulating Gaussian boson sampling on graphs in polynomial time Quantum computational advantage using photons

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:40.597212Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:40.597212Z digest=sha256:007a121d761549a47e71b98766aff772944b208eac0158cc2c5512320a094a8b

Observation 0b5bd8b6-5381-4c5d-b400-13a4622333f6 · outbound

This paper cites Efficient classical sampling from G aussian boson sampling distributions on unweighted graphs.

Simulating Gaussian boson sampling on graphs in polynomial time Efficient classical sampling from G aussian boson sampling distributions on unweighted graphs

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-03T21:20:40.657104Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T21:20:40.657104Z digest=sha256:4b3bf100290c821c1ee94e4a57407b4a9dd161e0a85dfa3c4719daebfaaf7bfc

Pith citing papers

Observation fcfe7a74-e836-4608-ab2c-3761d0a6b8d6 · inbound

Gaussian Boson Sampling for Asset Clustering in Statistical Arbitrage Portfolios cites this paper.

Gaussian Boson Sampling for Asset Clustering in Statistical Arbitrage Portfolios Simulating Gaussian boson sampling on graphs in polynomial time

Reference 67

Resolution
unresolved
no resolver link, observed 2026-08-01T12:59:17.348575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T12:59:17.348575Z digest=sha256:751d57210294378a1a1f5ca0600ab5433bd91bffde2ca4d46a291e42b4077b0f