{"as_of":"2026-08-22T03:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:245a9e66dcc05d65930c4a1810ab17442a87a34359487924f7bab66b3f9b5a3c","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:53:33.456592Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2509.00170/citation-record","integrity":"/paper/2509.00170/integrity","json":"/paper/2509.00170/citation-record.json","paper":"/paper/2509.00170"},"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-15T16:53:34.893773Z","title":null,"venue":null,"work_id":"99bfa769-6e10-46f1-aed1-95d107789500","year":null},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:32.761841Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:b38e4381296f638d502862eeab059aac47f748bc71f6794bd13031186076bbb4","observation_id":"fe7ed794-d59e-4650-ad3b-3eb1e60d6829","resolution":{"observed_at":"2026-08-15T16:53:34.931487Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.878943Z","title":"These operations interact through the identity: X† jσz iσz jXj =−σz iσz j","venue":null,"work_id":"3f56380e-6c82-4309-839e-dcc653fda0c9","year":null},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:32.859269Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:b9c369c339b3271954ef7415a16e2acf189544919220b5181ec767753f049f49","observation_id":"777c20b9-e5c0-44ae-8ed4-14c0a7afec9a","resolution":{"observed_at":"2026-08-15T16:53:34.883986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.864357Z","title":null,"venue":null,"work_id":"6d590783-88f7-4cb7-8b66-833715e69a59","year":null},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:32.865132Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:520ff4feaaac1ea1cb2d94f694a902bfba5b9f51a3fdd6894e3d6fbcbb205906","observation_id":"4fd87fc0-6523-4e0e-a4e9-04ac2aa1abf8","resolution":{"observed_at":"2026-08-15T16:53:34.869200Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.849621Z","title":null,"venue":null,"work_id":"5a0976ac-e13e-4b73-950c-ac97dab42134","year":null},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:32.870537Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:f67fe6d426839a483848e51049b1a8642b8de80092cab2aec63139478218c398","observation_id":"5c0d0947-19c6-402b-9e8c-55406caf5666","resolution":{"observed_at":"2026-08-15T16:53:34.854530Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.715466Z","title":"Then A =   1 −1 −1 1  ⊙ J =pp⊤⊙ J, for p = [1|S| − 1n−|S|]","venue":null,"work_id":"6ed4b6db-9d8e-4c69-9acc-4bd38bd7c0c6","year":null},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:32.917124Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:32e743a986912a4b2916589bcb5a450716bfb0804358909fac5dd474e700a327","observation_id":"aadf426d-69b8-4d8f-8d02-52d0dec2913e","resolution":{"observed_at":"2026-08-15T16:53:34.808238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.662463Z","title":null,"venue":null,"work_id":"b6b49233-ad94-4726-84dc-ea43d0ef705f","year":null},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:32.939742Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:728fa88e0c15ea2858013bc99fe31299841c8fc33d64e606c52fe5d86a7388ab","observation_id":"a2960e5b-7605-47b3-b75b-614e0d7b4f5c","resolution":{"observed_at":"2026-08-15T16:53:34.667329Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.647065Z","title":"Next, we characterize graphs with gc(G) = 2 and gc(G) = 3","venue":null,"work_id":"10877b7c-67c3-4822-945b-8e5fa2865c11","year":null},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:32.948067Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:bdd7cf8a60d41fb6f6a85590f42f0b73924852c155fb5cfd0c49ecb0698a3c13","observation_id":"c00d7f1b-9a2e-4ade-bc34-946dd68df788","resolution":{"observed_at":"2026-08-15T16:53:34.652477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.632836Z","title":"Since each perfect matching can be constructed using n 2 + 1 spin bicliques (one of which is Kn), the entire cycle can be constructed using n + 1 spin bicliques","venue":null,"work_id":"7d7a05d5-538e-4491-b83c-38aa667326dc","year":null},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:32.953404Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:deeb2969968f620ae3109cd6b50041c7c0b9e2d7f46bb4a426274fbfab703042","observation_id":"59c362f0-1ec8-4975-a8b2-2f2ffed42422","resolution":{"observed_at":"2026-08-15T16:53:34.637861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.541135Z","title":"Let G1 consist of edges e1,e 3,...,e n−2, G2 of e2,e 4,...,e n−1, and G3 of the single edge en","venue":null,"work_id":"7ed999c2-2d73-4e8e-993b-d7861028fb26","year":null},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:32.958665Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:00c70e1813187e1abf033479e327fcbdcb80a871b5ce20d4474972ebff934036","observation_id":"7425384a-9554-4a5b-9647-dcada8ac9edf","resolution":{"observed_at":"2026-08-15T16:53:34.622295Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.334222Z","title":"Quadratic reformulations of nonlinear binary optimization problems","venue":null,"work_id":"45984cc3-dd92-40a4-9e20-86b543b5ad75","year":2017},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:32.964492Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:cdf73106c7a98367747e37b811d6fc4cfa89c5a485ec17a2492329f31b85daa2","observation_id":"06de95c7-334f-4da0-a009-0b2654edd888","resolution":{"observed_at":"2026-08-15T16:53:34.439537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.320608Z","title":"Graph theory","venue":null,"work_id":"39feaa59-5d21-4440-b79f-707547196606","year":2008},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:32.973822Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:8d2513625701640c4b2a40821e7aaf63e080477751dd2c1feb3ed431a9025eaf","observation_id":"82f48438-ad97-42c4-bda0-3dbc696108fa","resolution":{"observed_at":"2026-08-15T16:53:34.325095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.306829Z","title":"Obstacles to variational quantum optimization from symmetry protection","venue":null,"work_id":"607ff01e-cf6c-4472-bcde-e7ac16738bd3","year":2020},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.023058Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:5aae0666ec79e4eca101c1f9e7c28ee58f743fe754644838b361ebbc7e4e5614","observation_id":"551a68d2-1cd8-4f64-b14a-2f9de906cf18","resolution":{"observed_at":"2026-08-15T16:53:34.311245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.291747Z","title":"Spectra of graphs","venue":null,"work_id":"c7e0011f-08e6-4dec-b6c7-757ad620575e","year":2011},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.048395Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:bdbc7520efac97184e4f5adc394755ac60b7deaa4c749aa4e7ba4ab9e047772e","observation_id":"3b11cc5a-1c9d-4249-ae90-2ba42ba8f074","resolution":{"observed_at":"2026-08-15T16:53:34.296946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.211997Z","title":"Solving clique partitioning problems: a comparison of models and commercial solvers","venue":null,"work_id":"58edf8dc-7eac-45da-bd5a-2198246d0122","year":2022},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.053415Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:491a14c2a2aed2a051a062ebd05e7b7824964ef387da330a414134cc5c1eac96","observation_id":"1d7c3dfe-1d8a-45ea-a34b-d0933cbd6008","resolution":{"observed_at":"2026-08-15T16:53:34.264586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.09002","last_updated":"2020-04-20T00:48:02Z","snapshot_observed_at":"2026-08-18T17:09:44.442058Z","submitted_at":"2020-04-20T00:48:02Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.09002","snapshot_observed_at":"2026-08-15T16:53:33.058344Z","title":"The quantum approximate optimization algorithm needs to see the whole graph: A typical case","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.058344Z"},"links":{"cited_paper":"/paper/2004.09002","citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:eb366cb7304df0a6bf07e2996902345894ca93008fab812392ae0cc1e575be41","observation_id":"f23da278-64c9-4963-af0f-c0ce4046ed88","resolution":{"observed_at":"2026-08-15T16:53:33.058344Z","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-15T16:53:33.066486Z","title":"A quantum approximate optimization algorithm","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.066486Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:d64311a403181b2d6a120b05820b08ee5088626de8dd26cf7b72164dd9d82a1c","observation_id":"39a988fd-993e-47b4-8bd7-1239c87ef01b","resolution":{"observed_at":"2026-08-15T16:53:33.066486Z","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-15T16:53:34.183200Z","title":"Quantum bridge analytics I: a tutorial on formulating and using qubo models","venue":null,"work_id":"1b675a7e-05ca-4e96-a670-f1d8a5ace6e2","year":2022},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.153804Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:b22af1cd9604e82250ea4cd050d23c62b8b0bf41e2457474ffc59e36c5678440","observation_id":"2757c9d5-289d-4d21-bfa5-00a91f46d373","resolution":{"observed_at":"2026-08-15T16:53:34.187911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.169026Z","title":"Rydberg-mediated entanglement in a two-dimensional neutral atom qubit array","venue":null,"work_id":"24b51980-2c86-4884-8bed-a74374cf5190","year":2019},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.180552Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:145e1fdbef9aafbe60d5320c7b63a5b5570dea85d5e012b0236d05769dbc12ce","observation_id":"58682cf5-a0dd-4fcb-ae97-022e8b922743","resolution":{"observed_at":"2026-08-15T16:53:34.173584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.154683Z","title":"Hadamard matrices and their applications","venue":null,"work_id":"efe946dc-5f40-4233-8962-5b949c1b3aab","year":1978},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.186120Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:5810bd63bc3230d4a246186fe749377c632bc6b20da85f2f0c260c3a25aba8ae","observation_id":"9c497769-5be8-4c50-96ce-226c5accf7b3","resolution":{"observed_at":"2026-08-15T16:53:34.159696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.130211Z","title":"Quantum computing with neutral atoms","venue":null,"work_id":"918382c1-b08e-4a7b-8f7a-9797bbd920ad","year":2020},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.191226Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:1df696685639960d9e69fc62138722b803d1b776c0d2b2b0fc252aac1c544a82","observation_id":"ac6e9caf-d13b-44a5-b683-d48b6da071e9","resolution":{"observed_at":"2026-08-15T16:53:34.144323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:33.229946Z","title":"Reducibility among combinatorial problems","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.229946Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:8df0f3dada22c02986956a1d4c0cefd79f2262b2fe21851df4f6b1302db1cbed","observation_id":"01f57688-b083-4e40-875c-af98e666779c","resolution":{"observed_at":"2026-08-15T16:53:33.229946Z","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-15T16:53:34.025797Z","title":"Practical guidelines for solving difficult mixed integer linear programs","venue":null,"work_id":"54ee3d60-a4c8-4b46-bdee-26f97d77b506","year":2013},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.259525Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:2cf0115a8604941f08d8d6d50f716305e0793c6c7f344aa06d105c157a1b7b53","observation_id":"165f6e56-ab91-4021-be5f-db511776d941","resolution":{"observed_at":"2026-08-15T16:53:34.075314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:34.011220Z","title":"A unified framework for modeling and solving combi- natorial optimization problems: A tutorial","venue":null,"work_id":"b607022a-a5fe-4ae5-b1bd-1f034d0050a4","year":2006},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.264375Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:7e12bcec7e585f22d9d9576aa6c57dfd5168c4fcf2ffc13b88686c9e626475f2","observation_id":"5830591a-8697-41bb-8c7a-b02bf4191a35","resolution":{"observed_at":"2026-08-15T16:53:34.015612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:33.996221Z","title":"High-fidelity control and entanglement of rydberg-atom qubits","venue":null,"work_id":"2f2e56e0-158f-4e48-94c8-e40a4626aa47","year":2018},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.268813Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:905274017fe9979e08b62c3e739a44ddef653ad1120f0d1248f9b1f9dbe86f86","observation_id":"3f57b1e9-82aa-4874-be11-68d041b1ce99","resolution":{"observed_at":"2026-08-15T16:53:34.001141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14330","last_updated":"2026-07-30T16:35:55Z","snapshot_observed_at":"2026-08-16T13:41:06.325964Z","submitted_at":"2024-06-20T14:00:09Z","title":"Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14330","snapshot_observed_at":"2026-08-15T16:53:33.272725Z","title":"Promise of graph sparsifica- tion and decomposition for noise reduction in QAOA: Analysis for trapped-ion compilations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.272725Z"},"links":{"cited_paper":"/paper/2406.14330","citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:8d8d3c486cbfc4fcbff37a26cbf3d7be02a802bb0bdadefa94aee4ff2c7c0abf","observation_id":"73ddbaa6-e410-402e-9129-273b165e1860","resolution":{"observed_at":"2026-08-15T16:53:33.272725Z","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-15T16:53:33.981384Z","title":"A quantum annealer with fully pro- grammable all-to-all coupling via floquet engineering","venue":null,"work_id":"125ebcc7-c1cc-4a15-be3e-b6042615a85d","year":2020},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.305724Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:92ef8ea8706d2ab82b4f698cd38fe7d5153f238eae94b64d0eef9a7b83ebe8c6","observation_id":"11bc6a30-08f2-475c-a326-d38bee46b93a","resolution":{"observed_at":"2026-08-15T16:53:33.986087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:33.920355Z","title":"The boolean quadric polytope: some characteristics, facets and relatives","venue":null,"work_id":"5329c55c-c2c4-4c85-97fc-f5a880e9a2ae","year":1989},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.359286Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:5d64cb4d49e68b1f25a2222aec693d1b01d4641fc2882719ecf4c4cc82896124","observation_id":"77cea187-79b8-44a2-a95a-fabc6ce94151","resolution":{"observed_at":"2026-08-15T16:53:33.950884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:33.904498Z","title":"Quantum approximate optimization of the long-range ising model with a trapped-ion quantum simulator","venue":null,"work_id":"b5e9dfe8-c78d-44d9-9f92-68fe5e2a853b","year":2020},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.429267Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:43f8c88042ed718d47a5d93279e7bfe61d93897bcac1f385e39d53874b88ba4a","observation_id":"fe6ddbd5-591c-46e6-97cf-ad1f8ae59d8b","resolution":{"observed_at":"2026-08-15T16:53:33.909484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:33.435087Z","title":"Quantum Computing in the NISQ era and beyond","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.435087Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:f4e9266f0cb2d515cd4de87edba1196fc7bd3d6b7eb30832300e278680f9dd3d","observation_id":"260cf1f7-d0f5-49d8-8065-7c570944ac48","resolution":{"observed_at":"2026-08-15T16:53:33.435087Z","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-15T16:53:33.879564Z","title":"Generat- ing target graph couplings for the quantum approximate optimization algorithm from native quantum hardware couplings","venue":null,"work_id":"cf9ab137-7965-45ee-af10-f1810338d06a","year":2022},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.440989Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:520bc1828e0852ff584b790b113f52bb8027be13727378885c05fc5389071f26","observation_id":"aceda605-e4a9-4789-bb88-7c99f322777f","resolution":{"observed_at":"2026-08-15T16:53:33.884555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:33.762115Z","title":"Introduction to Linear Algebra","venue":null,"work_id":"653e359c-6d8f-4dbb-a4ba-356adbf8d7c1","year":2023},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.446649Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:9b824386d2769cd690219ca8af9a589a57298bd5907d948d4602c0897f20e1d4","observation_id":"51658a1a-544a-4068-a8b7-01e5230c9080","resolution":{"observed_at":"2026-08-15T16:53:33.838229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:33.746732Z","title":"Experimental realization of shor’s quantum factoring algo- rithm using nuclear magnetic resonance","venue":null,"work_id":"4539bfe3-6c66-44c1-bb02-d8711a00a11b","year":2001},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.451767Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:0cb1677858cae967b25fbf800bf4c70d7d8f80ec9586be129e69a3140aa7fb83","observation_id":"2c92e8f5-8ae9-4f59-9801-f63fa8cde1e6","resolution":{"observed_at":"2026-08-15T16:53:33.751875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:53:33.652364Z","title":"Emulating many-body localization with a superconducting quantum processor","venue":null,"work_id":"184e6a9d-34b7-43bf-9344-2db9825a62bb","year":2018},"citing_paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T16:53:33.456592Z"},"links":{"citing_paper":"/paper/2509.00170"},"observation_digest":"sha256:71de336178e13e865f474943003aac04773a49402fccfa11921141ae66127c16","observation_id":"2da951a8-aafb-4d6f-8b15-3682ccd48d5f","resolution":{"observed_at":"2026-08-15T16:53:33.734828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.00170","last_updated":"2025-08-29T18:12:20Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-18T15:36:38.409627Z","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":33},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2509.00170."}