{"as_of":"2026-08-11T11:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d27f7cc3cdd3c83ea4dee79083756251af4a8d61cebf59e9a63e6cac746d2618","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T07:02:52.919799Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2510.27353/citation-record","integrity":"/paper/2510.27353/integrity","json":"/paper/2510.27353/citation-record.json","paper":"/paper/2510.27353"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T07:02:49.273746Z","title":"Springer, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:49.273746Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:37fb00908238a92131cbf56964da2b5aeeafca070044a704bdcc8e950cc5b3db","observation_id":"2cca1c60-9de2-4a3a-924b-db66b99245a9","resolution":{"observed_at":"2026-08-04T07:02:49.273746Z","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-04T07:02:49.340316Z","title":"Hyper-heuristics: A sur- vey of the state of the art.Journal of the Opera- tional Research Society, 64(12):1695–1724, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:49.340316Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:508f38f44cb02946c4d6c6831476f0530c34ec419ecc40e07457ca80c9c7a9e8","observation_id":"4c27b7fc-b5b3-4c53-aaec-6ad58e302bb3","resolution":{"observed_at":"2026-08-04T07:02:49.340316Z","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-04T07:02:49.463317Z","title":"Au- tomated design of metaheuristic algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:49.463317Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:8594670a069c8159b83cd625ea6ae8777ad24c320a737dc6f0557b0097cd0e75","observation_id":"4405758a-f8f9-48a6-97a6-043708be9452","resolution":{"observed_at":"2026-08-04T07:02:49.463317Z","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-04T07:02:49.587115Z","title":"Springer Science & Business Media, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:49.587115Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:dfb9a753a4aeebf6719d42bdd24135e2474dbcc28320aec14e719c9464658e44","observation_id":"a0c6f9c0-1f25-4e68-bad8-2ce2c9497b97","resolution":{"observed_at":"2026-08-04T07:02:49.587115Z","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-04T07:02:49.752781Z","title":"Survey on genetic programming and machine learning techniques for heuristic design in job shop scheduling.IEEE Transac- tions on Evolutionary Computation, 28(1):147– 167, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:49.752781Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:990094d6bc4fe93fca884c1549646ba93bed3876de5454dd09c8f434ab1c947d","observation_id":"ae2b5105-5676-4634-8aa2-53c21c7e660f","resolution":{"observed_at":"2026-08-04T07:02:49.752781Z","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-04T07:02:49.925102Z","title":"Mathematical discoveries from program search with large language mod- els.Nature, 625(7995):468–475, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:49.925102Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:80c07c4acaca58946bf0e4ed404558870c71cb4bb4b711f9762fd6f35c973cc0","observation_id":"87bc83ab-7cc1-4a9c-b6a2-34d535aae4cd","resolution":{"observed_at":"2026-08-04T07:02:49.925102Z","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-04T07:02:50.046433Z","title":"Machine learning for combina- torial optimization: a methodological tour d’horizon.European Journal of Operational Re- search, 290(2):405–421, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.046433Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:e58b3a3423ae7814c6da69eba4680ee445de736130483892c51b577bcad2306d","observation_id":"ba11b80e-a5f8-494e-a0a4-f38543c112d9","resolution":{"observed_at":"2026-08-04T07:02:50.046433Z","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-04T07:02:50.155500Z","title":"Evolutionary compu- tation in the era of large language model: Survey and roadmap.IEEE Transactions on Evolution- ary Computation, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.155500Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:2a0dc5f575f7ad5a48c84fc7618040c80c7388ace3aa830d5b67473297d601e4","observation_id":"7eff26f5-39dd-4949-b75f-5ffdedc256d7","resolution":{"observed_at":"2026-08-04T07:02:50.155500Z","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-04T07:02:50.247469Z","title":"New applications of the poly- nomial method: the cap set conjecture and be- yond.Bulletin of the American Mathematical Society, 56(1):29–64, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.247469Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:383d3ea2d721163079e7c566a80dd4d90722ab7b33aeed67c215024e092354a8","observation_id":"2711e4c7-4882-4dc8-b686-130dadcb2957","resolution":{"observed_at":"2026-08-04T07:02:50.247469Z","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-04T07:02:50.331584Z","title":"Cambridge University Press, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.331584Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:a4932d6edc3d9ac962d71fbca6679f1799a78a2af0a06be7810460756fa7dbf2","observation_id":"85cd66f4-e38d-4cdc-a5b6-55ba01c2ece2","resolution":{"observed_at":"2026-08-04T07:02:50.331584Z","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-04T07:02:50.423696Z","title":"Approximation algorithms for bin-packing—an updated survey","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.423696Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:3d7fb79955a0656a6f5291e9037b167de29fdba5e0450288548eec72a15cd915","observation_id":"f56fc9ae-6911-4a25-9637-f097b89b1b1a","resolution":{"observed_at":"2026-08-04T07:02:50.423696Z","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-04T07:02:50.496667Z","title":"Hyper-heuristics: An emerging direction in mod- ern search technology","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.496667Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:f386b15cea16173459264e8ee63bd64c87d23b3d7bcdf24fc1177755db1d7231","observation_id":"a95c76b1-69bc-464b-a4ed-2b94a6e218df","resolution":{"observed_at":"2026-08-04T07:02:50.496667Z","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-04T07:02:50.612754Z","title":"Hyper-heuristics: learning to combine simple heuristics in bin- packing problems","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.612754Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:bf50530bd9c6c92e17e889a07ce4a354b274e09474a6da75877c85d722c58e7f","observation_id":"a01c63c7-6546-4e8d-8973-217cd5f61b0c","resolution":{"observed_at":"2026-08-04T07:02:50.612754Z","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-04T07:02:50.696034Z","title":"A lifelong learning hyper-heuristic method for bin packing.Evolutionary computation, 23(1):37–67, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.696034Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:bbe7cf4f52ee8ea8fae042d39bf7de6f22f1cc630799b5b9991e6bc868efcc2f","observation_id":"8cce6e1e-2ae9-49ec-bb25-bf9d8114d773","resolution":{"observed_at":"2026-08-04T07:02:50.696034Z","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-04T07:02:50.784990Z","title":"Handbook of evolutionary compu- tation.Release, 97(1):B1, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.784990Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:4e782d32cfdd8b04cd307a6b5c4aab4b8b030bc0209e16b74fd33691e039fa05","observation_id":"69c9a39c-206b-4512-95ac-ebef1d071883","resolution":{"observed_at":"2026-08-04T07:02:50.784990Z","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-04T07:02:50.842383Z","title":"From evolu- tionary computation to the evolution of things","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.842383Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:99c4f7038de20f2941c0cde583b49e635cd5189abcc5a5b5f1534687c3f0e875","observation_id":"0e5759df-76a8-42e3-8a33-89f91eed3a9f","resolution":{"observed_at":"2026-08-04T07:02:50.842383Z","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-04T07:02:50.929009Z","title":"Explainable artificial in- telligence by genetic programming: A survey","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.929009Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:79405e058e200a73cb4c71bb0dae8bef837c7df278c3eaa655cc15f7a29911f2","observation_id":"c6059eee-41d0-4d5a-8b5f-3a5356dcd047","resolution":{"observed_at":"2026-08-04T07:02:50.929009Z","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-04T07:02:50.993112Z","title":"Learn- ing heuristics with different representations for stochastic routing.IEEE Transactions on Cy- bernetics, 53(5):3205–3219, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:50.993112Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:226f9f354d43d3cbe358b36f1172215e53fb9745678f5edd6286095c679631d1","observation_id":"cdbaf762-101e-4788-858e-ee8c89cb997f","resolution":{"observed_at":"2026-08-04T07:02:50.993112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04023","last_updated":"2023-11-28T09:01:12Z","snapshot_observed_at":"2026-08-07T14:17:12.140094Z","submitted_at":"2023-02-08T12:35:34Z","title":"A Multitask, Multilingual, Multimodal Evaluation of ChatGPT on Reasoning, Hallucination, and Interactivity","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04023","snapshot_observed_at":"2026-08-04T07:02:51.053045Z","title":"A multitask, multilingual, multimodal evaluation of chatgpt on reasoning, hallucination, and inter- activity.arXiv preprint arXiv:2302.04023, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.053045Z"},"links":{"cited_paper":"/paper/2302.04023","citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:e305f72466f1bf109bf33a9958405c7d893e780f06dacdfe3158f43cf53c51ff","observation_id":"aa47e481-8846-4485-874a-0c506cc36e5a","resolution":{"observed_at":"2026-08-04T07:02:51.053045Z","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-04T07:02:51.169451Z","title":"Evolving code with a large language model.Genetic Programming and Evolvable Ma- chines, 25(2):21, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.169451Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:0b1839fc366324e80c4b6b6809f3805d9715410a728fcc07e17282ef73f2e44b","observation_id":"524cd439-fa95-4417-ae98-5d0c872170f9","resolution":{"observed_at":"2026-08-04T07:02:51.169451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.10510","last_updated":"2025-03-07T05:29:18Z","snapshot_observed_at":"2026-08-10T08:06:35.323700Z","submitted_at":"2024-01-19T05:58:30Z","title":"When Large Language Models Meet Evolutionary Algorithms: Potential Enhancements and Challenges","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.10510","snapshot_observed_at":"2026-08-04T07:02:51.221934Z","title":"When large language models meet evolutionary algo- rithms.arXiv preprint arXiv:2401.10510, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.221934Z"},"links":{"cited_paper":"/paper/2401.10510","citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:53e5c7a73063ce432c5033f0e18826853631a8226b054031fedbd65ab67d884f","observation_id":"825d5d43-0743-4dbc-84e1-0eb60562a617","resolution":{"observed_at":"2026-08-04T07:02:51.221934Z","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-04T07:02:51.303718Z","title":"Bridging evolutionary algorithms and reinforcement learning: A com- prehensive survey on hybrid algorithms.IEEE Transactions on evolutionary computation, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.303718Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:9237223e2d899724a709acebf15bf4870822a7418e009dbec387811429feb2cc","observation_id":"71449c17-a1f5-4072-aa7c-2c22fa30ca3d","resolution":{"observed_at":"2026-08-04T07:02:51.303718Z","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-04T07:02:51.384081Z","title":"Fully autonomous programming with large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.384081Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:63abecacee8fb03b3c30ad974c63bed31ff0b7f36ad28ac5451506957fab93da","observation_id":"eec45dc4-b4dc-46e3-83b2-fcd3c036bdf3","resolution":{"observed_at":"2026-08-04T07:02:51.384081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12931","last_updated":"2024-04-30T21:35:53Z","snapshot_observed_at":"2026-08-02T10:40:03.816188Z","submitted_at":"2023-10-19T17:31:01Z","title":"Eureka: Human-Level Reward Design via Coding Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12931","snapshot_observed_at":"2026-08-04T07:02:51.496901Z","title":"Eureka: Human-level reward de- sign via coding large language models.arXiv preprint arXiv:2310.12931, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.496901Z"},"links":{"cited_paper":"/paper/2310.12931","citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:6b264fb74eef0e23d90ed367bc2819532ace4785d7ad6629bdd41a9dbaa925f5","observation_id":"1dc635c3-8e90-4212-b363-f1f95fe70e71","resolution":{"observed_at":"2026-08-04T07:02:51.496901Z","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-04T07:02:51.573828Z","title":"Evolution through large models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.573828Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:eae89298b0083288952651352e01eed472f7f0e6ea88bf61b067c8db1227c59b","observation_id":"8ba8c08b-f206-40fa-af6c-74acb76e0d2f","resolution":{"observed_at":"2026-08-04T07:02:51.573828Z","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-04T07:02:51.648960Z","title":"Advancing math- ematics by guiding human intuition with ai.Na- ture, 600(7887):70–74, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.648960Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:62fedd514211a1d0553e7ff44104582c4697ef4b7d4fd1318c61ab656e2f3b33","observation_id":"1061c6a8-bd3a-42bd-9af5-97a1c51037d5","resolution":{"observed_at":"2026-08-04T07:02:51.648960Z","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-04T07:02:51.708675Z","title":"Discovering symbolic models from deep learning with inductive biases","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.708675Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:452d54f50558acfac3b0635370412cd403d75473f18e8d023c8b77bf123be958","observation_id":"ce33cc4f-257d-4981-af44-3a73cc031f04","resolution":{"observed_at":"2026-08-04T07:02:51.708675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10403","last_updated":"2023-09-13T20:35:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-17T17:46:53Z","title":"PaLM 2 Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10403","snapshot_observed_at":"2026-08-04T07:02:51.746487Z","title":"Palm 2 technical report.arXiv preprint arXiv:2305.10403, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.746487Z"},"links":{"cited_paper":"/paper/2305.10403","citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:85cfb95d175f963cc4cba306af0de26421d01ffd3d5617ddeea413628471f2df","observation_id":"7d6ef486-c1d1-4d3f-a877-ef1d084b8568","resolution":{"observed_at":"2026-08-04T07:02:51.746487Z","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-04T07:02:51.826174Z","title":"For- mal mathematical reasoning: A new frontier in ai.AI Magazine, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.826174Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:ca7ac5fe0f629871bdc92117b3e3ccb7bb6179e8a6faca9f16072c4cd00be35e","observation_id":"e94ee3fe-1802-4f99-a529-073e5fe6e702","resolution":{"observed_at":"2026-08-04T07:02:51.826174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-04T07:02:51.898642Z","title":"Evolution of heuristics: Towards efficient automatic algorithm design using large language model.arXiv preprint arXiv:2401.02051, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.898642Z"},"links":{"cited_paper":"/paper/2401.02051","citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:0e162e7a76776fab718cf506896aecd2e2cab19c0524c824b3e94db838b3897c","observation_id":"48c15144-f659-465a-960d-f8ab339f783b","resolution":{"observed_at":"2026-08-04T07:02:51.898642Z","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-04T07:02:51.969155Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:51.969155Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:eabf58376bb402347bd18c69554e30062277778febe1bd0ae201eb697bb725df","observation_id":"1002db78-3b43-4bca-814b-4bd6f6c80cc3","resolution":{"observed_at":"2026-08-04T07:02:51.969155Z","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-04T07:02:52.052410Z","title":"Reevo: Large language models as hyper-heuristics with reflec- tive evolution.Advances in neural information processing systems, 37:43571–43608, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.052410Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:1b033d1cdf25475feec35bbe1d567b27aa2aa54f700d6062602f8f77caa42b8e","observation_id":"6c0f7da8-e2e7-4d4d-8dd5-c48337e48f67","resolution":{"observed_at":"2026-08-04T07:02:52.052410Z","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-04T07:02:52.128359Z","title":"Beyond the hype: Benchmarking llm-evolved heuristics for bin packing","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.128359Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:d560401d91b0b0433dcc6851cd0735ff4fcc9204d01065e7c576ae4e046a8cca","observation_id":"6d440fda-9866-41ce-90a7-ecba776caa63","resolution":{"observed_at":"2026-08-04T07:02:52.128359Z","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-04T07:02:52.209080Z","title":"Detecting hallucinations in large language models using semantic entropy","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.209080Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:f5ba2ce5e7f9298c7b2699e8196553f2a0058e96a6ed1fb10369789eee1bc150","observation_id":"d137c71d-a25c-4968-b24a-84e80f8d60e4","resolution":{"observed_at":"2026-08-04T07:02:52.209080Z","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-04T07:02:52.261623Z","title":"Johnson, Alan Demers, Jeffrey D","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.261623Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:35cd45aa4ec01c27133be6f902c131684f416e66434d253df2cd2b831ad860ce","observation_id":"6c2e27e9-fa12-4485-85b2-714aabaf05f9","resolution":{"observed_at":"2026-08-04T07:02:52.261623Z","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-04T07:02:52.331500Z","title":"Near-optimal algo- rithms for stochastic online bin packing.ACM Transactions on Algorithms, 21(2):1–39, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.331500Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:2742628c5744c92b19215b36a8754c28941888922936484aa0d6a17863845f73","observation_id":"14b4fe6a-35ec-44cf-8b04-ca9ee206994f","resolution":{"observed_at":"2026-08-04T07:02:52.331500Z","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-04T07:02:52.391140Z","title":"The average-case analysis of some on-line algorithms for bin packing.Combinator- ica, 6(2):179–200, 1986","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.391140Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:c4254b29e87b2979b390090efed23a6affe39b0129d8d0912acfd0e8fe96c1f3","observation_id":"c0386758-2d7a-4e13-93c9-b794f042428e","resolution":{"observed_at":"2026-08-04T07:02:52.391140Z","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-04T07:02:52.470298Z","title":"A stochastic model of bin- packing.Information and control, 44(2):105– 115, 1980","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.470298Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:1d901aa742524ee58fc1f699941875f0d4653cbed3003538550a2ea780181058","observation_id":"24bb663c-6bc1-434d-8cb1-b46c902958e6","resolution":{"observed_at":"2026-08-04T07:02:52.470298Z","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-04T07:02:52.543489Z","title":"Bin packing with discrete item sizes, part ii: Tight bounds on first fit.Random Structures & Algorithms, 10(1-2):69–101, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.543489Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:09503eb88fcd9b03a3e09e3116acc06159a35a2ec8548e82e30313b270517e03","observation_id":"22d8fea3-2ae4-465c-a0b7-46198b642c28","resolution":{"observed_at":"2026-08-04T07:02:52.543489Z","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-04T07:02:52.615524Z","title":"Some unexpected expected behavior results for bin packing","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.615524Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:e93775dab96766f64a1a78b06b0054e7b705c3a8f18207a1592f3f4fca26583c","observation_id":"846a263e-d8d6-4e16-ba44-fcae96d97831","resolution":{"observed_at":"2026-08-04T07:02:52.615524Z","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-04T07:02:52.693715Z","title":"Best-fit bin-packing with random order","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.693715Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:275573b00e41811a42a31a1aec64cb31d992c80721a960f50edc5b4e25313d96","observation_id":"e78bead5-82e5-4d97-ba18-46324ce0c656","resolution":{"observed_at":"2026-08-04T07:02:52.693715Z","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-04T07:02:52.755905Z","title":"Or-library: distributing test problems by electronic mail.Journal of the oper- ational research society, 41(11):1069–1072, 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.755905Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:c2098b111aa4fc69c33e71514ef57ab0e3805707846c9e6014733cfdde6b351b","observation_id":"b65363bd-3638-4acc-a786-9e993bf1d2aa","resolution":{"observed_at":"2026-08-04T07:02:52.755905Z","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-04T07:02:52.812310Z","title":"Examples are not enough, learn to crit- icize! criticism for interpretability.Advances in neural information processing systems, 29, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.812310Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:ee0c07d015b5e013000a1431801782efd57ce276f2ed38ddfd089440d5794b0b","observation_id":"75a9f861-78d0-4e24-ac88-e0a92f2275a5","resolution":{"observed_at":"2026-08-04T07:02:52.812310Z","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-04T07:02:52.866102Z","title":"Obtaining dynamic scheduling policies with simulation and machine learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.866102Z"},"links":{"citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:d5a0983efabf3602e52c56d60c42ab65f27dc1f7f697a1cc1af56300401c798a","observation_id":"fcbb42dd-b968-43b2-9f30-fb3e87705817","resolution":{"observed_at":"2026-08-04T07:02:52.866102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.20694","last_updated":"2025-02-21T03:28:49Z","snapshot_observed_at":"2026-08-10T23:11:08.251282Z","submitted_at":"2024-12-30T04:05:22Z","title":"QUBE: Enhancing Automatic Heuristic Design via Quality-Uncertainty Balanced Evolution","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.20694","snapshot_observed_at":"2026-08-04T07:02:52.919799Z","title":"Qube: En- hancing automatic heuristic design via quality- uncertainty balanced evolution.arXiv preprint arXiv:2412.20694, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T07:02:52.919799Z"},"links":{"cited_paper":"/paper/2412.20694","citing_paper":"/paper/2510.27353"},"observation_digest":"sha256:e0692b4c4b478368ac1349bc419514bb29d1f2e73b4b929560f4fa40567fd7bf","observation_id":"45e9f9df-a9ba-4bd3-a649-0bf24503c0c9","resolution":{"observed_at":"2026-08-04T07:02:52.919799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.27353","last_updated":"2026-06-17T09:27:17Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-09T07:10:25.600933Z","submitted_at":"2025-10-31T10:39:16Z","title":"An In-depth Study of LLM Contributions to the Bin Packing Problem"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":45},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2510.27353."}