{"as_of":"2026-08-05T00:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5202d94d813403d5ec552949e999075b69c560315a4ce45947bd0457d2a019ed","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-14T21:53:32.228752Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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/2603.28413/citation-record","integrity":"/paper/2603.28413/integrity","json":"/paper/2603.28413/citation-record.json","paper":"/paper/2603.28413"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"db670565-ca6a-42ee-925c-7fff026733f2","year":null},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:39a70ab57aa11b2c2a5286040d13bc9a6fd335d84fc5466dbe5d95601a6f2f69","observation_id":"5f9f7369-e083-441f-bced-b74446d72a2a","resolution":{"observed_at":"2026-05-14T23:09:36.721520Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c5bffde2-67a1-420f-91fa-e78ba9c527d1","year":null},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:ae5c9d7f8917b28efe118331a2691d261b188ebe3028685450f20a4281cdb6f3","observation_id":"b1e3a602-c70a-488c-8b3d-16a837404346","resolution":{"observed_at":"2026-05-14T23:09:36.690498Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"how to estimate the expectation value more accurately","venue":null,"work_id":"a7cebd8c-5428-49ae-b7ee-5594255f31c2","year":null},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:ff5732665c2d5e99efd0b64d051d8e37d1ac5cb4677f475bb093cb8dbec0fbcc","observation_id":"df34b3c6-8d6a-4d41-8932-286517a05387","resolution":{"observed_at":"2026-05-14T23:09:36.704394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":"1411.4028","doi":"10.48550/arxiv.1411.4028","metadata_source":"pith","pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-07-10T19:27:32.382371Z","title":"A Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"5a33d9f3-407a-4c7e-a119-ff581c66b173","year":2014},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:fbca2744496b648783627830951ca9a80d8c6f506058b9e4663e23b13b79f13c","observation_id":"39d74851-3392-48b2-90e4-9a9310481949","resolution":{"observed_at":"2026-05-14T21:58:03.796580Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Blekos, D","venue":null,"work_id":"7255985c-471a-494e-b921-73501f3cd7cf","year":2024},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:75c5f86766d9dee788b63922d8d515172744103aad0705cd112f201750ce3171","observation_id":"b9045c2f-27e1-4f02-ab1d-b6cfb28ad4a3","resolution":{"observed_at":"2026-05-14T23:09:36.708886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Tilly, H","venue":null,"work_id":"881ecb1e-adf4-42f6-94f3-f5c8bf83e0dd","year":2022},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:8b60ef527400f8142689fc8be69affcc2be5c906d021550f6563a2157088199b","observation_id":"8759ff45-bf22-4881-8b16-cf624d7877e0","resolution":{"observed_at":"2026-05-14T23:09:36.717517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Bittel and M","venue":null,"work_id":"f8537967-0f57-40eb-99d2-50bbf9c975b6","year":2021},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:328ce06c3e4b4db9f2d0fa65e4069c259fa3e4ffb1d7c1932bac3b6b1541ef28","observation_id":"899c809c-fc12-4428-b565-b9c0d442e0f9","resolution":{"observed_at":"2026-05-14T23:09:36.713650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"033bfd4d-0d38-497c-ae6e-5747712893a3","year":2024},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:07cee7ddff723aba7edfeb731f87be11d4e4f2b4ec83d5da52c26ce8ee212e64","observation_id":"9f36b933-a89f-4a41-aab5-e7f30af1acb0","resolution":{"observed_at":"2026-05-14T23:09:36.694498Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Larkin, M","venue":null,"work_id":"f8f12c39-9422-4965-b866-1bcb893a25a8","year":2022},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:c0ed655f6a5a09b9964213c3d70eaefa76a1e7021892974e46d49ebc360c98ed","observation_id":"734a729a-ee35-4514-88fa-41e4fc773a32","resolution":{"observed_at":"2026-05-14T23:09:36.699374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.cam.2021","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fern´ andez-Pend´ as, E","venue":null,"work_id":"3f822c54-c210-4541-af15-c77bfadcf377","year":2022},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:9b5faeba84befbb8e4ae1f79b20e603e7176de0d283938960ed787a3be6baaab","observation_id":"3d6321ff-761b-4d78-aacc-8faf1c7099a6","resolution":{"observed_at":"2026-05-14T21:58:02.724385Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1023/a:","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T10:17:00.972327Z","title":"Cluster Computing 6(3), 215–226 (Jul 2003), https://doi.org/10.1023/A: 1023588520138","venue":null,"work_id":"d8ce5cfc-20e8-456f-a19a-0b8698da903f","year":2001},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:8c7c7a29974ea79f5e6a7673525853d67692b8ed4196fedd4d284ce6e6bf8208","observation_id":"2cf89716-3de6-4170-888e-5ad729628b76","resolution":{"observed_at":"2026-05-14T21:58:02.729275Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Tibaldi, D","venue":null,"work_id":"8dc2b8d1-7f93-42e8-b502-c5db63a59b3b","year":2023},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:2c2d57a13d45b2a631394d63f69773da2db1243dcc366a08ca4e26d6bee9487c","observation_id":"4377bbba-428d-476c-af7d-ad0b8cff4744","resolution":{"observed_at":"2026-05-14T23:09:36.726242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.22331/q-2020-08-31-314","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T05:41:41.258989Z","title":"Sweke, F","venue":null,"work_id":"e4e0f1d2-8e6a-4f3c-81f3-7934da2434f4","year":2020},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:7f1274224be3d72e4570be1950724bcab54757460f19560bf29d2fa307fe444a","observation_id":"28ec9ab5-19d5-488a-83a9-30284079d52f","resolution":{"observed_at":"2026-05-14T21:58:02.733676Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.10434","last_updated":"2021-08-23T22:29:44Z","snapshot_observed_at":"2026-07-06T11:40:53.154397Z","submitted_at":"2021-08-23T22:29:44Z","title":"Adaptive shot allocation for fast convergence in variational quantum algorithms","version":1},"cited_work":{"arxiv_id":"2108.10434","doi":"10.48550/arxiv.2108.10434","metadata_source":"arxiv_reference","pith_arxiv_id":"2108.10434","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Adaptive shot allocation for fast convergence in variational quantum algorithms","venue":null,"work_id":"49120cc3-00c5-4442-9942-a20ba757d55f","year":2021},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"cited_paper":"/paper/2108.10434","citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:a977542f8600890a652db0e11524a8cec92b1a2ee0ad1302ed0d1ccec1ecc6b8","observation_id":"a973adfe-5752-431d-8db8-43016b7dd913","resolution":{"observed_at":"2026-05-14T21:58:03.802348Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.17248","last_updated":"2024-07-10T12:53:46Z","snapshot_observed_at":"2026-07-06T18:36:30.295995Z","submitted_at":"2024-06-25T03:28:40Z","title":"MindSpore Quantum: A User-Friendly, High-Performance, and AI-Compatible Quantum Computing Framework","version":3},"cited_work":{"arxiv_id":"2406.17248","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.17248","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Xuet al., Mindspore quantum: A user-friendly, high- performance, and ai-compatible quantum computing frame- work (2024), arXiv:2406.17248[quant-ph]","venue":null,"work_id":"1cc02e4c-b517-4e09-8475-a4ebcf2ef2b2","year":2024},"citing_paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-14T21:53:32.228752Z"},"links":{"cited_paper":"/paper/2406.17248","citing_paper":"/paper/2603.28413"},"observation_digest":"sha256:3e390ee55582e5fe64302ec040f4e456f0c309fd7c10ce08f7b3514d6f385e2b","observation_id":"bf69120b-5c6c-499f-bd00-c5a2e080db87","resolution":{"observed_at":"2026-05-14T21:58:03.808706Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2603.28413","last_updated":"2026-04-08T15:16:26Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T22:51:05.074191Z","submitted_at":"2026-03-30T13:22:25Z","title":"Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":5,"verified_fuzzy":6},"total_outbound_references":15},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2603.28413."}