{"as_of":"2026-08-13T15:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0522623c1deb41caf42e1ed765c57bafd43afac7dcc62941e6bbaed97ace0f76","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-08-07T00:26:12.945367Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:00:11.892407Z","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-08-06T17:00:14.221382Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"cited_work":{"arxiv_id":"2506.14250","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.14250","snapshot_observed_at":"2026-08-06T17:00:14.221382Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","venue":"quant-ph","work_id":"994e2909-fe7a-4177-9c26-a8d98fc5640d","year":2025},"citing_paper":{"arxiv_id":"2507.12159","last_updated":"2025-08-11T04:20:55Z","snapshot_observed_at":"2026-08-13T11:15:01.669351Z","submitted_at":"2025-07-16T11:39:47Z","title":"Cutting Slack: Quantum Optimization with Slack-Free Methods for Combinatorial Benchmarks","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T17:00:11.892407Z"},"links":{"cited_paper":"/paper/2506.14250","citing_paper":"/paper/2507.12159"},"observation_digest":"sha256:21b516f638feb427bbb830d319c0155435465a0cd57d8bf190b2a17518cafafc","observation_id":"68e813db-f0d7-47a9-9c81-3332980932f6","resolution":{"observed_at":"2026-08-06T17:00:14.298771Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.14250/citation-record","integrity":"/paper/2506.14250/integrity","json":"/paper/2506.14250/citation-record.json","paper":"/paper/2506.14250"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.627643Z","title":"A review of simheuristics: Extending metaheuristics to deal with stochastic com- binatorial optimization problems","venue":null,"work_id":"8404162e-43b8-452c-a4f5-e58d0dcc0103","year":2015},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.779971Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:77d3105a4520c175a1b24c27c749162732b0e16024f0981e8b190365dfbf336d","observation_id":"4cd20117-b0ba-4fee-8cca-8447c5f92150","resolution":{"observed_at":"2026-08-07T00:26:13.631784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:12.785287Z","title":"Springer Science & Business Media, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.785287Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:5c64a758f2916e477db6034117a68a87181deb5814b1d373eee45a5b69c8d7fd","observation_id":"fcca1d0a-99c3-4d0e-b8d2-4ee9b7ce562b","resolution":{"observed_at":"2026-08-07T00:26:12.785287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.606221Z","title":"Ma- chine learning for combinatorial optimization: a method- ological tour d’horizon.European Journal of Operational Research, 290(2):405–421, 2021","venue":null,"work_id":"fef21ec1-9a55-4ee4-9d32-f1394f7b1726","year":2021},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.789313Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:c6cb079e104c57a0f442d1028e59410f84f40a995d63a52808a4f53d318c2d8f","observation_id":"05965b2a-dfe8-4bc8-869d-375f1a7c0bc4","resolution":{"observed_at":"2026-08-07T00:26:13.610625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.593370Z","title":"Optimal inapproximability results for max- cut and other 2-variable csps?SIAM Journal on Com- puting, 37(1):319–357, 2007","venue":null,"work_id":"15152038-9042-4f9a-829a-8930eb513806","year":2007},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.793634Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:92887e66a6d8e80e7ed1fac91687188c860c304a8d8a31a37783f1f2778e9d9e","observation_id":"99fa9e7b-ef34-466c-a698-52e9793f7465","resolution":{"observed_at":"2026-08-07T00:26:13.597745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.580960Z","title":"A quantum approximate optimization algorithm, 2014","venue":null,"work_id":"86d03db3-0abc-4780-8ca3-69a5f5371ca9","year":2014},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.798063Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:a091750e325d80d674c3b6fd737666183b4c81dcedfe57897dd44024f69a95b2","observation_id":"a15c2ed9-3f5f-4381-9765-7081f36360a0","resolution":{"observed_at":"2026-08-07T00:26:13.584939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.567723Z","title":"A variational eigenvalue solver on a photonic quantum processor.Nature commu- nications, 5(1):4213, 2014","venue":null,"work_id":"9d91b5bc-c16f-42d9-a38f-37365d9ad42e","year":2014},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.802067Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:36fbb7f453dcf5688a15a043e0210c38c0241bbdea515958d5afffe79c1578bf","observation_id":"5eb90bd6-43e1-452e-955c-84647c291352","resolution":{"observed_at":"2026-08-07T00:26:13.572311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01743","last_updated":"2026-03-02T19:30:39Z","snapshot_observed_at":"2026-08-12T23:51:10.458386Z","submitted_at":"2024-06-03T19:08:01Z","title":"Integrated error-suppressed pipeline for quantum optimization of nontrivial binary combinatorial optimization problems on gate-model hardware at the 156-qubit scale","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01743","snapshot_observed_at":"2026-08-07T00:26:12.806258Z","title":"Quantum optimization using a 127- qubit gate-model ibm quantum computer can outper- form quantum annealers for nontrivial binary optimiza- tion problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.806258Z"},"links":{"cited_paper":"/paper/2406.01743","citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:1bc564669c0b0c06304d884fda4660bc80b748859e81417a4ffa793e6cb07bae","observation_id":"2232c76f-6a72-48c9-aff9-69f23d2021b8","resolution":{"observed_at":"2026-08-07T00:26:12.806258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.554628Z","title":"Herzog, Friedrich Wagner, Christian Ufrecht, Lilly Palackal, Axel Plinge, Christopher Mutschler, and Daniel D","venue":null,"work_id":"463dde9c-609f-4158-8111-06f7c426864e","year":2024},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.810433Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:d498ca9874b7f77742fafdd9da0c80a1a048108fba70394543d3f9c83322897a","observation_id":"95fac26c-4d61-4f80-849c-8cba70c2e287","resolution":{"observed_at":"2026-08-07T00:26:13.559695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.543028Z","title":null,"venue":null,"work_id":"849f26b6-bbf9-4dd2-a947-95c1bda27267","year":2024},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.814597Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:93af7caec00e20a87151eb4ee2fac1e61b04f6d1421a2d8a4f51d4ec36b211fc","observation_id":"3d86eef2-0fbc-4af7-887e-472dacc12b16","resolution":{"observed_at":"2026-08-07T00:26:13.546710Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.531065Z","title":"Experiments in quadratic 0–1 programming","venue":null,"work_id":"99a2a328-1972-4c3b-9ec5-a367b197483e","year":1989},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.819221Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:3119bec45b43a8bb30343801df6414f4cb442952d38a169b1dc56208df2cb7ab","observation_id":"7a794316-58bb-4e88-b541-28b5999d4990","resolution":{"observed_at":"2026-08-07T00:26:13.535306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.518720Z","title":"Springer, 2004","venue":null,"work_id":"96697905-ab20-447c-9bc0-20f8b6a60f2a","year":2004},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.823433Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:bca5de9a349ef3d947d579c539576a8d75a19462d67ba9df07f563eda759f362","observation_id":"d64627c4-a965-4c66-8332-cac5568fd657","resolution":{"observed_at":"2026-08-07T00:26:13.522865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.505798Z","title":"Find- ing a maximum independent set.SIAM Journal on Com- puting, 6(3):537–546, 1977","venue":null,"work_id":"5dd54589-1db6-4a2a-963a-f1aae9eded2d","year":1977},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.828940Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:ac36006729d04d3de3d77ee93de3ef5762ee592f0bfe210727d744aa8b1ef260","observation_id":"21619336-2273-422c-a078-038fdda80cfe","resolution":{"observed_at":"2026-08-07T00:26:13.510006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.492717Z","title":"Assign- ment problems and the location of economic activities","venue":null,"work_id":"4f75501b-186e-4114-b24f-390cf3e3b887","year":1957},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.833266Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:7505f18c2b119e115dc0707be497773dc30d320fee8395897871f47b6c154b3d","observation_id":"fccbd62c-94c3-4011-a6f3-43c39a54528a","resolution":{"observed_at":"2026-08-07T00:26:13.497697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.480239Z","title":"Benchmark instances for the multidimen- sional knapsack problem","venue":null,"work_id":"5bd32ae2-2f9e-44ac-8a3c-a59a2cd2e596","year":2015},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.837661Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:36801af0de31b9a4ff008555360449585b98e0922d52904ac6db4f69ab334636","observation_id":"9a9a2904-5dd6-45b9-946a-da589a9b16a4","resolution":{"observed_at":"2026-08-07T00:26:13.484881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.468223Z","title":null,"venue":null,"work_id":"f8efa232-9272-475a-943b-28dfb48272e4","year":2000},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.841550Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:cbdb0247cf33fc7e20ee48005b72433d17f63624e8b4d9f03eb9cdb2cdb5d48e","observation_id":"23b87c54-cd95-44c7-b83e-e8d13ac3d6d7","resolution":{"observed_at":"2026-08-07T00:26:13.472494Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.456143Z","title":"Burkard, Stefan E","venue":null,"work_id":"3af407da-af5f-4abd-9c5b-49fefdd839c4","year":1997},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.845903Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:6dfccb4a31207467ff09fe8232d4ed2bd1959dbdc3c28cd55babd10373c6f226","observation_id":"1096dc9d-aec9-457e-a327-b0c7ea65f0f3","resolution":{"observed_at":"2026-08-07T00:26:13.460234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.443747Z","title":"QAPLIB: Quadratic Assignment Problem Library – Problem Instances and Solutions","venue":null,"work_id":"58235c96-c900-4f59-bc3e-b8e284fe47ff","year":2011},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.850332Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:5200bd71f601216012315c2a4b0b6ccf5cde7088d3ccf471f547fd44060ed780","observation_id":"8cb0e042-c9cf-4d3f-b742-1d33e1f5b0ce","resolution":{"observed_at":"2026-08-07T00:26:13.447714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00494","last_updated":"2023-06-01T09:44:17Z","snapshot_observed_at":"2026-08-13T11:27:32.282709Z","submitted_at":"2023-06-01T09:44:17Z","title":"Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00494","snapshot_observed_at":"2026-08-07T00:26:12.854086Z","title":"Lotshaw, Sarah Powers, George Siopsis, Travis Humble, and James Ostrowski","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.854086Z"},"links":{"cited_paper":"/paper/2306.00494","citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:6c9aacbec4514c884b5a181bec5ba925cb5afc8293be7bd132a5350e7d08f756","observation_id":"4a2a028b-a914-4e6f-bef2-041dc4b8857c","resolution":{"observed_at":"2026-08-07T00:26:12.854086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.432320Z","title":"Seymour and Robin Thomas","venue":null,"work_id":"065c90d7-cff1-4795-9e57-69558aba6eb2","year":1994},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.858670Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:293c457b7157a97ff2d65583a38f878c8f1f1d7b39ff4acff247999a53f495b9","observation_id":"dfc9b7f0-b1b3-4aeb-9809-a7857f26f1a1","resolution":{"observed_at":"2026-08-07T00:26:13.436020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.419805Z","title":"Bridging classical and quan- tum with sdp initialized warm-starts for qaoa, 2022","venue":null,"work_id":"ea85a3a5-c9e1-4d7a-a3cf-845be2447938","year":2022},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.862639Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:a0e1b3a8391d9ba58cb773f42ccb37fd4cb1496f32deda207f6c6af0417173fe","observation_id":"b9cf48c2-4782-4554-ad4d-4b6e982beca4","resolution":{"observed_at":"2026-08-07T00:26:13.423949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.406816Z","title":"A branch-and- cut algorithm for the resolution of large-scale symmetric travelingsalesmanproblems","venue":null,"work_id":"15ae960c-995f-4d6e-83f4-a22bdd9b8e2a","year":null},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.866906Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:3d69d33722a953e4f54b236761ed546f19ba7db850875ed4e093ec347e584eb5","observation_id":"c0b04bc2-e78c-446e-8575-b9d9f7496cea","resolution":{"observed_at":"2026-08-07T00:26:13.411623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.395286Z","title":"Author and B","venue":null,"work_id":"b0aced2f-98ee-49c5-82d9-37603be567da","year":2024},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.870754Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:d0aca12b27e1738b6e81a8213cff42b44daab56b4223afaf90cc80d8a23c129a","observation_id":"396f76f8-8e24-400e-911d-fd5d58ca9b9f","resolution":{"observed_at":"2026-08-07T00:26:13.399173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.382285Z","title":"Quantum approximate optimization of non-planar graph problems on a planar superconducting processor.Nature Physics, 17(3):332–336, 2021","venue":null,"work_id":"e1bd3e99-dba9-4fcf-a86c-0dcc8400625c","year":2021},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.874512Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:0e69ff5500b7d3374179776b942e6ca1f47ae1c422f580fcad427c2f85926257","observation_id":"28368024-1f80-4e16-9856-d91eff85fa26","resolution":{"observed_at":"2026-08-07T00:26:13.386952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.369583Z","title":"Quantum-informed recursive optimization algorithms","venue":null,"work_id":"fb20f227-bfeb-476d-b1db-e3901683944b","year":2024},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.878181Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:0806f11b70c5d7b6b250cb929c13ce00e7f12cba7b10237eb8ee65e82ec71c89","observation_id":"588e5407-defd-4573-a0ff-779deeeda7e6","resolution":{"observed_at":"2026-08-07T00:26:13.373814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.356753Z","title":"A separator theorem for planar graphs","venue":null,"work_id":"b4d192e3-993a-4cf2-956b-19747ffe6783","year":1979},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.882083Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:576c3c59108c36ca44bcd5f1e9822dfedbf462ef7020c5f8910da51927e6f55d","observation_id":"c7cbda47-c24d-42d9-93bc-cba27b84ea0a","resolution":{"observed_at":"2026-08-07T00:26:13.361258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.344854Z","title":"Finding near-optimal independent sets at scale","venue":null,"work_id":"8d1c5604-69b2-48cd-a7cb-28efb513478f","year":2016},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.885948Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:e8315ec2dd70f123e94efc094b6b088609c1732ce893e6a6b7dea893ca686ffe","observation_id":"08abdc95-bc8d-43a8-bb42-968b2a27c274","resolution":{"observed_at":"2026-08-07T00:26:13.348976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.333373Z","title":"Wahl and Sergii Strelchuk","venue":null,"work_id":"b9a79954-f2e2-499b-8a8e-54a7be87dbfb","year":2023},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.889766Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:2335c3fb78e8e36c898156dc7bcdc14d1fb4cff13acd48300fb7926f80a979af","observation_id":"645feb23-b51c-46bd-973b-f3a088f64851","resolution":{"observed_at":"2026-08-07T00:26:13.337058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.320717Z","title":"Multilevel combinatorial optimization across quantum architectures.ACM Transactions on Quantum Computing, 2(1):1–29, 2021","venue":null,"work_id":"381aaa2f-b1df-4705-818d-9be80ce14406","year":2021},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.893580Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:23986fd210655b3e3d77d681a37d7b5bcc14040f7abca5b87ad2e8502d302f1b","observation_id":"8d8175a2-688e-4d92-9adc-1895f11954f0","resolution":{"observed_at":"2026-08-07T00:26:13.325635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.308154Z","title":"A constraint programming approach for qubo solving and quantum annealing","venue":null,"work_id":"248d4bf0-de15-461c-8720-11d7267d38fc","year":2024},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.897837Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:6cf14ec2ef1730fdcb8feb375659bf6a5fe509ab793e138fd3af2066b6293ce9","observation_id":"b344828c-a9e8-4ad2-852c-f4f7f11bd319","resolution":{"observed_at":"2026-08-07T00:26:13.312834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.296039Z","title":"Ising formulations of many np problems","venue":null,"work_id":"e0d182c1-f104-4614-973e-ccbccb3f83a9","year":2014},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.902302Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:ee8504b760a0aed84530f25e8bba21eeeef7ce6086f47e6b53a0e1c63f4ed704","observation_id":"03a14a1a-bef3-413b-bfe1-7ea72713f08b","resolution":{"observed_at":"2026-08-07T00:26:13.300206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.283214Z","title":"Quantum approximate optimization with parallelizable gates","venue":null,"work_id":"cd2a3628-7b57-43f8-b7fc-0e8cbd1b7df1","year":2020},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.906348Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:6bdd57e4d6667b9bde2ecd0e67cdf388659b2aa4e2e270194e496e64b79d6ec6","observation_id":"4b6dc3f8-ffc3-4783-834f-7185619c8d2e","resolution":{"observed_at":"2026-08-07T00:26:13.287178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.270627Z","title":"Improved approximation algorithms for maximum cut and satisfia- 24 bility problems using semidefinite programming.Journal of the ACM (JACM), 42(6):1115–1145, 1995","venue":null,"work_id":"cedc82b6-a9c9-4f74-bb9f-4b0fa03933c0","year":1995},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.910949Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:f889e2d04c72d4643494467cd3f06e4e5e603fbe4c60a21b6f74b4cb188cbd27","observation_id":"dfe85504-cb6d-4d85-b608-14f3bdd37742","resolution":{"observed_at":"2026-08-07T00:26:13.275323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.258434Z","title":"A unified framework for optimization-based graph coarsen- ing","venue":null,"work_id":"3e41eb78-8d2f-4816-b317-d4ad0fef06b4","year":2023},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.915953Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:348c4acd84f47c9d1af1cb3c95ccda1b9341b2fce72606f3ff62e89c4620bbf2","observation_id":"30964d78-161e-43d3-80b0-830121c7a4ed","resolution":{"observed_at":"2026-08-07T00:26:13.263061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.246119Z","title":"Graph coars- ening with preserved spectral properties","venue":null,"work_id":"ef7df0ff-1ec8-4ce0-9f5f-69edef0ba742","year":2020},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.920143Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:3c45d745daf44701d6ee5ac37186fc7bca81a859e186f51947a5871b4cc60baa","observation_id":"348fdd4f-d33b-4091-a77f-0dbca56b30ea","resolution":{"observed_at":"2026-08-07T00:26:13.249871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.234193Z","title":"Spectrally approximating large graphs with smaller graphs","venue":null,"work_id":"bfca0c3e-08d9-4608-9338-01c04b4aed18","year":null},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.923903Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:4d90386652e6c46140029da1d2bd24f5ed490fdfb82ef5e24f6cffac2b762464","observation_id":"7922c4df-0ba9-42d4-ac1c-3c0535fe5893","resolution":{"observed_at":"2026-08-07T00:26:13.237605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.222510Z","title":"Dey, Pan Peng, Alfred Rossi, and Anasta- sios Sidiropoulos","venue":null,"work_id":"a88a9a06-c190-498f-9f0d-2ccb42bca73a","year":2018},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.928255Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:b66450eeffb3654b174b3977fc0a22fd1c7d3fbb51ddde4aadda9dfb49bc21f3","observation_id":"610e535c-f624-40a8-88ec-ec57ef378151","resolution":{"observed_at":"2026-08-07T00:26:13.226194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.210783Z","title":"A review on quantum approximate optimization algorithm and its variants.Physics Reports, 1068:1–66, June 2024","venue":null,"work_id":"e85b82d0-5e4b-4f62-9a1a-7572b2d78520","year":2024},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.932869Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:623dbc7eff5b49dcf5091731ed3f7a7bc2db7399d94bf5a2e12d77f202499988","observation_id":"2365fdc1-32a9-4d3a-a109-7b9f36ea4030","resolution":{"observed_at":"2026-08-07T00:26:13.214718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.198472Z","title":"Approximate solutions of combinatorial problems via quantum relaxations","venue":null,"work_id":"9c93d0f4-c392-4807-bf2c-778a64c2c57e","year":2024},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.937181Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:15cb420d272e54752317fd66c1b20388d4084e2641e033616233a7c7438cb608","observation_id":"2ad1d26c-5cc2-4dc7-9292-463ea3132ae4","resolution":{"observed_at":"2026-08-07T00:26:13.203074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.186831Z","title":"Our method consistently produced feasible solutions across all instances and achieved competitive optimality gaps","venue":null,"work_id":"3e413554-2487-48bd-bc96-1bb4adf568a1","year":null},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.941403Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:6415196fc525d048ecca0584ca000de566d4b225477eeef72da1ed30f4abf39f","observation_id":"7b82575b-2744-451b-a598-bde5a929043d","resolution":{"observed_at":"2026-08-07T00:26:13.190576Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1874.3088","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.139673Z","title":"Fixed- ratio strategies reduced the problem to⌊2/3 · n⌋ and ⌊1/2 · n⌋ variables (qubits), wheren is the original problem size","venue":null,"work_id":"0f2d9add-3969-48d3-9942-68a3d8ae8b8f","year":null},"citing_paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.945367Z"},"links":{"citing_paper":"/paper/2506.14250"},"observation_digest":"sha256:e7110326c47919b23df13ce00adf54a4e6744acb158953952ae699519f3ffa8e","observation_id":"74e20b57-2714-4770-91e3-e498f89b3a8b","resolution":{"observed_at":"2026-08-07T00:26:13.152525Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.14250","last_updated":"2025-06-17T07:11:48Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-12T10:16:02.705990Z","submitted_at":"2025-06-17T07:11:48Z","title":"Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":33},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 1 inbound Pith citation observation for arXiv:2506.14250."}