{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TYHCSVL6FVYMZXBGMMUKLN7OPG","short_pith_number":"pith:TYHCSVL6","canonical_record":{"source":{"id":"2607.23765","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-26T17:20:39Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bf0d1426c00040badc6d3e692e58eaccb12ca4269f9cd8cf523f693cd210adf7","abstract_canon_sha256":"be29461e99755dba9a2f85eb8037fff0eeea80336177fe7017d694006aa3ad08"},"schema_version":"1.0"},"canonical_sha256":"9e0e29557e2d70ccdc266328a5b7ee79a8739cc2fc2ad6346c0ed8f2be92b160","source":{"kind":"arxiv","id":"2607.23765","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.23765","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.23765v1","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23765","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"TYHCSVL6FVYM","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"TYHCSVL6FVYMZXBG","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"TYHCSVL6","created_at":"2026-07-28T01:23:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TYHCSVL6FVYMZXBGMMUKLN7OPG","target":"record","payload":{"canonical_record":{"source":{"id":"2607.23765","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-26T17:20:39Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bf0d1426c00040badc6d3e692e58eaccb12ca4269f9cd8cf523f693cd210adf7","abstract_canon_sha256":"be29461e99755dba9a2f85eb8037fff0eeea80336177fe7017d694006aa3ad08"},"schema_version":"1.0"},"canonical_sha256":"9e0e29557e2d70ccdc266328a5b7ee79a8739cc2fc2ad6346c0ed8f2be92b160","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:23:10.141613Z","signature_b64":"dMC4S3ZWQQWRQGjRsPyWCTIlU8Ucco3/H/Rnb/pA7RbcyiCdUZ2MKB7DE5nKJgjlpg+7J07p9GwEmgbGb0yTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e0e29557e2d70ccdc266328a5b7ee79a8739cc2fc2ad6346c0ed8f2be92b160","last_reissued_at":"2026-07-28T01:23:10.140761Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:23:10.140761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.23765","source_version":1,"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-28T01:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9Dyd3fec/j8NOuqJ/zcDi60AE5Uym0m8WbUCohCrWfF1zKUj9SU76WQPLUBZDiz8FJagEzY3Gq1iEU/xdfTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T20:08:59.023020Z"},"content_sha256":"953e6566241b6fd3e41cb709f941543e0cbbb50e79c486e5547ebcc33af8f630","schema_version":"1.0","event_id":"sha256:953e6566241b6fd3e41cb709f941543e0cbbb50e79c486e5547ebcc33af8f630"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TYHCSVL6FVYMZXBGMMUKLN7OPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"WISERouter: LLM Routing with Workload Budget Constraint","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Laks V.S. Lakshmanan, Yifei Li, Zihui Gao","submitted_at":"2026-07-26T17:20:39Z","abstract_excerpt":"Large language models (LLMs) achieve impressive performance across multiple domains, but using the most capable model for every query is prohibitive at scale. LLM routing exploits diversity in model capability and cost by assigning each query to a suitable model to balance utility and budget. Current methods have two limitations: (i) they either use heuristics that do not always enforce the budget constraint or impose a fixed per-query budget that cannot adapt across the workload and leads to suboptimal performance; (ii) they require supervised learning on a dense dataset with statistics for e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23765","kind":"arxiv","version":1},"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/2607.23765/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-28T01:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jk2PEn0afolOayYT3Q5VSsZTqPAszVSbacDp9JMIIPHXXkaXD5ojv1oBszApds5zRkd3GbN0PxXUQ4CN/Gs6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T20:08:59.023341Z"},"content_sha256":"a7d28564009fa5705b606234ed60fe375898992f170e527c4f70a0d8c8453d84","schema_version":"1.0","event_id":"sha256:a7d28564009fa5705b606234ed60fe375898992f170e527c4f70a0d8c8453d84"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:TYHCSVL6FVYMZXBGMMUKLN7OPG","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1609/aaai.v24i1.7758 resolves to 'Epsilon–First Policies for Budget–Limited Multi-Armed Bandits'. A reader following the printed text alone cannot reach it.","snippet":"Long Tran-Thanh, Archie Chapman, Enrique Munoz de Cote, Alex Rogers, and Nicholas R. Jennings. Epsilon–first policies for budget–limited multi-armed bandits.Proceedings of the AAAI Conference on Artificial Intelligence, 24(1):1211–1216, Jul","arxiv_id":"2607.23765","detector":"doi_compliance","evidence":{"ref_index":36,"verdict_class":"incontrovertible","resolved_title":"Epsilon–First Policies for Budget–Limited Multi-Armed Bandits","printed_excerpt":"10.1609/aaai","reconstructed_doi":"10.1609/aaai.v24i1.7758"},"severity":"advisory","ref_index":36,"audited_at":"2026-07-30T13:31:38.354226Z","event_type":"pith.integrity.v1","detected_doi":"10.1609/aaai.v24i1.7758","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"37fce94f04b3b4266a07f43c09abc0d85b673aadcbf3e8e2564dc054440986d6","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Epsilon–First Policies for Budget–Limited Multi-Armed Bandits","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13940,"payload_sha256":"c0c6ae9f2d38f0e9ac89a2fc5a4f053dac0b28a19e9baf17b28a9a2aa57935dc","signature_b64":null,"signing_key_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-30T13:36:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yFilcXuC01BuU8CUYEO+/sPJJs99xw0iLf80zG/S3aJnZHjTVUo86rfnfQg+oSHVAYxmeAbke2o2j6m8gyPNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T20:08:59.037100Z"},"content_sha256":"4820003b769b6884db14da5fcbd5241925f12ae6d8041db0431efea0abec527b","schema_version":"1.0","event_id":"sha256:4820003b769b6884db14da5fcbd5241925f12ae6d8041db0431efea0abec527b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:TYHCSVL6FVYMZXBGMMUKLN7OPG","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1023/A:1013689704352) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer. Finite-time analysis of the multiarmed bandit problem.Mach. Learn., 47(2–3):235–256, May 2002. ISSN 0885-6125. doi: 10.1023/A: 1013689704352. URLhttps://doi.org/10.1023/A:1013689704352","arxiv_id":"2607.23765","detector":"doi_compliance","evidence":{"ref_index":2,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1023/a:","reconstructed_doi":"10.1023/A:1013689704352"},"severity":"advisory","ref_index":2,"audited_at":"2026-07-30T13:31:38.354226Z","event_type":"pith.integrity.v1","detected_doi":"10.1023/A:1013689704352","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a8a872e6f5582e1bc25d729337ffb94a1c36ed9870b36a51a9b137dc79ffddb4","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13939,"payload_sha256":"132625a6ef8a49d59689c2b127b95f18922a0ee3c2affb5cea69692d69f5e36e","signature_b64":null,"signing_key_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-30T13:36:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TrIUXIA0wr7mDGTuTOfepjidvJjMOLo0TMvgY51hCmSwnhxiCY0Jbe07pxAFBkwYdk2uvAE6rVb+neuNhFYUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T20:08:59.037330Z"},"content_sha256":"bf744ec11b4bc438863e929414f3dd4243ca78f49ecb9e4ceb4d5c175bf01edf","schema_version":"1.0","event_id":"sha256:bf744ec11b4bc438863e929414f3dd4243ca78f49ecb9e4ceb4d5c175bf01edf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG/bundle.json","state_url":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG/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-02T20:08:59Z","links":{"resolver":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG","bundle":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG/bundle.json","state":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TYHCSVL6FVYMZXBGMMUKLN7OPG","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"be29461e99755dba9a2f85eb8037fff0eeea80336177fe7017d694006aa3ad08","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-26T17:20:39Z","title_canon_sha256":"bf0d1426c00040badc6d3e692e58eaccb12ca4269f9cd8cf523f693cd210adf7"},"schema_version":"1.0","source":{"id":"2607.23765","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.23765","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.23765v1","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23765","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"TYHCSVL6FVYM","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"TYHCSVL6FVYMZXBG","created_at":"2026-07-28T01:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"TYHCSVL6","created_at":"2026-07-28T01:23:10Z"}],"graph_snapshots":[{"event_id":"sha256:a7d28564009fa5705b606234ed60fe375898992f170e527c4f70a0d8c8453d84","target":"graph","created_at":"2026-07-28T01:23:10Z","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/2607.23765/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models (LLMs) achieve impressive performance across multiple domains, but using the most capable model for every query is prohibitive at scale. LLM routing exploits diversity in model capability and cost by assigning each query to a suitable model to balance utility and budget. Current methods have two limitations: (i) they either use heuristics that do not always enforce the budget constraint or impose a fixed per-query budget that cannot adapt across the workload and leads to suboptimal performance; (ii) they require supervised learning on a dense dataset with statistics for e","authors_text":"Laks V.S. Lakshmanan, Yifei Li, Zihui Gao","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23765","kind":"arxiv","version":1},"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:953e6566241b6fd3e41cb709f941543e0cbbb50e79c486e5547ebcc33af8f630","target":"record","created_at":"2026-07-28T01:23:10Z","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":"be29461e99755dba9a2f85eb8037fff0eeea80336177fe7017d694006aa3ad08","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-26T17:20:39Z","title_canon_sha256":"bf0d1426c00040badc6d3e692e58eaccb12ca4269f9cd8cf523f693cd210adf7"},"schema_version":"1.0","source":{"id":"2607.23765","kind":"arxiv","version":1}},"canonical_sha256":"9e0e29557e2d70ccdc266328a5b7ee79a8739cc2fc2ad6346c0ed8f2be92b160","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e0e29557e2d70ccdc266328a5b7ee79a8739cc2fc2ad6346c0ed8f2be92b160","first_computed_at":"2026-07-28T01:23:10.140761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T01:23:10.140761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dMC4S3ZWQQWRQGjRsPyWCTIlU8Ucco3/H/Rnb/pA7RbcyiCdUZ2MKB7DE5nKJgjlpg+7J07p9GwEmgbGb0yTBA==","signature_status":"signed_v1","signed_at":"2026-07-28T01:23:10.141613Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.23765","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:4820003b769b6884db14da5fcbd5241925f12ae6d8041db0431efea0abec527b","sha256:bf744ec11b4bc438863e929414f3dd4243ca78f49ecb9e4ceb4d5c175bf01edf"]}],"invalid_events":[],"applied_event_ids":["sha256:953e6566241b6fd3e41cb709f941543e0cbbb50e79c486e5547ebcc33af8f630","sha256:a7d28564009fa5705b606234ed60fe375898992f170e527c4f70a0d8c8453d84"],"state_sha256":"b1387937060389abbfbf3fbde3b26f4eae41f8aaecec908270daeff52eddd6dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/KyBwM/nkpO6j28sY0ycFGMz4TsNhNcxvy1d0153qBGrRn64EOjU5ckYSrCewjMCdy3AOE8qVuWe/L6yOlEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-02T20:08:59.039201Z","bundle_sha256":"41130c641d864327f96c326cc2084ee069b0fe117ce6a7994db720c0db8f63d9"}}