{"as_of":"2026-08-10T08:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:05c63b529bc74f812c6971b65863c94e522dc64bb75e37a8ed0ad720c89fa131","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:49:11.205063Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.02297/citation-record","integrity":"/paper/2509.02297/integrity","json":"/paper/2509.02297/citation-record.json","paper":"/paper/2509.02297"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.10172","last_updated":"2024-02-15T18:19:18Z","snapshot_observed_at":"2026-08-09T06:15:43.446027Z","submitted_at":"2024-02-15T18:19:18Z","title":"OptiMUS: Scalable Optimization Modeling with (MI)LP Solvers and Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10172","snapshot_observed_at":"2026-08-05T11:49:08.220110Z","title":"Optimus: Scalable optimization modeling with (mi) lp solvers and large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.220110Z"},"links":{"cited_paper":"/paper/2402.10172","citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:d2e4eecb5de2f2ad989d2c05f1d37dfb09c750ee28788ccdb8e88a350ecb352a","observation_id":"c0767e4d-402c-462d-9215-6ccf17682382","resolution":{"observed_at":"2026-08-05T11:49:08.220110Z","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-05T11:49:15.850181Z","title":"A survey of genetic programming and its applications","venue":null,"work_id":"d07bee7e-510d-4a5f-ae2c-5728ba4e658a","year":2019},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.275609Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:23c88eba7fddf73aa8c6ade24c06c88f6c1a9302878ca719c806fc90b24b2d71","observation_id":"0959e616-d5bb-4f45-88c1-991eaa72a138","resolution":{"observed_at":"2026-08-05T11:49:15.945517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:15.723495Z","title":"On-line three-dimensional packing problems: A review of off-line and on-line solution approaches","venue":null,"work_id":"633fea81-26c4-437a-a8a6-03bee547be8b","year":2022},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.340504Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:e21721e51da6778b7c5f2ddacebfb0880518949b3e751b6166eb0778223a2f2f","observation_id":"6c1437a0-ebb5-4678-ad36-8d4d5a4ecdd3","resolution":{"observed_at":"2026-08-05T11:49:15.785773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:15.574976Z","title":"Mathematical models for multi container loading problems with practical constraints","venue":null,"work_id":"d92c0318-a363-4aa6-8a97-5adcbb603cba","year":2019},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.413033Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:48c2b5cf9a2bc1b99b09836ec272cf647c46dae731d8313d2e86a72b7ab075bf","observation_id":"b0e8066f-4963-43b6-8f19-c393f07f83a7","resolution":{"observed_at":"2026-08-05T11:49:15.641029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:15.397694Z","title":"Eine heuristik für multiple containerladeprobleme: A heuristic for multiple container loading problems","venue":null,"work_id":"36e58890-d200-4487-b644-8baf5c485d6d","year":2000},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.486826Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:2fb239268a174c7b1a65df875787f1b29d78dbf2cdad249cf12f4abb9d372194","observation_id":"b195399e-9fb8-4d17-9783-39adcd984786","resolution":{"observed_at":"2026-08-05T11:49:15.498368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:15.267453Z","title":"Constraints in container loading–a state-of-the-art review","venue":null,"work_id":"78bb7234-3701-4ed5-9132-0c2ae816dedc","year":2013},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.562503Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:6a693de4e148e6cdd1bed3284e627dfecaf7a4948ad982ccca5b739074921b9a","observation_id":"65190b3f-bdfd-4208-94df-605219121095","resolution":{"observed_at":"2026-08-05T11:49:15.332207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:15.114426Z","title":"The multiple container loading cost minimization problem","venue":null,"work_id":"bf1d7a8b-06e9-425b-9d73-5c6443abae0b","year":2011},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.627979Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:9190d307d746f530439ed05bc4e96a4b0fe3a4fd448d9890632ffc7485772168","observation_id":"e3f60b7b-bd44-427c-9313-ec7eadfeb37e","resolution":{"observed_at":"2026-08-05T11:49:15.189330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:14.946599Z","title":"Bin packing approximation algorithms: survey and classification","venue":null,"work_id":"c8cccd0d-75b4-4591-9039-97bb6be0a8f5","year":2013},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.707260Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:6090b903842094dc70ca4fc8bda30ab6d865b11cb4a5403c01efc3f25ccf6f8c","observation_id":"685bf6d9-e3e7-4ac5-976a-b81ea72d5d11","resolution":{"observed_at":"2026-08-05T11:49:15.033781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:14.824869Z","title":"Solving container loading problems by block arrangement","venue":null,"work_id":"6466d661-3a36-4fa1-a3fb-5adec7182c5c","year":2002},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.768255Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:acddd1db0e8835b21e9dd258574cdaa65b301632946a84bc9a50ca3e1567e790","observation_id":"07bfd51c-b3f3-4b34-9baa-fe82f3ca621b","resolution":{"observed_at":"2026-08-05T11:49:14.880766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:14.695658Z","title":"A bottleneck assignment approach to the multiple container loading problem","venue":null,"work_id":"c1ea4901-6c94-41ae-b58f-1f1cbedde2d1","year":2003},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.846722Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:7371b1fbea874de6ef24700250dcfc4c9a4cea2dd6824f111368e3bcc005665f","observation_id":"7954bf24-c562-4dc2-a9a6-71c899f05393","resolution":{"observed_at":"2026-08-05T11:49:14.766570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.08714","last_updated":"2023-06-08T02:14:20Z","snapshot_observed_at":"2026-08-08T00:09:55.721599Z","submitted_at":"2023-05-15T15:19:08Z","title":"Sensitivity and Robustness of Large Language Models to Prompt Template in Japanese Text Classification Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.08714","snapshot_observed_at":"2026-08-05T11:49:08.917814Z","title":"Sensitivity and robustness of large language models to prompt template in japanese text classification tasks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.917814Z"},"links":{"cited_paper":"/paper/2305.08714","citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:500288c8e2a19563b55c66be1575a468d46fc63afc930aa99ffb64c5b35b62b5","observation_id":"2165c1e8-b169-4f89-9a71-a5de5b3f534b","resolution":{"observed_at":"2026-08-05T11:49:08.917814Z","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-05T11:49:14.537081Z","title":"Gimenez-Palacios, M","venue":null,"work_id":"309810f8-3638-4b58-908f-7d2ae52fb4d4","year":2021},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:08.993366Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:88d7eba482c560407c4b75d36a27c575099f82f195f9161ae099b06e00129da8","observation_id":"c68a8506-a1fe-4a9e-b159-b8eea071b2ea","resolution":{"observed_at":"2026-08-05T11:49:14.614166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:14.366282Z","title":"An integer programming based heuristic approach to the three dimensional packing problem","venue":null,"work_id":"e32f5745-2009-44b2-afaa-d0779b78fbd6","year":1988},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.065108Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:6ca5f3c9e36fd852ad644664a9fba7901ef22509928a658cc368d6c5f28194fe","observation_id":"368609e3-6399-4036-994d-49326f0b608c","resolution":{"observed_at":"2026-08-05T11:49:14.443584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:14.196639Z","title":"The exact solutions of several types of container loading problems","venue":null,"work_id":"7b43ebac-5d02-481e-9b4e-89146e0d2646","year":2020},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.163798Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:e64c3466d1fe522f8c035d54d20a11fa171d177cfefc6ad2a52d4ae319881311","observation_id":"482e94bf-cf32-458e-926d-d8376b4b8645","resolution":{"observed_at":"2026-08-05T11:49:14.283795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.09110","last_updated":"2023-10-01T21:44:23Z","snapshot_observed_at":"2026-08-01T19:14:56.803459Z","submitted_at":"2022-11-16T18:51:34Z","title":"Holistic Evaluation of Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.09110","snapshot_observed_at":"2026-08-05T11:49:09.241889Z","title":"Holistic evaluation of language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.241889Z"},"links":{"cited_paper":"/paper/2211.09110","citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:37c21e6002189718433469f054666e087f5685de584d382442f484ea48e6cdd5","observation_id":"3bcefed3-ad27-4f6a-9290-df47929a375b","resolution":{"observed_at":"2026-08-05T11:49:09.241889Z","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-05T11:49:14.061972Z","title":"The container loading problem","venue":null,"work_id":"fce0f787-e99b-4590-8c8a-309e3edafc26","year":2005},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.316697Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:21e2fc617bf554218fdd5f9ebf8ae250052dafa9afdd736930a355a33dc058d2","observation_id":"7e21fd68-d516-4cbb-b500-82ce0d898e89","resolution":{"observed_at":"2026-08-05T11:49:14.129314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02051","last_updated":"2024-06-01T16:48:37Z","snapshot_observed_at":"2026-08-10T02:50:45.341878Z","submitted_at":"2024-01-04T04:11:59Z","title":"Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02051","snapshot_observed_at":"2026-08-05T11:49:09.401162Z","title":"Evolution of heuristics: Towards efficient automatic algorithm design using large language model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.401162Z"},"links":{"cited_paper":"/paper/2401.02051","citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:7bfafde43e14cbe6687ef30ad48df44e6245f042fe6da99ab044417047bd355d","observation_id":"3562725e-6bc9-4401-ad9d-4de5cbbf78b0","resolution":{"observed_at":"2026-08-05T11:49:09.401162Z","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-05T11:49:13.912589Z","title":"Heuristic methods for evolutionary computation techniques","venue":null,"work_id":"23223db6-7c38-4641-aabb-f66f4af57805","year":1996},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.486518Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:4d759b8792c5f1446d78a97b497644050c352243f045ba661833404d44d6d1d2","observation_id":"5a0a4825-1275-4b30-a4e9-44d373775a64","resolution":{"observed_at":"2026-08-05T11:49:13.984016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:13.798630Z","title":"Container packing problem with balance constraints","venue":null,"work_id":"aed9847f-1de1-4030-9fce-a305e5bf147a","year":2014},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.531790Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:a51cec75136102e8bd23256f0823efdfa44f0ee1f22d3a504186e3ca79787f13","observation_id":"000f0d71-e83f-4678-b74b-a35b35010b3a","resolution":{"observed_at":"2026-08-05T11:49:13.849930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:13.648487Z","title":"A grasp approach to the container-loading problem","venue":null,"work_id":"db852b04-46fa-4681-aad4-2d19b654e6a8","year":2005},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.596999Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:6783cf7d0bca9250daffaf16dd3c486476a4875a09373225186867ae716afdde","observation_id":"a900662e-1165-43e9-8385-4b2eb2197749","resolution":{"observed_at":"2026-08-05T11:49:13.720190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:13.534616Z","title":"Automating the planning of container loading for Atlas Copco: Coping with real-life stacking and stability constraints","venue":null,"work_id":"45560e34-f59f-4910-8707-6f727ee63f31","year":2020},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.664907Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:740baaaeb02f8f139e8e9b3ae4ba6071c75664b47a7aea232b6d7ec359a02363","observation_id":"b2e09f19-14f6-49db-abbd-b93dba13eaff","resolution":{"observed_at":"2026-08-05T11:49:13.580651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:09.728436Z","title":"Training language models to follow instructions with human feedback.Advances in neural information processing systems, 35:27730–27744, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.728436Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:25a30a3946cc47329b4676bee40c6eefa49ac3c0556717128d9f5d35e1d62df3","observation_id":"a9dfd9a8-4e8c-475f-96ac-8a9cfa08a0e7","resolution":{"observed_at":"2026-08-05T11:49:09.728436Z","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-05T11:49:13.377204Z","title":"A new load balance methodology for container loading problem in road transportation","venue":null,"work_id":"82a4b031-edc6-403b-8ecc-863d803de33a","year":2018},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.799445Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:2a81d38c23a688ca5b0429d1d9b201400a9745f5b066a966c0e69d03d21dc62e","observation_id":"5cb69f69-4e56-421d-acbe-07ba8089c4ee","resolution":{"observed_at":"2026-08-05T11:49:13.450930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:13.248041Z","title":"Mathematical discoveries from program search with large language models","venue":null,"work_id":"61471368-3e3b-4f99-97af-0cb12b44e975","year":2024},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.854484Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:96753f8b6f1a9880f9f742f3fc0209fb06973536024f249fa575616188743aa5","observation_id":"e23d0b67-0447-47a8-82b6-9db35b48c3a3","resolution":{"observed_at":"2026-08-05T11:49:13.305872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:13.108666Z","title":"Heuristic algorithm for the container loading problem with multiple constraints","venue":null,"work_id":"e3be866c-8f01-4571-ad02-f5e504621748","year":2017},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:09.964237Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:6aa4a56011d71ead8a714a87e6b4b28320193772e3b5c5a1b55ba5dbf3af362e","observation_id":"c861e44f-f7cc-4b30-ad66-2b6c08c57c06","resolution":{"observed_at":"2026-08-05T11:49:13.170222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:12.961674Z","title":"Large language models as optimizers","venue":null,"work_id":"f6c4c6e6-8083-433d-855b-1aa0549a88b0","year":2023},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:10.044648Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:82c3b233d6adb114bcbfbdaf0954a2aa9c7323c8c2a28fdbe2e92bacc5088f1b","observation_id":"b80b2616-3106-4ecc-b241-2ec8e5d5c17d","resolution":{"observed_at":"2026-08-05T11:49:13.039497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:12.818669Z","title":"Reevo: Large language models as hyper-heuristics with reflective evolution","venue":null,"work_id":"86ac9d4a-6608-4306-a728-0d1302b10450","year":2024},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:10.116543Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:989449df620c96d5eb96dcbeefbed03bd797b3f9a74ad64d232bb4e8d81b27c6","observation_id":"0eee7321-9838-43af-b228-2055d5975e24","resolution":{"observed_at":"2026-08-05T11:49:12.886351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.10009","last_updated":"2025-08-01T04:52:21Z","snapshot_observed_at":"2026-08-07T17:08:15.599661Z","submitted_at":"2025-03-13T03:40:50Z","title":"OR-LLM-Agent: Automating Modeling and Solving of Operations Research Optimization Problems with Reasoning LLM","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.10009","snapshot_observed_at":"2026-08-05T11:49:10.186743Z","title":"Or-llm-agent: Automating modeling and solving of operations research optimization problem with reasoning large language model","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:10.186743Z"},"links":{"cited_paper":"/paper/2503.10009","citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:628c05b25516287dc30e013cbd2a0d3bb93ff54c39aa4433c7169eb80f159437","observation_id":"0430d228-1560-44bb-8a73-1fe1c731d7ef","resolution":{"observed_at":"2026-08-05T11:49:10.186743Z","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-05T11:49:12.679986Z","title":"Integer linear programming models for the containership stowage problem","venue":null,"work_id":"a3869fb1-bd20-4ba7-bc07-98399e682abd","year":2020},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:10.257790Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:80ae869f98d9f8453f407f5ce3b8ab9ea0d9bb3e76c6744c030efaf2880a5602","observation_id":"c70ac301-b739-48ab-8dd7-258200e64739","resolution":{"observed_at":"2026-08-05T11:49:12.735364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:12.533633Z","title":"naive approach","venue":null,"work_id":"bdade5b4-d076-404a-99aa-944e9415089b","year":2012},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:10.331535Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:a0a6da6ba28e0c751b6638fe3e070da2bc608f3ba11326eda6d61cf35fce2485","observation_id":"a69756dd-c643-4fac-a6eb-5b85493cb14a","resolution":{"observed_at":"2026-08-05T11:49:12.613521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:11.949245Z","title":null,"venue":null,"work_id":"67e8a8c2-87d8-49f1-af09-3788c328d2e8","year":null},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:10.661475Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:e7cabc95ebf500af1aeabeecf4735274b8096ce2f9329c5d373891e7a5639762","observation_id":"87e6bf6c-ab7d-4ebe-987e-e0d99430c0b4","resolution":{"observed_at":"2026-08-05T11:49:12.028140Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:11.668859Z","title":"Constraint Scaffolding","venue":null,"work_id":"9d75ac7b-6043-4e22-8f7a-74b77e6d2137","year":null},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:10.823215Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:4f78d79cf3831ddb04e30e6e447ddec277bd31fc05ea5fba4d05bf1ff734b9a6","observation_id":"7c2b750f-cfa0-4e1a-b1ce-48c23e9d4445","resolution":{"observed_at":"2026-08-05T11:49:11.738582Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:12.398363Z","title":"No weight or support constraints apply","venue":null,"work_id":"e041cc25-d5af-4ad7-9057-ffa6285a9615","year":null},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:10.874540Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:d4fa558dd060d9ac3ca98801285402f0f6288d0d011fbadf373afeb380d061c9","observation_id":"2f73228b-442e-447c-b158-af4f8d323cdb","resolution":{"observed_at":"2026-08-05T11:49:12.455163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:12.244393Z","title":null,"venue":null,"work_id":"f2769706-bff7-4d7a-85cc-a6c21431ba48","year":null},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:10.933198Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:7093f2ceab9b7bc8df5f7ea90fd6ee8b46a84fcf517ee4660323716143c3c0ad","observation_id":"c4e1d0e5-0c4f-41e6-aca9-fae61f7f2ba4","resolution":{"observed_at":"2026-08-05T11:49:12.297690Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:12.107524Z","title":"There are 6 possible orientations","venue":null,"work_id":"6f10600e-5601-4b08-961a-b5552b9106c0","year":null},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:11.001800Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:237270792518641094cf3652cae3d21c2bbf13eb7b7b12f1cd181db9ae7c54d5","observation_id":"73e6b061-d2ef-43af-a2d7-ab2332bed035","resolution":{"observed_at":"2026-08-05T11:49:12.181978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:11.504043Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem 17","venue":null,"work_id":"9e1ff935-d3c1-4215-99e0-bf4c19e519ee","year":null},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:11.040204Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:c184861683ca44cedd60f1b2c54d0978102b01afd299b6bd3a9444f567998ee4","observation_id":"37799ff5-db03-4a1c-b8e3-5bf24f7cc451","resolution":{"observed_at":"2026-08-05T11:49:11.588600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:11.800142Z","title":null,"venue":null,"work_id":"0f2b283e-68e5-48f2-abc2-0283b12d8267","year":null},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:11.142038Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:958b591f9aabe885f533e2303b3e37ace626ef02d924388a2222de878fb3324c","observation_id":"2fa3646e-4f89-42a0-8fa6-8589f3beab92","resolution":{"observed_at":"2026-08-05T11:49:11.866396Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:49:11.346504Z","title":"epsilon should be a small positive value","venue":null,"work_id":"37bae02b-16e3-4105-9a43-f7ade25972d1","year":null},"citing_paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T11:49:11.205063Z"},"links":{"citing_paper":"/paper/2509.02297"},"observation_digest":"sha256:8594ee8429a33f99106152fab7765831c535bb3e520b644f333d0df78d817201","observation_id":"5f97285f-bbb3-46fc-b91b-926543e6c7ed","resolution":{"observed_at":"2026-08-05T11:49:11.422705Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.02297","last_updated":"2025-09-02T13:18:47Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-09T06:28:51.686185Z","submitted_at":"2025-09-02T13:18:47Z","title":"Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":27},"total_outbound_references":38},"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 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2509.02297."}