{"as_of":"2026-08-15T00:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5acfbbd63b8f760016e6d08c8d6db683fbe6001d73a73def67824507f7c0e251","coverage":[{"denominator":97,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":97,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T05:41:13.849921Z","state":"measured"},{"denominator":97,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":97,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2412.17309/citation-record","integrity":"/paper/2412.17309/integrity","json":"/paper/2412.17309/citation-record.json","paper":"/paper/2412.17309"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.460357Z","title":"Simulation of Many-Body Fermi Sys- tems on a Universal Quantum Computer","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.460357Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:e2714d98573eaae59a0316238d7c2b0b7430d81457661031942136e6ba1a1b60","observation_id":"fe36600e-a3bd-4730-9332-c94ed18133eb","resolution":{"observed_at":"2026-08-11T05:41:13.460357Z","resolver_source":null,"status":"malformed_identifier"},"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-11T05:41:13.465524Z","title":"Quantum attacks on Bitcoin, and how to protect against them","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.465524Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:d1f9fda41304a3d86eda99c7d2f939edcc7c8b5d9fcc4bc1c0c5fe9a9871bdda","observation_id":"c460e3a2-aac1-41a0-9e3b-a47390eb1683","resolution":{"observed_at":"2026-08-11T05:41:13.465524Z","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-11T05:41:13.470201Z","title":"A New Scaling and Squar- ing Algorithm for the Matrix Exponential","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.470201Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:861e27084edbb9f60d100380e97793adb28621052ee94a604f1ea984271a8f9b","observation_id":"305e108c-d0cc-4532-8757-171ba86e9a7c","resolution":{"observed_at":"2026-08-11T05:41:13.470201Z","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-11T05:41:13.474487Z","title":"Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.474487Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:42368ae465bb240446592ad977cecf04f0e7d745b6590a5eb685e52a531af4f8","observation_id":"bcb0e7f1-307c-4d9a-801a-c74e43a74c17","resolution":{"observed_at":"2026-08-11T05:41:13.474487Z","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":"10.1016/j.parco.2010.01.006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.096259Z","title":"Matrix exponentials and parallel prefix computation in a quantum control problem","venue":null,"work_id":"27c9ef7b-aa5f-4f91-93c4-5025dc2ab6a4","year":2010},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.478971Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:16ab952c807647750553921d0ddd21a044a7573d890671a9128f611652f7eae2","observation_id":"ad4f4866-659e-4b4a-9b91-6b04902681fc","resolution":{"observed_at":"2026-08-11T05:41:14.101141Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.483156Z","title":"PETSc Web page","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.483156Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:4e71240f9e16802583bcab5da856a77f32eac7c9ecac6f782aef31c1ca403c25","observation_id":"874a4557-20ac-4f14-b31d-89192e223625","resolution":{"observed_at":"2026-08-11T05:41:13.483156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1505.03424","last_updated":"2015-08-11T14:18:26Z","snapshot_observed_at":"2026-08-14T22:48:43.269445Z","submitted_at":"2015-05-13T15:27:16Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.03424","snapshot_observed_at":"2026-08-11T05:41:13.487412Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.487412Z"},"links":{"cited_paper":"/paper/1505.03424","citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:456d7277ed0cf8e4a4d9cada9a2fb62bb8013bc0cc10e7623f6cd9776f0a2fdb","observation_id":"7d106b34-20ab-45b4-a404-e4645add315d","resolution":{"observed_at":"2026-08-11T05:41:13.487412Z","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-11T05:41:13.491765Z","title":"Strengths and Weaknesses of Quantum Com- puting","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.491765Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:15d77bb66b60e637e331c1ecd46308bea5d840845b3dc5e432390449ccc685cd","observation_id":"33c9d0b0-c29a-4623-ab2d-22136a7fc066","resolution":{"observed_at":"2026-08-11T05:41:13.491765Z","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-11T05:41:13.495889Z","title":"Efficient computation of the expo- nential operator for large, sparse, symmetric matrices","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.495889Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:37f088990869d0871553ff0813b889b30b9cac5c46fafd785622b02e2ede89fe","observation_id":"caccfc89-8276-4930-9479-d22c6075de57","resolution":{"observed_at":"2026-08-11T05:41:13.495889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.00460","last_updated":"2020-01-01T00:27:28Z","snapshot_observed_at":"2026-08-14T18:45:24.862549Z","submitted_at":"2018-08-01T18:00:01Z","title":"Entanglement Scaling in Quantum Advantage Benchmarks","version":4},"cited_work":{"arxiv_id":"1808.00460","doi":null,"metadata_source":"pith","pith_arxiv_id":"1808.00460","snapshot_observed_at":"2026-08-11T05:41:14.717786Z","title":"Entanglement Scaling in Quantum Advantage Benchmarks","venue":"quant-ph","work_id":"2c9f6ddb-32df-4c28-b9f0-c526fa360e83","year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.504109Z"},"links":{"cited_paper":"/paper/1808.00460","citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:5320eeab9e7be3500da3555dd2b9a1c8506ad5780e8091d7c60b154381f4d864","observation_id":"821b0930-ed85-4cc3-8e84-ea93e2646d21","resolution":{"observed_at":"2026-08-11T05:41:14.722990Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.508245Z","title":"Characterizing Quantum Supremacy in Near-Term Devices","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.508245Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:ece8f8bb17cf9715db4e32f061e81aadfa836b461eb04f49d286cd4d139e813e","observation_id":"4d62cdb8-150d-4ac2-8e56-e34e95bc4fe7","resolution":{"observed_at":"2026-08-11T05:41:13.508245Z","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-11T05:41:13.512174Z","title":"Simulation of low-depth quantum circuits as complex undi- rected graphical models","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.512174Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:0e616fd1ae9373553c110ad3bc50cee6d23cf3d960370cf45f82ff17732a1426","observation_id":"d38c5ac4-6bcb-4992-a63e-9fe8081ac6fd","resolution":{"observed_at":"2026-08-11T05:41:13.512174Z","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-11T05:41:13.515963Z","title":"Pseudo-Boolean optimization","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.515963Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:9bdde2528c0c30af82d5eba4ada23812fc87a7831c660b6e6976cd91d137f300","observation_id":"03cf6fd5-7506-4901-bfb0-5ea8bc678c57","resolution":{"observed_at":"2026-08-11T05:41:13.515963Z","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-11T05:41:13.520091Z","title":"The anatomy of a large-scale hypertextual Web search engine","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.520091Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:ac908d2c64c630a2236a82e9ccb551cafe30200336427f2e67fb493b39ad22ee","observation_id":"1bef30a9-375a-4cf7-86e2-8f9272623ceb","resolution":{"observed_at":"2026-08-11T05:41:13.520091Z","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-11T05:41:13.523854Z","title":"Published: Cryptology ePrint Archive, Report 2017/847","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.523854Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:d73b95190d22b9911f2ad2de663e7ff3cc8d891c49d83afa081aba0f2e5f03e3","observation_id":"c58ad4fb-ae76-468b-a6cd-764e2ff622bf","resolution":{"observed_at":"2026-08-11T05:41:13.523854Z","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-11T05:41:13.527949Z","title":"Classical Simulation of Intermediate-Size Quantum Circuits","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.527949Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:50a5e2d8b8c69c1df02fd64ee3c7f69ac3e12695d4efb5129a892c585aad1b9c","observation_id":"00b8bf5a-c3d3-4c49-afc8-f5ead197d75a","resolution":{"observed_at":"2026-08-11T05:41:13.527949Z","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-11T05:41:13.531894Z","title":"64-Qubit Quantum Circuit Simulation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.531894Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:3b8b64d7be3b1925546374bcfdfe3e0e1940169e7d3833e9544f31bf7a09457f","observation_id":"9dfcbfd5-ac55-40fe-9d38-765c3571a891","resolution":{"observed_at":"2026-08-11T05:41:13.531894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.01647","last_updated":"2018-10-03T09:14:29Z","snapshot_observed_at":"2026-08-14T18:20:07.926654Z","submitted_at":"2018-10-03T09:14:29Z","title":"Graph comparison via nonlinear quantum search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.01647","snapshot_observed_at":"2026-08-11T05:41:13.536155Z","title":"Graph comparison via nonlinear quantum search","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.536155Z"},"links":{"cited_paper":"/paper/1810.01647","citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:3cbdd5a29b52580fb46fb2f1980a12de7feed9c19e16b79f58b4c1f0b6a0b707","observation_id":"f8914350-e108-400e-a046-dae5b1a41cb4","resolution":{"observed_at":"2026-08-11T05:41:13.536155Z","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-11T05:41:13.540398Z","title":"Quantum Information Processing in Continu- ous Time","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.540398Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:6cbfb89b042015f0f5f853753e4805121087ca42babeec6b176762add55ecd0c","observation_id":"2c512fec-7c92-4fb8-b9af-06a462568952","resolution":{"observed_at":"2026-08-11T05:41:13.540398Z","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-11T05:41:13.544136Z","title":"Quantum machine learning: a classical perspective","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.544136Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:bb59cf7697a673d1e13b85afccf033ee6cedbdb6e89375912c4fa466528a4835","observation_id":"2cd52625-aa70-462f-82a1-9aab333e84de","resolution":{"observed_at":"2026-08-11T05:41:13.544136Z","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-11T05:41:13.547640Z","title":"Quantum algorithms revisited","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.547640Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:62c9513a60349695fd5cbfbdf01cd30e6a1391a6c99e3d25b0f116809ce900c5","observation_id":"1c45766a-6e1b-408a-b741-2855753ced99","resolution":{"observed_at":"2026-08-11T05:41:13.547640Z","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-11T05:41:13.551400Z","title":"Different Strategies for Optimization Using the Quantum Adiabatic Algorithm","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.551400Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:06be11426148764fce7a0d9fe996dc853303420e5d9b814a61ad89de8b6ed2ee","observation_id":"07972ab6-0fb8-43ae-bd5c-b556174e0992","resolution":{"observed_at":"2026-08-11T05:41:13.551400Z","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-11T05:41:13.555577Z","title":"Quantum Theory, the Church-Turing Principle and the Uni- versal Quantum Computer","venue":null,"work_id":null,"year":1934},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.555577Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:ed11981a95d52368ffe29ac8d42aa4257f7600bdeb1b2af2204708811f41d491","observation_id":"88c4e885-b056-4877-817a-f6c5ff69fb43","resolution":{"observed_at":"2026-08-11T05:41:13.555577Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.305964Z","title":"Rapid Solution of Problems by Quan- tum Computation","venue":null,"work_id":"140d9281-f18f-4db1-ac49-b65a9692af17","year":1992},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.559377Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:0aedd1b8bbe925842bcb1806c81d9e74ec23c0b63149f9739e5aab29c4313211","observation_id":"843447d8-7111-4f1d-b292-c0cae560c8f2","resolution":{"observed_at":"2026-08-11T05:41:15.310292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.293439Z","title":null,"venue":null,"work_id":"2447dde9-b250-476c-9167-7deab9fd4473","year":null},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.563039Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:47b1a7debad8999071fa6ff05ae0d963bdd7094c59926a5110d67e9c879911cc","observation_id":"bdacd8d1-49b0-4bdb-a6b0-c34a1fbf40c1","resolution":{"observed_at":"2026-08-11T05:41:15.298028Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.570803Z","title":"A new notation for quantum mechanics","venue":null,"work_id":null,"year":1939},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.570803Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:efae52e892467187e9aeb7f151515b1ccc784638a3eebdeecb1e416122d25389","observation_id":"89f08433-1d03-4295-99e5-eb08fb46d528","resolution":{"observed_at":"2026-08-11T05:41:13.570803Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.266711Z","title":"Sparse matrix test problems","venue":null,"work_id":"41217c2d-73d1-48af-adca-cbb2475def1f","year":1989},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.574819Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:672f951e87e4183480ff7e0180f6f8f3953b97440e1ac7ae0c588566a12e8247","observation_id":"1f25b160-baf8-46b9-92b6-8a26a787b1b3","resolution":{"observed_at":"2026-08-11T05:41:15.271324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0009-2614(96)01272-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.063197Z","title":"One step time propagation method for systems with time- dependent Hamiltonians","venue":null,"work_id":"84668008-8fab-4206-be4a-6fdf910dab1a","year":1996},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.579055Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:db760e0d6a98cae8a52149e78afcab74e5d4f19a07999c186a53ada60d143082","observation_id":"9d004a63-4fe2-470c-bcb7-9d1919ca67d3","resolution":{"observed_at":"2026-08-11T05:41:14.067323Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.253258Z","title":"A Quantum Approximate Opti- mization Algorithm Applied to a Bounded Occurrence Constraint Problem","venue":null,"work_id":"68253c8f-7bf5-494f-a3d9-cddd00b667cb","year":2014},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.583342Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:0512c5227663602517070aa68e0af0b88feca4ee90f6c76446f32eca93e225b1","observation_id":"cb7dcae9-6657-49d0-9d24-46c43ec09cc3","resolution":{"observed_at":"2026-08-11T05:41:15.258140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.238248Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","venue":null,"work_id":"6b951458-883e-432e-8039-1f4faa41c621","year":2016},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.587136Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:8fe8f9270922ab3916087ca6dcfcd5dc5a474880064a257708f39e2543513930","observation_id":"a28a4972-43bd-4040-85bd-78eff912a439","resolution":{"observed_at":"2026-08-11T05:41:15.243685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-08-13T17:16:52.599300Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-11T05:41:13.590943Z","title":"A Quantum Approx- imate Optimization Algorithm","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.590943Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:4b6c68e86a3183b36e6f09aa31123601e294fe2186712701ad26f2a9f45395d1","observation_id":"bc042e3a-dfb4-4ab8-8d39-b8c17a3410b2","resolution":{"observed_at":"2026-08-11T05:41:13.590943Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.222799Z","title":"A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem","venue":null,"work_id":"267d16f0-f49f-46b1-8ddd-d5c7609f0255","year":2001},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.595507Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:55fbcb0a467f198116dd36506f66495e231f0d06b94d506358a4407964749d93","observation_id":"512cae46-ee8e-4303-ade9-e6cb7ac6f47a","resolution":{"observed_at":"2026-08-11T05:41:15.227978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.209148Z","title":"Simulating physics with computers","venue":null,"work_id":"48275557-e149-40b4-ad8d-607f2473b214","year":1982},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.600103Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:e92bbe5976b52456dad0c7c733613a6d75b62d14d1dfa9e53ae54fcf3e7f5e2b","observation_id":"d62aeaf3-92b4-4280-a64e-30bb185e33e2","resolution":{"observed_at":"2026-08-11T05:41:15.213842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.196589Z","title":null,"venue":null,"work_id":"6c1cdaf0-716f-41c1-99b1-728d5b85d902","year":1979},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.604283Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:b5474b02fad0bfd9ff41e4a751f2e1ce6ad89f5b966c2eecebf029dcc2ea244f","observation_id":"f875d9f2-b787-416f-90a1-b76ef6691d29","resolution":{"observed_at":"2026-08-11T05:41:15.200722Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9605043","last_updated":"1996-11-19T17:54:17Z","snapshot_observed_at":"2026-07-07T07:26:17.833366Z","submitted_at":"1996-05-29T19:09:06Z","title":"A fast quantum mechanical algorithm for database search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9605043","snapshot_observed_at":"2026-08-11T05:41:13.607982Z","title":"A fast quantum mechanical algorithm for database search","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.607982Z"},"links":{"cited_paper":"/paper/quant-ph/9605043","citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:9fc5c7ac0295b85a0b5099bd9bf37dc85241fc08cda8afe35ce3164694859212","observation_id":"4672523a-4f06-4e7f-b3d7-5e175c7aae7d","resolution":{"observed_at":"2026-08-11T05:41:13.607982Z","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":"ph/9809029","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.643269Z","title":"How fast can a quantum computer search?","venue":null,"work_id":"b5535c90-5ada-4932-b429-eda28a7d885a","year":1998},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.612025Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:0e96496054dde9d914156b76012e0900a83263163de46dca97d30b3ccd4ec06a","observation_id":"6e6a3075-30e9-4895-9c79-e2088594e222","resolution":{"observed_at":"2026-08-11T05:41:14.649893Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.01450","last_updated":"2017-01-05T19:04:19Z","snapshot_observed_at":"2026-08-14T21:22:23.375812Z","submitted_at":"2017-01-05T19:04:19Z","title":"Practical optimization for hybrid quantum-classical algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.01450","snapshot_observed_at":"2026-08-11T05:41:13.616192Z","title":"Practical optimization for hybrid quantum-classical algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.616192Z"},"links":{"cited_paper":"/paper/1701.01450","citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:bde7cdf150909f3a0b55fdcb07045362b68591db1b9f0a2a631598ce4da61886","observation_id":"811b1327-9068-45a4-b4c0-f47b6dd99c71","resolution":{"observed_at":"2026-08-11T05:41:13.616192Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.182895Z","title":"Quantum Algorithms for Scientific Computing and Approxi- mate Optimization","venue":null,"work_id":"585f3ccf-f434-4a9c-b4b8-2eb4606c457d","year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.620336Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:057be5190539f163b44fdd9a2dfc2c3a5df029f0cd78975f456f0b56d2f4aacc","observation_id":"51be34d2-f206-4a3b-87f0-4a9b71456199","resolution":{"observed_at":"2026-08-11T05:41:15.187510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.169933Z","title":"From the Quantum Approximate Optimization Algo- rithm to a Quantum Alternating Operator Ansatz","venue":null,"work_id":"baf6ab3e-7476-4cda-b66c-675a3a8af210","year":2017},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.623980Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:485fab930cf92ed9d2164451b3c4ac1a53890301f06ddeb615329a5c6f2f0d4d","observation_id":"a3a25873-12db-4d14-a895-003824405141","resolution":{"observed_at":"2026-08-11T05:41:15.174354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/comjnl/bxt123","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.050622Z","title":"Topological Similarity-Based Feature Selection for Graph Classification","venue":null,"work_id":"29839109-04b0-445c-b423-ca92285d920e","year":2015},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.627560Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:ff8fdeb95777d5b3c185a58edd1c7f503f4924f4186181d4a75afe156a93337b","observation_id":"63cf8d2b-b8e7-4fc0-87ce-13394bd62316","resolution":{"observed_at":"2026-08-11T05:41:14.054863Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.157044Z","title":"Development of a chemical structure comparison method for integrated analysis of chemical and genomic information in the metabolic pathways","venue":null,"work_id":"77dbe2c6-e6be-4d08-96cf-43b7f13d4b90","year":2003},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.631863Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:bc20718fd894182dfdf1acbcb1ddd83c4ec39b2eb20a43d912a4d27baa26fc2a","observation_id":"be4b14fa-843a-414c-97bd-3305a2868337","resolution":{"observed_at":"2026-08-11T05:41:15.161491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.86.042310","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.038108Z","title":"Solving the graph-isomorphism problem with a quantum annealer","venue":null,"work_id":"7bd08292-a04b-4d39-a157-2a389ab6bf08","year":2012},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.635510Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:82f9c2fb992d1641ec2984aec6ede102d4de0b1e07e029a68a1821770dd51254","observation_id":"a2c58212-aefa-470d-9f76-ada530bbccab","resolution":{"observed_at":"2026-08-11T05:41:14.042433Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.144738Z","title":"SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems","venue":null,"work_id":"e8dc2bd1-c364-4a06-a514-6c31c9979011","year":2005},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.639594Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:3359459141e289c6fb648f966fe9dcc1e3311b32cd481025e5e2916d3799f226","observation_id":"926cbd00-2c03-4694-ab0b-68690a5469ab","resolution":{"observed_at":"2026-08-11T05:41:15.148890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.131330Z","title":"Deriving phylogenetic trees from the similarity analysis of metabolic pathways","venue":null,"work_id":"8a348a89-d40b-471b-b185-07fbd23b46cb","year":2003},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.643405Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:df99f5c3ca1cf50f73d540898078587a3e45afa3c36b74bdd0275fa85e5f45db","observation_id":"98f7dd9c-4c29-4f67-9da2-c5ebee6224b9","resolution":{"observed_at":"2026-08-11T05:41:15.135996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.118057Z","title":"A Block Algorithm for Matrix 1- Norm Estimation, with an Application to 1-Norm Pseudospectra","venue":null,"work_id":"9abb3fc4-fc7d-4c02-be73-8e0759ef0d8a","year":2000},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.647560Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:48021f47841238b167522ea5f295d14c3669f26d5e515ccda244a6f6c08892ee","observation_id":"f0a61de7-2497-4d37-b32e-7c11d5bf0632","resolution":{"observed_at":"2026-08-11T05:41:15.122641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.01127","last_updated":"2017-09-18T11:24:06Z","snapshot_observed_at":"2026-08-14T21:08:20.203263Z","submitted_at":"2017-04-04T18:00:08Z","title":"0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.01127","snapshot_observed_at":"2026-08-11T05:41:13.655764Z","title":"0.5 Petabyte Simulation of a 45- Qubit Quantum Circuit","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.655764Z"},"links":{"cited_paper":"/paper/1704.01127","citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:f9693f7b7ae4bec46ce44243a52b336905f82ca41f6ba42fbf7f004cad5ec5b2","observation_id":"685633fa-5424-42ea-936a-6d8a974a5999","resolution":{"observed_at":"2026-08-11T05:41:13.655764Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.105478Z","title":"Qiskit Aqua","venue":null,"work_id":"e979f59d-d5d7-430a-9093-d29c503fcf0c","year":null},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.660101Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:c3b0348efe62cbdc284a973945b8a8cf3f9a041e25d075c17fea793765f2844f","observation_id":"3aae31e2-3f51-4a09-add7-01e9a88f68f3","resolution":{"observed_at":"2026-08-11T05:41:15.109835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.091574Z","title":"url: https : / / software","venue":null,"work_id":"90583663-1c8e-4e40-acba-d93335648ede","year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.664890Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:ccdf5884a2442dd3830e8bad6be7713aae485095b93de6cf5444f0b65dbb324b","observation_id":"1823d5b1-9247-4b9a-a343-9dab6479b670","resolution":{"observed_at":"2026-08-11T05:41:15.096468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.078121Z","title":"pyCTQW: A continuous-time quantum walk simulator on distributed memory computers","venue":null,"work_id":"ffaaf1f5-03a4-4852-8a89-8eff4651065f","year":2015},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.668611Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:5dbee645b4a4672d9f2a49b2e138ba98008915093332f6ea1aafaaa36fbc2cc3","observation_id":"97f072cc-fb6d-48e2-93fe-e9bf812948bf","resolution":{"observed_at":"2026-08-11T05:41:15.082449Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.064915Z","title":"Six Degrees of Information Seeking: Stanley Milgram and the Small World of the Library","venue":null,"work_id":"6d40b654-9805-44ac-97a5-9fda259759cb","year":2006},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.672856Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:a3c2f77cd434b23dd919768351053f99a330888d5820f626a46e411cbe4e61ed","observation_id":"688a09a0-8efc-42ba-a747-6df510b139e5","resolution":{"observed_at":"2026-08-11T05:41:15.069806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.051706Z","title":null,"venue":null,"work_id":"5849a833-d22b-4c30-8494-c9ad0137f8de","year":2011},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.677499Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:f0a4318bdfe25bb33efaa11ac2d3a05dbfa9d62445ba4dbcd3fe6d72c35ac83e","observation_id":"d2572ed7-618f-4ae3-9acd-0c371bf61ad2","resolution":{"observed_at":"2026-08-11T05:41:15.055941Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.038494Z","title":"Lipschitzian optimization with- out the Lipschitz constant","venue":null,"work_id":"ed6fe70c-978b-4b6e-9647-961ce7ef4fdc","year":1993},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.681295Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:df894732a70cbb63e115d75fd7af5d7ced744233de00a622824fb37883f5e7db","observation_id":"c26dab97-faf6-445d-8897-0e1602cbbc4d","resolution":{"observed_at":"2026-08-11T05:41:15.043875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.022408Z","title":"SciPy: Open source scientific tools for Python","venue":null,"work_id":"a7f12587-202d-4df3-8731-1193b8077051","year":2001},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.684989Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:812744984639641c0712ff1ff6d7f51fa65c291742e44e8efed0af8d865a5dad","observation_id":"6372af0f-8e27-4b7d-9f92-9e04ff54f48a","resolution":{"observed_at":"2026-08-11T05:41:15.028350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.006819Z","title":"A Preview of Bristlecone, Google’s New Quantum Processor","venue":null,"work_id":"04f16c98-2013-465e-a07e-1e6b49e27c06","year":null},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.689090Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:d8304a9dc29170c883ec12c799328ed3c558f512e98d3cd92884de91c4a5acc9","observation_id":"0e226036-c37d-464a-ba16-c4744efb87dd","resolution":{"observed_at":"2026-08-11T05:41:15.013135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"docview/1808072","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.537013Z","title":"Authoritative sources in a hyperlinked environment","venue":null,"work_id":"28248f38-804b-4bf8-acfe-cfd7a0e854fa","year":1999},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.697319Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:f83481815cfcefe3f29115311a8b278ac42d17368a2236488ceadfe65d4ceae1","observation_id":"a2b8a747-f5c9-444c-9800-012d6f0d0771","resolution":{"observed_at":"2026-08-11T05:41:14.543661Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.700997Z","title":"Fast parallel algorithms for graph similarity and matching","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.700997Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:33840e4bdae92c30b28b371011a19be0a7052b7acb02acb46def0f3146385ce2","observation_id":"f67e47b9-2ef9-46d0-85f1-2b81231dda0f","resolution":{"observed_at":"2026-08-11T05:41:13.700997Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/12.210173","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.007170Z","title":"Distortion invariant object recognition in the dynamic link architecture","venue":null,"work_id":"f970fc8f-fc89-4693-a49c-941bc402582d","year":1993},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.705387Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:2630a5563006cafd58dadf455d1d57adda325ec3deff6f4f85f7f161adca09cb","observation_id":"ef00c5ab-b6e3-44ac-b1c6-35dc298fee73","resolution":{"observed_at":"2026-08-11T05:41:14.012298Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.981300Z","title":"Quantum Supremacy Circuit Simulation on Sunway Taihu- Light","venue":null,"work_id":"b0481166-9283-499f-ab3a-2ccd6e042732","year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.709586Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:57a81383900ec6f9707016378e7f320fdcd534f0e495b1261e35420820a77b3c","observation_id":"d95e95be-de68-467e-94d5-cf852fcec9f7","resolution":{"observed_at":"2026-08-11T05:41:14.985631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1302.5843","last_updated":"2014-01-24T16:20:55Z","snapshot_observed_at":"2026-08-15T00:27:43.387366Z","submitted_at":"2013-02-23T20:45:26Z","title":"Ising formulations of many NP problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1302.5843","snapshot_observed_at":"2026-08-11T05:41:13.713408Z","title":"Ising formulations of many NP problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.713408Z"},"links":{"cited_paper":"/paper/1302.5843","citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:dba0428b0efc7e396fe46e1cdb26608ed0bbf35f4a7a76a7dc5082fd61c054ef","observation_id":"8dfd45f1-71b6-4b8e-b4aa-6c0baa7e45c5","resolution":{"observed_at":"2026-08-11T05:41:13.713408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.10749","last_updated":"2018-09-26T22:11:10Z","snapshot_observed_at":"2026-08-14T18:46:57.467369Z","submitted_at":"2018-07-27T17:58:05Z","title":"Quantum Supremacy Is Both Closer and Farther than It Appears","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.10749","snapshot_observed_at":"2026-08-11T05:41:13.717510Z","title":"Quantum Supremacy Is Both Closer and Farther than It Appears","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.717510Z"},"links":{"cited_paper":"/paper/1807.10749","citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:a752706d316533fe9188bc732624ac6d20b7592f5879fbd49471bd2ce67b6ce8","observation_id":"6c5d9b17-750c-4e01-8889-9615675615f5","resolution":{"observed_at":"2026-08-11T05:41:13.717510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.08227","last_updated":"2018-04-26T03:23:36Z","snapshot_observed_at":"2026-08-14T19:23:14.945964Z","submitted_at":"2018-04-23T02:23:14Z","title":"A quantum walk assisted approximate algorithm for bounded NP optimisation problems","version":2},"cited_work":{"arxiv_id":"1804.08227","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.08227","snapshot_observed_at":"2026-08-11T05:41:14.437906Z","title":"A quantum walk assisted approximate algorithm for bounded NP optimisation problems","venue":"quant-ph","work_id":"a53a1bdf-195b-4235-bba6-0d55ec3e3006","year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.721494Z"},"links":{"cited_paper":"/paper/1804.08227","citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:9510cac98cb3ae7c52bd3ffb2b492d4c903fa78e206ee86d3eaa25b6a0c46f10","observation_id":"8045ac89-7d58-443d-abc6-47ba636f5ddd","resolution":{"observed_at":"2026-08-11T05:41:14.442883Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.969301Z","title":"Nineteen Dubious Ways to Compute the Exponential of a Matrix","venue":null,"work_id":"14b0a5cd-b53e-4e96-87af-68600c48fe27","year":1978},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.725785Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:cb6553b80c9283cd1972d675dd10fa4f4a209f059e7d40e70d7c1d4bb532d761","observation_id":"ddfc5361-6844-4329-9ced-907cf85776b7","resolution":{"observed_at":"2026-08-11T05:41:14.973277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.733985Z","title":"Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.733985Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:abc6ebaaacc6f0a753751bb8718e4ad6d205ca31b0437d2e79f9ff45279b1fe0","observation_id":"9cc94b65-bc88-4dfb-9370-f0cf64e02442","resolution":{"observed_at":"2026-08-11T05:41:13.733985Z","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":"10.1063/1.3312531","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.970519Z","title":"A Chebychev propagator with iterative time order- ing for explicitly time-dependent Hamiltonians","venue":null,"work_id":"b3dd8f71-3508-4660-a1e8-842880cfebd8","year":2010},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.738031Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:acf94dde86207af0b1d13fc6901e427170f1a3ef36464577b10483ae05a43793","observation_id":"4a260cc8-8330-4829-8e70-12ed74994f25","resolution":{"observed_at":"2026-08-11T05:41:13.975068Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.956779Z","title":"A Simplex Method for Function Minimization","venue":null,"work_id":"f4dba069-bcb7-4b79-a915-85b2a854ba0e","year":1965},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.742008Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:5de4de019ec098a0b1b4cc1489ff72af2070e4df6b2113d95544567cc882dad6","observation_id":"aa895ed0-1b13-4e55-8c00-84d822488518","resolution":{"observed_at":"2026-08-11T05:41:14.961195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.944740Z","title":null,"venue":null,"work_id":"b9ee999d-b1fa-4ae0-8466-a669c85dc5eb","year":2000},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.745698Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:c0bacb49d0642f048481a9a4cba942df005f475a911c78afeef46e200ce00fdc","observation_id":"77a295e0-6f28-4cca-a918-00c987cd22a2","resolution":{"observed_at":"2026-08-11T05:41:14.949061Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.932196Z","title":"Unsupervised Machine Learning on a Hybrid Quantum Computer","venue":null,"work_id":"66f3697b-d7e9-4ed6-b47f-d0cec511bd87","year":2017},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.749351Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:9e9e900ebb2811b017fde676b6a841ac209e24c81a6f8e7a385f6a5a0813c81f","observation_id":"e8a09a6a-ac8f-4d85-b27c-d637573fc891","resolution":{"observed_at":"2026-08-11T05:41:14.936638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s13174-010-0003-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.956934Z","title":"Web graph similarity for anomaly detection","venue":null,"work_id":"32248fbe-87e1-4aad-9d64-a1681820c216","year":2010},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.753130Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:a52e9b9cd62abec2e98708e9ff271bc6017fe2bf5da4aa0dedd5c1fd26e59297","observation_id":"ae7fb69a-44dc-46e9-9c51-4d1f782d6163","resolution":{"observed_at":"2026-08-11T05:41:13.961890Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.919250Z","title":"Breaking the 49-Qubit Barrier in the Simulation of Quan- tum Circuits","venue":null,"work_id":"ce0ead16-563b-48e1-9be3-e9fddb78f01c","year":2017},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.756930Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:9e01ea958a6b85a3e8e7d6674f5652012b9896790cc0dfb93cb46e588d7905a6","observation_id":"b597e2cc-55e7-4a1e-8b6d-267923e559c7","resolution":{"observed_at":"2026-08-11T05:41:14.923680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.760735Z","title":"Direct search algorithms for optimization calculations","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.760735Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:afa24f3e1436ec9cdf11c31298ceb1b673c80363460ac42045047aa28e4d7209","observation_id":"33e8fb0d-3860-4160-aeb2-8e1f49f9a20f","resolution":{"observed_at":"2026-08-11T05:41:13.760735Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.902679Z","title":"RASCAL: Cal- culation of Graph Similarity using Maximum Common Edge Subgraphs","venue":null,"work_id":"c15f2d20-c344-4787-81b9-258b266881ee","year":2002},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.765147Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:709d7bdc42ee0d59587671f895254349c5307eb4932c280bfd9280d44e4fd4fa","observation_id":"4a9e7cfd-b6c6-4e59-a68d-62128f03649c","resolution":{"observed_at":"2026-08-11T05:41:14.907099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.890093Z","title":"Stochastic global optimization methods part II: Multi level methods","venue":null,"work_id":"b100216d-63be-4ced-990d-b30763b4290f","year":1987},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.769117Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:22d74f0ed80533100896a84f0252eaa4a091fb55e20ccb54f4b8f0147cd4e3a6","observation_id":"093cebee-6494-4bb4-8c39-89d09e25dfd8","resolution":{"observed_at":"2026-08-11T05:41:14.894531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"docview/3038650","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.415053Z","title":"Functional stability analysis of numerical algorithms","venue":null,"work_id":"836938a0-774f-4aca-a0c1-3b72e1edb6dd","year":1990},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.773028Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:dc3831b44447c0a57cf62ba3e719ac53c1accf842389d7a87e21554ee4686af6","observation_id":"4585f9b2-fdb7-405d-9bff-7ad76adf6fd3","resolution":{"observed_at":"2026-08-11T05:41:14.424891Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.776979Z","title":"Theory of Quantum Annealing of an Ising Spin Glass","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.776979Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:8d5efc47063e2d325c5507accb81540cd703406351530fb78c2fbd6eed5d68d5","observation_id":"4e67e8c9-1bcb-4b31-8ae1-521739b09d0c","resolution":{"observed_at":"2026-08-11T05:41:13.776979Z","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":"6689.35669","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.346272Z","title":"Permutation Generation Methods","venue":null,"work_id":"11fe32b5-3fe8-4701-800e-733c668454b4","year":1977},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.780841Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:fadcbecac1fc89aab84cd20e73b9d215dce2e423714804d76453d16a9c9c8ebe","observation_id":"8840f3c7-d948-472d-9678-69b04c8b3809","resolution":{"observed_at":"2026-08-11T05:41:14.352971Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2016.77387","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.266396Z","title":"A functional architecture for scalable quantum computing","venue":null,"work_id":"4995caae-dc9e-4d64-be0d-074cc2ce6f17","year":2016},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.784780Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:f62332c7b9e65bcf180029e66f95c0dd7306bbc334c631a8655d403b0df605a1","observation_id":"4a867280-88c3-459b-ba0f-e465c1fb417f","resolution":{"observed_at":"2026-08-11T05:41:14.273871Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.877906Z","title":"Polynomial-time algorithms for prime factorization and dis- crete logarithms on a quantum computer","venue":null,"work_id":"7618ea71-27c4-4387-8c0d-ef7787e5634b","year":1997},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.788614Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:71377642adf78350bc85c4856fb8099d362d0ba5e5ad6b467b12f16ec9e83164","observation_id":"bf91f27e-460f-414b-8598-30b833846895","resolution":{"observed_at":"2026-08-11T05:41:14.882115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.864817Z","title":"Algorithms for quantum computation: discrete logarithms and factoring","venue":null,"work_id":"acc4ebb9-be80-4796-8e2f-d2fa8860c42d","year":1994},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.792870Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:716ba2a93853d8ccfae42e6e70d3677aeb061ae9b6c2a335ad993e32f0ad2a67","observation_id":"b8ad6bba-6ae2-4963-9a56-bd7b19b9d0c2","resolution":{"observed_at":"2026-08-11T05:41:14.868819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5861.28586","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.200214Z","title":"Expokit: a software package for computing matrix expo- nentials","venue":null,"work_id":"3cab5e3a-9aa1-4890-976a-b2fa4c376991","year":1998},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.797118Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:c7a81a2b6ad143ad3d5025378b7afba0406c0446b9da509f12dd585164ba1dfa","observation_id":"0bdf7055-0e01-45a4-abd0-fed4f02980bd","resolution":{"observed_at":"2026-08-11T05:41:14.207591Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.853189Z","title":"Mastering the game of Go with deep neural networks and tree search","venue":null,"work_id":"646cf4f9-a006-4a01-94e5-e6cab851dc6d","year":2016},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.800949Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:e49905a300695021c631471df2e413c4b287354be96de3a8238897781cb7ed6c","observation_id":"977a71ae-89bb-4cab-b307-f5edecded02c","resolution":{"observed_at":"2026-08-11T05:41:14.857022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.838601Z","title":"qHiPSTER: The Quantum High Performance Software Testing Environment","venue":null,"work_id":"c421be4e-48c1-41e8-97b7-d5bf307d4d6e","year":2016},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.805230Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:a9dd55c9b4044eb6a13f63d59651c291229c9aa7bb5ef85eed0ecf86bd2b210b","observation_id":"05b9a922-427a-401b-af5f-c73df5db4a75","resolution":{"observed_at":"2026-08-11T05:41:14.844924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.823514Z","title":"Automatic design quality evaluation using graph similarity mea- sures","venue":null,"work_id":"537f2539-1a3d-4cab-a393-8676c7f2054c","year":2013},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.809496Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:7cffa7d10bb1c529daf8faf86f5a08ca3cf5199104dac96f0d004205f2d057b9","observation_id":"26de590b-cdda-47c5-bdd0-7fc1f445a524","resolution":{"observed_at":"2026-08-11T05:41:14.828604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physrevb.60.13668","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.925924Z","title":"Quantum waveguide theory: A direct solu- tion to the time-dependent Schr¨ odinger equation","venue":null,"work_id":"49db7579-da03-4eff-8815-ee1753a5c602","year":1999},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.817034Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:7b566fb733c30a8f3dc10b746f2eb1a3cb735b361bfd1e8438020b554c193178","observation_id":"411916e0-0848-4d08-9aec-f07930507739","resolution":{"observed_at":"2026-08-11T05:41:13.930652Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.57.3554","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.911380Z","title":"Time-dependent approach to scattering by Chebyshev-polynomial expansion and the fast-Fourier-transform algorithm","venue":null,"work_id":"effe8e52-3119-4a90-a1ce-277ca2b1be67","year":1998},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.820912Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:46b54f25486c103d615b0fbe455786171c2643f3a58d1713ed6ab1d8dd63dede","observation_id":"7fbdc833-ae8a-46c7-9ed0-c403d597b523","resolution":{"observed_at":"2026-08-11T05:41:13.916323Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.795757Z","title":"Training a quan- tum optimizer","venue":null,"work_id":"75c23a75-16a2-47f1-ac31-5880830bc989","year":2016},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.825097Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:c756a726e8c3509f8334fd03bc241f3714a88ed5a68e5a333a89e79cc859effb","observation_id":"843cd030-4480-498f-8704-1e74357cb626","resolution":{"observed_at":"2026-08-11T05:41:14.800006Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.782755Z","title":"Weisstein","venue":null,"work_id":"13e7d392-4daa-4908-b478-13a393779c51","year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.828808Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:52cd28bdd19c68d6f0c2ce054723255245c8184728646a9241ac5ac16ba869d9","observation_id":"d6c9ebb0-c704-4f66-b06d-f1273b5a0cab","resolution":{"observed_at":"2026-08-11T05:41:14.787131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.769326Z","title":"Efficient quantum circuits for diagonal unitaries with- out ancillas","venue":null,"work_id":"d6485e4a-1fe9-445b-86e2-b1387bb9f809","year":2014},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.832634Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:a9b02ab0798581d011cbbc1c2f1e461db486ff9fadb62bd228fa270045173da2","observation_id":"f7182c9e-50e1-491f-960c-79d2be4dbd0c","resolution":{"observed_at":"2026-08-11T05:41:14.773370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/34.598235","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.897462Z","title":"Face recognition by elastic bunch graph matching","venue":null,"work_id":"1a9647ee-d89d-421a-93f7-f9e75be4e0f4","year":1997},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.837177Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:ba5c4af49e624aad2ee18eccdac77bf4f7b7718c31d8b74c088dd507e988cfbc","observation_id":"9f0cce2a-049b-422c-8335-f87e294f7bc0","resolution":{"observed_at":"2026-08-11T05:41:13.901823Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.aml.2007.01.006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.882497Z","title":"Graph similarity scoring and matching","venue":null,"work_id":"53221b91-3fda-4143-9e77-113e1bafbe7a","year":2008},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.841604Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:ca2449ba573988d992701bcbdd3cc0eb8bf0a5f727c2795b809243e96e03bc45","observation_id":"46ba5bd6-8e04-4f1a-8bbc-e49388f5205e","resolution":{"observed_at":"2026-08-11T05:41:13.888657Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.756695Z","title":"Efficient Graph Similarity Search Over Large Graph Databases","venue":null,"work_id":"fe447184-8278-4289-a68c-44919d99a72d","year":2015},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.845763Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:45c2378af994184ab71c8917ccd6639712cd229d546a11cb51c9c891c27f3eab","observation_id":"3c508600-6585-4f3b-9fea-a8f6d288b124","resolution":{"observed_at":"2026-08-11T05:41:14.760915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.744600Z","title":"The QAOA can be formulated to reduce a combinatorial optimisation problem to a parameter search on around two variables","venue":null,"work_id":"32b9b76b-58ce-49df-903d-968d97fad2e7","year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.849921Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:0d57798c31b355ca4525c251a8b8e4c3dc5670d7bbb097540d2af5f7d24f3289","observation_id":"2896455e-2102-46bc-8d1f-42b85a21ca46","resolution":{"observed_at":"2026-08-11T05:41:14.749040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:15.280241Z","title":"isbn: 0-387-95014-1","venue":null,"work_id":"764bb47a-1dcf-47be-bb74-08f367b777d0","year":2000},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":173,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.567154Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:5a1df5ffe0f70d8f758154f14a3cfe12758abd5c3085f2e45f2593045bf7cff6","observation_id":"7fc56a26-207c-44e0-b1f2-ad149f174387","resolution":{"observed_at":"2026-08-11T05:41:15.284514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1020098","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.993440Z","title":null,"venue":null,"work_id":"4e0d2f0c-3135-495f-a22a-940770fdd76a","year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":836,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.729976Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:4021970b27decb080fb62c50b32184920e57ce182ce0e45ec8a64111cba8ccb3","observation_id":"d30bb035-29ff-4a95-91d4-60db50aa35a9","resolution":{"observed_at":"2026-08-11T05:41:13.998049Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:13.651686Z","title":"doi: 10.1137/S0895479899356080","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":1201,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.651686Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:427cf606a6895340f8aa7969f8394234cfc9cc5d846a47035660e6cf2cc49517","observation_id":"59559047-51ff-4ad6-b1ee-e1df1866f2b6","resolution":{"observed_at":"2026-08-11T05:41:13.651686Z","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":"10.1002/(sici)1099-1506(200001/02)7:1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.083338Z","title":"url: http://doi.wiley.com/10.1002/%28SICI%291099- 1506%28200001/02%297%3A1%3C27%3A%3AAID- NLA185%3E3.0.CO%3B2- 4 (visited on 09/17/2018)","venue":null,"work_id":"565e4f81-e645-4668-a58c-5d912288dd05","year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":1506,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.499972Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:c5346873eb125ee0d76832bc535746f9fd9c3a00d0b31dc0c9e4f3cc50c68683","observation_id":"22ac16ac-dfe0-494e-b87a-fa72730ad882","resolution":{"observed_at":"2026-08-11T05:41:14.088098Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.994291Z","title":null,"venue":null,"work_id":"c8cbf3bc-fb63-4492-a8fe-a2b77350e93f","year":2018},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.693209Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:75747c6a8b7121585e26a662fc4b4d99b8cc124203a561ff87a015b2cffd48dd","observation_id":"29b5c521-b053-42af-8cd1-6524362d1ea9","resolution":{"observed_at":"2026-08-11T05:41:14.998152Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:41:14.809897Z","title":"org / 10","venue":null,"work_id":"552359ac-f1e3-4f69-bf71-4104c79e2360","year":2012},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":5805,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.813168Z"},"links":{"citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:619980abca55e43ee8cb13b76d30652f2b16bfc4a3ea799741d003362b645e1d","observation_id":"ca08840c-c800-459d-9525-c272fe2e381b","resolution":{"observed_at":"2026-08-11T05:41:14.814609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity"},"reference_resolution":{"displayed":97,"state_counts":{"malformed_identifier":5,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":36,"verified_exact":17,"verified_fuzzy":36},"total_outbound_references":97},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 97 of 97 outbound references and 0 inbound Pith citation observations for arXiv:2412.17309."}