{"as_of":"2026-08-13T04:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:825ec52fcc22b299414946d6adbb2641ecdb9318719736929be612d246cd11d8","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T12:29:52.721186Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2607.08138/citation-record","integrity":"/paper/2607.08138/integrity","json":"/paper/2607.08138/citation-record.json","paper":"/paper/2607.08138"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1801.00862","last_updated":"2018-07-31T21:46:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-01-02T23:43:08Z","title":"Quantum Computing in the NISQ era and beyond","version":3},"cited_work":{"arxiv_id":"1801.00862","doi":"10.22331/q-2018-08-06-79","metadata_source":"pith","pith_arxiv_id":"1801.00862","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Quantum Computing in the NISQ era and beyond","venue":"quant-ph","work_id":"db02914e-62e0-4457-a74e-836513460506","year":2018},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"cited_paper":"/paper/1801.00862","citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:ad3a7247f02e666624b65f472e9a8d7095bdd8224bea98f729e27e9eea814b78","observation_id":"0738ee59-9aab-4993-a635-454730e2928a","resolution":{"observed_at":"2026-07-10T12:37:04.189379Z","resolver_source":"doi","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-03T18:38:25.951755+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T18:38:25.951755+00:00","source":"openalex_status_cache"},{"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":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:5ac43628b8bb12344e0aae5b377de23c0bc6ac8cbe8f6a0fa1190141d6e08f07","observation_id":"7551fc0c-0ba0-4f10-ac49-1454c1b9c84d","resolution":{"observed_at":"2026-07-10T12:37:04.286773Z","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-07-10T12:37:04.659097Z","title":null,"venue":null,"work_id":"dafbc9fa-fd47-4d23-814f-912f6130d00b","year":2021},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:6e961a46769e6b506dba52490a2319ad5b66c65f9814a52a7a7a12fb4d2a3e0e","observation_id":"88f53b94-bb31-4bce-b8c4-490dc5230712","resolution":{"observed_at":"2026-07-10T12:37:04.660364Z","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.1103/physreva.104.052419","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fixed-angle conjectures for the quantum approximate optimization algorithm on regular maxcut graphs","venue":"Physical review. A/Physical review, A","work_id":"bb1ee148-9b33-49e6-a172-f082fcf5eed2","year":2021},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:67c5927e008b8a2b91512b261b3a08e181042206985f717beafbee8e62780a85","observation_id":"d863ad01-8870-4fba-91df-dee07697e3af","resolution":{"observed_at":"2026-07-10T12:37:04.192547Z","resolver_source":"doi","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-07-13T17:49:40.946998+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T17:49:40.946998+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-07-10T12:37:04.701055Z","title":null,"venue":null,"work_id":"3fb1c6f5-9b24-4fdf-9f07-7e8135683805","year":2021},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:9d28a1e3dbd771ac7dfecc62d9eb57030d4caffffb9e94d6d18ce60b55f6df5b","observation_id":"512d1912-9ec0-4181-a2ef-3c05fb6f3f47","resolution":{"observed_at":"2026-07-10T12:37:04.702340Z","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.1103/physreva.97.022304","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View","venue":"Physical review. A/Physical review, A","work_id":"3cc291ab-61d1-4f58-97af-3c91a5c2cedd","year":2018},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:0f1ee1da8dc06710173ad2854e94b2c0526044769d101a85771f0e1f748acf3b","observation_id":"987fce8d-5e7a-4216-a84c-f97ceab650fe","resolution":{"observed_at":"2026-07-10T12:37:04.195121Z","resolver_source":"doi","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-07-13T17:49:39.388971+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T17:49:39.388971+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-07-10T12:37:04.699225Z","title":null,"venue":null,"work_id":"59992e86-f0c6-4e2d-8d03-ef02c691a750","year":2020},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:e58d3689408760532b298a07de60bcf15e4fc9f6926f2f8778aa3f6f31414f9a","observation_id":"96e707ed-dcc6-4516-aead-9af14e583032","resolution":{"observed_at":"2026-07-10T12:37:04.700458Z","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":"5814.344675","doi":"10.1145/3445814.3446750","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: ACM inter- national conference on architectural support for programming languages and oper- ating systems","venue":null,"work_id":"d9d05dfc-0ba9-487f-a978-adfc30f72540","year":2021},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:82cb8e2e333c88fb243def1fc4e8ad3a3277d500e2e64b9e63a6e44e7bcd0e21","observation_id":"a5c66d78-7bfe-45ea-8698-b4ca1ca8fe02","resolution":{"observed_at":"2026-07-10T12:37:04.186559Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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-05-24T01:24:35.404466+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T01:24:35.404466+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":"10.1103/physrevlett.125.150504","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Simulating large quantum circuits on a small quantum computer","venue":"Physical Review Letters","work_id":"2168d9f7-b4ab-44a2-bcb5-a32ab4aa9e92","year":2020},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:1f03076ec56ced8d7fa4b3d63bf92d94f72119021f31b72369d88c7d70d227df","observation_id":"ad0d8d9e-a398-4e45-941d-675f203ff6b4","resolution":{"observed_at":"2026-07-10T12:37:04.221424Z","resolver_source":"doi","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":"10.1103/rfn7-c5n6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Physical Review Applied","work_id":"0860abc5-6ab9-4d1d-a4b2-3b70723320a9","year":2026},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:c447f1f49b65b01b83356713ae6c608a08efd6077e87221b1f045bb28f0b0ca4","observation_id":"823b8d89-7de0-4bc5-be7d-c1804d6a242b","resolution":{"observed_at":"2026-07-10T12:37:04.197319Z","resolver_source":"doi","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-07-10T12:37:04.697420Z","title":null,"venue":null,"work_id":"bddb5013-4310-44e0-ba40-16aa990d7d1e","year":2023},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:0617f2a2166bd4b6b489a39d42c2c71cf48f023a4a436faa42394c2e48e96dec","observation_id":"aeedd381-eaea-4fff-9e62-aa0bd056cdda","resolution":{"observed_at":"2026-07-10T12:37:04.698611Z","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.1103/physrevapplied.19.024027","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Physical Review Applied","work_id":"f4fbb662-c577-442c-b64e-e088c67aae6e","year":2023},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:4d89c4bd045e436767230b1e9046f2172a5a65d6682f001e23dc6d1f879ab8bc","observation_id":"4c65f0c5-b09b-430b-8140-e0a5a3379b42","resolution":{"observed_at":"2026-07-10T12:37:04.205660Z","resolver_source":"doi","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":"2307.15260","last_updated":"2023-07-28T02:06:42Z","snapshot_observed_at":"2026-08-07T06:35:25.909162Z","submitted_at":"2023-07-28T02:06:42Z","title":"QAOA with fewer qubits: a coupling framework to solve larger-scale Max-Cut problem","version":1},"cited_work":{"arxiv_id":"2307.15260","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.15260","snapshot_observed_at":"2026-07-10T12:37:04.291083Z","title":"QAOA with fewer qubits: a coupling framework to solve larger-scale Max-Cut problem","venue":"quant-ph","work_id":"2102eea9-3d82-45a0-83a5-40326d55ea4a","year":2023},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"cited_paper":"/paper/2307.15260","citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:5ab999370badd18bdbbe69dcf543e7b34ae59ad299feccf745fc0b750c439319","observation_id":"83d93994-90e0-4ade-9caf-0dccdae40ad9","resolution":{"observed_at":"2026-07-10T12:37:04.292958Z","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":"2603.26232","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T12:37:04.288067Z","title":null,"venue":null,"work_id":"838cbedd-3c66-40f6-911d-9a5d28dcbede","year":2026},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:1f58a70253564ea7fcdd93a39fff24095d9b7c0132a278086a5dcb7430958336","observation_id":"7ba78377-abcd-4f84-b690-bde263261811","resolution":{"observed_at":"2026-07-10T12:37:04.289639Z","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-07-10T12:37:04.695469Z","title":null,"venue":null,"work_id":"8e646e04-5467-45be-adbb-22b9fbda9116","year":1959},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:41032af61abe26b00072986e37033a4a022a2cdb7fcca0baac39e2045a0297b3","observation_id":"9bb91b7d-a58a-4c11-ae46-8a65c1915a9e","resolution":{"observed_at":"2026-07-10T12:37:04.696703Z","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-07-10T12:37:04.693508Z","title":null,"venue":null,"work_id":"2776f587-28e6-4c54-8a34-0162abfbc978","year":1999},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:f5f5c5a77d94cffbe5d1bee87e97d50bfe2b984b6294c8e9caafb51ae709e053","observation_id":"1fd3b4f4-4d16-4bf7-a02d-a3ad3a692866","resolution":{"observed_at":"2026-07-10T12:37:04.694704Z","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-07-10T12:37:04.691683Z","title":null,"venue":null,"work_id":"fbc3ba46-11da-4759-be1e-0096daa35ea9","year":1985},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:913b880117a50c1a8f0798fd0450431f1e04370f217efe933aaa7225d426e9cc","observation_id":"08a4fda9-7d72-4cf2-aca3-102d505059fd","resolution":{"observed_at":"2026-07-10T12:37:04.692859Z","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-07-10T12:37:04.689876Z","title":null,"venue":null,"work_id":"d678f8b8-04ca-45a3-b75b-c4fc4f5fb133","year":2003},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:a6be7c587aa7833228adc7737479058660aeb707cfb0b3fe1dee229a69776582","observation_id":"cc2a4a98-ad0b-47b2-bf25-17bbf146de85","resolution":{"observed_at":"2026-07-10T12:37:04.691072Z","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-07-10T12:37:04.688127Z","title":null,"venue":null,"work_id":"d569b442-862c-41aa-b2c5-4d089148690f","year":2017},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:af4851006a65c0d353d748d7365bcbb77b1b802866250f25b79b48fa92c20b18","observation_id":"a506c4ff-ac67-4eb9-a2d5-f3dc7903eb7f","resolution":{"observed_at":"2026-07-10T12:37:04.689322Z","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-07-10T12:37:04.686170Z","title":null,"venue":null,"work_id":"88d30723-ecff-4b8e-ad4f-d3d4eec7e6ce","year":null},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:7ff16dcd4c468161d44906fdb5ef99635f88175a248a7fc778c57665feaa27cf","observation_id":"2e9b6755-7bb1-44af-8357-46fc62e688af","resolution":{"observed_at":"2026-07-10T12:37:04.687497Z","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":"2014.00005","doi":"10.3389/fphy.2014.00005","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lucas, Frontiers in Physics2 (2014), 10.3389/fphy.2014.00005","venue":"Frontiers in Physics","work_id":"f037aee6-2950-4c1f-a042-66162f9e5d4a","year":2014},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:7b54d287766eb43979be4fc6dd8b7dfd34a544c561f8d612953cb684986b6dad","observation_id":"c52c4147-2aa7-4b62-a18d-38dc82361062","resolution":{"observed_at":"2026-07-10T12:37:04.214902Z","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-05-21T15:24:04.109275+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-21T15:24:04.109275+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-07-10T12:37:04.683551Z","title":null,"venue":null,"work_id":"9ca3aadd-6b3b-4b65-9c1f-73fb69710fc8","year":2019},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:5954f5e5f5ecd267f8be089c16a37ab4a5faf0b19d17c6d3a57fcc0106b514df","observation_id":"03b617a7-a1c2-4ff0-9354-9de29b13a913","resolution":{"observed_at":"2026-07-10T12:37:04.685554Z","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-07-10T12:37:04.677476Z","title":null,"venue":null,"work_id":"30a9490b-4c53-4bff-a588-4d4831d8bd4d","year":null},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:838c9af2cfbcd39d0544574b0eadb259edfb762abe9750469f0482e3512fd427","observation_id":"6480b872-f8ce-4f5e-9581-d84407dd325e","resolution":{"observed_at":"2026-07-10T12:37:04.682565Z","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-07-10T12:37:04.675719Z","title":null,"venue":null,"work_id":"95ec5272-1978-461e-9096-8490f5df5846","year":2014},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:4c0f200db44bda1f4375be7e175b5e9c6aef46df809e03ceb8c25e78bd3ce473","observation_id":"e4f725bb-1539-4240-994e-882aa28e215d","resolution":{"observed_at":"2026-07-10T12:37:04.676916Z","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-07-10T12:37:04.673961Z","title":null,"venue":null,"work_id":"aac3966d-3c14-4ff0-bbf0-7a704a7dc135","year":2017},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:1eda33ad56321a0504a5fff35fb2024be2e18fc070cb1f87d7a6648b48852ed0","observation_id":"4a4f9df3-0cbf-492e-a5f0-aff3335b4ba2","resolution":{"observed_at":"2026-07-10T12:37:04.675131Z","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":"7858.330402","doi":"10.1145/3297858.3304021","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Keckler, Christopher W","venue":null,"work_id":"601b03e1-7457-4ad3-b46f-7cce8eb55012","year":2022},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:3ceb78745f8b8d4e087aecfe870d2279d02a34c33e2fbd337b8f3b412e3e6bbf","observation_id":"53e19d10-ae5a-413e-9ef4-0f28fca08bbb","resolution":{"observed_at":"2026-07-10T12:37:04.204477Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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-07-10T12:37:04.672134Z","title":null,"venue":null,"work_id":"af969f47-3969-4dc9-acae-625243c43e0c","year":2022},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:9ebf6c50af22e726a56f7313a5a33abd206c5a15ab3db81c0281c5fcb880cacf","observation_id":"dac77082-7693-461e-8b80-05ccfca72733","resolution":{"observed_at":"2026-07-10T12:37:04.673349Z","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-07-10T12:37:04.670363Z","title":null,"venue":null,"work_id":"5f05fed8-25ed-408d-a66c-e3e21a95439f","year":2020},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:dc28c8050c3c24d6078c828cb2b7ee2e2de0aeb5adf22cb3c9793783360f38ea","observation_id":"a4940897-ed10-4e10-a387-15ec8a92c8b0","resolution":{"observed_at":"2026-07-10T12:37:04.671556Z","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.1088/2058-9565/abe519","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Quantum Science and Technology","work_id":"7089bead-f070-4c81-ad6d-f95b85586271","year":2021},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:25ae62284cc959c15544303e4e52017e0c2a5f0a130ec93f58e9085355d440d1","observation_id":"5d2f4c82-1f51-491d-b726-e9718eff5847","resolution":{"observed_at":"2026-07-10T12:37:04.211257Z","resolver_source":"doi","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":"5693.357574","doi":"10.1145/3575693.3575742","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Emer, and Saman P","venue":null,"work_id":"dce1fed8-a27c-43eb-b121-e3442ca764c5","year":2023},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:30972eee4a4c926cfc919f0f50b89f7ba94b34a004743c823d841ee321917444","observation_id":"9934f47f-5b17-4833-a0dc-33704c1decba","resolution":{"observed_at":"2026-07-10T12:37:04.201214Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"cited_work":{"arxiv_id":"2602.21689","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.21689","snapshot_observed_at":"2026-07-10T12:37:04.282118Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","venue":"quant-ph","work_id":"0b105162-cbfa-44cd-a025-5d02da6d71bd","year":2026},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"cited_paper":"/paper/2602.21689","citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:0480418afa705d42478872933147c89c628a7b9c3cc0eac91300b5fd0e7b21e1","observation_id":"8c99de3e-3679-4461-95ed-585ceb66f6e4","resolution":{"observed_at":"2026-07-10T12:37:04.283752Z","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-07-10T12:37:04.668506Z","title":null,"venue":null,"work_id":"ec6ed04f-e4d5-4d00-8867-79bf46e2f668","year":null},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:ef5ef3f56d07a49d7065b0d86dd89ecb6b1f119b45e9334afd4530706099984e","observation_id":"f15bc37f-9ae4-4109-b9fe-6d825b2cdd71","resolution":{"observed_at":"2026-07-10T12:37:04.669815Z","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-07-10T12:37:04.666744Z","title":null,"venue":null,"work_id":"7cac64af-0eba-41c9-8c5a-e86f8d85b93e","year":1980},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:d87084aa7ee38e66feac9a4ca7dc84299d67b5bcaea02bf71e20186e7c5e0863","observation_id":"d389835e-792b-4dea-8e27-f5668f0de46b","resolution":{"observed_at":"2026-07-10T12:37:04.667888Z","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":"7683.227684","doi":"10.1145/227683.227684","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Available: https://doi.org/10.1145/227683.227684","venue":"Journal of the ACM","work_id":"2765126d-6586-4053-b953-58a936e5aa4d","year":1995},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:df6fde9c9285744e68a65522297c2b238d57b3c06e69b2463fdbfcbf83d98caf","observation_id":"2fcb8e0f-6627-4184-97e4-9452be0bc507","resolution":{"observed_at":"2026-07-10T12:37:04.209630Z","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-05-20T09:56:29.122396+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T09:56:29.122396+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":"10.1002/wics.182","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Wiley Interdisciplinary Reviews Computational Statistics","work_id":"9ee2357a-b705-49d8-a83d-806f1cf36a36","year":2011},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:8e5901c4d67483f8246fb308b62c0f5d08558de8ec087b602729f704e164ad5b","observation_id":"bbc4941b-b490-4d75-90a6-ab5ea7803d36","resolution":{"observed_at":"2026-07-10T12:37:04.216495Z","resolver_source":"doi","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":"10.1007/978-1-4612-4380-9_16","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"1992.Individual Comparisons by Ranking Methods","venue":"Springer series in statistics","work_id":"36e6fdf1-7402-4d37-b78b-1df8aa291f58","year":1992},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:5dd10758cef45f19dd40784fea3f7c8c1e974a49e1ca25bd4424962591e631b1","observation_id":"2eb5dd1b-bd92-424f-a873-a6ebd9f523df","resolution":{"observed_at":"2026-07-10T12:37:04.219196Z","resolver_source":"doi","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-03T19:38:34.085393+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T19:38:34.085393+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-07-10T12:37:04.664997Z","title":null,"venue":null,"work_id":"b66318ec-7e22-4440-9cca-6de790393971","year":1994},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:87262f8f968e7112da3e08a80f67071d3c4b98a5437963555f3f05cc8d69052f","observation_id":"92853d95-544a-45a3-b3f9-8fde30c219b9","resolution":{"observed_at":"2026-07-10T12:37:04.666173Z","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-07-10T12:37:04.663177Z","title":null,"venue":null,"work_id":"b922bb0e-1659-43a4-b0c8-1255a02917e2","year":2019},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:b42cb2442d9db4f086f6b1015cedc2a8decea11d6752dd05722662be73a87680","observation_id":"f9e80f7b-29f1-480d-892f-46adc0d7e875","resolution":{"observed_at":"2026-07-10T12:37:04.664359Z","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.1007/bf01068419","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Schuirmann","venue":"Journal of Pharmacokinetics and Biopharmaceutics","work_id":"66b1ab6c-5f4a-4f2b-a2a4-68bae8ebee06","year":1987},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:32afc2698230c9d37b2a417bf6d5ecbc7732ca5dd62399a58d7a91db6526e326","observation_id":"ed30a1e8-d8f9-4225-ad58-424ead438af5","resolution":{"observed_at":"2026-07-10T12:37:04.182184Z","resolver_source":"doi","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-10T17:38:10.130539+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-10T17:38:10.130539+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-07-10T12:37:04.661104Z","title":null,"venue":null,"work_id":"756e62b8-13b2-4f2a-8893-85b11b1d2a0e","year":1998},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:1f19a072ea14469d8293df697d44ed91dbddcf66e069be0b8856b27b04411776","observation_id":"1f4a0cd3-5d0d-4b6c-bd72-d0467064aef7","resolution":{"observed_at":"2026-07-10T12:37:04.662495Z","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"}}],"paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":21,"verified_exact":16,"verified_fuzzy":0},"total_outbound_references":40},"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 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2607.08138."}