{"as_of":"2026-08-08T10:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e727a6ddce587614582cacfaa67d2aae60a23a98aabff2f659b023c9c1ea2e1d","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:16:32.601715Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.22497/citation-record","integrity":"/paper/2505.22497/integrity","json":"/paper/2505.22497/citation-record.json","paper":"/paper/2505.22497"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:16:36.855794Z","title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses,","venue":null,"work_id":"5d94e722-8f5b-4a78-aa42-92d829edb9e9","year":2008},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:30.701025Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:16d3c36150837bcd859720637a4d182c8068944d0a5d79fd75e6d22cca2b6654","observation_id":"9c78b13a-f288-451c-a31a-6118e2cc654e","resolution":{"observed_at":"2026-08-07T13:16:36.938717Z","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":"article/3250341","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:16:32.859681Z","title":"China stakes global dominance in race to build intelligent ports,","venue":null,"work_id":"17464e1c-272d-4f32-a25f-ccf7ba3e1e04","year":2025},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:30.756210Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:55a5c188de8896996d66b5ed496ca1ae4a11f9ecc894e74042775a5fb8369ba9","observation_id":"e5c6d104-d961-4e59-be59-c1af0b241ac7","resolution":{"observed_at":"2026-08-07T13:16:32.942188Z","resolver_source":"raw_fallback","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:16:36.717374Z","title":"Scheduling of inbound and outbound trucks in cross docking systems with temporary storage,","venue":null,"work_id":"bbe7d171-5ee7-439c-8e68-40943ebc4f88","year":2008},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:30.818899Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:7518514364fe472e9288e3a2d1b618aaf669fc85391eadf02d02e8e0882c2f43","observation_id":"a3201c64-52ae-45c3-942e-0ee2df612940","resolution":{"observed_at":"2026-08-07T13:16:36.772922Z","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-07T13:16:36.593007Z","title":"A survey of literature on automated storage and retrieval systems,","venue":null,"work_id":"8b3bfc59-ee95-4df6-9d53-59f392e7648c","year":2009},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:30.927929Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:6589448ca709d22f41ce5050f89203fbd374040b260b1fa320ffe179987181e4","observation_id":"68de55b0-22ef-46dc-b7d8-17b5e8d99b69","resolution":{"observed_at":"2026-08-07T13:16:36.662065Z","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-07T13:16:36.379683Z","title":"Multi-agent route planning in grid-based stor- age systems,","venue":null,"work_id":"4c3f7a0f-f6ea-45f0-81f6-bbc0eea82528","year":2017},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:31.005385Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:cd15cbc36747d8fbf87a7bb235e6dca7c08e9dc369b63d7dd757447d1edada07","observation_id":"72086994-0fab-473e-8cb9-e80365be8b48","resolution":{"observed_at":"2026-08-07T13:16:36.447267Z","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-07T13:16:36.178883Z","title":"A high-density system for carton sequencing,","venue":null,"work_id":"c23aead6-46ef-47d2-bbd8-058a2e3bc35f","year":2012},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:31.092829Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:2c6cded8123edd268ec571deaa33cf640a50f764bbedf3ee039b919b923928b7","observation_id":"a47306ca-87ae-45cc-b42d-23000035d8a5","resolution":{"observed_at":"2026-08-07T13:16:36.272743Z","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-07T13:16:36.007424Z","title":"Hidden like secret bases – automated multistory parking facilities,","venue":null,"work_id":"e090ac92-71b1-401f-8478-229ec9d5b8d0","year":2025},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:31.234214Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:99b7afb8b2e53e51daac2bf61b40622fcdf74c195c50c2b0d0358f9b45da06ee","observation_id":"0fd2042b-84b6-436f-9dc8-316d927d2026","resolution":{"observed_at":"2026-08-07T13:16:36.086473Z","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-07T13:16:35.811449Z","title":"A branch and price procedure for the container premarshalling problem,","venue":null,"work_id":"2e45d671-8a15-4270-9853-bc808d00e8d9","year":2014},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:31.389164Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:8ce82766f4b6b899d4e73a49779b29737b20c5fda6228ef42263b5c83122d9af","observation_id":"5c37172d-af12-4dbd-9ebf-8c3562da4689","resolution":{"observed_at":"2026-08-07T13:16:35.900206Z","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-07T13:16:35.677009Z","title":"Puzzle-based storage systems,","venue":null,"work_id":"dcfca256-67d6-4ff9-aef0-3419e776a4bf","year":2007},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:31.474309Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:8a9ba198a3da853623821f45c4e66e58c39e0ca15bb538d69c55a058f30ce539","observation_id":"2d11230a-a7d9-4670-9376-57ec1795d143","resolution":{"observed_at":"2026-08-07T13:16:35.751177Z","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-07T13:16:35.518270Z","title":"Toward efficient physical and algorithmic design of automated garages,","venue":null,"work_id":"c1b2b385-453c-4ed1-a37f-646ef9c41724","year":2023},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:31.558019Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:e04d84935f4c786965bbf50d5313f3d5402c32be07c563e5e9623afa7bc45b80","observation_id":"140b8112-66d0-47fe-b10f-8d512ca3e841","resolution":{"observed_at":"2026-08-07T13:16:35.576407Z","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-07T13:16:35.386092Z","title":"Mechanical search on shelves using a novel “bluction","venue":null,"work_id":"bc1abbba-3d19-4bf7-9b40-8e6befbf15a3","year":2022},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:31.643128Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:65501706b7f93f9336b2886c9a7447934d90bcfb6ddd048b0996e928e9c66674","observation_id":"965cf915-3a44-49e0-89d7-9ff3e2480fd0","resolution":{"observed_at":"2026-08-07T13:16:35.451502Z","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-07T13:16:35.266868Z","title":"Very high density storage systems,","venue":null,"work_id":"646f6344-1f34-414f-94ea-bf9d861b8e4f","year":2006},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:31.754666Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:121f66e0ee1e8d240d2b6699091e4c78f9c412134b349e8f465572da41f5848d","observation_id":"7f989c6d-ba05-44db-b740-c0f3e4d2b7a7","resolution":{"observed_at":"2026-08-07T13:16:35.331474Z","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-07T13:16:35.103735Z","title":"A comprehensive toolbox for load retrieval in puzzle-based storage systems with simultaneous movements,","venue":null,"work_id":"b63aa281-897d-42d9-8ea0-3c309e2c2ae2","year":2022},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:31.854565Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:064ac1fdaf6cde66fe2227b907c7b79620bc30aadad40944abd1334c7899f53a","observation_id":"4cb71235-8dde-42fc-9c1a-96e6dd772459","resolution":{"observed_at":"2026-08-07T13:16:35.178645Z","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-07T13:16:34.958639Z","title":"Retrieval time performance in puzzle-based storage systems,","venue":null,"work_id":"2b1e9bee-4e30-4c22-a239-56f45a467708","year":2015},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:31.953189Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:8012f3f7ead598888fc62fa237a00f966c1ed715c65598caddafdb2f2e537757","observation_id":"5a63f39f-2eb4-484c-8e1b-bc352cc28781","resolution":{"observed_at":"2026-08-07T13:16:35.013914Z","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-07T13:16:34.748312Z","title":"Well-connected set and its application to multi-robot path planning,","venue":null,"work_id":"118dfbca-ae5b-4047-8f6c-e8693643125f","year":2024},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:32.031458Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:6cbdb9cf0b79ff4328db6edae140b34737a7b2a612c323ff1f88591b105cc3f0","observation_id":"2e4caa7d-5fbd-4d79-83de-7d8e640305e4","resolution":{"observed_at":"2026-08-07T13:16:34.869710Z","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-07T13:16:34.533240Z","title":"Container rehandling at maritime container terminals: A literature update,","venue":null,"work_id":"5840957a-a8cc-4449-a181-da078f6bdc58","year":2020},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:32.078876Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:046c1f903c88772d03ec6f42ca1e845bfc3c5a07e7340a975e64ccd1f53f8b2a","observation_id":"35721be4-f08f-4fb8-b099-2659cd6ffc57","resolution":{"observed_at":"2026-08-07T13:16:34.613011Z","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-07T13:16:34.317211Z","title":"A survey of optimization methods for block relocation and premarshalling problems,","venue":null,"work_id":"94363ab6-c670-4367-8f24-10dd180c285d","year":2022},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:32.125178Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:f3bd901269ef3ab1aa11ad88d87869f43ba6b13334eb66db409c8a43a0f3d572","observation_id":"3b18df4d-c423-47ca-915a-7ca1f9c515bd","resolution":{"observed_at":"2026-08-07T13:16:34.402393Z","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-07T13:16:34.098051Z","title":"An algorithm with performance guarantee for the online container relocation problem,","venue":null,"work_id":"55ae40f2-3b08-4d3b-9038-e103d2c033e2","year":2017},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:32.175647Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:8dc99c1b4e6c3697c605a761ce48b702d0968531eca871bb5be6ff1894f4ac4f","observation_id":"ea3afb46-db70-49cf-a52e-d45f8f515c30","resolution":{"observed_at":"2026-08-07T13:16:34.210129Z","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-07T13:16:33.910171Z","title":"A mathematical formulation and efficient heuristics for the dynamic container relocation problem,","venue":null,"work_id":"13f2b7a9-b724-4967-95bf-8e773c22281b","year":2014},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:32.273040Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:a9221ca60a61a86197fbe3d86a906fd4ea4b7842f192be9c6d324dcf250115cf","observation_id":"66498f90-7c31-4b4a-92f4-2850b0ba8a75","resolution":{"observed_at":"2026-08-07T13:16:33.967093Z","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-07T13:16:33.758091Z","title":"Moving trains like pebbles: A feasibility study on tree yards,","venue":null,"work_id":"2f6004ac-e8d6-42be-a3bf-1e2cae3c1c7a","year":2023},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:32.368831Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:606520d751503e993ad415be69f5b37c217961eeb8c1f77c584f6a5cca766bb5","observation_id":"7d0720b6-3d7e-42ca-bcbe-7b95a64769f6","resolution":{"observed_at":"2026-08-07T13:16:33.838324Z","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-07T13:16:33.495252Z","title":"Object search by manipulation,","venue":null,"work_id":"12c32188-f51e-48d5-8558-3ff53843b4f3","year":2014},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:32.449434Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:e8524149281b000b5985a77d70897c843b79fd75d3d24d0f391f5512d748b739","observation_id":"92ee90df-95ee-4ca4-890a-c04d27a792ad","resolution":{"observed_at":"2026-08-07T13:16:33.628637Z","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-07T13:16:33.278172Z","title":"Mechanical search on shelves using lateral access X-RAY,","venue":null,"work_id":"7110c883-308d-42aa-a833-6d2859c585d8","year":2021},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:32.498341Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:2b9ff7c18dbc18f11273a07eb0db4966bc22d7148398ed0783b629d3c9ff7d34","observation_id":"89e67e48-5c0e-444f-b3cb-b5a16e94d384","resolution":{"observed_at":"2026-08-07T13:16:33.370042Z","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-07T13:16:33.063705Z","title":"Optimal arrangement and rearrangement of objects on shelves to minimize robot retrieval cost,","venue":null,"work_id":"5a91d89a-306c-428d-b04b-d7f3e760c14f","year":2024},"citing_paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:16:32.601715Z"},"links":{"citing_paper":"/paper/2505.22497"},"observation_digest":"sha256:910225bde3bec3f6566f58bdad6ceff9c7bce54977e199c1225215a05c68f959","observation_id":"36d0109d-87cf-4df0-a3a1-bb55ab5be77a","resolution":{"observed_at":"2026-08-07T13:16:33.157822Z","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"}}],"paper":{"arxiv_id":"2505.22497","last_updated":"2025-05-28T15:47:43Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-08T07:42:56.122432Z","submitted_at":"2025-05-28T15:47:43Z","title":"Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":23},"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 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2505.22497."}