{"as_of":"2026-08-19T16:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3d4388af8f90a0c719201269fdd8cc59611ff25dbffdc96f1e0779587d620233","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:13:03.933928Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T23:29:01.446024Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T09:16:49.184051Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"cited_work":{"arxiv_id":"2504.16350","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16350","snapshot_observed_at":"2026-07-02T09:16:49.184051Z","title":"Qaoa-gpt: Efficient generation of adaptive and regular quantum approximate optimization algorithm circuits","venue":null,"work_id":"0b69c907-c508-46c1-862b-969b750c0211","year":2025},"citing_paper":{"arxiv_id":"2504.04021","last_updated":"2025-07-26T18:46:30Z","snapshot_observed_at":"2026-08-06T12:49:44.099157Z","submitted_at":"2025-04-05T02:05:45Z","title":"Direct entanglement ansatz learning (DEAL) with ZNE on error-prone superconducting qubits","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-22T21:44:29.434178Z"},"links":{"cited_paper":"/paper/2504.16350","citing_paper":"/paper/2504.04021"},"observation_digest":"sha256:e841677b1c02e21505589222135ad544e8baee3fd7f6d0851329c40201087541","observation_id":"9b61955e-09c4-450d-b491-a40dedb860bd","resolution":{"observed_at":"2026-05-22T21:45:12.388926Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"cited_work":{"arxiv_id":"2504.16350","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16350","snapshot_observed_at":"2026-07-02T09:16:49.184051Z","title":"Qaoa-gpt: Efficient generation of adaptive and regular quantum approximate optimization algorithm circuits","venue":null,"work_id":"0b69c907-c508-46c1-862b-969b750c0211","year":2025},"citing_paper":{"arxiv_id":"2509.08351","last_updated":"2026-05-10T16:10:11Z","snapshot_observed_at":"2026-08-14T06:48:56.924094Z","submitted_at":"2025-09-10T07:41:55Z","title":"Generative quantum eigensolver with constrained circuit-cutting overhead","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-18T18:30:59.240631Z"},"links":{"cited_paper":"/paper/2504.16350","citing_paper":"/paper/2509.08351"},"observation_digest":"sha256:2a59c3236ed711e85132c5029aad322b3e840dc12ff4510e5d725e0a9db60a48","observation_id":"5fa5fc71-8757-41fc-b05e-0c9e813ede01","resolution":{"observed_at":"2026-05-18T18:31:44.081603Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"cited_work":{"arxiv_id":"2504.16350","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16350","snapshot_observed_at":"2026-07-02T09:16:49.184051Z","title":"Qaoa-gpt: Efficient generation of adaptive and regular quantum approximate optimization algorithm circuits","venue":null,"work_id":"0b69c907-c508-46c1-862b-969b750c0211","year":2025},"citing_paper":{"arxiv_id":"2605.17145","last_updated":"2026-05-16T20:30:30Z","snapshot_observed_at":"2026-08-15T04:48:03.463565Z","submitted_at":"2026-05-16T20:30:30Z","title":"Scaling Quantum Optimization for Unit Commitment via Pauli Correlation Encoding","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-20T14:39:52.782803Z"},"links":{"cited_paper":"/paper/2504.16350","citing_paper":"/paper/2605.17145"},"observation_digest":"sha256:7ea0b3283029ac1f22f4a2db43d61aee5963123dd5388c07eaa22e8023a727e0","observation_id":"4d958d2a-3249-4420-865c-e42a1f60c4a0","resolution":{"observed_at":"2026-05-20T14:43:22.605273Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"cited_work":{"arxiv_id":"2504.16350","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16350","snapshot_observed_at":"2026-07-02T09:16:49.184051Z","title":"Qaoa-gpt: Efficient generation of adaptive and regular quantum approximate optimization algorithm circuits","venue":null,"work_id":"0b69c907-c508-46c1-862b-969b750c0211","year":2025},"citing_paper":{"arxiv_id":"2606.05311","last_updated":"2026-06-03T18:02:26Z","snapshot_observed_at":"2026-08-17T10:13:52.019985Z","submitted_at":"2026-06-03T18:02:26Z","title":"Setting angles in quantum approximate optimization at utility-scale","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-06-28T05:36:16.703269Z"},"links":{"cited_paper":"/paper/2504.16350","citing_paper":"/paper/2606.05311"},"observation_digest":"sha256:eec088ef6556bca896193c606ff15903f8232d70526d1b9a10e79a808d2eb59e","observation_id":"f9cd5387-de1b-4347-86cf-3c4e120f891a","resolution":{"observed_at":"2026-07-02T09:16:49.185573Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.16350","snapshot_observed_at":"2026-08-01T23:29:01.446024Z","title":"URL https://arxiv.org/abs/2504","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.15426","last_updated":"2026-07-16T19:57:17Z","snapshot_observed_at":"2026-08-17T04:56:12.627902Z","submitted_at":"2026-07-16T19:57:17Z","title":"Performance Model for Hybrid Quantum-Classical Workflows","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T23:29:01.446024Z"},"links":{"cited_paper":"/paper/2504.16350","citing_paper":"/paper/2607.15426"},"observation_digest":"sha256:7a9de91b28411a9376009ace3d6779c1eb0d5371d1d40a3268420376a943b0fd","observation_id":"3b5f64cd-1e67-4d22-8686-0f01e4ffdaff","resolution":{"observed_at":"2026-08-01T23:29:01.446024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.16350","snapshot_observed_at":"2026-08-01T04:45:21.563369Z","title":"https://arxiv.org/abs/2504.16350","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22468","last_updated":"2026-07-24T16:32:40Z","snapshot_observed_at":"2026-08-16T18:57:36.816165Z","submitted_at":"2026-07-24T16:32:40Z","title":"Learning to Prepare Molecular Ground States with Transformer Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T04:45:21.563369Z"},"links":{"cited_paper":"/paper/2504.16350","citing_paper":"/paper/2607.22468"},"observation_digest":"sha256:5770b0e9d8fda1d6cfb815ce5c6960ebe47839f31a36ec82facf344ade85406d","observation_id":"2107182b-e145-4a7d-9138-3cb86cf6434f","resolution":{"observed_at":"2026-08-01T04:45:21.563369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.16350/citation-record","integrity":"/paper/2504.16350/integrity","json":"/paper/2504.16350/citation-record.json","paper":"/paper/2504.16350"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:13:04.422276Z","title":"Quantum computing for finance","venue":null,"work_id":"5b8a3c6a-5324-4bab-a3a5-b0bf67d55077","year":2023},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.799794Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:14b1602e54c41a4297bb51f7595c82ca0e780ade8e53c68ac9b0943ee07201b1","observation_id":"0b261d2a-32f5-40a3-aae2-e94701552d34","resolution":{"observed_at":"2026-08-16T11:13:04.426396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.409816Z","title":"Quantum chemistry in the age of quantum computing","venue":null,"work_id":"0fe53d8e-70ab-4f9e-8b2a-55424b11d286","year":2019},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.804587Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:643e728406dc56c9859b705d3694b343c15956d2940044f8be5f0b54e36c94d3","observation_id":"16b6117b-2079-4f68-b916-ad8a85367c38","resolution":{"observed_at":"2026-08-16T11:13:04.414131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.398149Z","title":"Quantum-centric supercomputing for materials science: A perspective on challenges and future directions","venue":null,"work_id":"d765dace-431a-4751-a553-7001753df016","year":2024},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.808064Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:dbea071ef387ed88764a941fda40a944d558757ea114a3fc0ea602eb342c3bbc","observation_id":"045562a7-943c-4791-a9d7-89b318039918","resolution":{"observed_at":"2026-08-16T11:13:04.402090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.385891Z","title":null,"venue":null,"work_id":"40bde558-abba-4a68-a3e8-533fa5a01ca8","year":2019},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.811729Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:d71a877ccca843df0987b0cb64dabc5aa456265daeb35c58ea96b0df42c15741","observation_id":"0603792e-6f03-4256-bdcf-1b0588cd4c50","resolution":{"observed_at":"2026-08-16T11:13:04.390090Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:03.815631Z","title":"Quantum machine learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.815631Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:1b9a665873bf3de56745822ee94b113b013767f1602ce65546d5f48102d8aa7f","observation_id":"d5332dda-9905-49fb-94b9-7a00831787de","resolution":{"observed_at":"2026-08-16T11:13:03.815631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-08-16T20:17:55.570300Z","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-16T11:13:03.819149Z","title":"A quantum approximate optimization algorithm","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.819149Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:a8d0015764b11bcd403921742f86b91d8bf60701e08913bb21cef2736e2a746b","observation_id":"18c144b9-963a-4be4-9fd1-2edc260fc733","resolution":{"observed_at":"2026-08-16T11:13:03.819149Z","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-16T11:13:04.367085Z","title":"A review on quantum approximate optimization algorithm and its variants","venue":null,"work_id":"c3cf06e1-e7ee-469d-a438-8f03c800cfb8","year":2024},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.823451Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:bcdf68c7ec779227c61a2be2c22e7c25e3413eb52f671d7b22b37fe0def2dccb","observation_id":"db58f651-0d36-43e1-b716-6588888d9c04","resolution":{"observed_at":"2026-08-16T11:13:04.370351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.354757Z","title":"Adaptive quantum approximate optimization algorithm for solving combinato- rial problems on a quantum computer","venue":null,"work_id":"76468489-8570-4333-9697-70b8d55c1779","year":2022},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.826799Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:bece32c16b4ca0a618668992fdd7a721d3541b2582b8c24ad26d138c33daa18e","observation_id":"1e92e87e-8da4-4bba-8880-41c1dace54bf","resolution":{"observed_at":"2026-08-16T11:13:04.358588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.343280Z","title":"An adaptive variational algorithm for exact molecular simula- tions on a quantum computer","venue":null,"work_id":"c5c419ba-2f77-43c6-a55f-d4a9dd1b6ec4","year":2019},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.830063Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:4832680a73f4e75b7eda4b3b150b48d3162571abb9fef80e090f69d5567e5fb1","observation_id":"bed5a84f-7a46-4774-afc6-fcfd44525e01","resolution":{"observed_at":"2026-08-16T11:13:04.347219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.330743Z","title":"Layer VQE: A variational approach for combinatorial optimization on noisy quantum computers","venue":null,"work_id":"b93e05b6-8166-42d9-a11a-50d56ca6dd43","year":2022},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.834107Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:07e7d8f5db0eee408b2907c045f6f5fafc63c49c9a3eb15c52e60a7179a9c954","observation_id":"c3d6b4d7-120d-491f-bd0f-5ece5fab8d6d","resolution":{"observed_at":"2026-08-16T11:13:04.334983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.00135","last_updated":"2025-02-14T04:00:08Z","snapshot_observed_at":"2026-08-17T20:35:42.130966Z","submitted_at":"2024-12-30T20:23:10Z","title":"GroverGPT: A Large Language Model with 8 Billion Parameters for Quantum Searching","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.00135","snapshot_observed_at":"2026-08-16T11:13:03.838062Z","title":"Grovergpt: A large language model with 8 billion parameters for quantum searching","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.838062Z"},"links":{"cited_paper":"/paper/2501.00135","citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:c6316761b9f8a9e04113f9029740482859b37d6d38eb9bae215a7bc4b4cfef82","observation_id":"ccffcd30-9e0c-49f1-9d9d-57095e03d320","resolution":{"observed_at":"2026-08-16T11:13:03.838062Z","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-16T11:13:03.842224Z","title":"The generative quantum eigensolver (gqe) and its application for ground state search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.842224Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:ab8a1a993549399e8e71967afdb73a5ebb56ee9e1715fa676831c8e08590a41b","observation_id":"063f243c-2a8d-4c55-983d-44d1a8dbd756","resolution":{"observed_at":"2026-08-16T11:13:03.842224Z","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-16T11:13:04.316890Z","title":"cuquantum sdk: A high-performance library for accelerating quantum science","venue":null,"work_id":"68d3404a-b248-4f77-9a85-be080b49beb5","year":2023},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.845942Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:76e0dfd8e0277df367d97d04ec4ca15fe6f5463afe39a52693f0e33d037fcb2e","observation_id":"42d239de-ca9e-4287-bee9-612f5e61e9d1","resolution":{"observed_at":"2026-08-16T11:13:04.321854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.304995Z","title":"NVIDIA CUDA-Q framework","venue":null,"work_id":"dbb85c4f-8cd8-481d-a758-7e802831745e","year":null},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.849505Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:64be098e47cc7288c750f23110b5ff26ffca6cbb08562722710e8b0d5712880f","observation_id":"f57efdb1-de23-4e3b-9b12-f60ed5f2b12d","resolution":{"observed_at":"2026-08-16T11:13:04.308973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:03.853519Z","title":"Some simplified np-complete problems","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.853519Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:2854428278063ccb27fdec2093beeec9bf4e7728986da1a85d780e062123c346","observation_id":"a47e6e9f-243a-4243-b488-04cf7a4b19e6","resolution":{"observed_at":"2026-08-16T11:13:03.853519Z","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-16T11:13:04.285056Z","title":"Quantum bridge analytics i: a tutorial on formulating and using qubo models","venue":null,"work_id":"7bf52f35-c9a0-4c73-a0eb-ebfcbcb136e1","year":2022},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.857324Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:81f2f84ae04b56769ee4e27b6d3171172978bb27c8c5274d0cf34c7fd5707cfd","observation_id":"63131c22-0f59-4e8f-869c-1c3548665a57","resolution":{"observed_at":"2026-08-16T11:13:04.289287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.11538","last_updated":"2019-11-04T20:50:57Z","snapshot_observed_at":"2026-08-14T17:59:50.407484Z","submitted_at":"2018-11-13T18:38:34Z","title":"A Tutorial on Formulating and Using QUBO Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.11538","snapshot_observed_at":"2026-08-16T11:13:03.860889Z","title":"A tutorial on formulating qubo models","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.860889Z"},"links":{"cited_paper":"/paper/1811.11538","citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:f44e6bb91da32e64c51806c5c9b01ed21a716065887e51160d7533055e8a3349","observation_id":"af09478f-b374-42c2-8e70-11578e987f67","resolution":{"observed_at":"2026-08-16T11:13:03.860889Z","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-16T11:13:04.273589Z","title":"Multilevel combi- natorial optimization across quantum architectures","venue":null,"work_id":"b182f7a0-a69b-461d-b87c-50b6030a1722","year":2021},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.865047Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:f7a6b715a4761eea22a70fa74c147f93f3467e45617b2b344d14ce48c9aa26ea","observation_id":"a35620c0-0dfd-472c-a51f-a54da417e0a6","resolution":{"observed_at":"2026-08-16T11:13:04.277479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.262502Z","title":"Hybrid quantum-classical algorithms for approximate graph coloring","venue":null,"work_id":"f85f91d0-10ab-4a7c-9861-b5ca3ea5480d","year":2022},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.868760Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:75fce72b416bea775a9cbf6fb76aed43cecb9f5dd1e0ed48fcfba9fc04b940cb","observation_id":"da862a08-f4bf-4f2e-8e4c-c3f87d3341b8","resolution":{"observed_at":"2026-08-16T11:13:04.266143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07211","last_updated":"2024-05-12T08:22:41Z","snapshot_observed_at":"2026-08-19T14:51:20.598157Z","submitted_at":"2024-05-12T08:22:41Z","title":"Equivariant QAOA and the Duel of the Mixers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.07211","snapshot_observed_at":"2026-08-16T11:13:03.872572Z","title":"Equivariant qaoa and the duel of the mixers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.872572Z"},"links":{"cited_paper":"/paper/2405.07211","citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:f27a042128e9f9b2b9915ef5426afe342effcb98d5da3f936d4b9e38eded2ddb","observation_id":"9412cbf4-298e-47d6-87a0-b7fb7799c51b","resolution":{"observed_at":"2026-08-16T11:13:03.872572Z","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-16T11:13:03.877100Z","title":"Improving language understanding by generative pre-training","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.877100Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:d2d764dcf1385cf8a8721d4b6c0d461f320c16ab0ca12e4fd9416ccd8e78e98c","observation_id":"776e92be-dad6-4426-b5af-89d1b515b12a","resolution":{"observed_at":"2026-08-16T11:13:03.877100Z","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-16T11:13:03.881557Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.881557Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:d5fa6e7d77ce9aaffba32a320d3c6f5ad4e9e4d89a01ee391756a17aeaf4a0b8","observation_id":"067c5310-580c-4f3c-9e85-8816ddf52f11","resolution":{"observed_at":"2026-08-16T11:13:03.881557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-16T11:13:03.886248Z","title":"Evaluating large language models trained on code","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.886248Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:9a5fb7ea28b175833c0505d3dc3596f68e5a15e506cbe0068d44ac6f93ddffd6","observation_id":"c893c673-a4f3-4e32-8c41-01cfded45b4f","resolution":{"observed_at":"2026-08-16T11:13:03.886248Z","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-16T11:13:04.235826Z","title":"Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models","venue":null,"work_id":"b443495e-3c6c-4d53-8671-d5e4adb611af","year":2020},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.890132Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:f1147310cd8567bbf34a852d2f88781a18e8208db20a40428eadf1e0efbb8d92","observation_id":"c4a9c37c-43b1-47fa-8b72-fd5609f6e41a","resolution":{"observed_at":"2026-08-16T11:13:04.240278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.222188Z","title":"Rank-two relaxation heuristics for max-cut and other binary quadratic programs","venue":null,"work_id":"fc041791-5576-424e-a2b1-b16c22fc3cfc","year":2001},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.894149Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:e9f8298e12305c9a541620cf5623c5098a34b44fe31fd077702597b610878a88","observation_id":"b4cc8d2a-9d69-4964-a6ca-7ca8b32806ca","resolution":{"observed_at":"2026-08-16T11:13:04.226078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.211063Z","title":"Classi- cal symmetries and the quantum approximate optimization algorithm","venue":null,"work_id":"cda72fd7-0140-41a7-a1e3-157968ffe971","year":2021},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.897750Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:5841f2db8e40b082520951a56e7a5be710c5f22d5d340ee891f249c214aeb28a","observation_id":"8aaba245-d467-4f5b-b536-fd26c388add5","resolution":{"observed_at":"2026-08-16T11:13:04.214622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.199379Z","title":"Graph repre- sentation learning for parameter transferability in quantum approximate optimization algorithm","venue":null,"work_id":"c286b94f-309d-4cf3-a7ca-f04379715774","year":2024},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.901616Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:d9ed14b7b4a51f3dadb707842280cbecfed805cba0b7c185841200e202c33180","observation_id":"39243a9f-ca49-4b0b-bf92-d8f61ce3095e","resolution":{"observed_at":"2026-08-16T11:13:04.203254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.186313Z","title":"Similarity-based parameter transferability in the quantum approximate optimization algorithm","venue":null,"work_id":"52a50f50-8865-4425-81c6-66213aa39c53","year":2023},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.905595Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:f606fecd1b7f467581d9b25b2ce25b082b41f871ea304e3e5e2e1b54893462c9","observation_id":"78a62a3b-6183-4586-9f15-54af177af1fb","resolution":{"observed_at":"2026-08-16T11:13:04.191097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.172618Z","title":"Hagberg, D.A","venue":null,"work_id":"8ee2f20b-908c-45a8-9365-983e3a296cc1","year":2008},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.909752Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:4047d67be4a46f7fa7c0ac149d7130cd3fa292d883bbc28f220c0927ed26398f","observation_id":"cf877408-22c5-4db0-b59e-a9da5f288e66","resolution":{"observed_at":"2026-08-16T11:13:04.177015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16986","last_updated":"2025-01-28T14:35:46Z","snapshot_observed_at":"2026-08-16T12:58:35.936340Z","submitted_at":"2025-01-28T14:35:46Z","title":"Generative quantum combinatorial optimization by means of a novel conditional generative quantum eigensolver","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.16986","snapshot_observed_at":"2026-08-16T11:13:03.913692Z","title":"Generative quantum combinatorial optimization by means of a novel conditional generative quantum eigensolver","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.913692Z"},"links":{"cited_paper":"/paper/2501.16986","citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:9a8f3d366e2cf7a6e4ce7ba988dd78c35384f52e85292554c3e82cf23452b58b","observation_id":"26968ac8-a709-4f91-8ec1-a6fa1c5fc849","resolution":{"observed_at":"2026-08-16T11:13:03.913692Z","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-16T11:13:04.159327Z","title":"NVIDIA CUDA-Q","venue":null,"work_id":"2d194908-6d71-4d77-9d52-2c3bc13eaedf","year":2025},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.918153Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:9fb42c6613aae5a4975e81d9a6e1a7c95457f477f2fd3b03d77517abc361c733","observation_id":"3a1c896e-9797-46b9-a41c-943f98fde34b","resolution":{"observed_at":"2026-08-16T11:13:04.163183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.146939Z","title":"NVIDIA DGX Quantum","venue":null,"work_id":"b80a8b07-e494-48f6-b603-9501a3c971f8","year":2025},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.922397Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:c1180b12ba3888c7a1326eea04e7b569877770763ce9e9cc98e907c5475d180b","observation_id":"caba5070-0e04-413c-957b-0bad5e7befe9","resolution":{"observed_at":"2026-08-16T11:13:04.150709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.134098Z","title":"Mlqaoa: Graph learning ac- celerated hybrid quantum-classical multilevel qaoa","venue":null,"work_id":"461afb97-fc60-44bf-aa15-d1ad408ef1be","year":2024},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.925946Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:7a3b69edab19f75b9637e30e834ccb2fc5c86c750ee1b0b62044ae08dd6419db","observation_id":"75c9839f-d2b7-42ab-8467-6f0eb49e973f","resolution":{"observed_at":"2026-08-16T11:13:04.138154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T11:13:04.120393Z","title":"Scal- ing up the quantum divide and conquer algorithm for combinatorial optimization","venue":null,"work_id":"cdb7cad1-5d78-49df-aaec-ee1373d41b17","year":2024},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.930058Z"},"links":{"citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:6967ca3be1ce7829c174a812d6ea2c78a16b5c1a831f7a4463c80dbde14d9fb3","observation_id":"ae2ffcfe-9006-4c60-87e9-ce6ea20aa0e0","resolution":{"observed_at":"2026-08-16T11:13:04.125847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.00861","last_updated":"2024-05-01T20:49:50Z","snapshot_observed_at":"2026-08-16T13:56:10.736970Z","submitted_at":"2024-05-01T20:49:50Z","title":"Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.00861","snapshot_observed_at":"2026-08-16T11:13:03.933928Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.933928Z"},"links":{"cited_paper":"/paper/2405.00861","citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:f1e87aeb8ef0e24c1ababcae95ddb2e22185bfe43cf6c17c6040b4f71c89739c","observation_id":"e3286b1a-13d4-4059-9af4-c0bc0cb034b5","resolution":{"observed_at":"2026-08-16T11:13:03.933928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":35},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 6 inbound Pith citation observations for arXiv:2504.16350."}