{"as_of":"2026-08-03T01:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5969e7d5309f48d17a9724768e4d0b87d2d177dc9e176deec1421f426df7179","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-02T06:30:47.504484+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-07-06T22:34:38.619949Z","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-02T08:12:47.625160Z","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:c3d1d054dc291425672083dcc31f2492705ef093c6edbcd99d49b03c8eb02645","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:2c145fff06cf48a0f2358a097380bf91e6395d258e722be9b13d305b1241119b","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:3a2c0113afd6a0ecae4537df3a1806b5e3116e59afbfb358b35c9f7e2a177272","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:cb989560a07eb058d8d10a8de02da4ba61db8796157ac8e8845d2b959b7fc61f","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:b9b6b3c7a115bded33ce1509832198bf2091c6d1fe7bba992f9a2f218e040395","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T21:53:32.678356Z","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-07-06T22:34:38.619949Z","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:4ff97ce82116d9c316e88639e0978df9d3ddf50b2884594d6ea97b96670adcd4","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T20:56:40.518889Z","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-07-06T22:34:38.619949Z","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:3d026bce2a07bcd8ea6ceb9fdb9bf619da6ac789771ce5c20d019bc964d3b094","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:a50ab75eab031795d8ac680c2b1f422569725c16d452822e7b6e9677d309291d","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:63272bbb22c4b12e71631d9e297f9994bd22a7cdc8a85bc542e9924423b01e02","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:fcbf2f382248aa86c822b409a4d5ab46f6fa4d912ce9e280033c91eb2219ba38","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:e251b1ba47588cd6a174f0f04629ab3588833944e45d962bebaffc2ee73c90e3","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:297f1e3c3127819f88500e4965cf2a4ea296b8da076481f80af68d546a97c158","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:9ad476dd6382e9645766129cf7d89631b534dd7f44512941bf3088c54bb49d80","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:4c94bdf343121abe89b2a1bc010130958a40d1fec5baddef9bd774b0facf17a1","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:1edeed86e0ed0e17455c974aa39893673407a71a09b17e10ae65fe6198bffa49","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:3d1b126b230d21e931aaff2acc652ec0323ff1152abee193fa68ea16212fa555","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1142/s0219749925400039","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Padmasola, Z","venue":null,"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-07-06T22:34:38.619949Z","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:0f3ac5b7a01d924428d7f786fe6301f24fde8ce9ba90475438c6a50953fa4529","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:6a0169228e7c96a81d15badd71a67831a9c79b925f6ac0f0e080c698dfbbf80c","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:cfcdb4c9868000458770c82d784f27cadf99f215f701a1696066564875ac54c8","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T06:41:34.530788Z","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-07-10T06:15:00.866473Z","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-07-06T22:34:38.619949Z","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:dedb835dcc0db1b0972c3eadaeb687cdd2a5dfdf232b087c9612df314c77f9bb","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:6123a1d3d61c6f50bd8d8903cf6d3725e43ceede821f9b44eaf7f2e34302eaad","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:8bbd0caeb1ac933fbae07772bf1cba7d8d111d9f50ef5314b5cf2edd28e2e8a7","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:741598e80a5bbd62d392fe0b95fe487060e3207abf60ed70292a4e7a49d2845b","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:b5de093d7de65dc58fccce74f039f863cbb306210212e5d4e9c723260446eafb","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:a64b5dd3600026947b7eec2c633b9c12815dd30f71961491480d8765d82d3d06","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:883489090abaacf017e4f25106aef72a26d5b3b6ef936ee895a4e888434a4ae1","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T21:03:58.170015Z","title":"Kotil, E","venue":null,"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-07-06T22:34:38.619949Z","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:53946c9f5f440bc25531a8a4145b8edf72cf986b596f55e3791864393c37884a","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:ab137469bc163060caca2d453a8da82fccf96561d70eda9f2c7b8b314227b0c8","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:c35bd11edec7fe0c9ad3c0a0f19a34675088b9a085de3001ea714cbd11760d96","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:3300e3fb4ced6f4be69600a73263ec8eaa1d582da397599a3d6fddb8e1d91f62","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:34a7b9546cf7d9f1163a733711b4455f517066842f09b04a03b36b4ff0a2e1d9","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:4d6777859abf1505d1f007f7ef8b2fef0be913ad5bb7398b7633cb260d91d64f","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:7183b412aa02c3efdf409e92135f5faaeff3a9e8a6ee85b9f2931b0c3dccbc46","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:6531f231d8a15810935455a9cca0cbf59106edfa1d4fd26b075d71492888ea8a","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:7875fab8e65b38bad53bc0ec52717a26414be958ece4406f071c6f04508bd9b5","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:21886b351779ee0f4090cb470f77bdc9855651a269be46f58fdfa2ef22cbe3aa","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:ccecf9df60bb8a5c4f6ae6498f68d59e1e92aa83f3306e405297ebddf417702c","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:13391e9c1c6373cfe7c8280101593ef89bb84a2e1ba3702bb27329d327a3a388","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T16:07:10.648879Z","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-07-10T06:15:00.866473Z","title":"A feasibility- preserved quantum approximate solver for the capacitated vehicle routing problem","venue":null,"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-07-06T22:34:38.619949Z","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:0ab85f1c40fd93666f24a8c407ea7a40132ab6d171e2a0cdf380b647510e6764","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:f8f072315e38f7e2acb0f30c703a14702a5fce8ccf7afc1fee6556e095d982d6","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:db7bdbfcabf53bf3db00f5235c6902391d788e821856d31bf8c6a38186a88134","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:220db60a90a7e7626f699bad96329ec3b9065e8a87cfd76a30a4d2fe688ed9d9","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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:36448d7d043e7e7478a8bb6e2071ce8fd57ff3fc0e9363ab26e6c0569fc4130e","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-02T06:30:47.504484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+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-07-06T22:34:38.619949Z","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-02T06:30:47.504484+00:00","source":"crossref"},{"observed_at":"2026-08-02T06:30:44.765945+00:00","source":"retraction_watch"}],"thesis":"As of 3 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 1 inbound Pith citation observation for arXiv:2511.00506."}