{"as_of":"2026-08-08T17:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:088d25b41b2f63b8c93729cba1ae5e72cea9ddc80fe4eaecc99008500dca5258","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T19:00:14.028632Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:22:02.920888Z","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-08-07T11:22:05.419516Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"cited_work":{"arxiv_id":"2502.10233","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.10233","snapshot_observed_at":"2026-08-07T11:22:05.419516Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","venue":"cs.MA","work_id":"1291ad8c-837d-428b-b512-f1cd2e86c2ef","year":2025},"citing_paper":{"arxiv_id":"2506.02746","last_updated":"2025-06-03T11:07:41Z","snapshot_observed_at":"2026-08-08T11:20:18.540508Z","submitted_at":"2025-06-03T11:07:41Z","title":"Solving the Pod Repositioning Problem with Deep Reinforced Adaptive Large Neighborhood Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:02.920888Z"},"links":{"cited_paper":"/paper/2502.10233","citing_paper":"/paper/2506.02746"},"observation_digest":"sha256:26bb4854000abfdcb9f16b889878c2af1438b68bae78c73d549a69191fbb8a5c","observation_id":"7edf9e27-d4b5-4912-abee-2c816cfd1dca","resolution":{"observed_at":"2026-08-07T11:22:05.620631Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.10233/citation-record","integrity":"/paper/2502.10233/integrity","json":"/paper/2502.10233/citation-record.json","paper":"/paper/2502.10233"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1607.06450","last_updated":"2016-07-21T19:57:52Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-07-21T19:57:52Z","title":"Layer Normalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.06450","snapshot_observed_at":"2026-08-07T19:00:13.900865Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.900865Z"},"links":{"cited_paper":"/paper/1607.06450","citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:ccca64d40c8cc724d1668daba84197ae1d16c6c163f22d46c29fd0a295e8af6f","observation_id":"cdad1c57-cd50-44a4-8589-90ecd9fa1f35","resolution":{"observed_at":"2026-08-07T19:00:13.900865Z","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-07T19:00:13.905962Z","title":"arXiv preprint arXiv:2409.03811 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.905962Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:1d5d3a31e7d2ea5bedeb4cc4a67fc07389b574520fd43612b9c78de7d12520ff","observation_id":"074b463a-14db-463d-b1cf-64dbb3afe141","resolution":{"observed_at":"2026-08-07T19:00:13.905962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17100","last_updated":"2025-07-21T08:23:56Z","snapshot_observed_at":"2026-07-06T15:48:25.059865Z","submitted_at":"2023-06-29T16:57:22Z","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17100","snapshot_observed_at":"2026-08-07T19:00:13.910344Z","title":"arXiv preprint arXiv:2306.17100 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.910344Z"},"links":{"cited_paper":"/paper/2306.17100","citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:0e0629d253fd9d7d3b96c6cd9dd13c4c465ca97b8f86de58acffeaa7738a228b","observation_id":"3691a9cd-791f-4cc4-bcaa-b0b353b5cceb","resolution":{"observed_at":"2026-08-07T19:00:13.910344Z","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.ejor.2017.03.053","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:00:14.108833Z","title":"European Journal of Operational Re- search 262(2), 550–562 (2017)","venue":null,"work_id":"507bfd1e-e8cc-4468-bdb8-58c071aa373d","year":2017},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.915598Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:14e8f1c218b20ed8c4318f8098fefc50244f4c6eeeb06b3e621c8f9b8f956494","observation_id":"e2e85227-84c4-4ff7-8e7a-00f4863f7fc3","resolution":{"observed_at":"2026-08-07T19:00:14.113743Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11849","last_updated":"2024-10-31T11:33:24Z","snapshot_observed_at":"2026-07-31T00:10:48.357368Z","submitted_at":"2024-01-22T11:08:36Z","title":"Self-Labeling the Job Shop Scheduling Problem","version":3},"cited_work":{"arxiv_id":"2401.11849","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.11849","snapshot_observed_at":"2026-08-07T19:00:14.145156Z","title":"Self-Labeling the Job Shop Scheduling Problem","venue":"cs.LG","work_id":"38bfd129-3c55-4cd9-96fb-5273be9c4de7","year":2024},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.920831Z"},"links":{"cited_paper":"/paper/2401.11849","citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:8c2e9e704aa3b917eb5af7456a6a9bad1c2b839d07b3f2aac84747ca684a8186","observation_id":"2c455bc1-ad31-4b02-95a7-a0b167af67ec","resolution":{"observed_at":"2026-08-07T19:00:14.150164Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0377-2217(97)00043-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:00:14.093145Z","title":"European Journal of Operational Research105(1), 1–17 (Feb 1998)","venue":null,"work_id":"f42555ca-215a-40e2-9264-430b43b12a39","year":1998},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.925543Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:0ff97d0fcbff214437b6b43044fcadace0484c41546dd2faaf3c276fcc5dff8e","observation_id":"fbcc8923-cbea-4829-a5d8-d6f20c2db634","resolution":{"observed_at":"2026-08-07T19:00:14.098646Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:13.930815Z","title":"https://doi.org/10.1016/j.ejor.2006.07.009","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.930815Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:3e9dbb6096b0b931eba9a9a78e35c4ee5c029bebd5933902829b9125bd1eb617","observation_id":"61aa6365-6406-426d-bf45-7d5c7bab3295","resolution":{"observed_at":"2026-08-07T19:00:13.930815Z","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-07T19:00:14.536373Z","title":null,"venue":null,"work_id":"40c86196-c065-412c-9a81-ade9b6183638","year":2024},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.934863Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:5c202ac1033cb9051f7c9ee348306959d3ca663f1ce307a945e7bfbc71d47be9","observation_id":"834f4964-5022-41b1-a3ad-c372a8773437","resolution":{"observed_at":"2026-08-07T19:00:14.541216Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.08415","last_updated":"2023-06-06T01:53:32Z","snapshot_observed_at":"2026-07-06T05:01:27.910364Z","submitted_at":"2016-06-27T19:20:40Z","title":"Gaussian Error Linear Units (GELUs)","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.08415","snapshot_observed_at":"2026-08-07T19:00:13.938923Z","title":"arXiv preprint arXiv:1606.08415 (2016)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.938923Z"},"links":{"cited_paper":"/paper/1606.08415","citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:f5db9289ebe7334be2fb2117bd2c5ac2f61ea6716a4359054ef0699f1c50c1a0","observation_id":"52c2cbd3-53af-4737-ab5e-3d05c7ffcdeb","resolution":{"observed_at":"2026-08-07T19:00:13.938923Z","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-07T19:00:14.521610Z","title":"In: Advances in Neural Information Processing Systems (2022)","venue":null,"work_id":"15bf7d7a-a440-4e31-9ab5-1c306d47268f","year":2022},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.942881Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:31bf7d9d16eaa319c698e30ef77bfc2460ffd17de4a48b5abd445ce61e3d4040","observation_id":"9752e5c7-04bb-4ca7-acf3-3fb0b2dc6fb6","resolution":{"observed_at":"2026-08-07T19:00:14.526060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.508474Z","title":"net/forum?id=ByxBFsRqYm Hierarchical and Parallel Decoding for Picker-Routing 15","venue":null,"work_id":"6d4ba569-a3ee-45a8-8c36-d825e893f800","year":2019},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.946697Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:a7431bf33b37c82b51ec909a2d8adb7af2038ef20e473073a4d5cb2f61a69521","observation_id":"61e87b89-2ccc-4da5-b5c3-2f0aa5437cdb","resolution":{"observed_at":"2026-08-07T19:00:14.512513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.493608Z","title":null,"venue":null,"work_id":"44031960-c94d-4557-9868-fccae97400f2","year":2019},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.950606Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:ee3d105689106e35d03ffb40ead1b2c5995b4e040af6d83a83b632a8ef466aff","observation_id":"b489fa7f-79c4-4c0e-b9c1-2ecf8c3f237d","resolution":{"observed_at":"2026-08-07T19:00:14.497958Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:13.954783Z","title":"Advances in Neural Information Processing Systems33, 21188–21198 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.954783Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:333c54b6d2e9e845727396995bf33a32002a19a67864abd6aab36e89c8ddfa6d","observation_id":"e79c385c-e597-42f8-9ad2-cf08d972fbfb","resolution":{"observed_at":"2026-08-07T19:00:13.954783Z","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-07T19:00:14.470361Z","title":"In: Larochelle, H., Ran- zato, M., Hadsell, R., Balcan, M., Lin, H","venue":null,"work_id":"1b922dbd-5a43-4093-9664-c1869e7c406d","year":2020},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.958591Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:533a0670be1bb449551f706e0ba5e4a3f90e37174a7f266d0bbab78bbecab2b9","observation_id":"4d951846-93c7-45c8-a350-76ab8672bf66","resolution":{"observed_at":"2026-08-07T19:00:14.474654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.455690Z","title":"In: Advances in Neural Informa- tion Processing Systems","venue":null,"work_id":"61e61eec-b70a-488d-8a3f-884cbc44b9d4","year":2021},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.962609Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:538bce92440a72a6270377bddc5bb27b5b5f80bee1bea2e59b440a3ec9fe670f","observation_id":"1bb1dc86-a34f-4165-9fa0-0fbd8795dfc4","resolution":{"observed_at":"2026-08-07T19:00:14.460198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.440067Z","title":"In: Advances in Neural Informa- tion Processing Systems","venue":null,"work_id":"81deb263-44d1-432d-8810-593dab90a274","year":2021},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.967005Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:c431ed09136c2bedb635967df46aae810994866d27f4bfe88b3b164458aed095","observation_id":"950b9a33-4552-4fde-9690-c806be89ef62","resolution":{"observed_at":"2026-08-07T19:00:14.445202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.424051Z","title":"In: Proceedings of the 23rd International Conference on Autonomous Agents and Mul- tiagent Systems","venue":null,"work_id":"0f8b8da7-55cf-430b-9e0f-1679c3cbf426","year":2024},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.971153Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:15ea44c9181c412d8752f7807645bf9051d6db09bb3b835a0dc6346111946323","observation_id":"009df0b7-75d4-4e3a-92a3-95298462d6c1","resolution":{"observed_at":"2026-08-07T19:00:14.428620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.409380Z","title":"In: Pro- ceedings of the International Conference on Automated Planning and Scheduling","venue":null,"work_id":"c705b364-31a2-4835-9601-53aa0bae727e","year":2024},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.975243Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:05c746e38986cced93076aaaa6c13561d0d08bc2c49734d28a52c0f8637bcd97","observation_id":"9ef4a717-9589-4319-b667-954b6d946193","resolution":{"observed_at":"2026-08-07T19:00:14.413964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.393771Z","title":"Transactions on Machine Learning Research (2024)","venue":null,"work_id":"64c5d083-8e71-4d46-8b96-c8844e202441","year":2024},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.979337Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:4d9811e0c02d1b54f6af7da834e04be4f2e5cdf80d14abc216034b33ba1bb584","observation_id":"16672d18-db8d-4c5d-9d1f-7f54b8ae3b56","resolution":{"observed_at":"2026-08-07T19:00:14.398871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.379231Z","title":"In: Proceedings of the AAAI Conference on Artificial Intelligence","venue":null,"work_id":"e2847933-28c8-40a6-a4aa-c697dfb43a0c","year":2024},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.983223Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:317432a59fbe0295dc69b016d07446c528a6b122030124f3780d6378079c04df","observation_id":"6b242d29-74c1-47f7-a458-04891a1d9dda","resolution":{"observed_at":"2026-08-07T19:00:14.383716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.364514Z","title":"John Wiley & Sons,4th edn","venue":null,"work_id":"970a6030-ec0e-44b1-be22-d97ed4672285","year":2010},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.987945Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:032f6fd97983bcce04575372101ecd9cac126d050fd1cd97bb0a441b29697b6f","observation_id":"a85385e7-0c00-40e9-8bd1-f3bbf31ffa89","resolution":{"observed_at":"2026-08-07T19:00:14.369148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:13.992577Z","title":"In: Advances in Neural Information Processing Systems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.992577Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:17b72d09dea494ccfa884d0c56f4d3bccef12ade62674b9c159a8a494fee8f44","observation_id":"2bd381e5-1511-44f1-b62d-7cb4cdd2fd4d","resolution":{"observed_at":"2026-08-07T19:00:13.992577Z","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-07T19:00:14.339528Z","title":"Advances in neural infor- mation processing systems28 (2015)","venue":null,"work_id":"98ac7d5e-e067-4270-9378-4073c820c145","year":2015},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:13.999809Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:a6e3bd2ddfaa4097e4fd4e4e9549da73fd6cc35a8199879e55ef8f19ba7daba4","observation_id":"8c3997e6-21c6-4307-8fa9-a79ca1683faa","resolution":{"observed_at":"2026-08-07T19:00:14.344100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.cor.2018","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:00:14.067706Z","title":"Computers &OperationsResearch 95,139–150(Jul2018).https://doi.org/10.1016/j.cor.2018","venue":null,"work_id":"71ff6986-71f7-4cad-a215-eb63f3175862","year":2018},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:14.005912Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:8ce1deca54ff6fe291e7edd40478cec71425ff014be930e74c7428ec6227e886","observation_id":"25e50441-62c9-4c60-a478-8f874378a28a","resolution":{"observed_at":"2026-08-07T19:00:14.073246Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.010053Z","title":"European Journal of Operational Research274(2), 501–515 (Apr 2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:14.010053Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:ffcbcf163fb02f641f5c758ca395a6efb858f570d5b303ca4566cc5f8afb4f44","observation_id":"ed1bc55e-669a-411c-a852-493e1576a2d7","resolution":{"observed_at":"2026-08-07T19:00:14.010053Z","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-07T19:00:14.325045Z","title":"European Journal of Operational Research307(2), 713–730 (2023)","venue":null,"work_id":"efdf39b5-f3de-4b02-9a1e-a24be8a9eec5","year":2023},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:14.014376Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:2d2e040a7a278d5d8b37467d176607751b738f526a1169d6f752c52377c2ee29","observation_id":"09b677bd-fe7d-44c9-be27-7fd3757562ce","resolution":{"observed_at":"2026-08-07T19:00:14.329628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.310378Z","title":"European Journal of Operational Research 288(1), 80–97 (2021)","venue":null,"work_id":"43d24772-4018-4d98-a2e3-402f75a5a9e8","year":2021},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:14.018928Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:843f8513402fc35b7f49417ce6daca0fd0cb43de6f9eccb2bbd89868a23d4bb6","observation_id":"6f71b697-08af-494b-abf9-fc8871d35f4f","resolution":{"observed_at":"2026-08-07T19:00:14.315167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.295419Z","title":"In: Proceedings of the AAAI conference on artificial intelligence","venue":null,"work_id":"00388ba5-c565-450d-91f9-62456f6f984e","year":2022},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:14.023229Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:86ee8b0ff2d69dc9e234caeb6362b0de48dd99138577d11c329a660f83513fb4","observation_id":"211625d8-270c-4d68-ad91-3576347a11fe","resolution":{"observed_at":"2026-08-07T19:00:14.299919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T19:00:14.281225Z","title":null,"venue":null,"work_id":"52e19167-5909-4dae-acb9-35de613687ad","year":null},"citing_paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T19:00:14.028632Z"},"links":{"citing_paper":"/paper/2502.10233"},"observation_digest":"sha256:4b90d428b61fd65607f1a360167750e5ca5f4724f95ec05ab40f9492cee72e43","observation_id":"42c087ba-dbf4-4143-a621-522cfd9e9b17","resolution":{"observed_at":"2026-08-07T19:00:14.285518Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.10233","last_updated":"2025-02-14T15:42:30Z","latest_version":1,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-07T18:49:17.467945Z","submitted_at":"2025-02-14T15:42:30Z","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":11,"verified_exact":3,"verified_fuzzy":14},"total_outbound_references":29},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 1 inbound Pith citation observation for arXiv:2502.10233."}