{"as_of":"2026-08-10T11:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96924b3ec30c597e609730a6e76210d5710b1740c64df70bd3de7d6271170957","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:58:01.408433Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2505.23098/citation-record","integrity":"/paper/2505.23098/integrity","json":"/paper/2505.23098/citation-record.json","paper":"/paper/2505.23098"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:58:04.459263Z","title":"Thevehicleroutingproblemwithmultipleprioritizedtimewindows:Acasestudy","venue":null,"work_id":"4995e004-c561-43d4-8590-d4b9d51c44e2","year":2015},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:57:59.899233Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:5d003eb4f0ef0c5a1d9dac34bb091141717242b1da97effe6e243ff8e716bf61","observation_id":"6f690b69-355f-43a0-866a-ae93b3ca589a","resolution":{"observed_at":"2026-08-07T12:58:04.522643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.09100","last_updated":"2020-06-16T12:08:10Z","snapshot_observed_at":"2026-08-09T14:12:18.650441Z","submitted_at":"2020-06-16T12:08:10Z","title":"Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.09100","snapshot_observed_at":"2026-08-07T12:58:00.239450Z","title":"arXiv preprint arXiv:2006.09100","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.239450Z"},"links":{"cited_paper":"/paper/2006.09100","citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:f6428fe44383f898d152468000500307fe2405ff7724f13e5001d89d9d7851b3","observation_id":"9b6cc037-3ddd-4e2b-9fc4-281fd7075275","resolution":{"observed_at":"2026-08-07T12:58:00.239450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08539","last_updated":"2020-02-20T02:39:02Z","snapshot_observed_at":"2026-07-06T08:58:39.542748Z","submitted_at":"2020-02-20T02:39:02Z","title":"Learn to Design the Heuristics for Vehicle Routing Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08539","snapshot_observed_at":"2026-08-07T12:58:00.387265Z","title":"arXiv preprint arXiv:2002.08539","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.387265Z"},"links":{"cited_paper":"/paper/2002.08539","citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:5f1b2d71fc92cae4c6ea3dc1fdf1387ca0c415f6be4a4039218f4a6c06c3c655","observation_id":"fbae45de-61c1-4d54-b924-afec817a0659","resolution":{"observed_at":"2026-08-07T12:58:00.387265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:58:04.064244Z","title":"Transportation Science 54, 400–416","venue":null,"work_id":"6cd91c93-eb51-4ead-8281-164cc3cd641a","year":2021},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.597603Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:10a20efb6e0700d0dff9af5c665d41e49759ed7b0cc81e5124e3de1dd5287bea","observation_id":"a77d4d25-caa6-4927-b710-d4d2d6f4e28a","resolution":{"observed_at":"2026-08-07T12:58:04.122141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.11344","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:58:02.618677Z","title":"Expert Systems with Applications 153, 113444","venue":null,"work_id":"3c994f17-deaa-4109-85b0-078bfcf1b644","year":2020},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.673450Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:436a02c30c8d5dffd8e1c51d70c99311cacc4519734126d9334b36ba7515b06f","observation_id":"26c61fe1-e746-4829-bfe9-fdcb1b868fd6","resolution":{"observed_at":"2026-08-07T12:58:02.670042Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06789","last_updated":"2023-05-24T01:20:16Z","snapshot_observed_at":"2026-08-10T03:12:27.222917Z","submitted_at":"2023-02-14T02:18:23Z","title":"On the fluid slip along a solid surface","version":2},"cited_work":{"arxiv_id":"2302.06789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.06789","snapshot_observed_at":"2026-08-07T12:58:02.333282Z","title":"On the fluid slip along a solid surface","venue":"physics.flu-dyn","work_id":"44d7c15f-0bb4-4fa4-8689-17c758ac74e3","year":2023},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.903485Z"},"links":{"cited_paper":"/paper/2302.06789","citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:025cf0a97424113183e28358492288313747b420c8732e6e053efe379f410483","observation_id":"65ef6069-3a78-435f-9676-ea2765cdec31","resolution":{"observed_at":"2026-08-07T12:58:02.404932Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1110.0396","last_updated":"2011-10-03T16:11:19Z","snapshot_observed_at":"2026-07-06T02:35:05.258609Z","submitted_at":"2011-10-03T16:11:19Z","title":"Calibrating 15 years of GOLF data","version":1},"cited_work":{"arxiv_id":"1110.0396","doi":null,"metadata_source":"pith","pith_arxiv_id":"1110.0396","snapshot_observed_at":"2026-08-07T12:58:02.097637Z","title":"Calibrating 15 years of GOLF data","venue":"astro-ph.SR","work_id":"f623f182-8f74-4f96-affb-9ee4a8a47b71","year":2011},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:01.217347Z"},"links":{"cited_paper":"/paper/1110.0396","citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:0e4010dbadfb376421e69754a44d09de48b4800ee0a7066ca00712c90335aec7","observation_id":"190b6a72-9ce8-49a2-9bbb-616afade8ceb","resolution":{"observed_at":"2026-08-07T12:58:02.205279Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:58:03.379363Z","title":"Society for Industrial and Applied Mathematics","venue":null,"work_id":"f21651f8-1723-4e93-be62-8b2e356fb036","year":2021},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:01.408433Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:d6d80722fa5a69ea9e31fff19183cecf21dbdf1b2eba1eb9fa61b6fb9a820a15","observation_id":"3ab59c2d-4afd-47ad-a65b-88008597b83e","resolution":{"observed_at":"2026-08-07T12:58:03.412011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:58:04.188694Z","title":"European journal of operational research 130, 449–467","venue":null,"work_id":"759deac0-8f47-4b4c-9cce-6e183cbb0d41","year":2017},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.542209Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:ef7bfe10c95e558dad120b58f5c30547f2e39c7ab8bec349961fb8d2378e5be7","observation_id":"8734b1f3-f251-4ede-89b0-f0dd9e724a34","resolution":{"observed_at":"2026-08-07T12:58:04.273764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:58:04.346482Z","title":"EURO Journal on Transportation and Logistics 1, 285–306","venue":null,"work_id":"3a6663ea-552c-417d-a2e2-599f902bc523","year":2010},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.472523Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:6bbb6adbe6c392da190d8de58c0e682b14ea4f2c84a5b2abb0246210988c3d11","observation_id":"b1e00710-de7d-490b-abbc-fb1bda500900","resolution":{"observed_at":"2026-08-07T12:58:04.382096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:58:03.658571Z","title":"Transportation Science 47, 81–107","venue":null,"work_id":"0b46c969-93a1-4864-a277-569176c71486","year":2022},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.986256Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:d00218a16104bdb0cb0ae11d4006ff7813f697ac7b7518d4431529144558694d","observation_id":"05273d12-698e-4731-b8ed-0b2f491be0d5","resolution":{"observed_at":"2026-08-07T12:58:03.734637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10732-019-09412-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Computers & Operations Research 52, 269–281","venue":"Journal of Heuristics","work_id":"e2939aa1-dab5-4977-b4b3-b5c4e12e15ec","year":2019},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-07T12:57:59.938273Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:441b3401f1f1a734cd532d1d637665684e5770d419c4cfcb353700b4a6425e11","observation_id":"dd4d752a-07a6-471e-8952-c9c972806546","resolution":{"observed_at":"2026-08-07T12:58:01.792999Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02438","last_updated":"2018-10-20T18:55:07Z","snapshot_observed_at":"2026-08-09T23:04:15.431743Z","submitted_at":"2015-06-08T11:12:48Z","title":"High-Dimensional Continuous Control Using Generalized Advantage Estimation","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.02438","snapshot_observed_at":"2026-08-07T12:58:01.083151Z","title":"arXiv preprint arXiv:1506.02438","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:01.083151Z"},"links":{"cited_paper":"/paper/1506.02438","citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:8d94125eb078c13376d528ac7ea3d8b12a6dcc98a7e4e57e9ebe6351b3bdeae9","observation_id":"cfc764f0-87ee-491a-8694-a37ea38df6cd","resolution":{"observed_at":"2026-08-07T12:58:01.083151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:58:03.508306Z","title":"nature 550, 354–359","venue":null,"work_id":"3eca82f7-8cb0-4f17-8457-de546b79ec43","year":1987},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:01.136518Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:8a3c2f7dd104623dbc9bb85e788c41d0afc92985369ec424b327965ce2b922fa","observation_id":"26e625fa-1b00-4750-b521-31227e55305c","resolution":{"observed_at":"2026-08-07T12:58:03.588154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.endm.2018.03.027","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Electronic Notes in Discrete Mathematics 66, 207–214","venue":"Electronic Notes in Discrete Mathematics","work_id":"018ce739-98ef-45bf-9b96-12da950539c7","year":2018},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.319340Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:e91ca5e8088a22e07a818533fde43ed81b567865cb4023a6e553056f7bc17f00","observation_id":"79bfa240-0149-4329-94d0-dcdf8688362b","resolution":{"observed_at":"2026-08-07T12:58:01.623954Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:58:03.941553Z","title":null,"venue":null,"work_id":"ec77dfe6-f20b-43dd-8825-6507d443efe3","year":2022},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.739072Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:e6bc5d8212efb17301936815890800b63d36482f8768e483e042938462fe75f2","observation_id":"a68eb9b8-1952-4c7a-9ef0-bf5bffce9e77","resolution":{"observed_at":"2026-08-07T12:58:04.000317Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.09330","last_updated":"2020-05-19T09:50:35Z","snapshot_observed_at":"2026-08-08T19:45:23.191077Z","submitted_at":"2020-05-19T09:50:35Z","title":"Dynamic Partial Removal: A Neural Network Heuristic for Large Neighborhood Search","version":1},"cited_work":{"arxiv_id":"2005.09330","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.09330","snapshot_observed_at":"2026-08-07T12:58:02.797207Z","title":"Dynamic Partial Removal: A Neural Network Heuristic for Large Neighborhood Search","venue":"cs.NE","work_id":"54645740-46eb-4d9f-8791-cc27391331f8","year":2020},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.160594Z"},"links":{"cited_paper":"/paper/2005.09330","citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:92049c3afd2e58ae87ef3f7a493a89065ba86dfaba2009e07e60ba485c82aa19","observation_id":"e627eb50-ebf0-405b-9bc6-873a405664c5","resolution":{"observed_at":"2026-08-07T12:58:02.844435Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:58:03.797724Z","title":"Computers & Operations Research 134, 105400","venue":null,"work_id":"2a10a0ac-af30-45fb-975b-7aae8fd1b1b9","year":2021},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.828272Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:496e18fa139a7e747f20da4aa5b6a5a1c0b855b6b5abf33dd6ef6bc484acf91f","observation_id":"f8014084-d3ef-483a-9812-e153a9b31522","resolution":{"observed_at":"2026-08-07T12:58:03.862885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.09860","last_updated":"2022-07-29T06:18:56Z","snapshot_observed_at":"2026-07-06T13:33:24.543977Z","submitted_at":"2022-07-20T12:51:06Z","title":"Learning to Solve Soft-Constrained Vehicle Routing Problems with Lagrangian Relaxation","version":3},"cited_work":{"arxiv_id":"2207.09860","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.09860","snapshot_observed_at":"2026-08-07T12:58:01.907535Z","title":"Learning to Solve Soft-Constrained Vehicle Routing Problems with Lagrangian Relaxation","venue":"cs.AI","work_id":"3f7ec9fd-458d-45c7-969f-ec8cf329d66a","year":2022},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:01.298257Z"},"links":{"cited_paper":"/paper/2207.09860","citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:ead9dde4a4116ba2c1aef791cbb8d8dcfc5fff24d65dfaa70d11723cb0fbac76","observation_id":"d15ca18f-ea19-40c6-8b61-e66f8a6a4eb9","resolution":{"observed_at":"2026-08-07T12:58:01.990478Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T12:58:00.024058Z","title":"Computers & Operations Research 149, 106016","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.024058Z"},"links":{"citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:3e792896a0a06929752a9d4de0a12ef41276aeab59fe07706906212e3bfdd1a3","observation_id":"73ba7d2a-4317-4c09-abc5-02cc2bcfce7c","resolution":{"observed_at":"2026-08-07T12:58:00.024058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05318","last_updated":"2024-03-08T13:49:21Z","snapshot_observed_at":"2026-07-06T17:41:34.856417Z","submitted_at":"2024-03-08T13:49:21Z","title":"Looking Ahead to Avoid Being Late: Solving Hard-Constrained Traveling Salesman Problem","version":1},"cited_work":{"arxiv_id":"2403.05318","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.05318","snapshot_observed_at":"2026-08-07T12:58:02.896442Z","title":"Looking Ahead to Avoid Being Late: Solving Hard-Constrained Traveling Salesman Problem","venue":"cs.AI","work_id":"21804ffa-ee04-4c8e-84e0-e75432e58849","year":2024},"citing_paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T12:58:00.090790Z"},"links":{"cited_paper":"/paper/2403.05318","citing_paper":"/paper/2505.23098"},"observation_digest":"sha256:fc5d1fd4bda5ce941d0b1f78c3ea9768c84d46fd0bc651b61eca7128f8a6cca9","observation_id":"9adffc31-f96f-4f76-82df-dc186eb2c9bc","resolution":{"observed_at":"2026-08-07T12:58:02.964731Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.23098","last_updated":"2025-05-29T05:03:28Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T12:50:58.876994Z","submitted_at":"2025-05-29T05:03:28Z","title":"Learning to Search for Vehicle Routing with Multiple Time Windows"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":6,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":8},"total_outbound_references":21},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2505.23098."}