Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Bridging Large Language Models and Optimization: A Unified Framework for Text-attributed Combinatorial Optimization
As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2408.12214.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-02T20:34:52.249813Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-04T09:49:44.514365Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 4355a32a-7796-4e4c-9757-a3c8988389aa · inbound
Enhancing CVRP Solver through LLM-driven Automatic Heuristic Design cites this paper.
Enhancing CVRP Solver through LLM-driven Automatic Heuristic Design Bridging Large Language Models and Optimization: A Unified Framework for Text-attributed Combinatorial Optimization
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T20:34:52.249813Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 71734018-45a2-49e7-81fc-bca3ace04510 · inbound
Learning with Foresight: Enhancing Neural Routing Policy via Multi-Node Lookahead Prediction cites this paper.
Learning with Foresight: Enhancing Neural Routing Policy via Multi-Node Lookahead Prediction Bridging Large Language Models and Optimization: A Unified Framework for Text-attributed Combinatorial Optimization
Reference 20
- Resolution
- verified exact
- arxiv_id, observed 2026-05-20T07:28:07.358099Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 241c46f0-15bf-4ff6-831a-db0f1f75c428 · inbound
GeoRouteNet: A Geometry-Aware Non-Autoregressive Neural Solver for the Euclidean Traveling Salesman Problem cites this paper.
GeoRouteNet: A Geometry-Aware Non-Autoregressive Neural Solver for the Euclidean Traveling Salesman Problem Bridging Large Language Models and Optimization: A Unified Framework for Text-attributed Combinatorial Optimization
Reference 9
- Resolution
- verified exact
- arxiv_id, observed 2026-07-04T09:49:44.515779Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation b9c64119-5866-4821-ae1b-7dd965f15083 · inbound
GeoRouteNet: A Geometry-Aware Non-Autoregressive Neural Solver for the Euclidean Traveling Salesman Problem cites this paper.
GeoRouteNet: A Geometry-Aware Non-Autoregressive Neural Solver for the Euclidean Traveling Salesman Problem Bridging Large Language Models and Optimization: A Unified Framework for Text-attributed Combinatorial Optimization
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T10:33:24.950301Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 39d5095d-bc73-48d2-8154-90093ed32f2d · inbound
LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers cites this paper.
LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers Bridging Large Language Models and Optimization: A Unified Framework for Text-attributed Combinatorial Optimization
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T17:18:09.501483Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.