{"as_of":"2026-07-27T15:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d8ddfbc83a3acd18c5b32d8d4dcc8777dfe17b4d13c8f2df8657127aa530576","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T20:03:55.135103Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-07-27T06:30:09.085275+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.165544Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"cited_work":{"arxiv_id":"2604.04570","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.04570","snapshot_observed_at":"2026-07-09T07:26:03.165544Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","venue":"quant-ph","work_id":"e5491ced-7975-46d8-989b-a739cfc4539c","year":2026},"citing_paper":{"arxiv_id":"2607.07550","last_updated":"2026-07-08T15:48:27Z","snapshot_observed_at":"2026-07-11T23:20:12.927958Z","submitted_at":"2026-07-08T15:48:27Z","title":"RL-Guided Quantum-ALNS for Constrained VRP","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-09T07:24:04.498106Z"},"links":{"cited_paper":"/paper/2604.04570","citing_paper":"/paper/2607.07550"},"observation_digest":"sha256:ffbbbc800873d4557c6d11dbe9fc8c229784cded4bbbbf12ca77114a4d6a046f","observation_id":"6b65aa3c-7c43-4123-832b-07b88ea61bba","resolution":{"observed_at":"2026-07-09T07:26:03.167640Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2604.04570/citation-record","integrity":"/paper/2604.04570/integrity","json":"/paper/2604.04570/citation-record.json","paper":"/paper/2604.04570"},"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":"QOPTLib: a Quantum-Computing-Oriented Benchmark for Combinatorial Optimisation Problems","venue":null,"work_id":"a370155c-787f-41bf-b7f0-066c64b3681a","year":2024},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:a0bdb90a8e5cda70e23de397c582c311cbccfb4b71851d3311c11dc790621a7a","observation_id":"7c574922-ced9-4704-942f-2bd9fd1dd5d3","resolution":{"observed_at":"2026-05-16T02:57:12.941287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.07403","last_updated":"2019-06-14T15:23:57Z","snapshot_observed_at":"2026-07-06T07:15:27.859230Z","submitted_at":"2018-11-18T21:14:55Z","title":"A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer","version":2},"cited_work":{"arxiv_id":"1811.07403","doi":"10.48550/arxiv.1811.07403","metadata_source":"arxiv_reference","pith_arxiv_id":"1811.07403","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"AHybridSolutionMethodfortheCapacitatedVehicleRouting Problem Using a Quantum Annealer","venue":null,"work_id":"6de2abd3-3989-4666-9d00-0b2b350b4141","year":2018},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"cited_paper":"/paper/1811.07403","citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:16ffe962d87ac8678707db75800cbf74ddd38a04b9ca24556f8b166623929aea","observation_id":"469bfb81-a16b-47d7-a9fd-07f0359dffc7","resolution":{"observed_at":"2026-05-10T20:05:45.313043Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.09629","last_updated":"2023-05-07T16:09:22Z","snapshot_observed_at":"2026-07-06T15:17:29.215781Z","submitted_at":"2023-04-19T13:03:50Z","title":"Quantum-Assisted Solution Paths for the Capacitated Vehicle Routing Problem","version":2},"cited_work":{"arxiv_id":"2304.09629","doi":"10.48550/arxiv.2304.09629","metadata_source":"arxiv_reference","pith_arxiv_id":"2304.09629","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Palackal, B","venue":null,"work_id":"c93c23a5-5096-4788-bd07-22f0b661cf2a","year":2023},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"cited_paper":"/paper/2304.09629","citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:6035d636ffe4dc3629212b7c63507a6ef52c41fe18a05cb8525a600f24c81dd4","observation_id":"3f556065-a304-49a4-a6da-d3dcf2fddaf3","resolution":{"observed_at":"2026-05-10T20:05:45.300161Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+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":"c3437c35-845b-4d34-af41-496403573a64","year":null},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:a99311314a9ac03af77a05d0753270ecfc7feab59ced565cedc50a53c95bb3b0","observation_id":"a45fc140-7376-4382-97bb-32a6c47c32ae","resolution":{"observed_at":"2026-05-16T02:57:12.954330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07313","last_updated":"2022-06-15T05:56:22Z","snapshot_observed_at":"2026-07-06T13:20:58.801332Z","submitted_at":"2022-06-15T05:56:22Z","title":"Quantum computing for transport optimization","version":1},"cited_work":{"arxiv_id":"2206.07313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.07313","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"1e37d3cc-16a0-4bb3-874a-e4ad1ad674c2","year":null},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"cited_paper":"/paper/2206.07313","citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:88a948758b5cdaaf2d6f4b32ffaa3a8f514ccc42d3fd7d7a8093bca12270ba6c","observation_id":"c605953e-c634-4f1f-a0b6-a9f702244538","resolution":{"observed_at":"2026-05-10T22:15:50.438757Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11128-024-04497-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem","venue":null,"work_id":"0c9b56dd-2176-43b2-a57f-b16797b761de","year":2024},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:e637a2c868190d496f88525e330cb1a6b6e2eeda87be4d075e75f3a51f5f01e2","observation_id":"b51e8734-0b8c-4c7d-aaa0-71598584c388","resolution":{"observed_at":"2026-05-10T20:05:45.320870Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.14296","doi":"10.48550/arxiv.2511.14296","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Empirical Quantum Advantage in Constrained Optimization from Encoded Unitary Designs","venue":null,"work_id":"a436e971-efba-422e-9c3e-897947b9a579","year":2026},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:e4f3af4fa8d7836f16ada300952b84fca8d33be8be0dc9c08181aa143bc1dccf","observation_id":"141f3d96-b3c0-4de8-a10b-09bf30d716b3","resolution":{"observed_at":"2026-05-10T22:15:50.460392Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.17259","last_updated":"2026-06-10T07:19:35Z","snapshot_observed_at":"2026-07-06T22:36:35.545474Z","submitted_at":"2025-11-21T14:04:01Z","title":"Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement","version":4},"cited_work":{"arxiv_id":"2511.17259","doi":"10.48550/arxiv.2511.17259","metadata_source":"pith","pith_arxiv_id":"2511.17259","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement","venue":"quant-ph","work_id":"51a68981-ff62-41e7-b91e-02a7b4c76536","year":2025},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"cited_paper":"/paper/2511.17259","citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:485d3208472a067f82a237b0a5cad3e9b81fababc08c4bc481c77033b9255e4e","observation_id":"f34dde3d-7284-4b85-9a9a-e74d6b5938ab","resolution":{"observed_at":"2026-05-10T22:15:50.430370Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.01809","last_updated":"2026-04-19T08:11:33Z","snapshot_observed_at":"2026-07-06T22:47:33.195274Z","submitted_at":"2026-03-02T12:44:19Z","title":"Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fej\\'er Filtering","version":2},"cited_work":{"arxiv_id":"2603.01809","doi":"10.48550/arxiv.2603.01809","metadata_source":"pith","pith_arxiv_id":"2603.01809","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fej\\'er Filtering","venue":"quant-ph","work_id":"829335fb-8999-4edd-afbe-c1aa1b776483","year":2026},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"cited_paper":"/paper/2603.01809","citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:5ffa443a8e46b8f5d1f6563f3eacd3fdddb41eb6c84e77edfc7252c95a5e9d6c","observation_id":"66454fb1-d55c-405c-a9a2-d8fe923286d8","resolution":{"observed_at":"2026-05-10T22:15:50.426302Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.11469","last_updated":"2026-05-19T10:52:38Z","snapshot_observed_at":"2026-07-06T22:29:58.066459Z","submitted_at":"2025-09-14T23:23:00Z","title":"Requirements for Early Quantum Utility and Quantum Utility in the Capacitated Vehicle Routing Problem","version":2},"cited_work":{"arxiv_id":"2509.11469","doi":"10.48550/arxiv.2509.11469","metadata_source":"arxiv_reference","pith_arxiv_id":"2509.11469","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"arXiv preprint arXiv:2509.11469","venue":null,"work_id":"acc3c741-1370-4daa-9861-3efa8e6f2d24","year":2025},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"cited_paper":"/paper/2509.11469","citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:1ff01722b8d477d81ac907c48b02246566604142770f5d157b3d5f8cd2a085d9","observation_id":"69c592a5-fdc4-4f42-915b-e2878b1a3c7e","resolution":{"observed_at":"2026-05-20T02:04:44.483449Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.18798145","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zenodo, 2026.doi: 10.5281/zenodo.18798145","venue":null,"work_id":"9f6a468b-c5e3-43ec-aee8-00ca6259408c","year":2026},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:484ae47a6130e075c7e6b337f1facb30a89bb50daba68c1913e36b34e8411bac","observation_id":"b4d8ba14-5f2f-4415-930f-932477cda3e4","resolution":{"observed_at":"2026-05-10T20:05:45.305174Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.317224","doi":"10.1109/tits.2022.3172241","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm","venue":null,"work_id":"5e9e387d-e648-4b7f-88cb-26c244139bda","year":2023},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:e8660d6099913cfc6f6b2ed32318058eccd540cc0e7014f0a0a85b9cb16b309f","observation_id":"c53ee99e-2437-4156-8a23-bd46b8432f4d","resolution":{"observed_at":"2026-05-10T20:05:45.303419Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.01614","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum- assisted vehicle routing: Realizing qaoa-based approach on gate-based quantum computer","venue":null,"work_id":"55d0d1fd-1f20-4a70-ae32-da303303ca90","year":2025},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:0f217a260a7d512f4a216d196c4e3612ba412a6566881dd0f01287b3923642a9","observation_id":"017fd113-0f42-4749-a734-2997fe27face","resolution":{"observed_at":"2026-05-10T22:15:50.446175Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41598-024-76967-w","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Applying Quantum Approximate Optimization to the Hetero- geneous Vehicle Routing Problem","venue":null,"work_id":"a234fdf8-997b-40c7-a29b-d070d52302eb","year":2024},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:5cf5bcac2c01d80c2b6089d89ba67cd8efd357a2991e4b8c1596fb0db87e2122","observation_id":"814e8bfe-25fd-46ee-9d1a-43637d596c28","resolution":{"observed_at":"2026-05-10T20:05:45.306982Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/a12020034","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T15:07:19.348176Z","title":"Rieffel, Davide Venturelli, and Rupak Biswas","venue":null,"work_id":"73702b6c-27de-4cce-a336-b2d8a47f4ca6","year":2019},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:bf159b0d15367fbedf3a0b8825e51e184ad8664f3678933bbcae51f0c43c345e","observation_id":"caf7b9d8-3bf4-43fb-965f-127d6c084498","resolution":{"observed_at":"2026-05-10T20:05:45.297209Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-05-23T16:54:09.919654+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T16:54:09.919654+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/a15060202","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T11:59:26.065724Z","title":"Constraint Preserving Mixers for the Quantum Approximate Optimization Algorithm","venue":null,"work_id":"58cb93cb-ee56-47b6-a3f2-e316a6e1b195","year":2022},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:37dabbef852a71d3c324cedeb99ffa9a176ecdc8254b61669c97beac23a0af49","observation_id":"054d722f-a462-4623-a1da-0ff9eca566ba","resolution":{"observed_at":"2026-05-10T20:05:45.318758Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.13787","last_updated":"2024-01-22T00:55:03Z","snapshot_observed_at":"2026-07-06T16:23:02.443154Z","submitted_at":"2023-09-25T00:35:40Z","title":"Symmetries and Dimension Reduction in Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"2309.13787","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.13787","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Symmetries and dimension reduction in Quantum Approximate Optimization Algorithm","venue":null,"work_id":"99cc7d42-b1eb-4156-87ed-bb422777c79e","year":2023},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"cited_paper":"/paper/2309.13787","citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:263eb5f398a743b48404017a52515556d9a87630fed9936edef0069b14fd756a","observation_id":"c1163371-731d-4d63-adf1-a5309fc62306","resolution":{"observed_at":"2026-05-10T22:15:50.449688Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7206.347746","doi":"10.1145/3477206.3477464","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"On the Co-Design of Quantum Software and Hardware","venue":null,"work_id":"7d05a582-2823-4569-8091-a43dd58754b3","year":2021},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:a1cd59dd1bf3494ccee42d4107e34dca95f7b42c4d2b4c099f3edcde1ce1916c","observation_id":"9897ff9d-e62c-428b-af2a-7b6294476d2c","resolution":{"observed_at":"2026-05-10T20:05:45.316140Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+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":"Ayrton et al.Qiskit: An Open-source Framework for Quantum Computing","venue":null,"work_id":"fe80c7f3-b8d0-4298-a722-380e9466c293","year":2023},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:7e19bf062df29acb65395aad3d1334023ff9358be96e9b8560d6062650ac0201","observation_id":"0162690a-0957-4bd3-841e-92ca9258c20a","resolution":{"observed_at":"2026-05-16T02:57:12.936915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physrevlett.91.147902","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T18:14:58.949443Z","title":"Vidal ,\\ 10.1103/PhysRevLett.91.147902 journal journal Phys","venue":null,"work_id":"15eadd66-1735-4893-8ded-d41f9409d506","year":2003},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:4010efc916801b2add52069c8ff93b08016f23afec1740221c501a696803a532","observation_id":"7d81ad91-377d-4697-b3f3-5625196176da","resolution":{"observed_at":"2026-05-10T20:05:45.329841Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-14T20:50:09.664454+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T20:50:09.664454+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-27T06:30:01.563335+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":"2026.url:https: //www.gurobi.com","venue":null,"work_id":"5caaabf4-6919-4fd4-967a-f60ff19b4b1b","year":2026},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:b8e96a4b9e4dac6fc44ec0ce92be0f7ae4f47facbcba67f01ee630dfe0733c37","observation_id":"c8003f33-fae6-41c6-b92a-e76abef4aa97","resolution":{"observed_at":"2026-05-16T02:57:12.950347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-020-01523-z","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A generic exact solver for vehicle routing and related problems.Mathematical Programming, 183:483 – 523","venue":null,"work_id":"eff2510e-36d3-4d07-883d-2ebf73febd5a","year":2019},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:12a448e3d2ed2a3846d4c16613ab4baf40a06597a410b438cfe860615c1bb478","observation_id":"e01d41a3-506e-4cc4-970a-eae9f1d238be","resolution":{"observed_at":"2026-05-10T20:05:45.327618Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2013.09.045","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Unified Solution Framework for Multi-Attribute Vehicle Routing Problems","venue":null,"work_id":"94ee02aa-2dcf-495a-814d-4502033ffbb4","year":2014},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:e918386f69458e84624c4a7790271609b967ff5716115eaab8aa3b4f1aae4842","observation_id":"5e1d1b41-2564-4728-9734-0b1c1e91307c","resolution":{"observed_at":"2026-05-10T20:05:45.323116Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+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":"Accessed: 2026-04-04","venue":null,"work_id":"595c0147-ea5a-48cb-b14a-56c598f34324","year":2026},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:cf88c5949c01366e5b1c980fbb8e6808485fb85614b207bffbc8a686f40240fa","observation_id":"1b940771-9700-40c9-8cb1-1428fbd569c4","resolution":{"observed_at":"2026-05-16T02:57:12.945779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+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":"Accessed: 2026-04-04","venue":null,"work_id":"be126fb1-aed8-43ff-ab4e-9f12c5809233","year":2026},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:ff8916d508d4366e8ad03deb26608bbb36de93e43a98b9abf64d38ef029cd1c0","observation_id":"6d15e218-d0a4-4a67-9ae3-c32ceadfe31f","resolution":{"observed_at":"2026-05-16T02:57:12.958174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T08:26:04.647696Z","title":"https://doi.org/10.1007/978-1- 4684-3384-5_11","venue":null,"work_id":"0fad01c3-852a-4d24-8bcd-0f8abadae6ba","year":2011},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:08808d2729e1d3c58005fda8771556a7a312ee8c2f4283e93206058bce339036","observation_id":"5e861ad4-0c3e-43a7-b239-65f9eb7f003b","resolution":{"observed_at":"2026-05-10T20:05:45.325543Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611973594","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Society for Industrial and Applied Mathematics, Philadelphia, PA, 2014.doi:10.1137/1.9781611973594","venue":null,"work_id":"aafd44f8-3c63-4f37-a6b5-1ad82303fbc4","year":2014},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:3696490e5e13192a15f4ede5dc3838fe8477f2670a98150ef9e5ddc96e565a34","observation_id":"d7b71ef9-a06d-47ec-b382-3c1f47f95c41","resolution":{"observed_at":"2026-05-10T20:05:45.335307Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2018.0878","doi":"10.1287/trsc.2018.0878","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Exact Branch-Price-and-Cut Algorithms for Vehicle Routing","venue":null,"work_id":"4aea3db3-1685-4192-98e9-afd5ea481b46","year":2019},"citing_paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T20:03:55.135103Z"},"links":{"citing_paper":"/paper/2604.04570"},"observation_digest":"sha256:0a8a1324cbd2dc0f9cdc6e602553a757619f8fe8afef66902c3ca4d3962fbc46","observation_id":"b4f24899-bce1-4d46-b200-5499af788f3e","resolution":{"observed_at":"2026-05-10T20:05:45.333094Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-27T06:30:09.085275+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:50.10863+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:50.10863+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.04570","last_updated":"2026-05-04T09:43:41Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T22:53:29.118925Z","submitted_at":"2026-04-06T10:08:41Z","title":"Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":0,"verified_exact":18,"verified_fuzzy":6},"total_outbound_references":28},"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-07-27T06:30:09.085275+00:00","source":"crossref"},{"observed_at":"2026-07-27T06:30:01.563335+00:00","source":"retraction_watch"}],"thesis":"As of 27 July 2026, this Paper Citation Record lists 28 of 28 outbound references and 1 inbound Pith citation observation for arXiv:2604.04570."}