{"as_of":"2026-08-23T01:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e142949d99e5c300bd18a30dec1f91c8ef0432f058e920cdb84bd59d814c2ee","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T14:07:26.366172Z","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-29T14:13:30.258471Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.03900","last_updated":"2023-06-06T17:58:12Z","snapshot_observed_at":"2026-08-16T15:26:05.179378Z","submitted_at":"2023-06-06T17:58:12Z","title":"Model Spider: Learning to Rank Pre-Trained Models Efficiently","version":1},"cited_work":{"arxiv_id":"2306.03900","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.03900","snapshot_observed_at":"2026-06-29T14:13:30.258471Z","title":"Model Spider: Learning to Rank Pre-Trained Models Efficiently, 2023","venue":null,"work_id":"f1f0297f-1a24-4467-908b-3b75923f054e","year":2023},"citing_paper":{"arxiv_id":"2606.07587","last_updated":"2026-05-27T19:29:01Z","snapshot_observed_at":"2026-08-20T11:34:49.978585Z","submitted_at":"2026-05-27T19:29:01Z","title":"The Routing Plateau: Understanding and Breaking the Accuracy Limits of LLM Routers","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-06-29T14:07:26.366172Z"},"links":{"cited_paper":"/paper/2306.03900","citing_paper":"/paper/2606.07587"},"observation_digest":"sha256:9761dc709622134b835c3af18ab98e14fdc172b18fdea76ae3a6ee3d6a67a127","observation_id":"685f22c0-987f-47a1-9ef1-1b892e40e75e","resolution":{"observed_at":"2026-06-29T14:13:30.259847Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.03900/citation-record","integrity":"/paper/2306.03900/integrity","json":"/paper/2306.03900/citation-record.json","paper":"/paper/2306.03900"},"outbound":[],"paper":{"arxiv_id":"2306.03900","last_updated":"2023-06-06T17:58:12Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:26:05.179378Z","submitted_at":"2023-06-06T17:58:12Z","title":"Model Spider: Learning to Rank Pre-Trained Models Efficiently"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2306.03900."}