{"as_of":"2026-08-13T16:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:10ec6ddfaf936f0536f8e4671562d6a8fdb9ba94bbf062400bb9d6187a1e0bfc","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:04:38.432576Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.05394/citation-record","integrity":"/paper/2608.05394/integrity","json":"/paper/2608.05394/citation-record.json","paper":"/paper/2608.05394"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.394762Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.394762Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:45f89ba1b55095dea293632a905510372b90f0331fcd8f994a9736f10bac5ebc","observation_id":"6054b509-5e93-40cc-bff6-7a92fc0aa518","resolution":{"observed_at":"2026-08-08T14:04:38.394762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2024.04879","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:39.291597Z","title":"Journal of Quantum Computing 6, 25–51","venue":null,"work_id":"a611c421-2d48-4dc5-89b7-069221faf053","year":2024},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.332810Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:3c3ec1b5c10d448ac914bee3e3a694c3a8fa6871b9ce225aff4b26f5754150ae","observation_id":"b5ffec78-8c47-4cf5-8fd2-2970abe20c23","resolution":{"observed_at":"2026-08-08T14:04:39.296401Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.353519Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.353519Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:2fa2c350e916ae31dffb67c7a60fd510369ba1444758400695f7789a4acd523f","observation_id":"88564778-903a-4a58-82e9-861584965f6c","resolution":{"observed_at":"2026-08-08T14:04:38.353519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.371567Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.371567Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:091f8507c438b0bc57dc8e1e3becb8fa7210cb3d404339530951f052963d36f3","observation_id":"a84a35a6-50e0-4b51-b53e-6679962f4b8c","resolution":{"observed_at":"2026-08-08T14:04:38.371567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41598-023-38787-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Scientific Reports","work_id":"b5b7823e-1e91-46ca-bc50-3c6f914f1e70","year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.346527Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:ec3b75335876b955494cd145157bfd8c87539bae11d11a9b5f64031022dbb810","observation_id":"dbc28a39-ffd2-4ed0-870d-0f34473b0e38","resolution":{"observed_at":"2026-08-08T14:04:38.569187Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41598-024-70649-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Ștefan, Leon, F.,","venue":"Scientific Reports","work_id":"7ad6a6a2-3d9d-4fc8-8428-4aa150ad349a","year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.336367Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:a5bc185c07ef47d0571aafda6e15f4965ec129b7e53ceb5dbeb98d61cc5991cf","observation_id":"89c7e340-e596-4c66-9b62-7d20146cfb82","resolution":{"observed_at":"2026-08-08T14:04:38.597653Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.356798Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.356798Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:68f3ba9af9573eee9bb9412b5068921de2183b75413801bce56a72d1a6dcc511","observation_id":"784c6f71-8e2f-40df-b9f3-589e61677130","resolution":{"observed_at":"2026-08-08T14:04:38.356798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/app16041690","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Applied Sciences","work_id":"dc1cd111-d70b-49d9-824d-f42f508590d0","year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.340077Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:1d5213e5f7b88276d901a381ad28bb88505dc5c786e167676578eac2cf29e5c5","observation_id":"9a24c3b6-d95c-44f7-985d-5659b8b77d2c","resolution":{"observed_at":"2026-08-08T14:04:38.588461Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.364478Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.364478Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:ab1b184c5699ab826d0a079974f99ef9a41815850d275451a6a0a377b540eb0d","observation_id":"8e42f453-e7eb-4a06-87b5-2238af62b62a","resolution":{"observed_at":"2026-08-08T14:04:38.364478Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.385218Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.385218Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:6eee9b95cace2c40cd393baa660d3414006c698128b117ed12d712cf74b8664e","observation_id":"32d225a8-b402-4ec8-bce2-0e08cf4c51f7","resolution":{"observed_at":"2026-08-08T14:04:38.385218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.trb.2016.03.009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Transportation Research Part B: Methodological 89, 19–42","venue":"Transportation Research Part B Methodological","work_id":"d0a5cc08-331d-4af9-b277-7b300a6cf592","year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.388691Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:13a22434ec50bc6d9f61a388c9d03fde8c71aaaa7afd7ac43d8e003d49d1532d","observation_id":"eafa5448-e81e-474a-a42b-4d2e3a02fdab","resolution":{"observed_at":"2026-08-08T14:04:38.517143Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.trb.2017.02.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Transportation Research Part B: Methodological 100, 115–137","venue":"Transportation Research Part B Methodological","work_id":"db0fe91f-36d6-477b-b136-d24ec822c84b","year":2017},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.401266Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:285f3487ab1c4d80953f86eb422e96dc7c760e113075163cc464c38ccdca0efb","observation_id":"79709025-8b3e-4b37-8fcc-68fcbc4693c4","resolution":{"observed_at":"2026-08-08T14:04:38.507654Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.404311Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.404311Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:3548f0898af15caa7158bef0ffda91d2ef597c167e4444f9d876c19be4513b0b","observation_id":"0b6d5be4-0bf7-4396-8fb0-f6caecd6ba5b","resolution":{"observed_at":"2026-08-08T14:04:38.404311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.407437Z","title":"arXiv preprint arXiv:2501.03194+","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.407437Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:29df950031730e1f25b7bf9d90a0c9e0df286e241c15d028d61378fbd3a6e993","observation_id":"56aff3a0-bb53-4578-b154-8635d0d3a340","resolution":{"observed_at":"2026-08-08T14:04:38.407437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10950","last_updated":"2021-05-23T14:50:14Z","snapshot_observed_at":"2026-07-06T11:11:58.263934Z","submitted_at":"2021-05-23T14:50:14Z","title":"A review of approaches to modeling applied vehicle routing problems","version":1},"cited_work":{"arxiv_id":"2105.10950","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.10950","snapshot_observed_at":"2026-08-08T14:04:38.750093Z","title":"A review of approaches to modeling applied vehicle routing problems","venue":"cs.AI","work_id":"f4f1bf23-4761-4154-9461-1c0a3c38707d","year":2021},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.410742Z"},"links":{"cited_paper":"/paper/2105.10950","citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:8aa0201be1a541e08c3b7fb3e9921e8d23f1d11ac94701eb8287c6bfdc1c3db0","observation_id":"c2f06b58-3314-4edf-8632-6e27483fa8da","resolution":{"observed_at":"2026-08-08T14:04:38.753785Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.417288Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.417288Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:7a4dce2f8b1ef1e2ec98b7191ddd2ff8b94ba8f4c0c4bbb738a08dc7eef53dae","observation_id":"f039eb6b-51e7-48b1-986c-c8024195834e","resolution":{"observed_at":"2026-08-08T14:04:38.417288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.trb.2023.03.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Transportation Research Part B: Methodological","venue":"Transportation Research Part B Methodological","work_id":"cb53a6f6-7fd6-400e-9806-0e2838f26478","year":2023},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.423325Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:097112a4c7452499053f29dec1ebbb26644120fb77a0a2d2767e5812e4dd31c7","observation_id":"b3c973d2-8c2f-485c-af30-051350d64fd0","resolution":{"observed_at":"2026-08-08T14:04:38.482587Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.trb.2019.09.009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Transportation Research Part B: Methodological 129, 156–174","venue":"Transportation Research Part B Methodological","work_id":"700c2c0e-60c9-47e1-9d34-f2adf971c102","year":2019},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.426493Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:d419292abf0aa13a5ea6d6935253d646f3f0e575d5c45087fcfbda97c216cdaf","observation_id":"b81d8ffb-20e1-4855-a264-0491fb2f5c45","resolution":{"observed_at":"2026-08-08T14:04:38.472674Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.trb.2023.01.002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Transportation Research Part B: Methodological 168, 124–150","venue":"Transportation Research Part B Methodological","work_id":"de441dc9-3bf8-4575-aece-37a83712dff8","year":2023},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.429563Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:5014f8e7fa46ab65475624ff672e1e3076ae26f9e7654dc1424f9df91d7d3147","observation_id":"d8e35e56-d3be-43f8-affa-02af08581c22","resolution":{"observed_at":"2026-08-08T14:04:38.461767Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.432576Z","title":"Chain 1, 138–149","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.432576Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:b20b866ff7f8107cede2ebb4b21d5b75fa03ee9b95624c2b244f414b27aba78c","observation_id":"7495626b-9936-4524-aa82-eb6f930f53a3","resolution":{"observed_at":"2026-08-08T14:04:38.432576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1088/1751-8121/ad00f0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Journal of Physics A Mathematical and Theoretical","work_id":"5a73c049-ca3d-43ca-8809-b5583367d063","year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.414182Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:b2371431132d6ffa62fdbd4f94ff022d6ef0c72a39d21cb935599c55ae4ceb8f","observation_id":"03ed2e39-c5a7-42a0-973b-a076cb401d4f","resolution":{"observed_at":"2026-08-08T14:04:38.498185Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.367984Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":192,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.367984Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:6fa06c3e8ce35483eb05e75a5d150c43e7515306fdff28212bcabf6dfa4aca11","observation_id":"05461ae7-855b-4be6-8032-ab3191bac093","resolution":{"observed_at":"2026-08-08T14:04:38.367984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.391765Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":198,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.391765Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:bab6bdcc0fc52ab6b9ea9818cfbbb68493faaee88cfd1238c0cc8b81a7988167","observation_id":"97aeb4a0-8519-4ad6-9127-5219484c3d13","resolution":{"observed_at":"2026-08-08T14:04:38.391765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2025.10331","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.735334Z","title":null,"venue":null,"work_id":"9a314466-6bfd-40e2-9134-ac46f849d588","year":2025},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":200,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.420376Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:7269816eda94cc461b03127fca8999c035a57c2d4e91388166568ffbd144278e","observation_id":"bb5c187d-50b6-4e60-baa6-32708697d85c","resolution":{"observed_at":"2026-08-08T14:04:38.740402Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.382025Z","title":"Networks 11, 221–227","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":1981,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.382025Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:2bfb84c5efac8d05f6e987ec56ece85f76117ceea930b8ae4ca2b4b4c8e96781","observation_id":"84add339-716a-4b42-b77a-ac1381c14d6f","resolution":{"observed_at":"2026-08-08T14:04:38.382025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-08T14:04:38.350113Z","title":"arXiv preprint arXiv:1411.4028","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.350113Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:71e97f2b26265131a006c01727f2d81449b9e25193eb94a7320a45d6cb37d204","observation_id":"e596985e-9a11-477d-8790-dd79f884d9b0","resolution":{"observed_at":"2026-08-08T14:04:38.350113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11227-016-1739-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"The Journal of Supercomputing","work_id":"9f6487e0-74f4-48ac-939d-1f8dcb2423f6","year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.343250Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:4336485ed229560bd541b1767e21d0229672f1b65c83fcacc45b9588c5f552fe","observation_id":"6787661a-eaed-4162-bad3-944bf2d34865","resolution":{"observed_at":"2026-08-08T14:04:38.578614Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.trb.2016.10.013","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Transportation Research Part B: Methodological 95, 169–195","venue":"Transportation Research Part B Methodological","work_id":"04337950-9948-4f16-b903-238b94c354c9","year":2016},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.378488Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:53f482decfbf9317753300f0eb063e5776d78c76b947c721d2ec37daa8f4c897","observation_id":"8d7d5a61-6f6c-4b65-b62f-06e833b835a8","resolution":{"observed_at":"2026-08-08T14:04:38.532164Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.11538","last_updated":"2019-11-04T20:50:57Z","snapshot_observed_at":"2026-08-11T03:19:34.808522Z","submitted_at":"2018-11-13T18:38:34Z","title":"A Tutorial on Formulating and Using QUBO Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.11538","snapshot_observed_at":"2026-08-08T14:04:38.360609Z","title":"arXiv preprint arXiv:1811.11538","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.360609Z"},"links":{"cited_paper":"/paper/1811.11538","citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:44b23fb36b5f03b8b253f193b7f922d4b39203ca8c21d10b6745c21121d70890","observation_id":"1fde1123-f172-4773-b0df-cb98dc310b76","resolution":{"observed_at":"2026-08-08T14:04:38.360609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12134","last_updated":"2019-05-28T23:29:38Z","snapshot_observed_at":"2026-07-06T07:56:17.069864Z","submitted_at":"2019-05-28T23:29:38Z","title":"Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth","version":1},"cited_work":{"arxiv_id":"1905.12134","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.12134","snapshot_observed_at":"2026-08-08T14:04:38.892779Z","title":"Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth","venue":"quant-ph","work_id":"013231cb-a3d0-45ea-b829-833026d8e644","year":2019},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.397791Z"},"links":{"cited_paper":"/paper/1905.12134","citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:17d4fd7f21648f3f3d9861b42c3e96f66e85561c5b3d84a90656d52b43077139","observation_id":"d3505a42-6e93-4d97-9a37-4a5588a5d27f","resolution":{"observed_at":"2026-08-08T14:04:38.897232Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.374907Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.374907Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:f37814cdcc3a1173f05b1dddd63b6392e9efad70b809c4d402fac16c2118d74e","observation_id":"a141790f-6195-4b35-b9ae-b95b5d6435c8","resolution":{"observed_at":"2026-08-08T14:04:38.374907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-04148-8_11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Springer, pp","venue":"Lecture notes in computer science","work_id":"d2649871-d3f6-4b0a-b24f-543e4c594910","year":null},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.320944Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:19e6d7321958bf1139a395b0675123ad4a4e17a7ba97c961adff17aaeb9f2bf3","observation_id":"346f9d0f-a1b4-441d-8dd6-b80363b921a7","resolution":{"observed_at":"2026-08-08T14:04:38.606835Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.324273Z","title":"IEEE Transactions on Intelligent Transportation Systems 24, 7564–7573","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.324273Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:135bd2ba55b244afac7b27a2b3e57116b351a9161ae5425a81c1a451940c6d3f","observation_id":"e82e8779-b6fc-49de-88eb-e6284d187529","resolution":{"observed_at":"2026-08-08T14:04:38.324273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:04:38.317150Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.317150Z"},"links":{"citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:d5b9caab961dfe3c87e09ee3a22633b37842d8877be0114351b5be968eb3cb16","observation_id":"e06866fa-9b8c-4f43-a001-25cc290777bd","resolution":{"observed_at":"2026-08-08T14:04:38.317150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.01214","last_updated":"2025-06-05T08:38:30Z","snapshot_observed_at":"2026-08-07T15:57:04.373241Z","submitted_at":"2025-05-02T12:04:46Z","title":"A Warm-start QAOA based approach using a swap-based mixer for the TSP: theoretical considerations,implementation and experiments","version":2},"cited_work":{"arxiv_id":"2505.01214","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.01214","snapshot_observed_at":"2026-08-08T14:04:39.305395Z","title":"A Warm-start QAOA based approach using a swap-based mixer for the TSP: theoretical considerations,implementation and experiments","venue":"quant-ph","work_id":"18758a09-4a88-4e9a-938f-594fad79e620","year":2025},"citing_paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-08T14:04:38.328622Z"},"links":{"cited_paper":"/paper/2505.01214","citing_paper":"/paper/2608.05394"},"observation_digest":"sha256:a6561214ec67ccffccf92092784f08567345e36bdb0dd23a50ec7605bba8d646","observation_id":"7422fc8d-b6da-4e8c-ae6e-a054ccb97e81","resolution":{"observed_at":"2026-08-08T14:04:39.309067Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.05394","last_updated":"2026-08-05T20:24:46Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T03:21:14.006997Z","submitted_at":"2026-08-05T20:24:46Z","title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":17,"verified_exact":14,"verified_fuzzy":0},"total_outbound_references":35},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2608.05394."}