{"as_of":"2026-08-09T21:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ef25defb0d6603d7025a26d7d564a05e978e32e20fb2763a5b98158fec53e0e6","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:08:17.093651Z","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-03T20:48:56.465069Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-08-07T12:08:17.093651Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.00439","last_updated":"2025-05-31T07:38:41Z","snapshot_observed_at":"2026-08-07T12:02:57.835052Z","submitted_at":"2025-05-31T07:38:41Z","title":"RLAE: Reinforcement Learning-Assisted Ensemble for LLMs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:08:17.093651Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2506.00439"},"observation_digest":"sha256:efb042ee87400ebd3c7a9b8da5290a5fe065164e5034752d9e7ab7c057353b8f","observation_id":"8f6a594f-8d58-4ad1-9ae8-af3813541e59","resolution":{"observed_at":"2026-08-07T12:08:17.093651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-08-07T11:04:07.129328Z","title":"Prompt-to-leaderboard,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03637","last_updated":"2025-07-07T09:53:22Z","snapshot_observed_at":"2026-08-08T03:23:19.289933Z","submitted_at":"2025-06-04T07:30:16Z","title":"RewardAnything: Generalizable Principle-Following Reward Models","version":2},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:07.129328Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2506.03637"},"observation_digest":"sha256:ecf28733ffc18f36e74b509f652d83bb09c6e29d524678fee72296ff3eea0e32","observation_id":"1a4e773d-0972-41b0-b0c5-f77d719df2f4","resolution":{"observed_at":"2026-08-07T11:04:07.129328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-08-05T20:07:01.245846Z","title":"Frick, C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.11291","last_updated":"2025-08-15T07:55:05Z","snapshot_observed_at":"2026-08-05T20:06:56.171779Z","submitted_at":"2025-08-15T07:55:05Z","title":"Dynamic Quality-Latency Aware Routing for LLM Inference in Wireless Edge-Device Networks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T20:07:01.245846Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2508.11291"},"observation_digest":"sha256:3016be419f02a319ddb906126e12add1180f8b81ed9974b5b8044ddfbb3a413f","observation_id":"7cd8dccc-096b-4355-b0c6-69b6fbff0682","resolution":{"observed_at":"2026-08-05T20:07:01.245846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-08-04T22:03:01.095225Z","title":"Prompt-to-leaderboard.arXiv preprint arXiv:2502.14855,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:01.095225Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:7d49c9bd08a97714311a9b0bea090e5f865861d9ee85e994291ce12be4267197","observation_id":"dba8262f-292c-4ebd-8fb1-086bea6ec619","resolution":{"observed_at":"2026-08-04T22:03:01.095225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":"2502.14855","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-07-03T20:48:56.465069Z","title":"arXiv preprint arXiv:2502.14855 , year=","venue":null,"work_id":"7ab71419-2f55-43bf-8007-c8ad46e90812","year":2025},"citing_paper":{"arxiv_id":"2604.15022","last_updated":"2026-04-16T13:51:48Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-16T13:51:48Z","title":"Route to Rome Attack: Directing LLM Routers to Expensive Models via Adversarial Suffix Optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-10T10:57:25.591595Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2604.15022"},"observation_digest":"sha256:261200c1999169fcc37202ef55dbdfdb636726581667af1c58a27c2dfa5f974b","observation_id":"3f4a21a5-ad1d-411f-a7ae-fc2aa5dc6c65","resolution":{"observed_at":"2026-05-10T11:00:04.312863Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":"2502.14855","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-07-03T20:48:56.465069Z","title":"arXiv preprint arXiv:2502.14855 , year=","venue":null,"work_id":"7ab71419-2f55-43bf-8007-c8ad46e90812","year":2025},"citing_paper":{"arxiv_id":"2604.18576","last_updated":"2026-07-12T18:34:47Z","snapshot_observed_at":"2026-07-16T23:18:42.403825Z","submitted_at":"2026-04-20T17:57:51Z","title":"Agentic Forecasting using Sequential Bayesian Updating of Linguistic Beliefs","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-10T04:14:17.395227Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2604.18576"},"observation_digest":"sha256:96e6aabdb7130d32f792334e6d222d3b438040e865be1e50bb5e9abf509a8fdd","observation_id":"defcc05b-02d9-443c-ba4b-6e818155ad3a","resolution":{"observed_at":"2026-05-11T12:06:01.635864Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-07-14T19:33:20.775008Z","title":"Angelopoulos, and Ion Stoica","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.18576","last_updated":"2026-07-12T18:34:47Z","snapshot_observed_at":"2026-07-16T23:18:42.403825Z","submitted_at":"2026-04-20T17:57:51Z","title":"Agentic Forecasting using Sequential Bayesian Updating of Linguistic Beliefs","version":4},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-14T19:33:20.775008Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2604.18576"},"observation_digest":"sha256:1d0ffc2e6645125e2399f7d7f0c6f8f08a1d5f38316d736e2454ed3011e09cc3","observation_id":"50d3920b-14fb-43d9-9be4-0da7dd46e06f","resolution":{"observed_at":"2026-07-14T19:33:20.775008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":"2502.14855","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-07-03T20:48:56.465069Z","title":"arXiv preprint arXiv:2502.14855 , year=","venue":null,"work_id":"7ab71419-2f55-43bf-8007-c8ad46e90812","year":2025},"citing_paper":{"arxiv_id":"2605.03426","last_updated":"2026-05-05T07:02:50Z","snapshot_observed_at":"2026-07-06T23:16:20.322265Z","submitted_at":"2026-05-05T07:02:50Z","title":"Replacing Parameters with Preferences: Federated Alignment of Heterogeneous Vision-Language Models","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-07T04:07:58.031100Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2605.03426"},"observation_digest":"sha256:ccfa5e6bb436232ed237206c83d8158d5b3a088f573430da092caf20e9400eeb","observation_id":"d9b4b6ea-dd2a-490b-896a-01038130d87d","resolution":{"observed_at":"2026-05-12T10:41:30.801787Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":"2502.14855","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-07-03T20:48:56.465069Z","title":"arXiv preprint arXiv:2502.14855 , year=","venue":null,"work_id":"7ab71419-2f55-43bf-8007-c8ad46e90812","year":2025},"citing_paper":{"arxiv_id":"2605.10805","last_updated":"2026-05-11T16:30:20Z","snapshot_observed_at":"2026-08-02T16:26:05.195808Z","submitted_at":"2026-05-11T16:30:20Z","title":"Reasoning Is Not Free: Robust Adaptive Cost-Efficient Routing for LLM-as-a-Judge","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-12T04:19:00.238602Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2605.10805"},"observation_digest":"sha256:0e45b42f2ad7ad36c70689abd9cf3d499f50c9ed0894c7cde0a845e5b1634a6b","observation_id":"6ddc626b-e999-4174-a1e9-d3bce613f009","resolution":{"observed_at":"2026-05-12T06:26:23.826933Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":"2502.14855","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-07-03T20:48:56.465069Z","title":"arXiv preprint arXiv:2502.14855 , year=","venue":null,"work_id":"7ab71419-2f55-43bf-8007-c8ad46e90812","year":2025},"citing_paper":{"arxiv_id":"2606.07587","last_updated":"2026-05-27T19:29:01Z","snapshot_observed_at":"2026-07-31T18:45:52.517819Z","submitted_at":"2026-05-27T19:29:01Z","title":"The Routing Plateau: Understanding and Breaking the Accuracy Limits of LLM Routers","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T14:07:26.366172Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2606.07587"},"observation_digest":"sha256:3c120a9282f1c1153b0838713183293a8bfdecbf3eeedb190b06fcb3d9f4f65d","observation_id":"7e58f48d-39dc-48f7-999d-7be1217caa44","resolution":{"observed_at":"2026-06-29T14:13:30.247221Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":"2502.14855","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-07-03T20:48:56.465069Z","title":"arXiv preprint arXiv:2502.14855 , year=","venue":null,"work_id":"7ab71419-2f55-43bf-8007-c8ad46e90812","year":2025},"citing_paper":{"arxiv_id":"2606.17628","last_updated":"2026-06-16T07:33:53Z","snapshot_observed_at":"2026-08-05T17:08:33.405254Z","submitted_at":"2026-06-16T07:33:53Z","title":"OPD-Evolver: Cultivating Holistic Agent Evolver via On-Policy Distillation","version":1},"reference_index":149,"source":"arxiv_source","source_observed_at":"2026-06-27T01:07:49.603969Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2606.17628"},"observation_digest":"sha256:a126d2662a03cb2cf63e3f2d4548b5b460a6eb1cdd6457de7b48aef24a3bc60e","observation_id":"a6864f6f-f588-4ad4-ba66-699582d7d87e","resolution":{"observed_at":"2026-07-03T20:48:56.466608Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.14855/citation-record","integrity":"/paper/2502.14855/integrity","json":"/paper/2502.14855/citation-record.json","paper":"/paper/2502.14855"},"outbound":[],"paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2502.14855."}