{"as_of":"2026-08-17T14:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9da05311cea33b9e7a366e8668a4d6f4efa8eb970a99aca74c00f5d4caa11ebe","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:25:06.181230Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:38:53.253639Z","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-08T05:44:10.720881Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"cited_work":{"arxiv_id":"2501.11411","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.11411","snapshot_observed_at":"2026-08-08T05:44:10.720881Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","venue":"cs.NE","work_id":"caffd021-bd1c-474e-94de-c7be04845c96","year":2025},"citing_paper":{"arxiv_id":"2502.08298","last_updated":"2025-02-12T10:58:57Z","snapshot_observed_at":"2026-08-11T21:19:49.270749Z","submitted_at":"2025-02-12T10:58:57Z","title":"Improving Existing Optimization Algorithms with LLMs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T05:44:10.252559Z"},"links":{"cited_paper":"/paper/2501.11411","citing_paper":"/paper/2502.08298"},"observation_digest":"sha256:37dd852b6bc840a3779cbdf320d6f3bf716f35fdc1e5a777e40c579925cf1e15","observation_id":"5a113cbf-f29e-4002-a9b6-b13d1a99af09","resolution":{"observed_at":"2026-08-08T05:44:10.726413Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.11411","snapshot_observed_at":"2026-08-16T05:38:53.253639Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.20183","last_updated":"2025-04-28T18:34:09Z","snapshot_observed_at":"2026-08-16T05:33:09.058825Z","submitted_at":"2025-04-28T18:34:09Z","title":"BLADE: Benchmark suite for LLM-driven Automated Design and Evolution of iterative optimisation heuristics","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T05:38:53.253639Z"},"links":{"cited_paper":"/paper/2501.11411","citing_paper":"/paper/2504.20183"},"observation_digest":"sha256:6b92a39d03546959f0db2e0ad6df8bc5883b9dc780f10214bc3f403208d1dd27","observation_id":"38c73595-29b5-485e-b070-bee6bacdca02","resolution":{"observed_at":"2026-08-16T05:38:53.253639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.11411/citation-record","integrity":"/paper/2501.11411/integrity","json":"/paper/2501.11411/citation-record.json","paper":"/paper/2501.11411"},"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-10T18:25:06.741064Z","title":"https://site.unibo.it/ operations-research/en/research/bpplib-a-bin-packing-problem-library","venue":null,"work_id":"ba8d6cc9-e221-48ad-8eb7-3859532b68eb","year":null},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.037615Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:b81312966e04d9ed327d3d6f2889de6329f822222744b7c79e7595d6d3c98bd9","observation_id":"748abc49-884a-49f6-811a-f133484f050a","resolution":{"observed_at":"2026-08-10T18:25:06.747090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.728070Z","title":"In: Proceedings of the Genetic and Evolutionary Computation Conference","venue":null,"work_id":"417e038d-8e25-448d-9f3c-6bdf3bc359b0","year":2019},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.042421Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:96ee89db91298dcc9ced16aea2f35e11ab31e3b2d7776ab2b0e002fea90c86a6","observation_id":"3b57abb8-de14-4609-b650-24b80224c1d3","resolution":{"observed_at":"2026-08-10T18:25:06.732406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.712391Z","title":"Journal of Artificial Intelligence Research78, 1111–1141 (2023)","venue":null,"work_id":"6cc75300-2bd6-4c16-a82a-c88f102d2395","year":2023},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.046897Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:28f5321a0ccbac77392f61822a3ee3b6ff20ee853cef5c5fbdf410a8c4c2cc6e","observation_id":"2435455e-f0d4-48df-b92c-a927188efb67","resolution":{"observed_at":"2026-08-10T18:25:06.717816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.696755Z","title":"https:// github.com/shahink84/BinPackingPredictions/tree/main/Data/Benchmarks (2024)","venue":null,"work_id":"abe00ba3-fa2e-4475-8d84-648d67b2e13f","year":2024},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.051221Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:1f536c0152f893c16fb1be00478eb380851994a9c85b5f9cd3ef88694f4f13e4","observation_id":"d12fb9fe-333d-4131-a9ef-16e5ec4ca47e","resolution":{"observed_at":"2026-08-10T18:25:06.701333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.14162744","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:06.224159Z","title":null,"venue":null,"work_id":"7b451b92-1e11-4147-9f13-d54a0d529cc1","year":2024},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.055397Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:98b3fd46ac9422e648728da1e1a2afcff891ea78648fe408221be7d5fd3f145a","observation_id":"be44696e-31f5-46f6-9721-0242eeea36a2","resolution":{"observed_at":"2026-08-10T18:25:06.229448Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.682622Z","title":"Journal of the operational research society41(11), 1069–1072 (1990)","venue":null,"work_id":"4cf2aa26-e32b-4610-9cdb-342d84f2fe5f","year":1990},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.059579Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:70b4217c9d7c2cede31d300e513f475bb07e773856ac648e94a526c6302cc55e","observation_id":"8c206018-d055-44ed-bb88-d9526cf31c11","resolution":{"observed_at":"2026-08-10T18:25:06.687059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.668680Z","title":"European Journal of Operational Research 290(2), 405–421 (2021)","venue":null,"work_id":"fa8e064b-1586-4bde-8c4c-4a34bfa55274","year":2021},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.063757Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:b70ac51e30422ba35308d2ce447472025a1d07104f301dd53cc89eb085bb5c62","observation_id":"3c75b832-d607-494d-b2b3-3ed5bc1e8549","resolution":{"observed_at":"2026-08-10T18:25:06.673127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.653546Z","title":"Journal of the Operational Research Society 64(12), 1695–1724 (2013)","venue":null,"work_id":"75a521d4-c718-4530-b334-bbd56c6e607e","year":2013},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.067950Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:f0e944f5020feeb6479bbdf65eff284be67c0a8d8fdf62155f96d968105e49dd","observation_id":"870d9d30-a4c2-4e9e-a356-11c653e3720a","resolution":{"observed_at":"2026-08-10T18:25:06.658278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.640101Z","title":"Evolutionary computation 20(1), 63–89 (2012)","venue":null,"work_id":"28fed623-c9bf-457b-a1e8-77c817a44a48","year":2012},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.071885Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:358bfed2b532c550b1b68573939b83fb1ccc7169117efbad08a3c56dbf5f0f7a","observation_id":"b5b96080-bea8-4202-a46a-d78966178958","resolution":{"observed_at":"2026-08-10T18:25:06.644249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.627461Z","title":"In: International Conference on Principles and Practice of Constraint Programming","venue":null,"work_id":"33380c74-be80-49de-b76a-0d6f370cd210","year":2012},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.075659Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:6f4f313e65e42a3b1e2a9301d43e49d3f1162ebcbf4345b532b80a76b2f80421","observation_id":"9a4be25d-c56e-49cf-a9d1-6cd27d3d68f6","resolution":{"observed_at":"2026-08-10T18:25:06.631854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.614064Z","title":"European Journal of Operational Research 255(1), 1–20 (2016)","venue":null,"work_id":"1d4ca3ff-5826-4b5c-a9ca-3c536187eec9","year":2016},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.079801Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:f910551751ab4da8649c9a7ca3692a807b34c14eea7ec92c798a882dc94673ad","observation_id":"74a872fa-c8dc-4b2a-acb8-30fbb5c631a9","resolution":{"observed_at":"2026-08-10T18:25:06.618814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.600393Z","title":"In: ICRA","venue":null,"work_id":"32c298b2-77bc-4e1e-a9a7-76bf820b9f07","year":1992},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.083715Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:ef958f86a48e5225fa506010caa29ac362e363705304988f8c4f6c0ed1e10476","observation_id":"6e43848f-7950-4954-adff-317beb416459","resolution":{"observed_at":"2026-08-10T18:25:06.605103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.582089Z","title":"INFORMS Journal on Computing28(1), 175–194 (2016)","venue":null,"work_id":"e2d47da6-298b-4ecf-8b3f-723087f0bc49","year":2016},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.087853Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:26baa401c78789bfde751a413d57c5291dbe2be0629b2e1b228939208d7bd1e7","observation_id":"62cd5a8b-4e7e-4f16-aafb-eacc119277d5","resolution":{"observed_at":"2026-08-10T18:25:06.589503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.092401Z","title":"Optimiza- tion Methods and Software 36(1), 114–144 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.092401Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:793d973139561ee52a2cae260b3b44fe55568ac548cda04459cd4487d46f8dde","observation_id":"049ceff7-10ef-49d0-a012-071eb1e4c728","resolution":{"observed_at":"2026-08-10T18:25:06.092401Z","resolver_source":null,"status":"malformed_identifier"},"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-10T18:25:06.097276Z","title":"Evolutionary Computation9(2), 159–195 (2001).https://doi.org/10","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.097276Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:78ee6dc2fa1433da3003ebb1f9adfbadf1b62bea480e614d1ed5bb743ccae9f5","observation_id":"aae128da-bebc-4270-8f62-e6a03cbffe0f","resolution":{"observed_at":"2026-08-10T18:25:06.097276Z","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-10T18:25:06.558432Z","title":null,"venue":null,"work_id":"479bbf00-3e9b-45e3-8a31-f9a1d2919f37","year":1973},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.101337Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:86dfd5aeac254f1c9e1d9536656d89784a34dde30c03cabdf375fd258c547548","observation_id":"d78235a5-9b7a-4ff8-868d-e51f985cb6ca","resolution":{"observed_at":"2026-08-10T18:25:06.563066Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.543638Z","title":"In: Forty-first International Conference on Machine Learning (2024)","venue":null,"work_id":"44ff645f-6468-47f1-ac3e-09ab9633a84f","year":2024},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.105473Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:d0917ff30657e9f1a62049f91f0c3cc5288aa7760fa939e51a477a8c2bb4dbef","observation_id":"5b2b67d2-b55e-40ae-a7a0-d5af6da5dcd6","resolution":{"observed_at":"2026-08-10T18:25:06.548105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.530848Z","title":"Opera- tions Research Perspectives3, 43 – 58 (2016)","venue":null,"work_id":"2259b71e-fb3d-4e22-8702-f10b337aaef6","year":2016},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.110563Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:b224aa8793c07bca94131fb9c6b7b8e8d3181f21e3fbdfb211005af1259d9168","observation_id":"1f5279aa-74e5-4a48-92ea-ed472c35c621","resolution":{"observed_at":"2026-08-10T18:25:06.535380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.515037Z","title":"European Journal of Operational Research (2024)","venue":null,"work_id":"633a45ee-6a1b-4726-92a8-fef3eae2d084","year":2024},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.114785Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:a0339af6334de4679257ac30ede0607d687c246371131e96fba9db223902a1de","observation_id":"5179c135-1379-4785-bb55-23b6feaca1d4","resolution":{"observed_at":"2026-08-10T18:25:06.521232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.501670Z","title":"In: European Conference on Evolution- ary Computation in Combinatorial Optimization (Part of EvoStar)","venue":null,"work_id":"a62a3c8b-64dd-47c6-8e8c-efa2ffd97045","year":2019},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.119128Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:1278cb584b63f85a1975e2d89718b0ebe96b7e4c95d64f9126c291c35ce1aecd","observation_id":"b814e0f3-953c-4a47-9d80-a86229b9b936","resolution":{"observed_at":"2026-08-10T18:25:06.506250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.122957Z","title":"Journal of Machine Learning Research12, 2825–2830 (2011)","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.122957Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:adf9eb1c5a82dd9330d5ce789b344da327e23259392e7520aa6f93d287b95835","observation_id":"ea9bd72f-f9d0-46f3-aaa4-4cc8dc2bfdaf","resolution":{"observed_at":"2026-08-10T18:25:06.122957Z","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-10T18:25:06.478286Z","title":"In: ProceedingsoftheGeneticandEvolutionaryComputationConferenceCompanion","venue":null,"work_id":"525dfbed-8712-4255-9846-b1fcfdf98f26","year":2024},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.127668Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:af96dfff2f5b2859a6acb0301a3cdbf03804468d527ee3f4f0a3efc92e1107a6","observation_id":"9a518fa1-2b35-46c9-a7d3-bd089a49faf6","resolution":{"observed_at":"2026-08-10T18:25:06.483239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.465508Z","title":"In: Proceedings of the 2014 annual conference on genetic and evolutionary computa- tion","venue":null,"work_id":"3b890ecb-6269-41d2-86e0-7ce2bc369dfb","year":2014},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.132133Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:5bfcec3cad36a850dccdaebdf32ac0cecd10809aac8a60d7ad222de96f944507","observation_id":"eb403d2e-8043-4241-925f-18039e3284d7","resolution":{"observed_at":"2026-08-10T18:25:06.470115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.453925Z","title":"Chapman and Hall/CRC (2008)","venue":null,"work_id":"eb3b4995-d878-4c5f-be36-80bea2855244","year":2008},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.135936Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:3ab0bd19e2a6078cfc47c98c4df961fd38cc3ef0d53f13cc00e8212ff6a0e64b","observation_id":"f6218b7b-6ab3-459c-8ceb-ed4a83bb9a41","resolution":{"observed_at":"2026-08-10T18:25:06.457756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.440299Z","title":"Nature625(7995), 468–475 (2024)","venue":null,"work_id":"cbc24b2e-1213-4092-b44d-5ba02703c6d1","year":2024},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.139925Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:3785a90acc3a43d49a637acbb91a22f37660b245cc5a9bba79d23c98008a077a","observation_id":"854dce43-4a31-4cf8-b07a-6ce46ae9a55a","resolution":{"observed_at":"2026-08-10T18:25:06.445176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.426030Z","title":"IEEE Access8, 128068–128095 (2020)","venue":null,"work_id":"63f5a7c3-eb95-40c4-a5fe-6fb1aac3b1e6","year":2020},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.143770Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:e3ec7c9a4e04735603dc6bc18758560e5f944c54c188db9545843769aaf7d085","observation_id":"4516ad2e-06b9-4b74-8519-c6f7f4e43bd2","resolution":{"observed_at":"2026-08-10T18:25:06.430435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.412619Z","title":"Computers & Operations Research 24(7), 627–645 (1997)","venue":null,"work_id":"f0f1c82b-71a4-4cc6-b4c9-243c8e7ce4b7","year":1997},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.147530Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:6c194083d172428b7e984a47734f4b97b4ddb14a8985f06d1f73fb5b27096541","observation_id":"ed0cd81c-3de4-437d-a857-20e47bea511b","resolution":{"observed_at":"2026-08-10T18:25:06.417409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.399433Z","title":"ACM Computing Surveys55(12), 1–31 (2023)","venue":null,"work_id":"16f4c51c-892e-4987-866f-13b97d3feaea","year":2023},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.151697Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:e7d5f180b80246028c99d5700fe4bfbfa789b206c23249e7c0a929b0c7a3bdfc","observation_id":"0d4ce171-74d8-4d64-ba0b-f0e61f612d02","resolution":{"observed_at":"2026-08-10T18:25:06.403667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20132","last_updated":"2025-01-30T08:54:54Z","snapshot_observed_at":"2026-08-17T02:01:48.946484Z","submitted_at":"2024-05-30T15:10:59Z","title":"LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristics","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20132","snapshot_observed_at":"2026-08-10T18:25:06.155809Z","title":"arXiv preprint arXiv:2405.20132 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.155809Z"},"links":{"cited_paper":"/paper/2405.20132","citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:640c48407058383eac84311d4c03883c873bfa6a69b5c2d11dee169830c7940c","observation_id":"04edc034-e755-4901-8288-9be7bf188a9b","resolution":{"observed_at":"2026-08-10T18:25:06.155809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16309","last_updated":"2024-10-07T14:04:31Z","snapshot_observed_at":"2026-08-16T13:11:54.376705Z","submitted_at":"2024-10-07T14:04:31Z","title":"In-the-loop Hyper-Parameter Optimization for LLM-Based Automated Design of Heuristics","version":1},"cited_work":{"arxiv_id":"2410.16309","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.16309","snapshot_observed_at":"2026-08-10T18:25:06.262480Z","title":"In-the-loop Hyper-Parameter Optimization for LLM-Based Automated Design of Heuristics","venue":"cs.NE","work_id":"e85f29e3-13a6-484e-a709-606a23516b80","year":2024},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.160149Z"},"links":{"cited_paper":"/paper/2410.16309","citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:6a19086a0590b5e8f2dcc27f2f5f7585f0c2ced4d40ecae625905863f5e312d7","observation_id":"40d22cbd-175c-463c-aacd-685014e68f1e","resolution":{"observed_at":"2026-08-10T18:25:06.268131Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.164463Z","title":"Journal of Global Optimization11(4), 341–359 (1997)","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.164463Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:65cd66ff77737f528304712c092f0413f601a38abac0dbfd1a16f367d00f1b9f","observation_id":"ff0785d8-700d-4ae0-901a-9d97498361be","resolution":{"observed_at":"2026-08-10T18:25:06.164463Z","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-10T18:25:06.384569Z","title":"Applied Soft Computing130, 109696 (2022) Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing 17","venue":null,"work_id":"90034d4f-51c8-4577-b321-8bd0ec9a5caa","year":2022},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.169036Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:184034ffc0454d463aab2f7e303f73dda4e04e332ea0939d099336e4db537651","observation_id":"0ec92ba4-2283-4142-b917-2501cbb4c52b","resolution":{"observed_at":"2026-08-10T18:25:06.389749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:25:06.369703Z","title":"Operations-Research-Spektrum 18, 131–144 (1996)","venue":null,"work_id":"90a679f8-4ce0-41f2-a269-68f9f3fe3d31","year":1996},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.172809Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:2b7d89d519c3bef0c8a35f19931107ae5ef73216eaf1b48bcfe326b43560020b","observation_id":"24d83f1b-9690-4a9e-b1a1-32657d81efd7","resolution":{"observed_at":"2026-08-10T18:25:06.374102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01145","last_updated":"2024-10-14T13:50:46Z","snapshot_observed_at":"2026-08-16T14:22:16.232177Z","submitted_at":"2024-02-02T05:04:51Z","title":"ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01145","snapshot_observed_at":"2026-08-10T18:25:06.176570Z","title":"arXiv preprint arXiv:2402.01145 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.176570Z"},"links":{"cited_paper":"/paper/2402.01145","citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:09b4f4ff8d48a00e74ea1c16321647869648911198c9a14d45c0096c9b218636","observation_id":"d39dd407-74c0-434f-8676-797c7c9fcbec","resolution":{"observed_at":"2026-08-10T18:25:06.176570Z","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-10T18:25:06.181230Z","title":"In: International Conference on Parallel Problem Solving from Nature","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:06.181230Z"},"links":{"citing_paper":"/paper/2501.11411"},"observation_digest":"sha256:15e48bde1b03e69d0c24df4f8c17663eac8b640967538de52c1566a8d55fe8b6","observation_id":"967e6e49-2659-4110-9af1-856818172afb","resolution":{"observed_at":"2026-08-10T18:25:06.181230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.11411","last_updated":"2025-01-20T11:23:50Z","latest_version":1,"primary_category":"cs.NE","snapshot_observed_at":"2026-08-11T19:16:36.804746Z","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":25},"total_outbound_references":35},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 2 inbound Pith citation observations for arXiv:2501.11411."}