{"as_of":"2026-08-07T12:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:75a7363c986bbcd80e8c93145e2cae8f02408cecdd0fe18ecc3327d7d348cd61","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:00:09.916657Z","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-03T19:18:55.039352Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.16587","last_updated":"2024-10-02T13:22:27Z","snapshot_observed_at":"2026-07-06T18:20:09.790181Z","submitted_at":"2024-05-26T14:38:24Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16587","snapshot_observed_at":"2026-08-07T12:00:09.916657Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01048","last_updated":"2025-06-21T03:39:58Z","snapshot_observed_at":"2026-08-07T11:49:55.750911Z","submitted_at":"2025-06-01T15:14:58Z","title":"IRT-Router: Effective and Interpretable Multi-LLM Routing via Item Response Theory","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:09.916657Z"},"links":{"cited_paper":"/paper/2405.16587","citing_paper":"/paper/2506.01048"},"observation_digest":"sha256:b62720187ea6b20425faa0f1224aeb70331220d433bcc48f446b4815151f00b8","observation_id":"656342c4-7c7d-47c8-a6bf-226ef477d660","resolution":{"observed_at":"2026-08-07T12:00:09.916657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16587","last_updated":"2024-10-02T13:22:27Z","snapshot_observed_at":"2026-07-06T18:20:09.790181Z","submitted_at":"2024-05-26T14:38:24Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16587","snapshot_observed_at":"2026-08-06T21:36:26.080397Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23762","last_updated":"2025-06-30T12:09:29Z","snapshot_observed_at":"2026-08-06T21:29:49.550137Z","submitted_at":"2025-06-30T12:09:29Z","title":"Software Engineering for Large Language Models: Research Status, Challenges and the Road Ahead","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T21:36:26.080397Z"},"links":{"cited_paper":"/paper/2405.16587","citing_paper":"/paper/2506.23762"},"observation_digest":"sha256:aa57954b09d155aeee68c9d9491a46936b924a9a0ff67f304d7f06d780e4c21b","observation_id":"16ceb3a9-c9c2-4b86-9dbb-193b30985a3f","resolution":{"observed_at":"2026-08-06T21:36:26.080397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16587","last_updated":"2024-10-02T13:22:27Z","snapshot_observed_at":"2026-07-06T18:20:09.790181Z","submitted_at":"2024-05-26T14:38:24Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16587","snapshot_observed_at":"2026-08-06T21:16:14.711497Z","title":"Cost-effective online multi-llm selection with versatile reward models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00672","last_updated":"2025-07-01T11:13:56Z","snapshot_observed_at":"2026-08-07T09:02:35.437888Z","submitted_at":"2025-07-01T11:13:56Z","title":"Toward Edge General Intelligence with Multiple-Large Language Model (Multi-LLM): Architecture, Trust, and Orchestration","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T21:16:14.711497Z"},"links":{"cited_paper":"/paper/2405.16587","citing_paper":"/paper/2507.00672"},"observation_digest":"sha256:e46556b14adc3a3b826db3a71465e5392b362b0dbd289abb80055e084f5e4a78","observation_id":"23944b62-c4d5-4df6-a7d5-771ddacf0dca","resolution":{"observed_at":"2026-08-06T21:16:14.711497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16587","last_updated":"2024-10-02T13:22:27Z","snapshot_observed_at":"2026-07-06T18:20:09.790181Z","submitted_at":"2024-05-26T14:38:24Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16587","snapshot_observed_at":"2026-08-06T18:12:58.230490Z","title":"Cost-effective online multi-llm selection with versatile reward models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08960","last_updated":"2025-07-11T18:34:07Z","snapshot_observed_at":"2026-08-06T18:05:47.861506Z","submitted_at":"2025-07-11T18:34:07Z","title":"How to Train a Leader: Hierarchical Reasoning in Multi-Agent LLMs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:12:58.230490Z"},"links":{"cited_paper":"/paper/2405.16587","citing_paper":"/paper/2507.08960"},"observation_digest":"sha256:24e180bf219da15149647ade0db222ede3f914cdf57d1f84badedda9071fa5b7","observation_id":"5ef96167-bebf-4553-b765-e9a53fc887f1","resolution":{"observed_at":"2026-08-06T18:12:58.230490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16587","last_updated":"2024-10-02T13:22:27Z","snapshot_observed_at":"2026-07-06T18:20:09.790181Z","submitted_at":"2024-05-26T14:38:24Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16587","snapshot_observed_at":"2026-08-03T11:01:43.520324Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.07978","last_updated":"2026-07-13T12:55:23Z","snapshot_observed_at":"2026-08-03T11:01:42.993651Z","submitted_at":"2026-01-12T20:20:35Z","title":"Cost and Accuracy of Long-Term Memory in Distributed Multi-Agent Systems Based on Large Language Models","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T11:01:43.520324Z"},"links":{"cited_paper":"/paper/2405.16587","citing_paper":"/paper/2601.07978"},"observation_digest":"sha256:d69f2f68d0c03730658bd9a87d3cf007902e5c6a54dfafbb8fe8720fbb84fa99","observation_id":"128909e4-4865-4e6a-b4aa-bf6372b63908","resolution":{"observed_at":"2026-08-03T11:01:43.520324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16587","last_updated":"2024-10-02T13:22:27Z","snapshot_observed_at":"2026-07-06T18:20:09.790181Z","submitted_at":"2024-05-26T14:38:24Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models","version":2},"cited_work":{"arxiv_id":"2405.16587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.16587","snapshot_observed_at":"2026-07-03T19:18:55.039352Z","title":"Cost-effective online multi-llm selection with versatile reward models","venue":null,"work_id":"3ce81b59-d338-4d3f-8b87-03068561ae63","year":2024},"citing_paper":{"arxiv_id":"2602.07303","last_updated":"2026-04-17T15:29:54Z","snapshot_observed_at":"2026-08-03T09:54:39.877691Z","submitted_at":"2026-02-07T01:30:19Z","title":"KRONE: Scalable LLM-Augmented Log Anomaly Detection via Hierarchical Abstraction","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-05-16T06:59:23.030671Z"},"links":{"cited_paper":"/paper/2405.16587","citing_paper":"/paper/2602.07303"},"observation_digest":"sha256:0e2aa0007728290b1060d6278fcdebbe459d40e972a2c713acf5200578f138fc","observation_id":"8475c3c2-209a-4130-a751-61b9dd98a0ca","resolution":{"observed_at":"2026-05-16T07:00:42.957502Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16587","last_updated":"2024-10-02T13:22:27Z","snapshot_observed_at":"2026-07-06T18:20:09.790181Z","submitted_at":"2024-05-26T14:38:24Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models","version":2},"cited_work":{"arxiv_id":"2405.16587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.16587","snapshot_observed_at":"2026-07-03T19:18:55.039352Z","title":"Cost-effective online multi-llm selection with versatile reward models","venue":null,"work_id":"3ce81b59-d338-4d3f-8b87-03068561ae63","year":2024},"citing_paper":{"arxiv_id":"2604.20021","last_updated":"2026-04-21T21:56:43Z","snapshot_observed_at":"2026-07-06T23:06:35.507008Z","submitted_at":"2026-04-21T21:56:43Z","title":"Continuous Semantic Caching for Low-Cost LLM Serving","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T02:32:28.923367Z"},"links":{"cited_paper":"/paper/2405.16587","citing_paper":"/paper/2604.20021"},"observation_digest":"sha256:1026878894a35d021e7835fe614ddfbfb28420e8dce808c2de9818e23f9e0b02","observation_id":"7c20c075-3576-4d6b-b649-7895230c295d","resolution":{"observed_at":"2026-05-11T13:01:03.338797Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16587","last_updated":"2024-10-02T13:22:27Z","snapshot_observed_at":"2026-07-06T18:20:09.790181Z","submitted_at":"2024-05-26T14:38:24Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models","version":2},"cited_work":{"arxiv_id":"2405.16587","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.16587","snapshot_observed_at":"2026-07-03T19:18:55.039352Z","title":"Cost-effective online multi-llm selection with versatile reward models","venue":null,"work_id":"3ce81b59-d338-4d3f-8b87-03068561ae63","year":2024},"citing_paper":{"arxiv_id":"2606.17489","last_updated":"2026-06-16T03:58:48Z","snapshot_observed_at":"2026-08-06T20:13:36.328452Z","submitted_at":"2026-06-16T03:58:48Z","title":"Online LLM Selection via Constrained Bandits with Time-Varying Demand","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T01:53:33.337375Z"},"links":{"cited_paper":"/paper/2405.16587","citing_paper":"/paper/2606.17489"},"observation_digest":"sha256:da4dc350c039f346042c3c08e3b6f237902552dde7418587ac0baf6cf3658480","observation_id":"380e8528-24b9-4020-a25b-6ff983c20a7b","resolution":{"observed_at":"2026-07-03T19:18:55.040862Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16587","last_updated":"2024-10-02T13:22:27Z","snapshot_observed_at":"2026-07-06T18:20:09.790181Z","submitted_at":"2024-05-26T14:38:24Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16587","snapshot_observed_at":"2026-07-13T01:00:14.236570Z","title":"Cost-effective online multi-llm selection with versatile reward models.arXiv preprint arXiv:2405.16587, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09015","last_updated":"2026-07-10T00:42:10Z","snapshot_observed_at":"2026-08-06T16:16:37.929128Z","submitted_at":"2026-07-10T00:42:10Z","title":"Correlation-Aware Contextual Bandits with Surrogate Rewards for LLM Routing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T01:00:14.236570Z"},"links":{"cited_paper":"/paper/2405.16587","citing_paper":"/paper/2607.09015"},"observation_digest":"sha256:76c6f98b6625be951b7fee6c80bc7b66e88f683e3dc6412fef5cccfe7ac08801","observation_id":"76948b06-21cc-4784-af69-361eeab62fea","resolution":{"observed_at":"2026-07-13T01:00:14.236570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16587","last_updated":"2024-10-02T13:22:27Z","snapshot_observed_at":"2026-07-06T18:20:09.790181Z","submitted_at":"2024-05-26T14:38:24Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16587","snapshot_observed_at":"2026-08-01T18:53:33.486859Z","title":"arXiv preprint arXiv:2405.16587 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17175","last_updated":"2026-07-19T10:21:30Z","snapshot_observed_at":"2026-08-01T18:53:31.318112Z","submitted_at":"2026-07-19T10:21:30Z","title":"LMEdge: QoS-Aware LLM Inference Orchestration on Edge Clusters","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T18:53:33.486859Z"},"links":{"cited_paper":"/paper/2405.16587","citing_paper":"/paper/2607.17175"},"observation_digest":"sha256:07df8339d6ca5275a3d8265e466abb04e31d3b704c7cb4f5e0f7fdf7d1497a31","observation_id":"9e1e8682-e6a4-4652-a8a4-5565d3de9a4d","resolution":{"observed_at":"2026-08-01T18:53:33.486859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.16587/citation-record","integrity":"/paper/2405.16587/integrity","json":"/paper/2405.16587/citation-record.json","paper":"/paper/2405.16587"},"outbound":[],"paper":{"arxiv_id":"2405.16587","last_updated":"2024-10-02T13:22:27Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:20:09.790181Z","submitted_at":"2024-05-26T14:38:24Z","title":"Cost-Effective Online Multi-LLM Selection with Versatile Reward Models"},"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 10 inbound Pith citation observations for arXiv:2405.16587."}