{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FVQIWQ7SCCKC3UGBX4BJIZRIOF","short_pith_number":"pith:FVQIWQ7S","canonical_record":{"source":{"id":"2508.21141","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-28T18:18:19Z","cross_cats_sorted":[],"title_canon_sha256":"0811a5dc4a11b6ef3792ceb8d1dca3b731a75ed6610779e57a7ca5e37f068da6","abstract_canon_sha256":"1f242023fc1c9f88d8efb5e1b4c2beb5f06eb1054eda29e9fb60a57a953a6738"},"schema_version":"1.0"},"canonical_sha256":"2d608b43f210942dd0c1bf029466287178369f8b6990f9145438812093e85b69","source":{"kind":"arxiv","id":"2508.21141","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.21141","created_at":"2026-07-05T12:07:11Z"},{"alias_kind":"arxiv_version","alias_value":"2508.21141v2","created_at":"2026-07-05T12:07:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21141","created_at":"2026-07-05T12:07:11Z"},{"alias_kind":"pith_short_12","alias_value":"FVQIWQ7SCCKC","created_at":"2026-07-05T12:07:11Z"},{"alias_kind":"pith_short_16","alias_value":"FVQIWQ7SCCKC3UGB","created_at":"2026-07-05T12:07:11Z"},{"alias_kind":"pith_short_8","alias_value":"FVQIWQ7S","created_at":"2026-07-05T12:07:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FVQIWQ7SCCKC3UGBX4BJIZRIOF","target":"record","payload":{"canonical_record":{"source":{"id":"2508.21141","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-28T18:18:19Z","cross_cats_sorted":[],"title_canon_sha256":"0811a5dc4a11b6ef3792ceb8d1dca3b731a75ed6610779e57a7ca5e37f068da6","abstract_canon_sha256":"1f242023fc1c9f88d8efb5e1b4c2beb5f06eb1054eda29e9fb60a57a953a6738"},"schema_version":"1.0"},"canonical_sha256":"2d608b43f210942dd0c1bf029466287178369f8b6990f9145438812093e85b69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:11.091446Z","signature_b64":"ZI+GGu5cBzKLo2YGcowuvcLyb71yAzP75kwC3gOmdvKQFugyCBUX+/7rzlSVx+LVADoo7AgbADkn/KkJpJsNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d608b43f210942dd0c1bf029466287178369f8b6990f9145438812093e85b69","last_reissued_at":"2026-07-05T12:07:11.091033Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:11.091033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.21141","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:07:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8NP0huoFMOuGyLriuoUmMU0fh69rocJTSh8v46MWUfWWSpuQ467SmdcrgD4E+DRyD8YQhct6C81Eds4OuJuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:16:39.555829Z"},"content_sha256":"fa39f353d641a6e2b41a1fe717c7a16c99be79373b7aabebb22ed7880421af8d","schema_version":"1.0","event_id":"sha256:fa39f353d641a6e2b41a1fe717c7a16c99be79373b7aabebb22ed7880421af8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FVQIWQ7SCCKC3UGBX4BJIZRIOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive LLM Routing under Budget Constraints","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chaitanya Devaguptapu, Pranoy Panda, Raghav Magazine, Sho Takemori, Vishal Sharma","submitted_at":"2025-08-28T18:18:19Z","abstract_excerpt":"Large Language Models (LLMs) have revolutionized natural language processing, but their varying capabilities and costs pose challenges in practical applications. LLM routing addresses this by dynamically selecting the most suitable LLM for each query/task. Previous approaches treat this as a supervised learning problem, assuming complete knowledge of optimal query-LLM pairings. However, real-world scenarios lack such comprehensive mappings and face evolving user queries. We thus propose to study LLM routing as a contextual bandit problem, enabling adaptive decision-making using bandit feedback"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21141","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.21141/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:07:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5dr0znPd3mkdlOh1os8XLcI781JV/N3jg8syKGWqXurD46RwdX1TsXLIwjuKqJD7JSpqMHc6bv4IY0V1awfKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:16:39.556340Z"},"content_sha256":"78612e60e41fd90c35a5f7c1c9fcc36b183403107ad35afa99feafbaf621e171","schema_version":"1.0","event_id":"sha256:78612e60e41fd90c35a5f7c1c9fcc36b183403107ad35afa99feafbaf621e171"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVQIWQ7SCCKC3UGBX4BJIZRIOF/bundle.json","state_url":"https://pith.science/pith/FVQIWQ7SCCKC3UGBX4BJIZRIOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVQIWQ7SCCKC3UGBX4BJIZRIOF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T16:16:39Z","links":{"resolver":"https://pith.science/pith/FVQIWQ7SCCKC3UGBX4BJIZRIOF","bundle":"https://pith.science/pith/FVQIWQ7SCCKC3UGBX4BJIZRIOF/bundle.json","state":"https://pith.science/pith/FVQIWQ7SCCKC3UGBX4BJIZRIOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVQIWQ7SCCKC3UGBX4BJIZRIOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FVQIWQ7SCCKC3UGBX4BJIZRIOF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1f242023fc1c9f88d8efb5e1b4c2beb5f06eb1054eda29e9fb60a57a953a6738","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-28T18:18:19Z","title_canon_sha256":"0811a5dc4a11b6ef3792ceb8d1dca3b731a75ed6610779e57a7ca5e37f068da6"},"schema_version":"1.0","source":{"id":"2508.21141","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.21141","created_at":"2026-07-05T12:07:11Z"},{"alias_kind":"arxiv_version","alias_value":"2508.21141v2","created_at":"2026-07-05T12:07:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21141","created_at":"2026-07-05T12:07:11Z"},{"alias_kind":"pith_short_12","alias_value":"FVQIWQ7SCCKC","created_at":"2026-07-05T12:07:11Z"},{"alias_kind":"pith_short_16","alias_value":"FVQIWQ7SCCKC3UGB","created_at":"2026-07-05T12:07:11Z"},{"alias_kind":"pith_short_8","alias_value":"FVQIWQ7S","created_at":"2026-07-05T12:07:11Z"}],"graph_snapshots":[{"event_id":"sha256:78612e60e41fd90c35a5f7c1c9fcc36b183403107ad35afa99feafbaf621e171","target":"graph","created_at":"2026-07-05T12:07:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.21141/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large Language Models (LLMs) have revolutionized natural language processing, but their varying capabilities and costs pose challenges in practical applications. LLM routing addresses this by dynamically selecting the most suitable LLM for each query/task. Previous approaches treat this as a supervised learning problem, assuming complete knowledge of optimal query-LLM pairings. However, real-world scenarios lack such comprehensive mappings and face evolving user queries. We thus propose to study LLM routing as a contextual bandit problem, enabling adaptive decision-making using bandit feedback","authors_text":"Chaitanya Devaguptapu, Pranoy Panda, Raghav Magazine, Sho Takemori, Vishal Sharma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21141","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fa39f353d641a6e2b41a1fe717c7a16c99be79373b7aabebb22ed7880421af8d","target":"record","created_at":"2026-07-05T12:07:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1f242023fc1c9f88d8efb5e1b4c2beb5f06eb1054eda29e9fb60a57a953a6738","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-28T18:18:19Z","title_canon_sha256":"0811a5dc4a11b6ef3792ceb8d1dca3b731a75ed6610779e57a7ca5e37f068da6"},"schema_version":"1.0","source":{"id":"2508.21141","kind":"arxiv","version":2}},"canonical_sha256":"2d608b43f210942dd0c1bf029466287178369f8b6990f9145438812093e85b69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d608b43f210942dd0c1bf029466287178369f8b6990f9145438812093e85b69","first_computed_at":"2026-07-05T12:07:11.091033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:07:11.091033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZI+GGu5cBzKLo2YGcowuvcLyb71yAzP75kwC3gOmdvKQFugyCBUX+/7rzlSVx+LVADoo7AgbADkn/KkJpJsNAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:07:11.091446Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.21141","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa39f353d641a6e2b41a1fe717c7a16c99be79373b7aabebb22ed7880421af8d","sha256:78612e60e41fd90c35a5f7c1c9fcc36b183403107ad35afa99feafbaf621e171"],"state_sha256":"3cb7f338f64627c26990e29e5bef58e64bbf7375cc68cfacdf07242adf2f555d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gFAxJMoCPEqZ4SNcZbPsml6bqB2/mjj+Xhe3dtlO7AIg0jWLzxaL6cHtfpVH8WM9XdAic0CJkf1m4lqNG/DjDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:16:39.565544Z","bundle_sha256":"cbe395c5d4744d2a4cabe453d2c3ed5f77fa321f224a968f3c9e67a6b57ef708"}}