{"as_of":"2026-08-10T15:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c3cf868ac176f960c66488025c97dbfd404d8653dbe851b149ac047ccfb13282","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:14:36.512211Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T19:50:06.390639Z","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-06-29T19:53:55.830531Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"cited_work":{"arxiv_id":"2511.02525","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.02525","snapshot_observed_at":"2026-06-29T19:53:55.830531Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","venue":"cs.LG","work_id":"6e30bad2-6085-4ca4-beea-23ecd6f279fd","year":2025},"citing_paper":{"arxiv_id":"2605.26763","last_updated":"2026-05-26T09:36:37Z","snapshot_observed_at":"2026-08-02T05:20:18.012933Z","submitted_at":"2026-05-26T09:36:37Z","title":"Adversarial Training for Robust Coverage Network under Worst-case Facility Losses","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-29T19:50:06.390639Z"},"links":{"cited_paper":"/paper/2511.02525","citing_paper":"/paper/2605.26763"},"observation_digest":"sha256:7e09df57d8d0a8723bfe7a659a62f9f574ea0c36fe25c6b916107049ca022324","observation_id":"44b61374-3c65-46e0-8dfb-68d367ed053d","resolution":{"observed_at":"2026-06-29T19:53:55.661020Z","resolver_source":"local_arxiv","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":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"cited_work":{"arxiv_id":"2511.02525","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.02525","snapshot_observed_at":"2026-06-29T19:53:55.830531Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","venue":"cs.LG","work_id":"6e30bad2-6085-4ca4-beea-23ecd6f279fd","year":2025},"citing_paper":{"arxiv_id":"2605.26776","last_updated":"2026-05-26T09:46:54Z","snapshot_observed_at":"2026-08-07T19:57:42.169811Z","submitted_at":"2026-05-26T09:46:54Z","title":"Towards Generalization-Oriented Models for Vehicle Routing Problems with Mixture-of-Experts","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T19:46:55.148691Z"},"links":{"cited_paper":"/paper/2511.02525","citing_paper":"/paper/2605.26776"},"observation_digest":"sha256:05cfb63270692188b83b7e43b8f30d81419adf63eb7d24dd09c3c8af94c8cb2c","observation_id":"a1780a8a-3008-47bb-86af-dd49e95cd514","resolution":{"observed_at":"2026-06-29T19:53:55.833062Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2511.02525/citation-record","integrity":"/paper/2511.02525/integrity","json":"/paper/2511.02525/citation-record.json","paper":"/paper/2511.02525"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:14:32.514355Z","title":"The effect of ignoring routes when locating depots,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:32.514355Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:3c25a7c6a4f916b508c4592a9b5e30e89e4c92b2a16f2a1990289c51c499d20e","observation_id":"f15b5cc3-a52a-4b86-badb-cfa4d1d9a115","resolution":{"observed_at":"2026-08-04T00:14:32.514355Z","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-04T00:14:32.657568Z","title":"Consistency and robustness in location-routing,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:32.657568Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:a98d9a2a40946fcf2c486ba7fe306dd333d68199c5f1182662ccaffdc5eceec8","observation_id":"577a74ab-7c95-4990-a5df-e98e22112b57","resolution":{"observed_at":"2026-08-04T00:14:32.657568Z","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-04T00:14:32.799736Z","title":"The transportation-location problem,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:32.799736Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:f09f5ef0881f8869d186bb3e6c5596c78bf49aba1a16121a7df5e1160cf3a0c6","observation_id":"006289e2-3dfc-4bea-ab0c-1f3b855a16be","resolution":{"observed_at":"2026-08-04T00:14:32.799736Z","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-04T00:14:32.931344Z","title":"Multi- objective sustainable capacitated location routing problem formulation in sustainable supply-chain management,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:32.931344Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:97dcb9efca893e386d9e640f1b61df545512a2bd9c16c5eadd462326b132434c","observation_id":"cd0a560c-2cfe-4f59-a33f-6c35372bbcf7","resolution":{"observed_at":"2026-08-04T00:14:32.931344Z","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-04T00:14:33.133329Z","title":"Flexible districting policy for the multiperiod emergency resource allocation problem with demand priority,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.133329Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:305a003c95ba76a98907a46e801d6f6340835a36c4928d747e47220033913cbc","observation_id":"f7eeb844-eecc-4c6c-9558-0cf76a3a1074","resolution":{"observed_at":"2026-08-04T00:14:33.133329Z","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-04T00:14:33.192256Z","title":"Disaster relief facility network design in metropolises,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.192256Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:d474e28e6e0714012e844370134f4eb1e2e034388f5868a4e8176a697e96dc48","observation_id":"af36358c-8dcb-41cc-9e57-b1e893648dbb","resolution":{"observed_at":"2026-08-04T00:14:33.192256Z","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-04T00:14:33.260541Z","title":"A simulated annealing heuristic for the open location-routing problem,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.260541Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:06e14a942241c7c488a0a7830e037edc14e0a828c6ca774c8c8111a1bafc8305","observation_id":"f40f38bc-02c4-449d-9d62-6d3cbaca7c55","resolution":{"observed_at":"2026-08-04T00:14:33.260541Z","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-04T00:14:33.301972Z","title":"Crowdsourced humanitarian relief vehicle routing problem,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.301972Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:54abbee49614f737bb5e9f3f93a572bc7ce01708038a5cc3a568fe604ad595ba","observation_id":"cd6d56d3-2209-4605-8f00-48e941ff8c7c","resolution":{"observed_at":"2026-08-04T00:14:33.301972Z","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-04T00:14:33.366535Z","title":"Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification,","venue":null,"work_id":null,"year":2033},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.366535Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:476a2099091ef57c8a30a16609eeb2c205990111dbff1b95d33eb3ff15981207","observation_id":"76186512-4d90-4b80-ad94-1b13d5e82930","resolution":{"observed_at":"2026-08-04T00:14:33.366535Z","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-04T00:14:33.424058Z","title":"A survey of recent research on location- routing problems,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.424058Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:b299f28d4c81716424e1d8307ea635dd98f4c682dd63130a605775f5b1dd5a20","observation_id":"a3e3529b-2b70-41a5-af85-af7dd2f1b370","resolution":{"observed_at":"2026-08-04T00:14:33.424058Z","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-04T00:14:33.493944Z","title":"An exact method for the capacitated location-routing problem,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.493944Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:e6e3765dea3788e2773d82bb26eac4377f52a039d28e5311558df51eb09922f4","observation_id":"d31770e5-44df-4a11-9957-ecc746c92799","resolution":{"observed_at":"2026-08-04T00:14:33.493944Z","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-04T00:14:33.544427Z","title":"Variable neighbor- hood search for location routing,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.544427Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:ec2e1b258425bab015ca88d18e9d243b1fbb32d18ec28b6b591c66455c8ba0ad","observation_id":"0085739c-cc06-4800-89a7-0b6862ff2919","resolution":{"observed_at":"2026-08-04T00:14:33.544427Z","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-04T00:14:33.596725Z","title":"Deep reinforcement learning for multi-period facility location: pk-median dynamic location problem,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.596725Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:c9418e9bfa15df56a0566e6f5e493890dc10524788d830e1f88da39796e4f041","observation_id":"d9aa5a65-1c1d-4a96-ab98-a0c2d3b4cde0","resolution":{"observed_at":"2026-08-04T00:14:33.596725Z","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-04T00:14:33.674578Z","title":"Sponet: solve spatial optimization problem using deep reinforcement learning for urban spatial decision analysis,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.674578Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:b2b429c980471b6a10ff4310aa34bc9873703f617fa51f60909efe8f40ed93c0","observation_id":"247465b2-4096-4353-9584-d800479a4cb1","resolution":{"observed_at":"2026-08-04T00:14:33.674578Z","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-04T00:14:33.769603Z","title":"Recovnet: Reinforcement learning with covering information for solving maximal coverage billboards location problem,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.769603Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:8565dc9d78a796e5b683f46ca52ab1aa93f7e24b4e7e8c7ce627d21759bfe72f","observation_id":"01c921ff-383a-4899-b021-66fcb9ddac8d","resolution":{"observed_at":"2026-08-04T00:14:33.769603Z","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-04T00:14:33.839402Z","title":"Pomo: Policy optimization with multiple optima for reinforcement learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.839402Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:29b57bdbaae34b015cea86a98a091cdf7f3c681720cea43c6827c3cf248b7b27","observation_id":"b8052c01-8f06-453f-837d-0b70b99f9478","resolution":{"observed_at":"2026-08-04T00:14:33.839402Z","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-04T00:14:33.954780Z","title":"Deep reinforcement learning for solving vehicle routing problems with backhauls,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:33.954780Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:066c85877a39056533cb91f6d6213b0a4d5ba8848d7dd0110d77745a12e33bcc","observation_id":"f08ef8d8-c134-47d5-90db-6533f919daa0","resolution":{"observed_at":"2026-08-04T00:14:33.954780Z","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-04T00:14:34.007257Z","title":"Multi-type attention for solving multi-depot vehicle routing problems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.007257Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:da325c876e2f73089833ea11f852e1e078449896ad9735826b875251df803a5c","observation_id":"27c07719-3813-4645-9887-0e3dcfa87b12","resolution":{"observed_at":"2026-08-04T00:14:34.007257Z","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-04T00:14:34.084829Z","title":"A new approach for solving location routing problems with deep reinforcement learning of emergency medical facility,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.084829Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:4819fca1bb08820da5ee3bb53ec322e32ede863ddf340d43f33e767e989318f0","observation_id":"9a0fc9c9-64e5-4341-9af6-9acc6ff1a6fd","resolution":{"observed_at":"2026-08-04T00:14:34.084829Z","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-04T00:14:34.148445Z","title":"Attention is all you need,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.148445Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:777fab50b57a8dc25967dd4d7b060980ce70ff117123bac4e88ea3923eb6d153","observation_id":"084b6a82-ec66-456e-b05a-c0829bd4041b","resolution":{"observed_at":"2026-08-04T00:14:34.148445Z","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-04T00:14:34.198238Z","title":"Branch-and-bound methods: A survey,","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.198238Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:3aa3660853311467d24d948e57eaf9fd9329bb9003ed517cdf6fc7db6a725b2a","observation_id":"137b2356-40a2-43e6-9c01-f7492fe8f57b","resolution":{"observed_at":"2026-08-04T00:14:34.198238Z","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-04T00:14:34.308797Z","title":"An exact algorithm for minimizing routing and operating costs in depot location,","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.308797Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:20b292f4add2ab983c0616aceda01750215dab51c7915ea5bc7ed983c67f733c","observation_id":"6d44da5d-9881-4e9d-bfff-ffedd4fb4303","resolution":{"observed_at":"2026-08-04T00:14:34.308797Z","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-04T00:14:34.379551Z","title":"Location-routing problems with distance constraints,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.379551Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:4d63ef5576e3c934a201343c127f7c4ffae0cc021d5e137b31a3b98fc1d6a4d0","observation_id":"1b6575c3-98c4-468c-a646-dcd2611ab8ed","resolution":{"observed_at":"2026-08-04T00:14:34.379551Z","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-04T00:14:34.426193Z","title":"A branch-and-price algorithm for combined location and routing problems under capacity restrictions,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.426193Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:6ba89a9ed60772e8f31ce104b3c96d7e0e05d436051cd1df4dc8dee8085fe4b2","observation_id":"1eb5d2d0-3951-4ccd-8224-0556dd31d5f0","resolution":{"observed_at":"2026-08-04T00:14:34.426193Z","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-04T00:14:34.544375Z","title":"A branch-and-cut method for the capacitated location-routing problem,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.544375Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:9660ad152d681df988c191005dbab9e4d45e4e621d7194c014d75e5a0a795b27","observation_id":"d740736a-6794-4e8d-a66d-e8e283a239b4","resolution":{"observed_at":"2026-08-04T00:14:34.544375Z","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-04T00:14:34.599255Z","title":"An exact algorithm based on cut-and-column generation for the capacitated location-routing problem,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.599255Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:cd53d6cb16d792b29582ac7329957dbb79f91bf001a68f4e8d33e4d5b545b139","observation_id":"c8f18a2c-e4ac-4390-acfb-99978f9dcf0d","resolution":{"observed_at":"2026-08-04T00:14:34.599255Z","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-04T00:14:34.650168Z","title":"Solving the capacitated location-routing problem by a grasp complemented by a learning process and a path relinking,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.650168Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:8b562a1dcc529d6cb11d413f58e1a6903ee1375634168274cfc83264f1c57d13","observation_id":"9ad80544-611d-4b2d-804b-9657ed474b11","resolution":{"observed_at":"2026-08-04T00:14:34.650168Z","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-04T00:14:34.767481Z","title":"A grasp×els approach for the capacitated location-routing problem,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.767481Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:23e9d541b2f0f8a43c9c885da61529ede3c536eced0202561331471354275ccd","observation_id":"cb5a2bfa-9e63-49a4-8132-c1d048ad009c","resolution":{"observed_at":"2026-08-04T00:14:34.767481Z","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-04T00:14:34.875210Z","title":"An iterated local search for solving a location-routing problem,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.875210Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:21178466823d0053956579bff2bb7a9822ad131eb4302a61df2bef5f804e1bf9","observation_id":"d1029d90-be30-4753-8f04-4c30983241bd","resolution":{"observed_at":"2026-08-04T00:14:34.875210Z","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-04T00:14:34.938947Z","title":"A simulated annealing heuristic for the capacitated location routing problem,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:34.938947Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:96de668fa79d567b558eabfde363e2eaeb187278aa25b8a7251b5806e44920aa","observation_id":"3278f9bb-c41d-48bd-a14d-d02b7b870459","resolution":{"observed_at":"2026-08-04T00:14:34.938947Z","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-04T00:14:35.041623Z","title":"Large composite neighborhoods for the capacitated location-routing problem,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:35.041623Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:dd88337945feecd2de0271bffd93eb55711c65f000be7c93ba319fce574c2bb9","observation_id":"fe8db0bc-b3a5-4a04-a7e1-ef2f863d347c","resolution":{"observed_at":"2026-08-04T00:14:35.041623Z","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-04T00:14:35.118290Z","title":"Multi- objective multiple neighborhood search algorithms for multiobjective fleet size and mix location-routing problem with time windows,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:35.118290Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:e7848be61e2d4c6cbc98918c26820320b3073a12e28ccccc280f33aeb397d733","observation_id":"541e590f-b0e0-421e-ab9e-483fb86f8098","resolution":{"observed_at":"2026-08-04T00:14:35.118290Z","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-04T00:14:35.213621Z","title":"Pointer networks,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:35.213621Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:056094adbd6f5387a0e9fa3bb602c6be9f743dbc05cc42bfbc50ca774aabfd09","observation_id":"c52e4ed6-74a7-469f-a154-c19d6ff36cee","resolution":{"observed_at":"2026-08-04T00:14:35.213621Z","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-04T00:14:35.272278Z","title":"Attention, learn to solve routing problems!","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:35.272278Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:ba96d965bc29f7ef7e23a72e0c1d093e9fc412ec16089333bf1f13fc940f0b18","observation_id":"38bce8f1-6676-47af-a891-f69f0bf9e059","resolution":{"observed_at":"2026-08-04T00:14:35.272278Z","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-04T00:14:35.388212Z","title":"Heuristic sequencing hopfield neural network for pick-and-place location routing in multi-functional placers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:35.388212Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:ff90b8ed744683a2b1dd7983cafc206d5fd98733c0c2ad0eefa8602b822b8370","observation_id":"5bc6926b-c567-431c-8e40-6f039877370b","resolution":{"observed_at":"2026-08-04T00:14:35.388212Z","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-04T00:14:35.510570Z","title":"A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:35.510570Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:c0e0825140decb87c4eb154b85433cb94ea327f2ec01a7b021860844b7e7d6c6","observation_id":"9563a6b4-48fe-415f-bc18-e11db11fe949","resolution":{"observed_at":"2026-08-04T00:14:35.510570Z","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-04T00:14:35.588825Z","title":"Neural embedded opti- mization for integrated location and routing problems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:35.588825Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:bdbca5256d90d61ce53988d5b71e075b189c37805a151e17d311d5770fe4d0cb","observation_id":"b4c53da8-d7f6-4888-8cc5-a3073358fdc0","resolution":{"observed_at":"2026-08-04T00:14:35.588825Z","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-04T00:14:35.661925Z","title":"A deep reinforcement learning method for solving two-echelon location-routing problem,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:35.661925Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:791cce21d708ee7d6be6d17512bd77a81e8ae27b5ab7a26b2e264d321815bc73","observation_id":"0696e0d0-0364-4d76-be8e-e881c9a623b4","resolution":{"observed_at":"2026-08-04T00:14:35.661925Z","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-04T00:14:35.733360Z","title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:35.733360Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:eca592c5c00b67cb6aef4cfcecccabdcb520de52d67534bc1e0238731f3f3393","observation_id":"48633a72-7574-4530-af5c-2f585fa47edb","resolution":{"observed_at":"2026-08-04T00:14:35.733360Z","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-04T00:14:35.841124Z","title":"Deep reinforcement learning for sequence-to-sequence models,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:35.841124Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:f6bdd88355f97be8d86722931686bd1dc911feb1a7cad2d00b8637239c3ee037","observation_id":"00e69814-581e-406d-97c9-67614bd0f7fe","resolution":{"observed_at":"2026-08-04T00:14:35.841124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.3555","last_updated":"2014-12-11T06:46:53Z","snapshot_observed_at":"2026-08-10T04:10:43.257455Z","submitted_at":"2014-12-11T06:46:53Z","title":"Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.3555","snapshot_observed_at":"2026-08-04T00:14:35.912740Z","title":"Empirical evaluation of gated recurrent neural networks on sequence modeling,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:35.912740Z"},"links":{"cited_paper":"/paper/1412.3555","citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:5067f46a44bfb83252677601eb7aca56b48b2e26597c45261136eea17831f0df","observation_id":"3bbbc844-e973-46f3-a130-704b5377dc0d","resolution":{"observed_at":"2026-08-04T00:14:35.912740Z","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-04T00:14:36.012162Z","title":"Simulation-guided beam search for neural combinatorial optimization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:36.012162Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:dca1a46565fc17c34f15981b8438dfa98b929e398aeb466008add00bbd75319d","observation_id":"67e8a66c-9ab9-4f17-a34e-b2ef98226b5b","resolution":{"observed_at":"2026-08-04T00:14:36.012162Z","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-04T00:14:36.077829Z","title":"Nouveaux algorithmes pour le probl `eme de localisation et routage avec contraintes de capacit ´e,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:36.077829Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:c3409840cbab21d5ab047ed03188a8c790ddb85e0ebaa45d87744aec653c8286","observation_id":"587dc6db-a03b-4b80-a5f7-3c9978cde0e9","resolution":{"observed_at":"2026-08-04T00:14:36.077829Z","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-04T00:14:36.170978Z","title":"Gurobi Optimizer Reference Manual,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:36.170978Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:21415ed794033c9b52b0f208f5aaaad86e31be5cfca7bc599854c31fc7c6236b","observation_id":"21e4e4a7-599b-4a32-816e-be19263e2603","resolution":{"observed_at":"2026-08-04T00:14:36.170978Z","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-04T00:14:36.356530Z","title":"Two-echelon routing problem for parcel delivery by cooperated truck and drone,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:36.356530Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:914d79f2004b3eb62674492fd2c3d8e62d74eff5914c3df645a8325d36b7c32c","observation_id":"b48c73e2-a952-459d-a290-e2509d6e2608","resolution":{"observed_at":"2026-08-04T00:14:36.356530Z","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-04T00:14:36.438783Z","title":"A hybrid multiobjective memetic algorithm for multiobjective periodic vehicle routing problem with time windows,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:36.438783Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:aaedb2b093377fe08537aca24183fe965c6c507b3d7f7f521d6c203f8660588c","observation_id":"ed792d1d-021c-45ef-9587-a8937f387634","resolution":{"observed_at":"2026-08-04T00:14:36.438783Z","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-04T00:14:36.512211Z","title":"Vehicle routing problems for drone delivery,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:36.512211Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:cdc4c68a7c2b3f42fa91c50479b83cb31b1f58aea6f6d3775b5f0b2ed894e64b","observation_id":"b76eb3b0-0824-4144-8484-452249dfbb21","resolution":{"observed_at":"2026-08-04T00:14:36.512211Z","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-04T00:14:36.293730Z","title":"Available: https://www.gurobi.com","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T00:14:36.293730Z"},"links":{"citing_paper":"/paper/2511.02525"},"observation_digest":"sha256:adff73be063aa52515132eb3fddc0d2fc6371e2fc7edb1ddebef32eab6f9b855","observation_id":"97abea58-9201-456f-93dd-9e0d4c177b88","resolution":{"observed_at":"2026-08-04T00:14:36.293730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.02525","last_updated":"2026-05-26T09:29:42Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T00:14:31.458738Z","submitted_at":"2025-11-04T12:23:17Z","title":"An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":48,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":48},"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 48 of 48 outbound references and 2 inbound Pith citation observations for arXiv:2511.02525."}