{"as_of":"2026-08-11T00:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ec8e089708fee0f99f0bc3058150ce779a85c0e3f0b50f85f62626ceb6e53c1","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:30:43.582129Z","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-07-04T16:59:58.924211Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.11511","last_updated":"2024-10-15T02:09:04Z","snapshot_observed_at":"2026-08-10T21:41:23.877950Z","submitted_at":"2023-12-12T05:38:55Z","title":"ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11511","snapshot_observed_at":"2026-08-07T04:30:43.582129Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10525","last_updated":"2025-06-12T09:43:48Z","snapshot_observed_at":"2026-08-08T21:26:08.789047Z","submitted_at":"2025-06-12T09:43:48Z","title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:30:43.582129Z"},"links":{"cited_paper":"/paper/2312.11511","citing_paper":"/paper/2506.10525"},"observation_digest":"sha256:5d0dcbbdf0eebbd1687e5f130dd8ec69c62d72d9d8a7883f4b4000c031299bb3","observation_id":"58c29299-0afa-46c1-91e1-7908038b11d8","resolution":{"observed_at":"2026-08-07T04:30:43.582129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11511","last_updated":"2024-10-15T02:09:04Z","snapshot_observed_at":"2026-08-10T21:41:23.877950Z","submitted_at":"2023-12-12T05:38:55Z","title":"ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity","version":3},"cited_work":{"arxiv_id":"2312.11511","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.11511","snapshot_observed_at":"2026-07-04T16:59:58.924211Z","title":"arXiv preprint arXiv:2312.11511 , year=","venue":null,"work_id":"bea7d84f-7c71-4ecf-9b81-5c054457d1d6","year":null},"citing_paper":{"arxiv_id":"2606.24734","last_updated":"2026-06-23T15:58:46Z","snapshot_observed_at":"2026-07-06T23:59:18.313042Z","submitted_at":"2026-06-23T15:58:46Z","title":"Task Decomposition for Efficient Annotation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-26T00:00:16.588823Z"},"links":{"cited_paper":"/paper/2312.11511","citing_paper":"/paper/2606.24734"},"observation_digest":"sha256:77a4177b86e792b53c877cbe8ef9c8925e4e0abcd10555480959818c5592739e","observation_id":"0b003f11-1eee-40b9-baab-44569eb2f644","resolution":{"observed_at":"2026-07-04T16:59:58.925865Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11511","last_updated":"2024-10-15T02:09:04Z","snapshot_observed_at":"2026-08-10T21:41:23.877950Z","submitted_at":"2023-12-12T05:38:55Z","title":"ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11511","snapshot_observed_at":"2026-08-05T00:36:51.526770Z","title":"arXiv:2312.11511 [cs] version:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00685","last_updated":"2026-08-01T14:14:12Z","snapshot_observed_at":"2026-08-06T23:17:57.459224Z","submitted_at":"2026-08-01T14:14:12Z","title":"When Does LLM Orchestration Pay Off? A Controlled Evaluation of Accuracy, Cost, and Task Difficulty","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T00:36:51.526770Z"},"links":{"cited_paper":"/paper/2312.11511","citing_paper":"/paper/2608.00685"},"observation_digest":"sha256:23cebf541637de7745af0ca18e6dd2e3920f293490535491ce83bda255cf80c1","observation_id":"3157bd3e-ba94-457e-b85a-e179d197338b","resolution":{"observed_at":"2026-08-05T00:36:51.526770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2312.11511/citation-record","integrity":"/paper/2312.11511/integrity","json":"/paper/2312.11511/citation-record.json","paper":"/paper/2312.11511"},"outbound":[],"paper":{"arxiv_id":"2312.11511","last_updated":"2024-10-15T02:09:04Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-10T21:41:23.877950Z","submitted_at":"2023-12-12T05:38:55Z","title":"ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2312.11511."}