{"as_of":"2026-08-15T11:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e24ef5eabe2bc6c286ee7356b9406fa374fd12fd9c6fa3eade804425c4589a2","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T01:44:20.954919Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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-07-09T07:24:04.498106Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-09T07:26:03.132471Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"cited_work":{"arxiv_id":"2511.00506","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.00506","snapshot_observed_at":"2026-07-09T07:26:03.132471Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","venue":"quant-ph","work_id":"c4fe3dcb-f3ff-431e-89db-42beb47f60f0","year":2025},"citing_paper":{"arxiv_id":"2607.07550","last_updated":"2026-07-08T15:48:27Z","snapshot_observed_at":"2026-08-15T10:35:36.031026Z","submitted_at":"2026-07-08T15:48:27Z","title":"RL-Guided Quantum-ALNS for Constrained VRP","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-09T07:24:04.498106Z"},"links":{"cited_paper":"/paper/2511.00506","citing_paper":"/paper/2607.07550"},"observation_digest":"sha256:3a67e156fd05e5dbdd2bb44bdf5a1a5d7fe8fd763fb47c7f60c2d6597fa94d9b","observation_id":"a16c5263-5e42-4af1-8b41-426014db3b47","resolution":{"observed_at":"2026-07-09T07:26:03.135270Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2511.00506/citation-record","integrity":"/paper/2511.00506/integrity","json":"/paper/2511.00506/citation-record.json","paper":"/paper/2511.00506"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"For inter- cluster VRP withN= 12 qubits, MA-QAOA generally uses more parameters than standard QAOA","venue":null,"work_id":"1b0811ff-abd9-432f-8d7e-ea90ffe58b1a","year":null},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:69fbe6a4a6783c7af989456a5f6ab6f0acc261ca065a05b5566edc2020c2f7ab","observation_id":"5da00e76-f7dd-439d-ba9c-5428eabb3972","resolution":{"observed_at":"2026-05-18T01:45:37.519624Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a7882260-6987-4a08-a4d5-fe93d4ae3a8f","year":2022},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:cec4b70d7f3e56587bb8e0437d3fa17fb67de692a56bf130328ad63f78431091","observation_id":"366bce3b-f37b-4bef-814e-23f674db00e3","resolution":{"observed_at":"2026-05-18T01:45:37.527224Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fitzek, T","venue":null,"work_id":"8adcfbd1-2171-40fd-a389-c7c94b68ba14","year":2024},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:5ce19306b2a0803b9b2c1276bb325f08c4596a46e840d5ab77dda7937c66fc61","observation_id":"73c6a719-ebe9-463f-9fc5-4e859efeed61","resolution":{"observed_at":"2026-05-18T01:45:37.546535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kerscher and S","venue":null,"work_id":"403d6149-e5ad-492f-951a-848a80cfe7d5","year":2024},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:939c9c55fd889203af0ed89586ab219c70c0f36108e6cd44074df601e8309bac","observation_id":"0021cf6b-022a-4316-b36d-6277ff9529c8","resolution":{"observed_at":"2026-05-18T01:45:37.531192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.05373","last_updated":"2025-07-07T18:02:13Z","snapshot_observed_at":"2026-08-10T00:49:23.929617Z","submitted_at":"2025-07-07T18:02:13Z","title":"Solving Large-Scale Vehicle Routing Problems with Hybrid Quantum-Classical Decomposition","version":1},"cited_work":{"arxiv_id":"2507.05373","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.05373","snapshot_observed_at":"2026-07-04T00:49:18.699189Z","title":"Azfar, R","venue":null,"work_id":"bc4adbd9-8541-4331-8e6b-1dbf14e36117","year":2025},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"cited_paper":"/paper/2507.05373","citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:9a8d160affe275bcd3ca27216ac07644007952bb8e0f694751db5e069af60dae","observation_id":"8a910f9b-0755-48f1-a834-fb42014e57c0","resolution":{"observed_at":"2026-05-18T01:45:37.054142Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.17051","last_updated":"2025-03-21T11:09:48Z","snapshot_observed_at":"2026-08-08T14:39:33.771835Z","submitted_at":"2025-03-21T11:09:48Z","title":"Solving Capacitated Vehicle Routing Problem with Quantum Alternating Operator Ansatz and Column Generation","version":1},"cited_work":{"arxiv_id":"2503.17051","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.17051","snapshot_observed_at":"2026-07-09T07:26:03.161097Z","title":"Huang, X","venue":"quant-ph","work_id":"98ad806d-c9d7-4595-b9ed-73874f355bdd","year":2025},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"cited_paper":"/paper/2503.17051","citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:c1a7a07b69c1a33d265d1a700b55bed8c5b852be969549f01b4d25fffdf89e3f","observation_id":"0376e272-ea91-409e-8e9a-17d9db06bdde","resolution":{"observed_at":"2026-05-18T01:45:37.048726Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Syrichas and A","venue":null,"work_id":"479532b0-ea50-4ea6-868c-07f974057dd5","year":2017},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:1ccd517e222bc4a84ce7d6c07737cc243888abfe863e1edb9864efb58f194bc4","observation_id":"547cb4c3-7dae-475c-b581-3688926b25f9","resolution":{"observed_at":"2026-05-18T01:45:37.538432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Farhi, J","venue":null,"work_id":"812f2ee6-7188-46c9-809f-f0aa1c260ace","year":2014},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:4dc136e015d7a35a30a26b9dc1c77d7d24995c4ddb4f6026b0bc2fb837edaa5b","observation_id":"5bc8aeaf-613b-40df-a045-5a18535061bf","resolution":{"observed_at":"2026-05-18T01:45:37.515507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"985fbf03-69be-45b9-af05-3fe991f11631","year":2024},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:4cb10f8bc5b14294c6418bdf468d7b58f4b21b49e81672720c04821fdb5595bb","observation_id":"b12c7353-0d94-4050-bf70-b25a30c167e6","resolution":{"observed_at":"2026-05-18T01:45:37.550854Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"89d244c0-a6a8-47dd-86c7-af1dfb0b9054","year":2018},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:e047c8d6b8487fc8b2e94f2e68bfcd81779ea8485badba5caab26f004947841e","observation_id":"65cd7fa0-6584-467a-a843-e284cc8492fe","resolution":{"observed_at":"2026-05-18T01:45:37.554663Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Borowski, P","venue":null,"work_id":"4e93aa14-ec73-4405-90b8-b8e2f4e7a6c6","year":2020},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:c64d607921a86c9dfb3fa997f83d3069abed04c9d8f42d1f5089a709b83423b1","observation_id":"a0e6fb67-e90f-42fa-99d3-cd8e598234f3","resolution":{"observed_at":"2026-05-18T01:45:37.542026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Alesiani, G","venue":null,"work_id":"f02af97f-e2b5-472f-a79f-df5338527772","year":2022},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:433ad3f9e6a38d7868963e5c11bc95e67af86f059c6d6772c9aca5f4ccfdf300","observation_id":"ed21fb7d-aa09-4459-ab9f-31c8ee185a5c","resolution":{"observed_at":"2026-05-18T01:45:37.534852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kerscher, T","venue":null,"work_id":"b50952d3-30b7-42dd-8a46-ccc3225de1c8","year":2025},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:205850b52f362def38adfb00d9c59a6dcc2639c92b19d7b6b653ec6df97fce17","observation_id":"39c1be64-bd41-4ff8-b314-5407c9a0d008","resolution":{"observed_at":"2026-05-18T01:45:37.523289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Santini, M","venue":null,"work_id":"46ee9c1c-50c1-4bc7-b1f9-24edbeb355ac","year":2023},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:106d376279b10052ee6b917e6f8c3165a5fb18d374663d6780c945bd1c21b83b","observation_id":"ace29fd5-b601-4492-83ac-bcc1a77c806b","resolution":{"observed_at":"2026-05-18T01:45:37.507771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"da690936-02a0-47c1-8064-bf6ad3d6f787","year":2019},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:665508673ce4c0d59312a2e316d37b4a9b01542b1054a964d761413f0c045be0","observation_id":"9dbda7f8-8150-4aa9-aed6-53eee47d72d9","resolution":{"observed_at":"2026-05-18T01:45:37.511823Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1142/s0219749925400039","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Padmasola, Z","venue":"International Journal of Quantum Information","work_id":"5df4cd03-257b-4130-b0fb-3266ee0b0abf","year":2025},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:08216cd18f13d25ce03020afba6aed457805d3b7585a01179959198696b11778","observation_id":"e63d3691-8935-4412-97d2-d16613ee5788","resolution":{"observed_at":"2026-05-18T01:45:36.647363Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9a7edef9-0b68-407b-86e2-a81f0536b106","year":null},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:4b3bf8fb6a3db27a02f5f075741d5f094623ffd7bd11ba17e1620f4312331263","observation_id":"eb29acee-913e-407f-ae24-437307d25678","resolution":{"observed_at":"2026-05-18T01:45:37.558804Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Marton ˘0146´ ak, G","venue":null,"work_id":"6acdfd26-c48d-4272-a2dd-c48ff72b0fbe","year":2004},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:fe794f3e45bc88af33e33ee460c0a92086c0d397cf0c48c890e7cc8d90f9ef75","observation_id":"2541870a-79b5-483d-ad45-07c2acf857dc","resolution":{"observed_at":"2026-05-18T01:45:37.569937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.10928","last_updated":"2018-05-28T14:10:17Z","snapshot_observed_at":"2026-08-14T19:10:23.144977Z","submitted_at":"2018-05-28T14:10:17Z","title":"Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience","version":1},"cited_work":{"arxiv_id":"1805.10928","doi":"10.48550/arxiv.1805.10928","metadata_source":"pith","pith_arxiv_id":"1805.10928","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience","venue":"quant-ph","work_id":"dd19b637-a88c-40f0-a441-ddba61e92ab5","year":2018},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"cited_paper":"/paper/1805.10928","citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:fdc5457f155033985962355ff9c276929ccf99e68fd5377d81c5719885686157","observation_id":"622b0e2f-d3d6-4b5d-b098-c5498fef8716","resolution":{"observed_at":"2026-05-18T01:45:37.041948Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"27c3e7d2-63b9-40b2-bfb7-236de0176f83","year":2017},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:534c235d88203cb48d67a5ddaf1e7aff103cec318ab645b632e950a0f850f58d","observation_id":"575327ec-74b7-45e0-9dc7-168260344d0f","resolution":{"observed_at":"2026-05-18T01:45:37.620326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"549c917c-36d8-486a-9100-2bcd4868c85a","year":2023},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:98b6169bd3ecc8fb2a6c6364d89371587e53431ae95cf8f4034366af797c4ad7","observation_id":"9d95dc45-7da8-4044-8059-678f5715b1bf","resolution":{"observed_at":"2026-05-18T01:45:37.566545Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hogg, Phys","venue":null,"work_id":"17878ef9-da23-45bc-a3fa-ef3316b366e4","year":2000},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:a991fb75b54b5bf11bba522fa18db5c9de5e2c219010d0d799d1860341509e4a","observation_id":"a9fe6eaf-ad2c-4136-a4f4-be78ab1ab246","resolution":{"observed_at":"2026-05-18T01:45:37.562530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Irieet al., inLecture Notes in Computer Science (2019) pp","venue":null,"work_id":"ed5dfc91-ed3a-4195-a1f1-a23766e052b0","year":2019},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:a53df0f54b9ebad93194ee9d7754b8eb3896a8a08b70c34f0d4d8690f6067989","observation_id":"18623d6b-6e7b-4a59-b78d-a00cc3e0506f","resolution":{"observed_at":"2026-05-18T01:45:37.583945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bettega, Formulating optimization problems for quan- tum computing (2023)","venue":null,"work_id":"977a068c-8ba2-4ed0-9047-ff6cb11e180a","year":2023},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:edb26f15769a168e34ae3eff538cf3f1344b8ae9f871e910759e1fa9d0ac8503","observation_id":"c2c95138-5b33-4402-81a9-431157a07dcb","resolution":{"observed_at":"2026-05-18T01:45:37.580270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9cf9ac8d-1b59-47ff-adfb-568e83c7cf6c","year":2019},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:285ef5d7220cc3181e76279de2221bf72d7a425ddf0eeb840434299cea1fbfe6","observation_id":"5252f2df-d5c9-431e-b1d2-54454bad60ef","resolution":{"observed_at":"2026-05-18T01:45:37.587327Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s43588-025-00873-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kotil, E","venue":"Nature Computational Science","work_id":"2487f6a6-0667-40f5-a35a-ccf376073c20","year":2025},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:7907863cd9a28bfff0f54b5c5bb08e1992a29a4a7edb8a822c212522a090f20e","observation_id":"80c4408c-27e8-4473-8282-7f1ad393add7","resolution":{"observed_at":"2026-05-18T01:45:36.643508Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pellow-Jarman, S","venue":null,"work_id":"288a7a21-d4dc-4c2a-ba00-f6b2bba600d2","year":2024},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:2af948c90eb52ca2af6ef05521487fcbe7374780a11e19ccea27d5896c2fe93b","observation_id":"200a2a4f-eb04-41fa-9ea6-95d8fb85a52c","resolution":{"observed_at":"2026-05-18T01:45:37.573509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Herrman, P","venue":null,"work_id":"f6ba824c-0a29-409d-8ad0-488478470c2a","year":2022},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:77bbbf646739a1971ee22afb6d1614d949bf5551a635e478a99bc4b90608be35","observation_id":"401c1a2e-f506-4d73-afab-75f5e2f22e5d","resolution":{"observed_at":"2026-05-18T01:45:37.590718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gaidai and R","venue":null,"work_id":"57e5c9ac-8296-440b-a557-110678a7ab77","year":2024},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:582b2ce03061ba70a9a821be6a4a0f0f3308166208f4b69765d4562812b9fa6f","observation_id":"7934fedb-86d7-4b45-9126-f0fd50a4db62","resolution":{"observed_at":"2026-05-18T01:45:37.594158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zhou, S.-T","venue":null,"work_id":"bb25d9e6-b293-474e-be28-1e356d3c6aa1","year":2020},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:0bddaa0af7bc013c60a3eb41c3f7195a42ce2bb8a0d27be063ba69c517049cae","observation_id":"f3a018b0-b6ac-42b8-b20e-0d5cb9192a0a","resolution":{"observed_at":"2026-05-18T01:45:37.597452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Shi, Y.-A","venue":null,"work_id":"e8e8b449-2688-41c7-bfba-f0cd301c05ef","year":2022},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:f22ecd7802b1e413dda779916e08c491f2586e6bdef9e8acd1e9b9800c392061","observation_id":"9136a6ff-4f50-42be-bd75-bf00f9d5e200","resolution":{"observed_at":"2026-05-18T01:45:37.614239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Singh, S","venue":null,"work_id":"3aea78bb-70de-42f3-95ff-347fea320437","year":2023},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:134c08903946c5f2cf2edbbed943bc5cc32535eaa8b5ad87dc18acf268844967","observation_id":"3665d766-1707-48db-9fe5-5645f71a1278","resolution":{"observed_at":"2026-05-18T01:45:37.600640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d7f74317-ea1b-4ce4-b42a-25729673bbd0","year":1998},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:52499ad3efad7e18b07ea230aed5f9aa9fd9bb50441118c312c4743decd7bbb5","observation_id":"b2ded98d-edae-4c4f-b821-95ac61c430f4","resolution":{"observed_at":"2026-05-18T01:45:37.627156Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Wiedmann, M","venue":null,"work_id":"09f16d86-c3b0-47a4-8636-08694af7f2ac","year":2022},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:753485c3dae74ba4e1ba6ef64c22f82453d30886dcef9b3e6fa73f8257c7d740","observation_id":"ade2be24-a9d3-409a-866e-c2d501ab817b","resolution":{"observed_at":"2026-05-18T01:45:37.576628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kungurtsev, G","venue":null,"work_id":"baa5bcc5-476b-49dd-9071-3c14bc0f3369","year":2022},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:a9f2fc3a7d17d600f6df3fa1a8cf8ad00c7c5cbba6ee97cd2ec0628ec1f50371","observation_id":"dd9761b2-af18-4cf1-8b56-767a91374931","resolution":{"observed_at":"2026-05-18T01:45:37.623780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cheng, Y.-Q","venue":null,"work_id":"b27cd624-d8fa-4fc5-8fad-1c59c173ad91","year":2024},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:34f700c117fb136609b1a3c02d6624c8ff083b280a296e2efdb474e8bc6aef2e","observation_id":"7b943456-0bcb-43c9-a1d2-f2c3304cf8ae","resolution":{"observed_at":"2026-05-18T01:45:37.630638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gacon, C","venue":null,"work_id":"547f163b-20f0-4eec-9072-df7a1e288d70","year":2021},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:2eb82345288214505ddd63b5ec1920a856f17dc2db188655b7602cf84b26e8d6","observation_id":"186fbfe3-6882-4c40-af6d-901e11be180d","resolution":{"observed_at":"2026-05-18T01:45:37.617158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08785","last_updated":"2024-04-21T05:03:01Z","snapshot_observed_at":"2026-08-13T22:42:12.551031Z","submitted_at":"2023-08-17T05:14:43Z","title":"A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem","version":3},"cited_work":{"arxiv_id":"2308.08785","doi":"10.48550/arxiv.2308.08785","metadata_source":"arxiv_reference","pith_arxiv_id":"2308.08785","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A feasibility- preserved quantum approximate solver for the capacitated vehicle routing problem","venue":"arXiv (Cornell University)","work_id":"4ff84dd8-0f43-44f3-8b7d-da89ad73d483","year":2023},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"cited_paper":"/paper/2308.08785","citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:9aaf3b8c66ba22e85cc723c0bfec34b9c0bc6e037de09ac76f3e50dd6e7914ce","observation_id":"f966d661-9f8f-4d02-99c6-bd97ec81fe45","resolution":{"observed_at":"2026-05-18T01:45:36.638666Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hadfield, Z","venue":null,"work_id":"8cb0a2b5-2656-40c2-872b-02a7fe309e17","year":2019},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:17b2d69d99d4425eb7ce50b1891b688ef35dd1949f8fa567ad2e6a80d7126705","observation_id":"9ac5122a-3b20-4edf-96af-94c1265b2770","resolution":{"observed_at":"2026-05-18T01:45:37.603768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8090e99d-98cd-4ecf-b0bc-c20ee15ac7f6","year":2023},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:acfcb2b6884f2bf2a2d7df69bf272be317fc4583c0713fa543424b8f85d7ea90","observation_id":"078c42a0-c316-4d5d-a32e-3ff6b65b56b2","resolution":{"observed_at":"2026-05-18T01:45:37.610569Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1126/sci-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T18:15:21.325607Z","title":"W., et al., 2019, Science, DOI: 10.1126/sci- ence.aaw5903 Barsdell et al., 2010, MNRAS, 408","venue":null,"work_id":"ccf6b19c-18c0-4ca5-82f8-76fdaa1082a5","year":2024},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:d11b2773e5a32c8edaa895bfb4cd054bedd984b8838eeb0ddcca2b62c368cec5","observation_id":"cc832a50-2693-448b-bbcc-ad48be10389b","resolution":{"observed_at":"2026-05-18T01:45:36.630251Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Brand˜ ao, R","venue":null,"work_id":"58f4d360-68a8-4530-aeff-cbbfe769521e","year":2022},"citing_paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-18T01:44:20.954919Z"},"links":{"citing_paper":"/paper/2511.00506"},"observation_digest":"sha256:dc3eea9ed78002f5568458e810be4f5337073ce039faea2ca5b28ea9f625fc13","observation_id":"25b9abcd-dd08-4d8b-b26a-ff121efe44ff","resolution":{"observed_at":"2026-05-18T01:45:37.607483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2511.00506","last_updated":"2026-05-11T13:32:55Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T00:28:44.706213Z","submitted_at":"2025-11-01T11:19:56Z","title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":6,"verified_fuzzy":24},"total_outbound_references":42},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 1 inbound Pith citation observation for arXiv:2511.00506."}