{"as_of":"2026-08-09T16:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:150cb0363b79104131a80175df4ebf6261cf2920764dc614c34390907a231dd6","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T21:20:40.657104Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T12:59:17.348575Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2511.16558","snapshot_observed_at":"2026-08-01T12:59:17.348575Z","title":"Anand, Z","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19279","last_updated":"2026-07-21T16:48:37Z","snapshot_observed_at":"2026-08-08T06:22:11.917236Z","submitted_at":"2026-07-21T16:48:37Z","title":"Gaussian Boson Sampling for Asset Clustering in Statistical Arbitrage Portfolios","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-01T12:59:17.348575Z"},"links":{"cited_paper":"/paper/2511.16558","citing_paper":"/paper/2607.19279"},"observation_digest":"sha256:751d57210294378a1a1f5ca0600ab5433bd91bffde2ca4d46a291e42b4077b0f","observation_id":"fcfe7a74-e836-4608-ab2c-3761d0a6b8d6","resolution":{"observed_at":"2026-08-01T12:59:17.348575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2511.16558/citation-record","integrity":"/paper/2511.16558/integrity","json":"/paper/2511.16558/citation-record.json","paper":"/paper/2511.16558"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:38.212535Z","title":"The computational complexity of linear optics","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:38.212535Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:6b3a4e1745253b24accf4bcd87c6bb276d34cd661db309d100327df5af243ee0","observation_id":"0afd1fcd-b64b-425e-9c61-d522bed50e83","resolution":{"observed_at":"2026-08-03T21:20:38.212535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:38.285890Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:38.285890Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:8a5a2b78f31145028cdfb58a6f7396687da7e2ed07f0523b9ef0df1361da336c","observation_id":"060f6dae-9472-4191-b591-04c4c5e1ac36","resolution":{"observed_at":"2026-08-03T21:20:38.285890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:38.349890Z","title":"Gaussian boson sampling for perfect matchings of arbitrary graphs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:38.349890Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:04393db046f6e729dd26d6da36e881eb217eee8a9364d95c0f3ee7785dad2e42","observation_id":"43c7891e-7ef2-4a47-8b29-949aa0273938","resolution":{"observed_at":"2026-08-03T21:20:38.349890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:38.485575Z","title":"Graph isomorphism and G aussian boson sampling","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:38.485575Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:7de784433a0b03bc95d2a278cb6f7388dd9554e4a7a9eb27d51ab79767d18cbe","observation_id":"b068eafe-dbd0-467f-8423-de88aaccfd62","resolution":{"observed_at":"2026-08-03T21:20:38.485575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:38.663007Z","title":"Vazirani, and Eric Vigoda","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:38.663007Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:3851e8db5f41aac6df9f263d909f376df3632396dfa83afac48f03237cadd0ce","observation_id":"594bfc77-2352-4317-9b73-462a16fff297","resolution":{"observed_at":"2026-08-03T21:20:38.663007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:38.843701Z","title":"The classical complexity of boson sampling","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:38.843701Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:e01178025a8a6bbf24d6a10577d760032eb7469c8d22fa6b0abcc660ccf15622","observation_id":"217a511f-e512-4b03-9087-7193ec554795","resolution":{"observed_at":"2026-08-03T21:20:38.843701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:39.045662Z","title":"Faster classical boson sampling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:39.045662Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:22dcc652ddffce3d11efaf9329eab886e953902c3472fe2bd504887d089dd418","observation_id":"d1ba38e2-7efc-42a0-9d90-e0859349225b","resolution":{"observed_at":"2026-08-03T21:20:39.045662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:39.175350Z","title":"Performance of gaussian B oson sampling on planted bipartite clique detection","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:39.175350Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:2c2f64d1cfa883c020cbd55bae016425f7977fad42839ec6aa772f60a5fd3e59","observation_id":"a4ca7d1a-2f8d-40ca-b694-f1c4d66eaf62","resolution":{"observed_at":"2026-08-03T21:20:39.175350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:39.365059Z","title":"Solving graph problems using G aussian boson sampling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:39.365059Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:a9b638107dfc9c4b4beab2c30dbb4af511fd1772ccd3b440a39a5e8d3bc3c28e","observation_id":"fc77c5a1-6a63-4fa1-ae49-95226feeb713","resolution":{"observed_at":"2026-08-03T21:20:39.365059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:39.551210Z","title":"Hamilton, Regina Kruse, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:39.551210Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:03d04aced25157d94d604c0c3c26c3c24792d955b29a5b8ae2b2725b51e85d47","observation_id":"3d0c6c0b-2d65-4b06-a473-84381b548630","resolution":{"observed_at":"2026-08-03T21:20:39.551210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:39.676884Z","title":"Approximating the permanent","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:39.676884Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:5c20f4a80e7308457b9d3327f5e70749bc51f611e13ff615e6c23aff9e2d8f85","observation_id":"19b74ac5-8142-4308-bae2-f09f2eae47cb","resolution":{"observed_at":"2026-08-03T21:20:39.676884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:39.890470Z","title":"The M arkov chain M onte C arlo method: an approach to approximate counting and integration","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:39.890470Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:d6596e9cde81705d9f583addd12938ef171aedfce375b93b93a51b06acffaf9e","observation_id":"bce19ed1-44ec-481a-ba00-1bc0603443d0","resolution":{"observed_at":"2026-08-03T21:20:39.890470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:40.030969Z","title":"A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:40.030969Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:52f276fda1a8408f00dcf801afafa77cd32add5080f91a9541e51c574bc45276","observation_id":"68420344-3b2e-4134-9378-496c6c20ee3e","resolution":{"observed_at":"2026-08-03T21:20:40.030969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:40.215323Z","title":"Hamilton, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:40.215323Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:3fca2ab537a6fde6373a26a3b65391b4a3b5114f64eef1a54aa9d760a425c23d","observation_id":"5e967ebf-6adf-4264-ba74-95c8dbf3c0d2","resolution":{"observed_at":"2026-08-03T21:20:40.215323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:40.321024Z","title":"Inapproximability of positive semidefinite permanents and quantum state tomography","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:40.321024Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:44642430c48a7f4e28cc6c1be6857bffd4bd0f1b1652914dbe8e4fb4e045e67e","observation_id":"debb4993-34aa-463c-b48a-aa948436c169","resolution":{"observed_at":"2026-08-03T21:20:40.321024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:40.463450Z","title":"Madsen, Fabian Laudenbach, Mohsen Falamarzi","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:40.463450Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:60e7c15ad11a7e4415c01748aee7a7f3a36ec260d28405c7e105a488eb1a9cfb","observation_id":"ffcfa250-7537-44c1-a4ab-f2a6b6a5b5aa","resolution":{"observed_at":"2026-08-03T21:20:40.463450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:40.521214Z","title":"Quantum-inspired classical algorithm for graph problems by G aussian boson sampling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:40.521214Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:ca92440ca3d776b30ca6e1e99d776dacc3f4f06d0c8d0554709ee9abe9e81a8e","observation_id":"4e62765c-940a-4002-a0c8-eee89ac93655","resolution":{"observed_at":"2026-08-03T21:20:40.521214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:40.578231Z","title":"Aghaee Rad, T","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:40.578231Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:13fb26fbf20cd09f66f3bb1cbbe5d315e9a8bd8565700312a1c0ba0af5501f55","observation_id":"866a9f1b-8494-49be-913e-2a5173d84b55","resolution":{"observed_at":"2026-08-03T21:20:40.578231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:40.597212Z","title":"Quantum computational advantage using photons","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:40.597212Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:007a121d761549a47e71b98766aff772944b208eac0158cc2c5512320a094a8b","observation_id":"9dbe9c56-43b6-44f8-8b73-a5b060418502","resolution":{"observed_at":"2026-08-03T21:20:40.597212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T21:20:40.657104Z","title":"Efficient classical sampling from G aussian boson sampling distributions on unweighted graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-03T21:20:40.657104Z"},"links":{"citing_paper":"/paper/2511.16558"},"observation_digest":"sha256:4b3bf100290c821c1ee94e4a57407b4a9dd161e0a85dfa3c4719daebfaaf7bfc","observation_id":"0b5bd8b6-5381-4c5d-b400-13a4622333f6","resolution":{"observed_at":"2026-08-03T21:20:40.657104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.16558","last_updated":"2026-06-25T08:07:15Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T15:00:39.070862Z","submitted_at":"2025-11-20T17:11:55Z","title":"Simulating Gaussian boson sampling on graphs in polynomial time"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":20},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"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."}