{"as_of":"2026-08-14T20:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cabf7dee0354f7954fb2603953d6c5ae34ffa722d77b704fe2759e81ebed3cb3","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-14T06:43:13.782503Z","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:57fc5ca6fa5cf010f2859c60ad53e351abe5fba3ce2c74261dc7e6d2de7651e5","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-14T06:43:13.782503Z","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:81b3d8d4edbd6946a1c1c47f5a8a537b1d51abb531b7779e6510e98e8f842d0e","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-14T06:43:13.782503Z","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:3282b9980b344e2b3b023fc1b10e529ab3922fab9b67c508167830e749d21543","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-14T06:43:13.782503Z","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:97534af9ea72ba1d60a6324f5828fb62d4f0663332de46abbab6415dab6d8d03","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-14T06:43:13.782503Z","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:d221f81f749ea3595247f07d516174caa72d4461f0efcead22f2516a2371c979","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-14T06:43:13.782503Z","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:fa3e979800ff08c82339b700cf016b6b63dd153d8ce6c24d447a290983192b9e","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-10T10:16:12.818716Z","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-14T06:43:13.782503Z","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:4d1ac4a669e46f042fec5735916d1b155889fce0bc100f2e79ba39aa60b0d880","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-14T06:43:13.782503Z","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:7f04b6f72fe607aae3200b8a05edf8a157db7f797ed460cd8c05ca4c8aca23b0","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-14T06:43:13.782503Z","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:fc5cd1bee02a7db54243fce06ec6e84e29fc27920f50ee73a4a6463aa241e107","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-14T06:43:13.782503Z","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:f81590fecf69d2a75eefe3ac13693bab3ca4ac896181cdd648b21bcc882f2690","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-14T06:43:13.782503Z","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:d54ea36df8614f717c0759942a65c490995ea21405f4f86eb06387af35079a05","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-14T06:43:13.782503Z","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:2142e321140f0c24c98a497e0e993ce07a0c41b85d566ca0200a094cb2976101","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-14T06:43:13.782503Z","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:34376e7901f15a77ea5999cc4b99de3955803a3d5cca786fca399c8efbc9f3e8","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-14T06:43:13.782503Z","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:6a86c122d5ee58cf92ab44294d0fb15a0bd31464761346f671337f8d57b189ef","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-14T06:43:13.782503Z","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:c2cfb506f11ccd4eb519a9c00b87d199a59ede5d54d1e4ce5681dc4e2e7c9049","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-14T06:43:13.782503Z","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:9d7f041859f181ce53d0a4e2302cf4bd5dba907c7f171bc7703dba82cd231dd3","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-14T06:43:13.782503Z","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:8785e6bb21cf7f02574f7e7d8fd2a3cedcfcdb42f41f6b4809edd00a9a014018","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-14T06:43:13.782503Z","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:4c665b98b454ef714808a9f289b70864299e4aebc3429f5945c61e5c19e27850","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-14T06:43:13.782503Z","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:ae191bac0bc3683caf353550a2d2afe304d2da90abd5b65d0be30f6a5fc97bbf","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-14T06:43:13.782503Z","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:dafb4aa95bee66ebc88bbfb4929470442c85500fc96ac2a9026af7a42c3da655","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-14T06:43:13.782503Z","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:cc7728b8845ca3b5f7528925ccd71755680b0c338dbe6f694bdc384289671ade","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-14T06:43:13.782503Z","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:594dc793c367216d2f849b455218ee59ea65a8e76d6348f3025259c59866ed0e","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-14T06:43:13.782503Z","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:94cb5d27566a15389187e21d31d70108596b9957b324a9044a0479b35ea58b11","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-14T06:43:13.782503Z","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:2b7ad70eec9425434a03115ce8c9ae03c4ffbfff80fc204b7cbebfe70fc99711","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-14T06:43:13.782503Z","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:48c42bf1a3d8849cc807ea180d81d58a6f4da73f9fc43a1d1932d557dc63aedb","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-14T06:43:13.782503Z","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:3f0d64bae2aaac594be82771f58ff1baa2bac676d39093528cf437b8f83a8c80","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-14T06:43:13.782503Z","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:50fc514333f12d4ed9735f103e6b0690cef6035911669f5df672c1c69c641312","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-14T06:43:13.782503Z","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:16d8b9897dce0f90c7e58faaffc96645473d0091824ff4f3727c6474e9e210ef","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-14T06:43:13.782503Z","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:c54baabd8ad67e80b4747187bbe737218dbec683d5577bd5fa0459f7f9aaaf34","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-14T06:43:13.782503Z","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:168d67a6fa9212334930601b31cfefd53330a7bcbd8e07987f3d9ee63906bcd9","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-14T06:43:13.782503Z","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:c317642cebb7f1cfea58ddb5f66de217fe758db6a702a8a49080000c101e53c4","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-14T06:43:13.782503Z","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:49d590add04b98ca2cc3bfb3633b0c52f358651d6db03447cdeb0f9bd456aa63","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-14T06:43:13.782503Z","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:4dffc32bc71a1f40f2889ee183e77ed6f985071f60a868e40d7f31e4236a8fc4","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-14T06:43:13.782503Z","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:c4c59a47cdac96c5bf2e354c840600ba27063b411a6cfe25e352fa14a9b949ec","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-14T06:43:13.782503Z","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:5cec9e211eb0ea859b880b9cc7fb11d01fcba252b7256d19c9e99d6afb7d1b00","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-14T06:43:13.782503Z","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:647232c96f8100b4a0bc3bb13e8cd35e3a99fabdb01f8b7cee1d988a04bfd840","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-10T12:28:04.781842Z","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-14T06:43:13.782503Z","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:398de26c520b8e0b49c92f3fe33db015c3e0d70579444916f3cf3a30bd1b45f2","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-14T06:43:13.782503Z","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:338d5c8fd7481e0deac3c630eea33a7ef814edd1d6975c8f7467ab070a328364","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-14T06:43:13.782503Z","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:75e29bd897219e08487816846ef2b63ec44da5b2fdcec5236c46f478c14a88df","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-14T06:43:13.782503Z","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:d381bc41186d4a8d909a6bf948a444a4c7747d7e5165c82d9c9351b370a584d3","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-14T06:43:13.782503Z","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:e6d372fdf999d694d0883b025cf2a5a56bb79f0600aba4be6a854dadb1cf2942","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-14T06:43:13.782503Z","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:51ef85a007d283ff6db9855ab63d074e8a645ac7ed39bc8b9dedfe0d9b482aef","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-14T06:43:13.782503Z","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:636aae9b953dfdb3a7b319681adb8325e4e8396d5ef1ba9ea41fc4cdd8c16426","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-14T06:43:13.782503Z","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:711fce9da5357faa00eefb878fabc80d05302902f8b89ea0c4a072dc64268687","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-14T06:43:13.782503Z","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:4e2773e89a71489690dace0e27978276569657f525b9d9e7769e233a18836a55","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-07-06T05:36:30.414068Z","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-14T06:43:13.782503Z","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:73a1b74aab3ef7d65ac8c0b04136e9fb4b691b64ddc02f86e3da9dde029b8377","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-14T06:43:13.782503Z","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:84494b5ebe1950d24dfd0d5816d9ae3049364db567320bb80de2f30a86098ccd","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-14T06:43:13.782503Z","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:1384d49e69d1ae21232de829039f4a8106486b029ebc7118cdcf51939cafcad8","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-14T06:43:13.782503Z","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:0179b4f907cad0f8fce53f897b2c0522851b5884e85c56a4b26b344e82d8d4a4","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-14T06:43:13.782503Z","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:1e1d8b74bcdfcc9f847f0ebe3dae345ca37b98f8db7e6fcb4012d6c135997dd1","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-14T06:43:13.782503Z","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:1afb1a07b3e5f2a61b184afb945f36495d811d5a9fad743e55e33e33b9d3eb51","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-14T06:43:13.782503Z","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:2ee5c8535d88177b25cccf8f2f2b47756a26dabf2a2968caeb9dcf0685801aa4","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-14T06:43:13.782503Z","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:cc7880beb4f56f7a7c42739dae1f6bfde091f1f0e61fee880c354ea36773c96e","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-14T06:43:13.782503Z","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:d92ddb8aacf59be0c805baa2259849ceb89ef97118fbd3f37755611ff575bbdf","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-14T06:43:13.782503Z","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:a39c78b2247adb9909da39f1b02d7174ec831666f7b5c06573e7fc7dda69ab1a","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-14T06:43:13.782503Z","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:03427ac205c6db2cf5b707db178b52a12c23e45971ed6a568e26af1e196150fa","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-14T06:43:13.782503Z","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:527c31e0bbc359b82eee8bf84332a12f4e81c25a8281f1184870859edf8a699a","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-14T06:43:13.782503Z","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:dacda34a67b932125042cf1ab6305d9d6252d4a926503318106c99049dc7379e","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-07-06T03:07:09.562311Z","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-14T06:43:13.782503Z","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:34ce738dd18eda3fb57576e7c436950ab69f9fd85561333453f26149d361f91d","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-14T06:43:13.782503Z","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:99f902f8d63f892c39e6e19f3cc832fac4e51d374d8a74c6a4c3be252fe57c2b","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-14T06:43:13.782503Z","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:99464669722a594d7d71f3f08422b9d7bf6b9879bdfcfc45d5eae1b537fec59b","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-14T06:43:13.782503Z","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:5f2b51e7e25ce35127e98d38786351226b56d4765493adad7b9d017b0e379ea2","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-14T06:43:13.782503Z","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:53a1ffe0ac1d6e07b9aca6c383eeae7206aa68b59720a2b53b021d315b01e0b2","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-14T06:43:13.782503Z","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:d6f5ca6d3eb48c5b065449ae717c16a5d56111c0865d58dfcd3db636c56161cb","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-14T06:43:13.782503Z","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:0fe650af2bc8d1f5aae7883c8fe0d16b2a873d3e6cbe90e5830af075670d0191","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-14T06:43:13.782503Z","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:96df5f185815d75eef7f0f9f253081c9a282d4a04b04183946f42f7d75b47973","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-14T06:43:13.782503Z","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:6d17afcbbad9b9b65f4c2763f6f5eee179a59cdf196751f522a2da5bb8634155","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-14T06:43:13.782503Z","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:24d1c30ca8c959bd7f7fb7ea2fe5f69d63e2163f44af0e97032011f883c88ec8","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-14T06:43:13.782503Z","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:bf063896b976357e666f3d600bee0a83a8c1a985399bfbcf683fb267613a7aea","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-14T06:43:13.782503Z","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:7a067a468534a2b1760467fa3e2b114dadb05a531e4bb192ff70d1ed81803d54","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-14T06:43:13.782503Z","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:fdf5f2d061ba719163a64ea5de73014577ccd8acdaadbe85b8ca2333e11ffc61","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-14T06:43:13.782503Z","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:42623c37f28f9713fd02fa90d54046c6bad2a2ddfb18206f529f9e16a050c706","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-14T06:43:13.782503Z","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:b56d3bcee882a49f27c8156b2c48ae9b75e3b2c0303990dfffafda79ca8b88c7","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-14T06:43:13.782503Z","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:1a458d72cf738b11e3f33342f459cec525d3428290719162b1e05cc64ec4e3e6","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-14T06:43:13.782503Z","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:7f2447a9c56f5a355f6079ccd49f48eb50413d4bc99b391d11adb6a1d502eeb0","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-14T06:43:13.782503Z","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:896136f1c1d2aeb22c409a8c752de03ddfc0f20691d140867c450777680d0fb8","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-14T06:43:13.782503Z","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:5ac07505bad43a44bdda344f3dea79b5243caf799f63ee18954349876747d2b8","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-14T06:43:13.782503Z","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:deab287ff3950acf5ffded92dcdaa3d58caff1a8a293addd3fa8438d72899a34","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-14T06:43:13.782503Z","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:fd2d38439fe6d80565230f7bad425a5912d809be511edebdaa2da01e32be3eda","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-14T06:43:13.782503Z","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:0bc5bced679b401faf03a91124c2911c26805a22d3442217353a6b7a68f9f404","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-14T06:43:13.782503Z","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:6dbec485026234e4aeae546a188bf39846708c3a363a32e24dfbdf77da64f9f0","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-14T06:43:13.782503Z","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:42d80dc3be6fb2bf38d8afca76a744f56ac47e83b0c048d0b2a282d1d95d043e","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-14T06:43:13.782503Z","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:4713595a33c3f75c9b1fa4cdc98961a33135a6758c774a3d4d2d8eabe2b37a07","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-14T06:43:13.782503Z","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:afc1b897d859f3506b085fa85b79d07b0e3505b766b1c4461a7124990c9aa081","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-14T06:43:13.782503Z","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:61ac6b5c64215d4acdab3ecd7053aed8275c364a6700cff6d8324351f523c619","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-14T06:43:13.782503Z","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:a84734c8bd16842e843758f038117fdce9ff27fd9e0a96b693225b1502b3b398","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-14T06:43:13.782503Z","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:0c7e36fe17ae9706fca93e3c5a8818b80475fadfca5071426a8073ba58ccbb3a","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-14T06:43:13.782503Z","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:7d07fb0c0e24b3ae5db3107ed76f1c0b66b202d68a6785804cd6df11fdf0b762","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-14T06:43:13.782503Z","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:5f3fc55878f447f9c23ef0f34eb045ba0ffad3f3762478b1126b43626ddbe1d4","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-14T06:43:13.782503Z","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:32f219fb9b20b1a43ea4891dfdbbbb225a6ee970e9424998274385cdd2789ef1","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-14T06:43:13.782503Z","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:f39edfd27a4a8568da4e259654195f69cca8ca04fad75b8b227322ae7950de3d","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-14T06:43:13.782503Z","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:9bee6c1ec0105af8c83efd034f7574d59f597b0e096416489427595db5b290db","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-14T06:43:13.782503Z","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:bb90e75103744d81bd6051db84f7629df590f1dc6ea34c3b9cf6294591b80bcf","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-14T06:43:13.782503Z","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:5303bb1d925a9368547e166004f9660ca9be913046ed4b63ed68c348cf1c2643","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-14T06:43:13.782503Z","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:a7f66a941bfe0c6fe000b136bf87e6275594c964d110341e492c208fde3939fc","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-14T06:43:13.782503Z","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:bca55a9729e16a769f138f170e2fd386e3f0bd8db31f9ef732cb7d841199c38d","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-14T06:43:13.782503Z","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:6fd2cf069e8c993ade974b5caa41d957e11b9d2606affbf27fc4bb2b50ade1bd","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-14T06:43:13.782503Z","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 14 August 2026, this Paper Citation Record lists 97 of 97 outbound references and 0 inbound Pith citation observations for arXiv:2412.17309."}