Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity
As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2312.11511.
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-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T04:30:43.582129Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-04T16:59:58.924211Z
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 58c29299-0afa-46c1-91e1-7908038b11d8 · inbound
AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length cites this paper.
AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T04:30:43.582129Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0b003f11-1eee-40b9-baab-44569eb2f644 · inbound
Task Decomposition for Efficient Annotation cites this paper.
Task Decomposition for Efficient Annotation ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity
Reference 9
- Resolution
- verified exact
- arxiv_id, observed 2026-07-04T16:59:58.925865Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 3157bd3e-ba94-457e-b85a-e179d197338b · inbound
When Does LLM Orchestration Pay Off? A Controlled Evaluation of Accuracy, Cost, and Task Difficulty cites this paper.
When Does LLM Orchestration Pay Off? A Controlled Evaluation of Accuracy, Cost, and Task Difficulty ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity
Reference 2023
- Resolution
- unresolved
- no resolver link, observed 2026-08-05T00:36:51.526770Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.