{"as_of":"2026-08-08T11:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5286d4264de349e9cf66715082cde8b3652ee7b614bb03db612240fdfbe39163","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:25:14.584478Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-28T17:42:25.773927Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.13184","last_updated":"2024-05-16T02:54:25Z","snapshot_observed_at":"2026-08-07T05:52:17.031595Z","submitted_at":"2023-11-22T06:23:18Z","title":"Large Language Model-Enhanced Algorithm Selection: Towards Comprehensive Algorithm Representation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.13184","snapshot_observed_at":"2026-08-07T11:25:14.584478Z","title":"As-llm: When algorithm selection meets large language model.CoRR, abs/2311.13184, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.02594","last_updated":"2025-06-03T08:13:41Z","snapshot_observed_at":"2026-08-08T02:26:12.399226Z","submitted_at":"2025-06-03T08:13:41Z","title":"EALG: Evolutionary Adversarial Generation of Language Model-Guided Generators for Combinatorial Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:14.584478Z"},"links":{"cited_paper":"/paper/2311.13184","citing_paper":"/paper/2506.02594"},"observation_digest":"sha256:2e929a913a40b47f50c7f2c44a89ef2e92309bae88c0e3ec15022b364ae0a33d","observation_id":"36f662b1-3ea2-44b3-a6d1-dd02aee2717d","resolution":{"observed_at":"2026-08-07T11:25:14.584478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.13184","last_updated":"2024-05-16T02:54:25Z","snapshot_observed_at":"2026-08-07T05:52:17.031595Z","submitted_at":"2023-11-22T06:23:18Z","title":"Large Language Model-Enhanced Algorithm Selection: Towards Comprehensive Algorithm Representation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.13184","snapshot_observed_at":"2026-08-04T20:55:41.684018Z","title":"Large lan- guage model-enhanced algorithm selection: Towards comprehensive algorithm representation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.08269","last_updated":"2026-07-17T08:53:46Z","snapshot_observed_at":"2026-08-07T13:22:52.525692Z","submitted_at":"2025-09-10T04:05:54Z","title":"A Systematic Survey on Large Language Models for Evolutionary Optimization: From Modeling to Solving","version":6},"reference_index":153,"source":"pdf_text","source_observed_at":"2026-08-04T20:55:41.684018Z"},"links":{"cited_paper":"/paper/2311.13184","citing_paper":"/paper/2509.08269"},"observation_digest":"sha256:e9247b57a471942144eea1f2b86fb7e88a61e00f7b29a7d86e8a36a6a9b3b75a","observation_id":"ccc01294-d1da-41d3-abc6-dbce36bf7b1c","resolution":{"observed_at":"2026-08-04T20:55:41.684018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.13184","last_updated":"2024-05-16T02:54:25Z","snapshot_observed_at":"2026-08-07T05:52:17.031595Z","submitted_at":"2023-11-22T06:23:18Z","title":"Large Language Model-Enhanced Algorithm Selection: Towards Comprehensive Algorithm Representation","version":3},"cited_work":{"arxiv_id":"2311.13184","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.13184","snapshot_observed_at":"2026-06-28T17:42:25.773927Z","title":"As-llm: When algorithm se- lection meets large language model","venue":null,"work_id":"786b1456-4bf8-481e-ba38-a72a938532d6","year":2023},"citing_paper":{"arxiv_id":"2605.02933","last_updated":"2026-04-30T04:28:10Z","snapshot_observed_at":"2026-07-06T23:15:55.848885Z","submitted_at":"2026-04-30T04:28:10Z","title":"Relation Reasoning with LLMs in Expensive Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-09T20:39:52.030823Z"},"links":{"cited_paper":"/paper/2311.13184","citing_paper":"/paper/2605.02933"},"observation_digest":"sha256:a0ca13cee04daab762e302fc344941b88ab6c57c0a01ffde5a4981010221cafc","observation_id":"8f33ddaa-9de3-4500-b6af-d3e4bd6c5664","resolution":{"observed_at":"2026-05-11T15:01:09.486226Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.13184","last_updated":"2024-05-16T02:54:25Z","snapshot_observed_at":"2026-08-07T05:52:17.031595Z","submitted_at":"2023-11-22T06:23:18Z","title":"Large Language Model-Enhanced Algorithm Selection: Towards Comprehensive Algorithm Representation","version":3},"cited_work":{"arxiv_id":"2311.13184","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.13184","snapshot_observed_at":"2026-06-28T17:42:25.773927Z","title":"As-llm: When algorithm se- lection meets large language model","venue":null,"work_id":"786b1456-4bf8-481e-ba38-a72a938532d6","year":2023},"citing_paper":{"arxiv_id":"2606.00862","last_updated":"2026-05-30T19:26:32Z","snapshot_observed_at":"2026-08-03T12:59:21.925772Z","submitted_at":"2026-05-30T19:26:32Z","title":"Meta-Black-Box Optimization with Ensemble Surrogate Modeling for Robustness-Accuracy Trade-off within SAEA","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T17:41:40.567807Z"},"links":{"cited_paper":"/paper/2311.13184","citing_paper":"/paper/2606.00862"},"observation_digest":"sha256:07739c025a4d4150de224b829548e20608c14cb1f8a011f513f99eba77761598","observation_id":"704a65d7-e18a-471d-af63-a2f2a0780e1c","resolution":{"observed_at":"2026-06-28T17:42:25.775579Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2311.13184/citation-record","integrity":"/paper/2311.13184/integrity","json":"/paper/2311.13184/citation-record.json","paper":"/paper/2311.13184"},"outbound":[],"paper":{"arxiv_id":"2311.13184","last_updated":"2024-05-16T02:54:25Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T05:52:17.031595Z","submitted_at":"2023-11-22T06:23:18Z","title":"Large Language Model-Enhanced Algorithm Selection: Towards Comprehensive Algorithm Representation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2311.13184."}