{"as_of":"2026-08-17T16:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1710bcbffff69bb11154a86f5a5a60a3d688c5e63575e1cf9348d6eb628d1efb","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:21:10.243859Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.12127/citation-record","integrity":"/paper/2608.12127/integrity","json":"/paper/2608.12127/citation-record.json","paper":"/paper/2608.12127"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.12031","last_updated":"2024-03-28T17:56:28Z","snapshot_observed_at":"2026-08-16T16:38:21.205977Z","submitted_at":"2024-03-18T17:59:04Z","title":"RouterBench: A Benchmark for Multi-LLM Routing System","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12031","snapshot_observed_at":"2026-08-16T00:21:09.776982Z","title":"Routerbench: A benchmark for multi-llm routing system, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.776982Z"},"links":{"cited_paper":"/paper/2403.12031","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:fb4684e2629a174775b08a107c706ed27301b65eaac36d70c9d90ec78c4383ea","observation_id":"d8dcb762-09de-4537-8ece-a74c6e0a1fb4","resolution":{"observed_at":"2026-08-16T00:21:09.776982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2512.23562","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:11.848724Z","title":"Vl-routerbench: A benchmark for vision-language model routing, 2026","venue":null,"work_id":"e689c3df-fe3e-4cec-805d-fc48e3a504da","year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.788081Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:1d8633f9fb08e5dbe5812423625116dfdee725d22963e54dacab4b0a9271ffcb","observation_id":"b062a010-6b4a-44e2-b997-10d41a55182c","resolution":{"observed_at":"2026-08-16T00:21:11.860976Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:09.797805Z","title":"Routerarena: An open platform for comprehensive comparison of llm routers, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.797805Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:b5e87f2961990ab9a3a108393a756b2dcc9bc2218611293f9de58a8e89cdf201","observation_id":"aa926c5b-d3e5-4eb5-85ba-8211e48c7563","resolution":{"observed_at":"2026-08-16T00:21:09.797805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18665","last_updated":"2025-02-23T08:50:33Z","snapshot_observed_at":"2026-08-16T00:08:23.767909Z","submitted_at":"2024-06-26T18:10:22Z","title":"RouteLLM: Learning to Route LLMs with Preference Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18665","snapshot_observed_at":"2026-08-16T00:21:09.805459Z","title":"Gonzalez, M Waleed Kadous, and Ion Stoica","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.805459Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:93477883ba2684caf51d9c0fdb20b13d4f8227777bf7390c669436e5f95fec01","observation_id":"f9709bf9-15cf-4d48-9d29-6efb647adca7","resolution":{"observed_at":"2026-08-16T00:21:09.805459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.03261","snapshot_observed_at":"2026-08-16T00:21:09.815657Z","title":"Carrot: A cost aware rate optimal router, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.815657Z"},"links":{"cited_paper":"/paper/2502.03261","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:ae179cb0ddb7c46b6c9be6c75599f20da18c9e035ba58fc818da9e738265f568","observation_id":"2047e7a7-78d4-4195-94db-6e26c8bb8392","resolution":{"observed_at":"2026-08-16T00:21:09.815657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.22902","last_updated":"2026-06-26T11:55:14Z","snapshot_observed_at":"2026-08-17T11:11:44.721518Z","submitted_at":"2026-06-22T06:37:31Z","title":"Agent-as-a-Router: Agentic Model Routing for Coding Tasks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.22902","snapshot_observed_at":"2026-08-16T00:21:09.822934Z","title":"Agent-as-a-router: Agentic model routing for coding tasks","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.822934Z"},"links":{"cited_paper":"/paper/2606.22902","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:b373d3ec11b3555e632d6a26030645cf2caf189f9df91f261722fd45229ec822","observation_id":"4519b724-aa76-4e29-be41-154f6c225935","resolution":{"observed_at":"2026-08-16T00:21:09.822934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19886","last_updated":"2024-09-30T02:31:40Z","snapshot_observed_at":"2026-08-16T13:14:18.073576Z","submitted_at":"2024-09-30T02:31:40Z","title":"RouterDC: Query-Based Router by Dual Contrastive Learning for Assembling Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.19886","snapshot_observed_at":"2026-08-16T00:21:09.839397Z","title":"Kwok, and Yu Zhang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.839397Z"},"links":{"cited_paper":"/paper/2409.19886","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:b3c413e398f339a1abf14411f5a85647ca43c4c41da6adb6d215af5202a0606b","observation_id":"1084bd2f-8d3e-4eb7-878c-6f789800d69b","resolution":{"observed_at":"2026-08-16T00:21:09.839397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08773","last_updated":"2025-07-22T15:27:33Z","snapshot_observed_at":"2026-08-14T02:29:31.486179Z","submitted_at":"2025-02-12T20:30:28Z","title":"Universal Model Routing for Efficient LLM Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08773","snapshot_observed_at":"2026-08-16T00:21:09.849996Z","title":"Universal model routing for efficient llm inference, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.849996Z"},"links":{"cited_paper":"/paper/2502.08773","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:570f4c74804a4fa4ab2601010025726e2ac7aeeecc5aeb304ad3a6901dd44b56","observation_id":"49e22d3e-a91f-4f40-80ad-8a7cac7b6916","resolution":{"observed_at":"2026-08-16T00:21:09.849996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:09.859951Z","title":"xrouter: Training cost-aware llms orchestration system via reinforcement learning, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.859951Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:ca4e5f45a096fbc08229cc7ba691b9821fe8d916452e50fe405df153cfe2341f","observation_id":"3a6f4211-4697-43d0-981b-a3087f09bfdf","resolution":{"observed_at":"2026-08-16T00:21:09.859951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:09.865393Z","title":"Mmr-bench: A comprehensive benchmark for multimodal llm routing, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.865393Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:e64667a8ba1ffacf98d806cecd675d368fe7833d0490d4c6ec7f902f69d1f98e","observation_id":"e030e4f4-ed9c-4c89-9f04-9367af792e33","resolution":{"observed_at":"2026-08-16T00:21:09.865393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:09.871040Z","title":"Icl-router: In-context learned model representations for llm routing, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.871040Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:6c70035ae2a839bdf1e297d69d8b7d78f66627998bf9bdb56997c69b23c60497","observation_id":"75662645-46f1-4a9a-a3c6-5714e5b7a2c1","resolution":{"observed_at":"2026-08-16T00:21:09.871040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-08-16T14:43:12.792044Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-16T00:21:09.877394Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.877394Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:104afe931d1f465abea91be30b0ae0c75c9b4d35d3d59cd2d9c63226faf4ac88","observation_id":"d81457c4-60f3-4d0c-8c87-c04a293cd379","resolution":{"observed_at":"2026-08-16T00:21:09.877394Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:09.883671Z","title":"Llmrouterbench: A massive benchmark and unified framework for llm routing, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.883671Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:e109643f931060c84b904b452f06922fce9988c6b2513b56ef59dd14d9eb8e4b","observation_id":"98571946-15ae-4acd-b929-6eeec38d60f8","resolution":{"observed_at":"2026-08-16T00:21:09.883671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.00180","last_updated":"2026-05-26T23:15:01Z","snapshot_observed_at":"2026-08-11T13:32:00.890651Z","submitted_at":"2026-04-30T19:56:08Z","title":"RouteProfile: Graph-Based Profiling for Cold-Start LLM Routing","version":2},"cited_work":{"arxiv_id":"2605.00180","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.00180","snapshot_observed_at":"2026-08-16T00:21:11.059768Z","title":"RouteProfile: Graph-Based Profiling for Cold-Start LLM Routing","venue":"cs.NI","work_id":"67184abd-6631-4258-b388-b506437a7eca","year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.889230Z"},"links":{"cited_paper":"/paper/2605.00180","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:3b743d50a79815c95bb83c8e00b23367b5982065ac8e8d850b19512941d90292","observation_id":"8d7892b3-2f02-49bd-8ce7-4145c5402861","resolution":{"observed_at":"2026-08-16T00:21:11.068507Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.360350Z","title":"Bge m3-embedding: Multi- lingual, multi-functionality, multi-granularity text embeddings through self-knowledge distillation, 2024","venue":null,"work_id":"aa84184b-17b4-4a45-8b2d-54097d027667","year":2024},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.896146Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:6bcfa7570369d5a73951bfe6e8c30449d7801f64644867af426fc7172c47bdde","observation_id":"9eb7661e-8d9e-4ed3-a336-33e9c18c8b32","resolution":{"observed_at":"2026-08-16T00:21:12.373812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.324018Z","title":"Dinov2: Learning robust visual features without supervision, 2023","venue":null,"work_id":"53dd8066-46f5-49c4-bf7e-3650d6835013","year":2023},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.918505Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:09b3d630641e5e8820100127543511e3bf91dc7f25f9df2039f0dfdbf483786f","observation_id":"fe8467d8-33c4-47be-a41d-908c8f5f7783","resolution":{"observed_at":"2026-08-16T00:21:12.330791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-15T17:40:38.050939Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-16T00:21:09.928970Z","title":"Program synthesis with large language models, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.928970Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:173c12a8af16ef849222d8fd13639f5b64dca073d77bf61f05728a837b75e819","observation_id":"f4e41704-9956-4090-a050-cf3ecc3dbb4a","resolution":{"observed_at":"2026-08-16T00:21:09.928970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15877","last_updated":"2025-04-01T08:36:44Z","snapshot_observed_at":"2026-08-14T15:45:30.011625Z","submitted_at":"2024-06-22T15:52:04Z","title":"BigCodeBench: Benchmarking Code Generation with Diverse Function Calls and Complex Instructions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15877","snapshot_observed_at":"2026-08-16T00:21:09.936097Z","title":"Big- codebench: Benchmarking code generation with diverse function calls and complex instructions, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.936097Z"},"links":{"cited_paper":"/paper/2406.15877","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:bdb9333d05afbef10f0066b0890f5b8e0ea7ca37b98d821daf7b6f9b78a8b551","observation_id":"25a262ee-153f-4e0b-81e5-543069b99457","resolution":{"observed_at":"2026-08-16T00:21:09.936097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09938","last_updated":"2021-11-08T21:16:44Z","snapshot_observed_at":"2026-08-14T15:19:05.440904Z","submitted_at":"2021-05-20T17:58:42Z","title":"Measuring Coding Challenge Competence With APPS","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.09938","snapshot_observed_at":"2026-08-16T00:21:09.942944Z","title":"Measuring coding challenge competence with apps, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.942944Z"},"links":{"cited_paper":"/paper/2105.09938","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:c156801371c58de53446363de9dba46bac37241bcacd8454651058c5034a1817","observation_id":"ac5334a2-91f4-401b-916e-a9a8aee88368","resolution":{"observed_at":"2026-08-16T00:21:09.942944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-08-16T07:05:57.323612Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07974","snapshot_observed_at":"2026-08-16T00:21:09.949033Z","title":"Livecodebench: Holistic and contamination free evaluation of large language models for code, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.949033Z"},"links":{"cited_paper":"/paper/2403.07974","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:3576a01fe24e4746fee0191e56e27f5ead0b000196da1ef6b17d5f5ee584da51","observation_id":"d65b3180-0e38-41bb-a986-44fe7ff57793","resolution":{"observed_at":"2026-08-16T00:21:09.949033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02255","last_updated":"2024-01-21T03:47:06Z","snapshot_observed_at":"2026-07-06T16:27:15.027202Z","submitted_at":"2023-10-03T17:57:24Z","title":"MathVista: Evaluating Mathematical Reasoning of Foundation Models in Visual Contexts","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02255","snapshot_observed_at":"2026-08-16T00:21:09.960183Z","title":"Mathvista: Evaluating mathematical reasoning of foundation models in visual contexts, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.960183Z"},"links":{"cited_paper":"/paper/2310.02255","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:b7126d7635f2b9824519d969ee1a31303ffee6eb5a93b8b671b894d295f8b276","observation_id":"2dfc2e30-b410-49d9-b6ab-732962a3233c","resolution":{"observed_at":"2026-08-16T00:21:09.960183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.10244","last_updated":"2022-03-19T05:00:30Z","snapshot_observed_at":"2026-08-11T03:45:43.920485Z","submitted_at":"2022-03-19T05:00:30Z","title":"ChartQA: A Benchmark for Question Answering about Charts with Visual and Logical Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.10244","snapshot_observed_at":"2026-08-16T00:21:09.968037Z","title":"Chartqa: A benchmark for question answering about charts with visual and logical reasoning, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.968037Z"},"links":{"cited_paper":"/paper/2203.10244","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:3511ea2886f1d0ae75bd002ac71fa4e84874df94dbfd29cb5244af2af6012579","observation_id":"6b27cc63-0643-47f4-8c2c-caad8bffb184","resolution":{"observed_at":"2026-08-16T00:21:09.968037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.16502","last_updated":"2024-06-13T15:02:39Z","snapshot_observed_at":"2026-08-17T13:10:52.611064Z","submitted_at":"2023-11-27T17:33:21Z","title":"MMMU: A Massive Multi-discipline Multimodal Understanding and Reasoning Benchmark for Expert AGI","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.16502","snapshot_observed_at":"2026-08-16T00:21:09.976355Z","title":"Mmmu: A massive multi-discipline multimodal understanding and reasoning benchmark for expert agi, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.976355Z"},"links":{"cited_paper":"/paper/2311.16502","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:6772d234c79021e102cfd19b6db110129a3bcdff22cf01938ff35d5a9647f573","observation_id":"89c787b6-5db2-448c-b117-331499064d0f","resolution":{"observed_at":"2026-08-16T00:21:09.976355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:09.986517Z","title":"Ocrbench: on the hidden mystery of ocr in large multimodal models.Science China Information Sciences, 67(12), December 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.986517Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:b658e62e96f93b00000b7655eaa7a4840642250b5757f37c9fa79ba11f77c1cb","observation_id":"0ef0920a-7005-448d-a670-1897aa51d4e4","resolution":{"observed_at":"2026-08-16T00:21:09.986517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.00398","last_updated":"2021-01-05T05:39:39Z","snapshot_observed_at":"2026-08-15T00:38:08.150895Z","submitted_at":"2020-07-01T11:37:40Z","title":"DocVQA: A Dataset for VQA on Document Images","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.00398","snapshot_observed_at":"2026-08-16T00:21:09.994412Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:09.994412Z"},"links":{"cited_paper":"/paper/2007.00398","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:07690b2b2dac1b10ef0597699f3b7c774297cdbce36dae2d754c27967b8c74d1","observation_id":"59785d13-fe4c-4b73-babc-a55d929a9b1f","resolution":{"observed_at":"2026-08-16T00:21:09.994412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.07396","last_updated":"2016-03-24T00:02:58Z","snapshot_observed_at":"2026-08-16T16:56:28.600506Z","submitted_at":"2016-03-24T00:02:58Z","title":"A Diagram Is Worth A Dozen Images","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.07396","snapshot_observed_at":"2026-08-16T00:21:10.004215Z","title":"A diagram is worth a dozen images, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.004215Z"},"links":{"cited_paper":"/paper/1603.07396","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:c115f3d3749caaf7f1eb5a2ec30306782173854bd487d9cbb08bf00d3c036863","observation_id":"d7e61a31-b2ee-4320-9b20-92e77d016462","resolution":{"observed_at":"2026-08-16T00:21:10.004215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.303988Z","title":"Grok-1.5 vision preview","venue":null,"work_id":"6ee5c4da-561c-40ea-a29b-71e3e23b63eb","year":2024},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.014328Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:ee0534294d7103153699696b3d54f55d3a37282cbcf24db16061ca4f3249cb53","observation_id":"cee2195a-012f-4b3b-8a82-b77f28380d67","resolution":{"observed_at":"2026-08-16T00:21:12.309949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06600","last_updated":"2025-08-08T17:55:11Z","snapshot_observed_at":"2026-08-16T19:56:18.562519Z","submitted_at":"2025-08-08T17:55:11Z","title":"BrowseComp-Plus: A More Fair and Transparent Evaluation Benchmark of Deep-Research Agent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06600","snapshot_observed_at":"2026-08-16T00:21:10.025595Z","title":"Browsecomp-plus: A more fair and transparent evaluation benchmark of deep-research agent, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.025595Z"},"links":{"cited_paper":"/paper/2508.06600","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:8bbbffdaee261a070f8b7679bc55d3274308efcc0a1a992f9440d9c439af6f45","observation_id":"384ce454-e7cd-452c-85e1-713fb9f40324","resolution":{"observed_at":"2026-08-16T00:21:10.025595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2511.21631","last_updated":"2025-11-27T12:16:54Z","snapshot_observed_at":"2026-08-17T13:26:10.378579Z","submitted_at":"2025-11-26T17:59:08Z","title":"Qwen3-VL Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2511.21631","snapshot_observed_at":"2026-08-16T00:21:10.033144Z","title":"Qwen3-vl technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.033144Z"},"links":{"cited_paper":"/paper/2511.21631","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:8e086df51b2ef5de6a06e6c54ad26c8e5fcdbb0e970a9e1bbbde8d9e44b00d68","observation_id":"d12a94af-9761-49e5-a40b-5772a1df7d20","resolution":{"observed_at":"2026-08-16T00:21:10.033144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:10.042347Z","title":"Qwen3.5: Towards native multimodal agents, February 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.042347Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:c001ff030e46f7cbd3c2db1e6c1b428a42f025767c4c5a4e5a8d83b99f2be6d0","observation_id":"77149de9-c8e7-42a4-b57c-7c53061ec3fb","resolution":{"observed_at":"2026-08-16T00:21:10.042347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.254334Z","title":"Gemini 2.5 Flash Model Card","venue":null,"work_id":"1d485fce-f2c7-4996-96f9-3d2e9f10e830","year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.049417Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:007fdfc11956297770a44b50d86cac6b62104a2a5a3aa27e2a44426fd9d25b4f","observation_id":"9b1b7ab7-9e29-4efd-aa5e-71003a3d94bc","resolution":{"observed_at":"2026-08-16T00:21:12.264188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.228189Z","title":"Gemini 3 Flash Model Card","venue":null,"work_id":"bef2f013-f656-486b-96e8-ceca8ec194e2","year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.060870Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:7de67c7a9eab6f1056dc04a591e269b8d4141eb619591ea94b6d246ccc76db61","observation_id":"ffad6aec-cc83-4148-a389-b1a62ea84494","resolution":{"observed_at":"2026-08-16T00:21:12.235699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.198674Z","title":"Gemini 3.5 Flash Model Card","venue":null,"work_id":"9255670b-43bf-48c6-9f22-e44f9e980ca3","year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.074906Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:100121fb274813d1c997e8d0d37b8db7c18b6591fd30082eec58e8aee7662645","observation_id":"f98c862a-56dc-436e-8cf4-b0bb06ab0725","resolution":{"observed_at":"2026-08-16T00:21:12.207963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.170677Z","title":"Introducing GPT-5.4, March 2026","venue":null,"work_id":"667023b5-070b-49be-b85f-44516c144cd5","year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.087759Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:4a5ff8c440af083857345e69cfd5160e2692e2778e18572dfa165449ce9e542e","observation_id":"8334221f-789b-45ee-bc03-2b8bbf160ce7","resolution":{"observed_at":"2026-08-16T00:21:12.179906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.132834Z","title":"Introducing GPT-5.4 mini and nano, March 2026","venue":null,"work_id":"1df0e552-6373-47e4-96ef-1f7a9cc42aa0","year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.095989Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:16c2356149342e6a0856e096ef2f939b520efc082be1c7d99fc4bead0874746f","observation_id":"fadc4aa1-8780-48d7-9c92-9221c3f245b8","resolution":{"observed_at":"2026-08-16T00:21:12.147124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.100769Z","title":"System card: Claude Haiku 4.5","venue":null,"work_id":"10403c24-8ab0-4be0-854b-448858b9f3eb","year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.110734Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:04b25fc458cc0ab113658f05b7acb80bb4c4bd5208e9e192f8f752277c72c1dc","observation_id":"a1bf3d0d-ecae-48fa-8203-f2970cdb6f85","resolution":{"observed_at":"2026-08-16T00:21:12.111901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.071812Z","title":"System card: Claude Sonnet 4.6","venue":null,"work_id":"241c04f5-9d9b-4d7e-b668-891dd9096b83","year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.125167Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:c3e7dc15ed5ade85e4c477ebcd9badd48a3190743161aad992274d1c8c2b52f7","observation_id":"6d5c32d1-00e4-4ffd-8c82-6a1026e204f4","resolution":{"observed_at":"2026-08-16T00:21:12.079958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.043815Z","title":"System card: Claude Opus 4.6","venue":null,"work_id":"10134b73-a562-4390-9cda-9b354e9d329d","year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.132215Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:42384462198d90b718b4e80d91f639e306b88841a9854e5c36e5f01c86d97524","observation_id":"627b3577-aaaa-407a-a361-d1a5ca49f5eb","resolution":{"observed_at":"2026-08-16T00:21:12.054426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.13392","last_updated":"2026-06-11T14:23:41Z","snapshot_observed_at":"2026-08-13T11:59:50.629136Z","submitted_at":"2026-06-11T14:23:41Z","title":"MiniMax Sparse Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.13392","snapshot_observed_at":"2026-08-16T00:21:10.157715Z","title":"Minimax sparse attention, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.157715Z"},"links":{"cited_paper":"/paper/2606.13392","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:649e13ebb88c0f9c364363010798d4f9b87dbd2ae5ab9cc7b7fc6125826345f8","observation_id":"af142e7d-0060-4cc8-a89a-276e5b07898b","resolution":{"observed_at":"2026-08-16T00:21:10.157715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:12.018033Z","title":null,"venue":null,"work_id":"f5066cba-79e2-42be-992e-b60c9bd1b054","year":1951},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.165977Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:16c7d2e4c023f13cff81c23d64c3e3c6f1f38d35da90a8c2c85e536aca000705","observation_id":"515f4aa8-1917-4384-9572-017e6581271d","resolution":{"observed_at":"2026-08-16T00:21:12.025174Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:10.177096Z","title":"MacQueen","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.177096Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:6d9910048b534601e4749360086f0f7d46802c828ae4fb3deed821a4de58de15","observation_id":"ea27ef0a-5a90-4f20-9a2c-3847f3095017","resolution":{"observed_at":"2026-08-16T00:21:10.177096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:10.182056Z","title":"Conditional logit analysis of qualitative choice behavior","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.182056Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:4c969a08a8b5b2a7204c1300f34bbc1e78b629462ece04d55e02c852cf1d323e","observation_id":"51481ec0-c190-46a2-a8f3-c425df214248","resolution":{"observed_at":"2026-08-16T00:21:10.182056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:10.191057Z","title":"Rumelhart, Geoffrey E","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.191057Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:24d9c06f42ce954fbeaec6259f862d759db8cdd85ff2bbc52ff1baa881e6ca42","observation_id":"75051a63-0dd8-48fe-83d0-91ff64a6ba71","resolution":{"observed_at":"2026-08-16T00:21:10.191057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:11.941209Z","title":"Rifkin and Aldebaro Klautau","venue":null,"work_id":"db416e2b-6dba-467e-9ad6-6941974c4087","year":2004},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.203642Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:1d44bc45d3a7b22fbec51e8989881a1a51003b656e07b4336e9e9dd21860a113","observation_id":"1992f520-ff7a-4241-a203-c3fbf886227c","resolution":{"observed_at":"2026-08-16T00:21:11.948861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:11.912346Z","title":"Pp-ocrv6: From 1.5m to 34.5m parameters, surpassing billion-scale vlms on ocr tasks,","venue":null,"work_id":"6854146b-3a7c-4bed-9b71-2a63116bdd29","year":null},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.212314Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:19ff8dbe5b9b388f0f68476b1c968087854b6b2eae52f576ec39de9cc1f0208a","observation_id":"1f085e25-1e71-4663-a78d-cac55cae5481","resolution":{"observed_at":"2026-08-16T00:21:11.924501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.05176","last_updated":"2025-06-11T02:54:49Z","snapshot_observed_at":"2026-08-17T07:57:12.232097Z","submitted_at":"2025-06-05T15:49:48Z","title":"Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05176","snapshot_observed_at":"2026-08-16T00:21:10.232013Z","title":"Qwen3 embedding: Advancing text embedding and reranking through foundation models.arXiv preprint arXiv:2506.05176, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.232013Z"},"links":{"cited_paper":"/paper/2506.05176","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:5185077a8d3c9ca6565d7e4957e029f474df0a1f7e78770d20e08814dbd42a7d","observation_id":"b5cdc979-4ee6-4d45-9914-1b0159960cd4","resolution":{"observed_at":"2026-08-16T00:21:10.232013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1012.7988","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:21:10.566904Z","title":"GPT-5.5 System Card","venue":null,"work_id":"4bc11804-1f47-44aa-8206-b6dd84417e91","year":2026},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.243859Z"},"links":{"citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:ea68133d5da5e7fd1fa8220699c4ae3b0ac959da2d48f480659e45b8f6a42119","observation_id":"c22d01b8-9066-4a78-8975-4692f8d295d3","resolution":{"observed_at":"2026-08-16T00:21:10.581592Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.13108","last_updated":"2026-06-11T09:35:16Z","snapshot_observed_at":"2026-08-16T17:50:20.596166Z","submitted_at":"2026-06-11T09:35:16Z","title":"PP-OCRv6: From 1.5M to 34.5M Parameters, Surpassing Billion-Scale VLMs on OCR Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.13108","snapshot_observed_at":"2026-08-16T00:21:10.219919Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-16T00:21:10.219919Z"},"links":{"cited_paper":"/paper/2606.13108","citing_paper":"/paper/2608.12127"},"observation_digest":"sha256:85de9a05fe089d5543056b00368cbe0baff88c4ad078c54e11e9fb4127d6ed0e","observation_id":"c9aebf86-ae6c-4fb9-b1ba-6b7f69e40a42","resolution":{"observed_at":"2026-08-16T00:21:10.219919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.12127","last_updated":"2026-08-12T14:49:28Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-17T11:20:36.403263Z","submitted_at":"2026-08-12T14:49:28Z","title":"SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":2,"verified_fuzzy":13},"total_outbound_references":48},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2608.12127."}