{"as_of":"2026-08-13T06:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eb3386293ede4c4cf6afae6d0ea48d8279f05234b7d3b522488992e66afa0311","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T11:42:34.456807Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T04:40:37.485277Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-01T17:35:51.821576Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"cited_work":{"arxiv_id":"2602.05956","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.05956","snapshot_observed_at":"2026-07-01T17:35:51.821576Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","venue":"quant-ph","work_id":"844de041-a233-4bf1-a43c-eee0cbd46fc0","year":2026},"citing_paper":{"arxiv_id":"2606.28234","last_updated":"2026-08-03T15:45:51Z","snapshot_observed_at":"2026-08-07T06:44:35.035273Z","submitted_at":"2026-06-26T16:21:57Z","title":"Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T03:30:23.266451Z"},"links":{"cited_paper":"/paper/2602.05956","citing_paper":"/paper/2606.28234"},"observation_digest":"sha256:ac453fa95caa21d3ddfff125e18d5143f8329c699338604502a97d7162117c90","observation_id":"135058f0-4d42-4d6a-af19-cd352cc948fe","resolution":{"observed_at":"2026-07-01T17:35:51.823175Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.05956","snapshot_observed_at":"2026-08-04T04:40:37.485277Z","title":"Quantum approximate optimization of integer graph problems and surpassing semidefinite programming for max-k-cut,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.28234","last_updated":"2026-08-03T15:45:51Z","snapshot_observed_at":"2026-08-07T06:44:35.035273Z","submitted_at":"2026-06-26T16:21:57Z","title":"Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T04:40:37.485277Z"},"links":{"cited_paper":"/paper/2602.05956","citing_paper":"/paper/2606.28234"},"observation_digest":"sha256:e8a4dbe014b8e0696a98212c684ee07bc674ac3bd561fa2dd3e369c8b509dcd1","observation_id":"8f9acd9b-6101-4cd2-8429-021a8893f61a","resolution":{"observed_at":"2026-08-04T04:40:37.485277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2602.05956/citation-record","integrity":"/paper/2602.05956/integrity","json":"/paper/2602.05956/citation-record.json","paper":"/paper/2602.05956"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7a1c042f-7f5b-47cd-81bb-f022e8b95db0","year":null},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:13df44c49d2f760e39d993236cf50b36c0f79cee43282b063b57d48bfa6ef266","observation_id":"ca5465d6-c4fc-427e-970a-199ef46f9f52","resolution":{"observed_at":"2026-05-22T11:44:51.009137Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"67cddae8-417c-4ead-9761-93e05134422f","year":null},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:57582bb861dc80c24f11c973f37706c1ffd50a7481633497acf44da54ddc9fe4","observation_id":"49419d66-482a-40c8-a379-9be30dcb4219","resolution":{"observed_at":"2026-05-22T11:44:50.977333Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"067785b4-d58f-47c2-a6cb-30a89c677304","year":null},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:b7289d066e23fba1b0cc96ee542dfd496fc87a8a673cc2dfe884e3542fbc0492","observation_id":"36f3c5d0-e0f1-4477-82f9-829dade3b741","resolution":{"observed_at":"2026-05-22T11:44:50.896210Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"35d655fd-2798-46b1-a0ac-f0059d00a4e3","year":null},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:c54d426225e8a64c49ed8d81a84762de975345b02e8d78a94093e2e9c54fb999","observation_id":"49139abb-6639-4b8a-a457-ab98444f9ebd","resolution":{"observed_at":"2026-05-22T11:44:50.943983Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"49ec3d48-7c84-4e59-8da6-0894bd58511c","year":null},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:6d7878f8e9ff6c81533e97a8351fc37cf0defed7d9e91ba137e5a466fac3e2f2","observation_id":"9578924a-cacb-4c68-aa50-c41749961b9e","resolution":{"observed_at":"2026-05-22T11:44:50.916574Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Given an undi- rected graphG= (V, E)and a fixed number of labels k, Algorithm 1 builds a cutχ:V→ {1","venue":null,"work_id":"564cc776-4a3d-4b08-af50-1eb0c835cb5f","year":null},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:a020c7a79e9713ae4a152e560c311d44e2e34b1732243d9909c9792ecbd97175","observation_id":"073fa873-8a5a-4d52-b9d3-da23acde52b7","resolution":{"observed_at":"2026-05-22T11:44:51.000512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"[10] (special casek= 2)","venue":null,"work_id":"580cf8a7-a1ea-40d5-8331-fe67df3c62a1","year":null},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:de5fb7ac6e531599f054077e7fc012b6a79d6315d1d75e68145a2467ad1a9f55","observation_id":"619296fa-b8bb-44a2-8552-7b750b224d59","resolution":{"observed_at":"2026-05-22T11:44:50.922049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"[10] to Max-k-Cut (with Max-Cut corresponding to special casek= 2)","venue":null,"work_id":"e3d689b4-c810-4d19-bb0d-7c366c1e28bb","year":2000},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:8936835b4c071be75401bba3a7d6268edd90e89fa39e298225bbe26d05ddc155","observation_id":"76b1e812-5189-432c-8c4b-b2a85bf60297","resolution":{"observed_at":"2026-05-22T11:44:50.974400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Abbas, A","venue":null,"work_id":"a731493b-38b4-43f8-81ee-6479972547b6","year":2024},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:4ed00b745bfdbae1a8e84d19d98380248743f5134baa7957d6bb65e156f335f0","observation_id":"15c23a1c-a0f5-4d81-853d-f74788e0a447","resolution":{"observed_at":"2026-05-22T11:44:50.913112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ebadi, A","venue":null,"work_id":"2f8dd100-0527-452c-8bec-1c1a59b58c32","year":2022},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:aa3c94a2842bbfc79ecdd15ea80c683949239e11bda6051a5ef49e4d682901d5","observation_id":"a615ddd7-6fd4-422c-928f-d4600551fd80","resolution":{"observed_at":"2026-05-22T11:44:50.971041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kellerer, U","venue":null,"work_id":"544628bd-9f42-4829-bd42-9c4d3dfc724f","year":2004},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:014407d201944d693a18c421af7626397c84a79a81cff5532db50b4114bc0d44","observation_id":"32c385bd-a6e0-4f44-9142-029e407422e5","resolution":{"observed_at":"2026-05-22T11:44:50.983244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pistoia, and Y","venue":null,"work_id":"6d723756-42be-4b18-91ca-377e42dcaf68","year":2023},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:fc0ba8625ffb78cc5964c5569ebd9cb34a7f364bd7a0c04a9b86cc27e061ca2c","observation_id":"5da143f6-8940-4874-a8ec-c13a91c07649","resolution":{"observed_at":"2026-05-22T11:44:50.946554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Frieze and M","venue":null,"work_id":"f797663f-e882-4eb1-8842-145effde630f","year":1997},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:e9b3d0a67aa2e820f2d789fafb80f3bdec43bf61f31176c854acb9d52b6a515c","observation_id":"7676f142-0fe1-4265-9987-761c3ddec8f6","resolution":{"observed_at":"2026-05-22T11:44:50.903951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c9c9273f-6bf5-4844-97da-9804f8c19f8a","year":1991},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:179b6f51ae1aae4d020739872e20134bc4a24e6f22dc744d87cb396ec7133e8b","observation_id":"5e3de196-8892-42ae-8dcc-25488336e532","resolution":{"observed_at":"2026-05-22T11:44:50.936053Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fe637872-cfac-4c5e-838d-0caf45976378","year":1995},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:4b2aab1e4ff13e90a03cd86b29a12eb554992983a9cb019ba9c804bb1fa98bb9","observation_id":"f25ca830-2a5a-4f3f-995d-6fea203197a0","resolution":{"observed_at":"2026-05-22T11:44:50.986065Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0006090","last_updated":"2000-06-20T19:56:44Z","snapshot_observed_at":"2026-07-07T07:03:29.703016Z","submitted_at":"2000-06-20T19:56:44Z","title":"Quantum Optimization","version":1},"cited_work":{"arxiv_id":"quant-ph/0006090","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0006090","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum Optimization","venue":"quant-ph","work_id":"0103a726-8b7a-4b9f-9b23-6abff419b3c0","year":2000},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"cited_paper":"/paper/quant-ph/0006090","citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:1901a3ab25faadbe80650aeaffa30717175d3601da42ce0a4f5abc923992fab8","observation_id":"8e1eb01f-ca58-4a91-89a8-e56a4902457d","resolution":{"observed_at":"2026-05-22T11:44:50.187199Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":"1411.4028","doi":"10.48550/arxiv.1411.4028","metadata_source":"pith","pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"5a33d9f3-407a-4c7e-a119-ff581c66b173","year":2014},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:8530af7428af37b8289443d585528377901227994a87a2858396429b08e8be46","observation_id":"68063774-b0c4-46bf-b678-fdc37a6e6a66","resolution":{"observed_at":"2026-05-22T11:44:50.183676Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Basso, E","venue":null,"work_id":"c747db99-6665-4ae6-896e-57c575f55b4b","year":2022},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:f2e4abfa78ff0379ca97833856e7ce5e17a196d2ab410fe3a5478ba86073d527","observation_id":"13b2acc9-8498-4b7c-9217-1ddd4308d78c","resolution":{"observed_at":"2026-05-22T11:44:51.003298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/phys-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T03:17:50.525348Z","title":"Manca, S","venue":null,"work_id":"412ba31b-7285-41a3-b20b-d12189fefe76","year":2025},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:e3985b73f01e8df4d3c6f63a7f1398be1c9c293a5af59bc9a0ef275882e7bd33","observation_id":"187cb248-ffa9-429f-ade8-5ce948b9232b","resolution":{"observed_at":"2026-05-22T11:44:50.103998Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2503.12789","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T04:19:34.298561Z","title":"Farhi, S","venue":null,"work_id":"b6f167d5-6b5a-4654-8789-c8a87a4c69ae","year":2025},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:a8d17357ff96501dd4940710c757dd93ad7891d4975ae0aa8fef6cc8081422cd","observation_id":"9eb0fecc-66a1-4889-9a4f-815d7bc22a04","resolution":{"observed_at":"2026-05-22T11:44:50.165663Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Marwaha, Local classical max-cut algorithm outper- formsp= 2qaoa on high-girth regular graphs, Quantum 5, 437 (2021)","venue":null,"work_id":"3d5b8e61-e921-439c-8f9e-33fbe8c23c52","year":2021},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:43a0b777274a97fd0b32559b150c28d03330a9909fc1b5bee20c8606201f4542","observation_id":"fbe4a23a-8021-4281-9872-d463a155c351","resolution":{"observed_at":"2026-05-22T11:44:50.890753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Shaydulin and M","venue":null,"work_id":"a5eab2b7-1c06-4d5a-83b7-84c1cb284f39","year":2023},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:d7561b5a37fc332fc0a53263c752156b1c67850488169d5edfb28548929789cf","observation_id":"4a03673e-b48f-45e7-8bd7-4236e0e9ce97","resolution":{"observed_at":"2026-05-22T11:44:50.893795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"912e6dd2-c565-45d6-aeaa-45e80768101c","year":2025},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:27faa8004fe1d165bda56f6a0583ba09d46e815036d73ca499f58670e9f69764","observation_id":"73af4b5a-6789-4ba3-8a47-bb524bc64fa9","resolution":{"observed_at":"2026-05-22T11:44:50.887782Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41534-021-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Borregaard, M","venue":null,"work_id":"3e7b73b8-a726-44fc-8e33-706dbab7cd72","year":2021},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:4816b5e40215f30a58cbae5c6b4c8f73557ec2c46218a906c5e5687d17d72b24","observation_id":"9edd0b75-51b5-40bc-b658-559c33104f35","resolution":{"observed_at":"2026-05-22T11:44:50.106920Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bravyi, A","venue":null,"work_id":"61b5e296-098b-4bc3-87fb-4ba493483a78","year":2022},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:6f8590b51f83364cbde9d971ec886ee054b1096c26a304c38c495c4bf2d0ef17","observation_id":"79cdc201-b8cd-4990-ac84-ab5b0f0788cd","resolution":{"observed_at":"2026-05-22T11:44:50.882396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Newman, Complex semidefi- nite programming and max-k-cut, in Proceedings of the Symposium on Simplicity in Algorithms (Schloss Dagstuhl – Leibniz-Zentrum für Informatik","venue":null,"work_id":"c5d46a46-bd14-471d-8212-e3bed2933a2b","year":null},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:8610c5c5a7b206076b14233fc06b7d6c961c7a66bddf6f3e2fac57112d39da54","observation_id":"d201dea4-bc62-4932-8562-62d2392757b8","resolution":{"observed_at":"2026-05-22T11:44:50.877941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"357ac1ed-013e-4169-943b-c35ec8f9e3fc","year":null},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:1a1732b324c68fd7a702ab94e0363d49f898b3810d9df9e04c2422580ad2b21e","observation_id":"ab3eafbe-52fa-4af8-b326-1ed0a217e3bb","resolution":{"observed_at":"2026-05-22T11:44:50.885022Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Farhi, J","venue":null,"work_id":"e9860f4f-2def-40e0-b916-2c0ca9e73983","year":2022},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:cf9af0df993478a258d56506aa6609e937117e69648bc0992b0b2063bcb4f63e","observation_id":"b4cf76fd-0542-4492-bb60-ac83ab6bc3fa","resolution":{"observed_at":"2026-05-22T11:44:50.880053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/prxquan-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T23:14:19.126397Z","title":"Generalized quantum signal processing","venue":null,"work_id":"58c80d75-f707-479a-93fe-5631bb63e06f","year":2025},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:75458fc0d332b834cb1318e586f1600ed5bacd5a9ea557fe86daf454c55e3b94","observation_id":"976b9d2a-3d8d-4908-81df-b1fce6bffb18","resolution":{"observed_at":"2026-05-22T11:44:50.093024Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Basso, D","venue":null,"work_id":"dd5bc2d1-f0f0-455b-8144-2e33603e97b3","year":2022},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:199d22ad826880eea84ddd52ace68dffc9784c446ce1693e0e7971a7e1de682c","observation_id":"8364b252-2cb6-4b33-ab21-9453fd362956","resolution":{"observed_at":"2026-05-22T11:44:50.980411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2402.19456","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"54944be2-a5ac-47b8-9454-42ab5567c61f","year":2024},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:e838d8c4d06d069fa433ed77cb16c72d21fe56d7d777ef613fd23643bc9e438e","observation_id":"54257b19-82a3-49a6-92b0-5ab6ef46ce7b","resolution":{"observed_at":"2026-05-22T11:44:50.179723Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1510.09156","last_updated":"2015-10-30T16:58:03Z","snapshot_observed_at":"2026-08-04T18:52:09.627186Z","submitted_at":"2015-10-30T16:58:03Z","title":"A Multiple Search Operator Heuristic for the Max-k-cut Problem","version":1},"cited_work":{"arxiv_id":"1510.09156","doi":null,"metadata_source":"pith","pith_arxiv_id":"1510.09156","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Multiple Search Operator Heuristic for the Max-k-cut Problem","venue":"cs.DM","work_id":"9b6c2333-5cba-42fa-b26c-84c618246a05","year":2015},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"cited_paper":"/paper/1510.09156","citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:ab973864c8419804b1646ca1765475aa9f28cb681606f658c46d3bd5fca9c96d","observation_id":"0fb88ea8-3fd6-4628-8bf2-e2a087a052ef","resolution":{"observed_at":"2026-05-22T11:44:50.169132Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"cf7a0ea9-8919-4c8c-adab-bba899471458","year":2022},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:d875068a6c5402781fb331a92403e9e5b2ee0d53de88428243a1c48d6d43a2a2","observation_id":"65e15769-1c83-4344-81d5-56b35104ad0f","resolution":{"observed_at":"2026-05-22T11:44:50.968546Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bartschi and S","venue":null,"work_id":"f6d55b21-cdc8-4914-bbd6-731e6d32fd5d","year":2020},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:db69db4721e4c0c867ed66fcc24d2692503db6db2c7057e5b111712b5833f88a","observation_id":"7927e7af-d15a-40f7-aecb-fd946ed0f729","resolution":{"observed_at":"2026-05-22T11:44:50.901094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Golden, A","venue":null,"work_id":"6adc8ff6-e2f7-42fc-9a51-daca4d179a75","year":2023},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:9c1d5c229d26d814dc5e6390484d5efe7b7ffbc4ff7e6d99739640e618e39d34","observation_id":"54a27650-aed2-44d6-ac26-393637cd4eab","resolution":{"observed_at":"2026-05-22T11:44:50.898688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Barahona, M","venue":null,"work_id":"d24046a0-bb5a-4171-94ee-968ccd65b47e","year":1988},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:e42c6b40f23fe6b3b251d2cbf49ba3c5bc98c5aecb8cba8ad462597f40863541","observation_id":"cec6912e-1373-4a39-93bd-9ce64283cede","resolution":{"observed_at":"2026-05-22T11:44:50.960888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Boykov and M.-P","venue":null,"work_id":"d180a161-a27e-48e5-ae7f-4ac7db167868","year":2001},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:386a198db394d7eb30a9f27680dfd4adf6ddd01e858ac372875830f61d26be4e","observation_id":"bd5b4daf-0d88-48d6-8862-34d8b022eb7e","resolution":{"observed_at":"2026-05-22T11:44:50.907038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tsvelikhovskiy, I","venue":null,"work_id":"916e61b4-da1e-4ca7-bb84-4219190189de","year":2026},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:4a566b65d69e39eeced8ba0f7faee293ea5b7c7e89293f29834629710913ead8","observation_id":"68cd94de-57b4-41a4-b435-a4b9d6a1e088","resolution":{"observed_at":"2026-05-22T11:44:50.909615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a1b1fc02-0250-4155-b1d6-ee3286eb9cb4","year":2021},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:70bf1977cb95e456c4a03713090894dacce4bc073d11acb857e614fbceed8187","observation_id":"e6b8a3e8-6006-48b1-84bf-c3462fe0175c","resolution":{"observed_at":"2026-05-22T11:44:50.957883Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2025.163604","doi":"10.3389/frqst.2025.1636042","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Frontiers in Quantum Science and Technology","work_id":"a7bcb2da-6d9b-4a42-8ad8-c528eea09667","year":2025},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:4bfbcc682ce7d9e2b2f5386d35258cc796a4cb7a070fd260a2ecdd74066259f4","observation_id":"9d9620b6-6884-4e98-b86e-cda2dbeae342","resolution":{"observed_at":"2026-05-22T11:44:50.097831Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Vandenberghe and S","venue":null,"work_id":"c009bed8-eab5-435c-a962-06e89f7cd4b3","year":1996},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:a291b8e94639d812d7133a62a3c1eb3f9f68640a3a31e55693c53bbfa72b2acd","observation_id":"4a6d94c0-ef1b-48e0-bc4e-37e0d41efa41","resolution":{"observed_at":"2026-05-22T11:44:50.965994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ma and J.-K","venue":null,"work_id":"1a1bed17-8abf-42e9-ac6e-2c27b9901e01","year":2016},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:fbd8aa508c415eea706fa6740f2ae09e2bb7c6beb99076d4f3491ce2c4df545d","observation_id":"5b4f5676-3a79-4685-b85c-9f89dce0d539","resolution":{"observed_at":"2026-05-22T11:44:50.989534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.20376","last_updated":"2026-07-18T21:06:06Z","snapshot_observed_at":"2026-08-09T18:00:15.083801Z","submitted_at":"2026-02-23T21:29:47Z","title":"Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization","version":3},"cited_work":{"arxiv_id":"2602.20376","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.20376","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exploiting Low-Rank Structure in Max-K-Cut Problems","venue":"cs.DS","work_id":"f85f7bbc-62e6-4886-af0c-ff235ca91955","year":2026},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"cited_paper":"/paper/2602.20376","citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:0e10f4fc49a0875f87d5f3a1167d5c6f0840aa8838ea7bea6953bdb0321499b1","observation_id":"c480a680-160f-4ad3-8773-3dd9ac099917","resolution":{"observed_at":"2026-05-22T11:44:50.198002Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Brélaz, New methods to color the vertices of a graph, Communications of the ACM22, 251–256 (1979)","venue":null,"work_id":"ed29a722-bcd2-4ee6-81a1-a8c5d84be7c7","year":1979},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:712a710f3d9a1ba2129c51b035dff2d5f51fcc8181fe2f80ecb00103d6a8930f","observation_id":"9bef0681-6945-4b2f-9020-ec86c2c9e942","resolution":{"observed_at":"2026-05-22T11:44:50.952446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kemkes, X","venue":null,"work_id":"a4cd59d7-74ec-4a12-b13a-fddb12a38528","year":2010},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:ac5ab6097c49d2467bd3861d70cf5c3dc4c107cc75ec0a26656023960342838f","observation_id":"1c8c1206-f6ab-4556-b243-20495b70132a","resolution":{"observed_at":"2026-05-22T11:44:50.928347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bb0a77d8-6b1b-4940-9e8e-ad0c7a7030a8","year":2011},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:2d295da98dfa633bba79415f5befbaa17b21ebc655815929d57d11af88d85c48","observation_id":"9a5f4c62-75d2-44fc-ae80-8330f780a064","resolution":{"observed_at":"2026-05-22T11:44:50.919012Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"65f0112e-0fea-4e09-9aed-c6b721ad01e9","year":2019},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:c10bf397f810ece3b51a3b4beab959328d482067b2d4abe8398840482052f63d","observation_id":"81d60352-ffde-43d8-bc23-a439a476f21a","resolution":{"observed_at":"2026-05-22T11:44:50.992222Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41534-023-00733-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Boulebnane, X","venue":null,"work_id":"448579f8-3975-47d3-a2f5-0293e0eef0ea","year":2023},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:2e166a6e31dbf70ee86e9152c8dbc66c178b20bc1dd6da3eaa4654b34f00f147","observation_id":"980ec54c-5b7e-4371-ba83-17fe6968edec","resolution":{"observed_at":"2026-05-22T11:44:50.100819Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zhou, S.-T","venue":null,"work_id":"1d23bb76-3a65-4b47-9023-ad738dc95b46","year":2020},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:e5d51c88ab228e9bf4e9f70e936c45eb869ad303156eb343c9466caa4cbcb0bf","observation_id":"f68b6ef7-a268-4c20-bb13-942cd9b12dd5","resolution":{"observed_at":"2026-05-22T11:44:50.994770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lykov, R","venue":null,"work_id":"25b1f16a-38f9-4738-937b-aa3959da7f6f","year":2023},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:9d019802191b5529a8fa36c8b630944ceb0c4b084021f82d41faff4398e9334f","observation_id":"dc79a304-e9b8-4e9d-8946-709db3523e16","resolution":{"observed_at":"2026-05-22T11:44:50.938744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-02T14:56:43.023626Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"2504.01694","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.01694","snapshot_observed_at":"2026-07-02T09:16:49.159804Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"69aaabbd-6869-4886-8bb2-a347da44f7cd","year":2025},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"cited_paper":"/paper/2504.01694","citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:aa50efc6570855d025275c3a28fe0f501ef065f52c48c3a8c02a4f07c4e7b8fc","observation_id":"e9802974-de50-4912-918a-a41ef8ac76e6","resolution":{"observed_at":"2026-05-22T11:44:50.194386Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Virtanen, R","venue":null,"work_id":"fcc502ee-4903-44e2-82d5-86c9d60f2de4","year":2020},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:4737167c364d8208c9b87189a7a36adf85a1f2ce1b3d11c6ae1e60cb3406594e","observation_id":"b72fd379-c22f-4410-9a38-451af12c3d7e","resolution":{"observed_at":"2026-05-22T11:44:50.933573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.07929","last_updated":"2026-04-22T01:12:30Z","snapshot_observed_at":"2026-08-02T16:02:47.699142Z","submitted_at":"2025-05-12T18:00:01Z","title":"Spin-Boson Mapping of the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"2505.07929","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.07929","snapshot_observed_at":"2026-07-03T21:18:58.875510Z","title":"Spin-Boson Mapping of the Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"6eda1ebf-13da-4f01-a989-aad98440ccbc","year":2025},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"cited_paper":"/paper/2505.07929","citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:99561d09a07a74e13fb8483b6d73e5c2e253eb1096091f1fe48db8f09e136d19","observation_id":"8adf3763-8b92-49b7-aaf5-ecba668fe365","resolution":{"observed_at":"2026-05-22T11:44:50.190854Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"37d88810-4cb0-4d1f-bea7-dade3ed8d52f","year":2022},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:e4379169ec78227b9cc78837a75906c9d1d44fa33177861cf0bd2fe170279e98","observation_id":"93aa5f73-6cc0-4c88-8486-023c1f2e991d","resolution":{"observed_at":"2026-05-22T11:44:50.997375Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"de Klerk, D","venue":null,"work_id":"3016eac9-fd2b-426e-9bc1-88c29cd7debc","year":2004},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:b5df686a6ac46adc551f28e39a230b5c35cba720f9d0e1cc7d344a5cd6d88579","observation_id":"1a0e0d8f-6ec6-4305-9108-4b3529d00991","resolution":{"observed_at":"2026-05-22T11:44:50.949270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"91ce7b7f-5dce-4678-966b-4477d2ef0911","year":2020},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:10c2f070605b9b50ed40933ad8acc011b554d0185005690d4c318c4a2b96d18a","observation_id":"abb6dd9d-3a8b-4ac3-9376-4b24e3abd51d","resolution":{"observed_at":"2026-05-22T11:44:50.955162Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4fd65e85-0ec8-4a62-8ff2-64f550a4395f","year":1976},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:60e3fd6ff1c1e32367b3d3cf2f7d252dc0fdaeef9e74473465453b3d1c7a12ae","observation_id":"afe4ceab-c415-4bbe-a41b-82dc963cfbda","resolution":{"observed_at":"2026-05-22T11:44:50.963473Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.15465","last_updated":"2022-11-28T15:51:58Z","snapshot_observed_at":"2026-08-10T03:10:48.579245Z","submitted_at":"2022-11-28T15:51:58Z","title":"Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections","version":1},"cited_work":{"arxiv_id":"2211.15465","doi":"10.48550/arxiv.2211.15465","metadata_source":"arxiv_reference","pith_arxiv_id":"2211.15465","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections","venue":"arXiv (Cornell University)","work_id":"d48299a0-32eb-478e-be00-5044a212edea","year":2022},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"cited_paper":"/paper/2211.15465","citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:b4b18b975b22392c89b463066b038758108e7cf3d10ef9a3a50ea6ce7a8b9a3e","observation_id":"11897956-5799-46a5-89a1-bbb99724dec0","resolution":{"observed_at":"2026-05-22T11:44:50.172409Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kemkes, X","venue":null,"work_id":"199131eb-2652-4b02-aa26-22e6035b3a8a","year":2010},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:fae55f1572bf1b2090fd67631825ada828d34e5291abaad8967d39a437f25a50","observation_id":"1386e846-75ed-46b0-9fd5-ad6678a3870e","resolution":{"observed_at":"2026-05-22T11:44:50.931093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.09640","last_updated":"2020-06-29T13:21:13Z","snapshot_observed_at":"2026-08-12T18:43:46.756736Z","submitted_at":"2019-11-21T17:52:58Z","title":"A randomized construction of high girth regular graphs","version":3},"cited_work":{"arxiv_id":"1911.09640","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.09640","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Linial and M","venue":null,"work_id":"14c2a1c0-f4d2-4e49-a10b-905c0b548011","year":2020},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"cited_paper":"/paper/1911.09640","citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:3beaf17dfe5591fa1ff1e67d4ecd1a45fba0db566ae070ada3f3b773b075fc8e","observation_id":"7de2eda3-3888-4922-815f-bc60bd23d710","resolution":{"observed_at":"2026-05-22T11:44:50.176356Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a0cf730d-d481-4875-b671-740c075fa5fe","year":1973},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:e8ac07355be9b2a8073ff5e51f0f2c37eb466663fcfd600c5fbe625fbf298db9","observation_id":"17882ef8-6081-49a4-a011-96193a269314","resolution":{"observed_at":"2026-05-22T11:44:50.941257Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"shell-based","venue":null,"work_id":"0b6fa13b-662b-428f-aa91-bd08abb0132a","year":2008},"citing_paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-22T11:42:34.456807Z"},"links":{"citing_paper":"/paper/2602.05956"},"observation_digest":"sha256:ffac45c4d37dedc4d5abcf512bd6e6404727dc02c7c683b8d3480873e27794a2","observation_id":"465240e3-2248-4e43-b8ee-a575d0c39dae","resolution":{"observed_at":"2026-05-22T11:44:51.006406Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2602.05956","last_updated":"2026-05-21T15:59:16Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-03T16:52:45.715806Z","submitted_at":"2026-02-05T18:11:18Z","title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":5,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":11,"verified_fuzzy":29},"total_outbound_references":62},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 2 inbound Pith citation observations for arXiv:2602.05956."}