{"as_of":"2026-08-07T10:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:185d02e2b677332369e59c72632595b5075dd294cc66851a92baa70c85e69ef3","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:10:14.947925Z","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-02T16:17:08.817116Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.16696","last_updated":"2025-02-23T19:23:22Z","snapshot_observed_at":"2026-07-06T20:41:19.676815Z","submitted_at":"2025-02-23T19:23:22Z","title":"Dynamic LLM Routing and Selection based on User Preferences: Balancing Performance, Cost, and Ethics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16696","snapshot_observed_at":"2026-08-06T18:10:14.947925Z","title":"Dynamic LLM Routing and Se- lection based on User Preferences: Balancing Perfor- mance, Cost, and Ethics.International Journal of Computer Applications, 186(51):1–7, November 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09003","last_updated":"2026-06-21T22:09:56Z","snapshot_observed_at":"2026-08-07T07:03:21.768786Z","submitted_at":"2025-07-11T20:11:04Z","title":"Orchestration for Domain-specific Edge-Cloud Language Models","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T18:10:14.947925Z"},"links":{"cited_paper":"/paper/2502.16696","citing_paper":"/paper/2507.09003"},"observation_digest":"sha256:3e299af05fa4e68833bf628770e71622bf6b794a2abe1a48347113819e543605","observation_id":"95992edb-fed9-4b75-8637-255f5efa10db","resolution":{"observed_at":"2026-08-06T18:10:14.947925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16696","last_updated":"2025-02-23T19:23:22Z","snapshot_observed_at":"2026-07-06T20:41:19.676815Z","submitted_at":"2025-02-23T19:23:22Z","title":"Dynamic LLM Routing and Selection based on User Preferences: Balancing Performance, Cost, and Ethics","version":1},"cited_work":{"arxiv_id":"2502.16696","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16696","snapshot_observed_at":"2026-07-02T16:17:08.817116Z","title":"arXiv preprint arXiv:2502.16696 , year=","venue":null,"work_id":"e34d5947-cf40-4a09-bb73-0d5935287c1d","year":null},"citing_paper":{"arxiv_id":"2606.06924","last_updated":"2026-06-05T05:42:00Z","snapshot_observed_at":"2026-08-06T11:49:12.989321Z","submitted_at":"2026-06-05T05:42:00Z","title":"From Sampled Outcomes to Capability Distributions: Rethinking Supervision for LLM Routing","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-06-27T22:54:28.452796Z"},"links":{"cited_paper":"/paper/2502.16696","citing_paper":"/paper/2606.06924"},"observation_digest":"sha256:ce493a383f1cd7bbb10f63231f6ab6a1dac2288b8d701f33fe5e9d9c5fca482e","observation_id":"acc3d0b4-0f8a-45a0-b090-707beeb640f1","resolution":{"observed_at":"2026-07-02T16:17:08.818419Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.16696/citation-record","integrity":"/paper/2502.16696/integrity","json":"/paper/2502.16696/citation-record.json","paper":"/paper/2502.16696"},"outbound":[],"paper":{"arxiv_id":"2502.16696","last_updated":"2025-02-23T19:23:22Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:41:19.676815Z","submitted_at":"2025-02-23T19:23:22Z","title":"Dynamic LLM Routing and Selection based on User Preferences: Balancing Performance, Cost, and Ethics"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.16696."}