{"as_of":"2026-08-09T23:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7fb48e4374d8032a9316941818da308790037fbaa1ae85faeaab1c61364c5a5a","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:27:19.155068Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2608.06212/citation-record","integrity":"/paper/2608.06212/integrity","json":"/paper/2608.06212/citation-record.json","paper":"/paper/2608.06212"},"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-07T12:27:22.361544Z","title":null,"venue":null,"work_id":"911095d9-08b3-4464-9d38-26a73cbcc342","year":2025},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:16.751281Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:59eb666e6e59bb8d0f1d9feb666ba4ef3c934b2af0d12ef4b98efabe79bdedf0","observation_id":"f57f7e38-da1f-46e1-85d6-cc01fae8e9bc","resolution":{"observed_at":"2026-08-07T12:27:22.469407Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:22.186473Z","title":"What works best when? a systematic evaluation of heuristics for max-cut and qubo.INFORMS Journal on Computing, 30(3):608–624, 2018","venue":null,"work_id":"12f2a2ea-293c-412a-8de9-5c8b412ed558","year":2018},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:16.859118Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:5d21dfbff535a1ed64b67cb1b7d10dd2c3946c104472ee332327936ad70ac6e4","observation_id":"e226f167-3158-45c1-8d0e-8cebf642cd93","resolution":{"observed_at":"2026-08-07T12:27:22.286981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:16.958992Z","title":"Quantum computing for finance.Nature Reviews Physics, 5(8):450–465, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:16.958992Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:06b8e0d166e8aa2890f7985bb15cbcf25cd74a80136f438c6486cb79f4dcae12","observation_id":"a2be26d7-5f0f-4207-a5f2-2bed1b2d74c7","resolution":{"observed_at":"2026-08-07T12:27:16.958992Z","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-07T12:27:21.992072Z","title":"Recent advances in graph partitioning.Algorithm engineering, pages 117–158, 2016","venue":null,"work_id":"ab1ef5c5-986f-4861-a6fa-591365e79614","year":2016},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.043807Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:14ed608e045e78583768cfc5cf9eafd8b465bc21685de259900515f46b4bbcd5","observation_id":"5d46147a-50e6-4ab9-b300-73c1bf324615","resolution":{"observed_at":"2026-08-07T12:27:22.060450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:17.136067Z","title":"Ising formulations of many np problems.Frontiers in physics, 2:74887, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.136067Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:77391f86d461ca2e17b2cc933e8081dbf8ca5802c3796453b0a3bf1cc6e373ba","observation_id":"d42e851d-e608-4e4e-9246-ba994c74b6e1","resolution":{"observed_at":"2026-08-07T12:27:17.136067Z","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-07T12:27:17.229681Z","title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefi- nite programming.Journal of the ACM (JACM), 42(6):1115–1145, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.229681Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:0ab8b69aeff6aacb8fa5d5743c6519616562af5c49234b3258338273b19d1c34","observation_id":"ea725e78-f345-4c00-b31c-12958f7c14d5","resolution":{"observed_at":"2026-08-07T12:27:17.229681Z","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-07T12:27:17.297232Z","title":"Optimal inapproximability results for max-cut and other 2-variable csps? SIAM Journal on Computing, 37(1):319–357, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.297232Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:832ba2505717f2640d9e4e1b1e52e4ac60d966ca63a13f141800b4380bacc0e1","observation_id":"f7bad385-42b5-4b1d-9e92-47259e09d25e","resolution":{"observed_at":"2026-08-07T12:27:17.297232Z","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-07T12:27:21.787037Z","title":"Rank-two relax- ation heuristics for max-cut and other binary quadratic programs.SIAM Journal on Optimization, 12(2):503–521, 2002","venue":null,"work_id":"1c0711d2-31c2-4bf7-bf16-ca43f4f51caf","year":2002},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.364785Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:da2aae90d3ab222d117499d04ee0693eb894643cbc2bba421d5e6c84c41bff95","observation_id":"6ae8580a-d71e-4545-a0f8-7c9dd8a04251","resolution":{"observed_at":"2026-08-07T12:27:21.878043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-07T12:27:17.436798Z","title":"A quantum approximate optimization algorithm.arXiv preprint arXiv:1411.4028, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.436798Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:04ea89b00f8cd2c3c2d8493e178f878aca353c4889ea55f6af039393e19514f7","observation_id":"653890b0-1250-48fb-9ba6-cf1ae4302fb1","resolution":{"observed_at":"2026-08-07T12:27:17.436798Z","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-07T12:27:17.503132Z","title":"Toward a linear-ramp qaoa protocol: evidence of a scaling advantage in solving some combinatorial optimization problems.npj Quantum Information, 11(1):131, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.503132Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:d224a5a8b320beabc38bc632ed1f311fa60a8d0f06f85117582672c0f06a58c5","observation_id":"47085f33-eaee-4d92-935c-52587a32bf9e","resolution":{"observed_at":"2026-08-07T12:27:17.503132Z","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-07T12:27:17.581654Z","title":"Mlqaoa: Graph learning ac- celerated hybrid quantum-classical multilevel qaoa","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.581654Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:77da4311db8da3abfd00fb9b827809ec35345547e460dc00ef0604579972bf6c","observation_id":"f02c2470-ffcc-454c-89d2-993c454175f7","resolution":{"observed_at":"2026-08-07T12:27:17.581654Z","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-07T12:27:21.608112Z","title":"Solving large-scale qubo with transferred parameters from multilevel qaoa of low depth","venue":null,"work_id":"5e0b8cb2-5b0b-48f6-bfdb-e286cee3d605","year":null},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.660263Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:17f0d9f5ad694f2d44013b3ff1cb138ba7badc5f73cf4bb6ff69eaf2eea1d025","observation_id":"199699ec-6097-41e2-a5fb-ba133bf13b1b","resolution":{"observed_at":"2026-08-07T12:27:21.683410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:17.738727Z","title":"Multilevel combi- natorial optimization across quantum architectures.ACM Transactions on Quantum Computing, 2(1):1–29, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.738727Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:4e8e05aa862946d9fb2b228578a1b1b1a38aa936d98976a4aa3c7efc92b64df4","observation_id":"10980629-46fe-4632-9961-3c08e217f68c","resolution":{"observed_at":"2026-08-07T12:27:17.738727Z","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-07T12:27:21.331638Z","title":"Local classical max-cut algorithm outperformsp= 2 qaoa on high-girth regular graphs.Quantum, 5:437, 2021","venue":null,"work_id":"8fa1f617-8b91-42c2-ae4f-a734f2fe6650","year":2021},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.805150Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:45c26a17f2cd52dbc61d19c73babadf611a30e0a189b0f32d51033e5bb2e56e1","observation_id":"ba71e7e7-9f0d-47c3-bb18-084c1aca9501","resolution":{"observed_at":"2026-08-07T12:27:21.469821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:21.098810Z","title":"Maxcut quantum approximate opti- mization algorithm performance guarantees for p¿ 1.Physical Review A, 103(4):042612, 2021","venue":null,"work_id":"02b676a8-c33a-4603-9833-072dbb0a57a2","year":2021},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.870686Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:19f28a14088fd6c680f39c220f94cd559ecf4b3facf4bf2faca11a120fab118a","observation_id":"1b7f921b-3330-4562-bcec-560077d2db42","resolution":{"observed_at":"2026-08-07T12:27:21.220025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:21.007576Z","title":"Quantum approximate optimization algorithm for maxcut: A fermionic view.Physical Review A, 97(2):022304, 2018","venue":null,"work_id":"8cf0f0d4-fdf4-4b98-99ad-33fc73287986","year":2018},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:17.960984Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:9819fae0ead40915196d143e0e8fd8b80a86c188581cc7d45a94393e07f8e8ed","observation_id":"04058f09-8b49-4545-9dff-15feb785ef36","resolution":{"observed_at":"2026-08-07T12:27:21.011799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:20.848119Z","title":"Expectation values from the single-layer quantum approximate optimization algorithm on ising problems.Quantum Science and Technology, 7(4):045036, 2022","venue":null,"work_id":"4782ddb5-ed16-481d-8869-af1c7239f293","year":2022},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.032401Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:3bc6cdd7d77964a9298f67cd2bcc61097188d5fcebd6d0c6a92a64b775966b64","observation_id":"48088be4-cbc5-4c0d-a339-01f331640be1","resolution":{"observed_at":"2026-08-07T12:27:20.936824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:20.672780Z","title":"Warm-starting quantum optimization.Quantum, 5:479, 2021","venue":null,"work_id":"e9e1e9e0-890c-4163-ae67-be9a551c7d19","year":2021},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.097344Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:328620a4da9bde3ba79e14b9d56872abce3a9b6e54aa7b621be3ed467062b7dc","observation_id":"dca4b0ec-8c5f-4e88-aa4f-fdc0811cef6d","resolution":{"observed_at":"2026-08-07T12:27:20.755864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:18.186915Z","title":"Bridging classical and quantum with sdp initialized warm-starts for qaoa.ACM Transactions on Quantum Computing, 4(2):1–39, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.186915Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:7b710ec82553491c53c3ab3e77063a95adc0196ed9b30a92ab35351d39e48482","observation_id":"55f3e739-26f5-4866-a1de-9c702a817fb9","resolution":{"observed_at":"2026-08-07T12:27:18.186915Z","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-07T12:27:20.497613Z","title":"Beinit: Avoiding barren plateaus in variational quantum algorithms","venue":null,"work_id":"680f60d5-1f3a-4c21-882a-ae7b8425ae9a","year":2022},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.254211Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:c683cb6180aeac45d17f6eb0020b617e705d25aa1f8d4c0ea5478c64364ef4ad","observation_id":"df213ff9-0ee1-4623-a02d-a5aacedfecc4","resolution":{"observed_at":"2026-08-07T12:27:20.589726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:20.333646Z","title":"Optimization via quantum preconditioning.Physical Review Applied, 24(4):044013, 2025","venue":null,"work_id":"0637f5df-8ca0-48d9-a782-4489a0c7b5f9","year":2025},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.331986Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:e9db31b58c805983ffb1b3c476c804def04259b8544b0b354d1ecaf16590b616","observation_id":"e20fa565-73ce-44e1-8391-b5602da7aa1c","resolution":{"observed_at":"2026-08-07T12:27:20.405190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.13607","last_updated":"2024-03-11T01:57:44Z","snapshot_observed_at":"2026-07-06T16:10:34.951414Z","submitted_at":"2023-08-25T18:02:06Z","title":"Quantum-Informed Recursive Optimization Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.13607","snapshot_observed_at":"2026-08-07T12:27:18.404296Z","title":"Quantum-informed recursive optimization algorithms.arXiv preprint arXiv:2308.13607, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.404296Z"},"links":{"cited_paper":"/paper/2308.13607","citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:7ee7f889ff50786b3b1e21f2d8e38f625922b49b353412845c1c973454b5a9cb","observation_id":"420db275-3a04-4168-a352-61dbd0921ffc","resolution":{"observed_at":"2026-08-07T12:27:18.404296Z","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-07T12:27:20.217795Z","title":"Obstacles to variational quantum optimization from symmetry protec- tion.Physical review letters, 125(26):260505, 2020","venue":null,"work_id":"1714d90d-c983-44cc-b388-d6fd5b1ab98e","year":2020},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.496309Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:3efb537d2c225f2c67d8c0094c2c1041041043a3035341f5ccdb26240de022c6","observation_id":"bfb9e675-c63e-4f04-8afd-05edb1a24acb","resolution":{"observed_at":"2026-08-07T12:27:20.271841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.16309","last_updated":"2025-08-22T11:36:19Z","snapshot_observed_at":"2026-08-09T21:56:31.497071Z","submitted_at":"2025-08-22T11:36:19Z","title":"Quantum-Enhanced Optimization by Warm Starts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.16309","snapshot_observed_at":"2026-08-07T12:27:18.588941Z","title":"Quantum-enhanced optimization by warm starts.arXiv preprint arXiv:2508.16309, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.588941Z"},"links":{"cited_paper":"/paper/2508.16309","citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:417a3365a25800aea6ec7e02e3c4af68bcb9dc736b05cb61dc7406275e8dcee1","observation_id":"1410773e-c27d-42b1-9c63-8aae7ccc9fc5","resolution":{"observed_at":"2026-08-07T12:27:18.588941Z","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-07T12:27:20.078588Z","title":"Some simplified np-complete problems","venue":null,"work_id":"c82f9fe3-3232-4500-a7ce-90d2521c3aa0","year":1974},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.680316Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:14d68c111256d823aa5125a7b9a2cda2c4b162402b567d8777045024959129bf","observation_id":"24611ca0-c11a-48a3-8d8a-0f08336bc959","resolution":{"observed_at":"2026-08-07T12:27:20.156915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:19.942730Z","title":"The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds.Annals of Operations Research, 33(3):151–180, 1991","venue":null,"work_id":"799a1c7d-ff51-42e5-9818-812172d42777","year":1991},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.777823Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:c836aa5d1661f6b318d63d2b6cafae500033f41ced660c3f5f9c07fc15a9bfcb","observation_id":"2571d5f2-9e4a-49f1-ae87-6172ccaa4039","resolution":{"observed_at":"2026-08-07T12:27:20.017922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:19.808637Z","title":"An application of combinatorial optimization to statistical physics and circuit layout design.Operations Research, 36(3):493–513, 1988","venue":null,"work_id":"a49d755a-8de9-4134-a138-b8cc6a4d2c0b","year":1988},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.848411Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:562840b462c9bf48b8d7ed21ef5db8caf071e0cbd47c712ae61a02d17577fc7a","observation_id":"5ec33ddd-6689-465e-9fe5-c45eac80f7e9","resolution":{"observed_at":"2026-08-07T12:27:19.869057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:19.685846Z","title":"Quantum combinatorial optimization in the nisq era: A systematic mapping study.ACM Computing Surveys, 56(3):1–36, 2023","venue":null,"work_id":"55cbdf27-dfb8-4d7e-84ae-4968331c8793","year":2023},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.905792Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:9ada24d1246f01e7680d9d5246cba974e4e1d5e47cd293fb0c561b4f18abd39b","observation_id":"0910e7eb-e0ca-4156-8a17-d7ace9c953f1","resolution":{"observed_at":"2026-08-07T12:27:19.752488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:19.516065Z","title":"Extending relax-and-round combinatorial optimization solvers with quantum correlations.Physical Review A, 109(1):012429, 2024","venue":null,"work_id":"a08c49dc-2c63-4402-b256-c287e732d1cc","year":2024},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:18.962100Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:8ae50545ed9647b0c65dc2e79ea8d61e3ed58960fc0ffac0a2f90b351e05f189","observation_id":"7ac97352-5d73-4868-81ab-073df185c9e1","resolution":{"observed_at":"2026-08-07T12:27:19.585241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:19.401893Z","title":"Iterative quantum algorithms for maximum independent set.Physical Review A, 110(5):052435, 2024","venue":null,"work_id":"f32cda3a-3ba5-4aef-8fc4-87504568ce56","year":2024},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:19.007009Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:7da0af6fac5d40fd8f3af44c5abeaf694edefac9e3ead769b3f1720acfea8cbe","observation_id":"4b2e22d1-9764-4b3f-9c5f-2e1b71a6c990","resolution":{"observed_at":"2026-08-07T12:27:19.448321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T12:27:19.269445Z","title":"Tabu search: A tutorial.Interfaces, 20(4):74–94, 1990","venue":null,"work_id":"10b1d2d3-220e-4e3d-804e-eef9e8c1bc26","year":1990},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:19.070492Z"},"links":{"citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:9717f8a0f2b2778363815fc9894a7639d307f7b1297ea0857349432dd8de60b7","observation_id":"48fc304a-92da-499a-85e8-cf1aa14cdac6","resolution":{"observed_at":"2026-08-07T12:27:19.342189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-09T09:41:06.935948Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-07T12:27:19.155068Z","title":"Quantum supremacy through the quantum approximate optimization algorithm.arXiv preprint arXiv:1602.07674, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T12:27:19.155068Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2608.06212"},"observation_digest":"sha256:3085ccbb6f9da2c244352436f12e25c03d3c5aef21892bee6be9fb3decf335c6","observation_id":"092e40c6-b4f6-4aad-8027-351aba12b722","resolution":{"observed_at":"2026-08-07T12:27:19.155068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.06212","last_updated":"2026-08-06T16:04:14Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T23:13:07.257387Z","submitted_at":"2026-08-06T16:04:14Z","title":"Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":32},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2608.06212."}