{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NWMUA2ENQUCYOF35FY5KKOQOTT","short_pith_number":"pith:NWMUA2EN","canonical_record":{"source":{"id":"2502.02743","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-04T22:09:43Z","cross_cats_sorted":[],"title_canon_sha256":"16bc6cf0e937cc200627e6c81977f3bdd2c1dcb9ee8bb4eedee0730a0fa4c6ca","abstract_canon_sha256":"3d3c80ae2481214f87069b5343dff1e9775661c219d9fa0019694838df010e6f"},"schema_version":"1.0"},"canonical_sha256":"6d9940688d850587177d2e3aa53a0e9cf783d32d1afdfa276114b1035a37e2f5","source":{"kind":"arxiv","id":"2502.02743","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02743","created_at":"2026-07-05T10:09:54Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02743v1","created_at":"2026-07-05T10:09:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02743","created_at":"2026-07-05T10:09:54Z"},{"alias_kind":"pith_short_12","alias_value":"NWMUA2ENQUCY","created_at":"2026-07-05T10:09:54Z"},{"alias_kind":"pith_short_16","alias_value":"NWMUA2ENQUCYOF35","created_at":"2026-07-05T10:09:54Z"},{"alias_kind":"pith_short_8","alias_value":"NWMUA2EN","created_at":"2026-07-05T10:09:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NWMUA2ENQUCYOF35FY5KKOQOTT","target":"record","payload":{"canonical_record":{"source":{"id":"2502.02743","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-04T22:09:43Z","cross_cats_sorted":[],"title_canon_sha256":"16bc6cf0e937cc200627e6c81977f3bdd2c1dcb9ee8bb4eedee0730a0fa4c6ca","abstract_canon_sha256":"3d3c80ae2481214f87069b5343dff1e9775661c219d9fa0019694838df010e6f"},"schema_version":"1.0"},"canonical_sha256":"6d9940688d850587177d2e3aa53a0e9cf783d32d1afdfa276114b1035a37e2f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:54.568668Z","signature_b64":"bbcrn74I+KbCNm5jVqLxui/4GghjKdLxyW1Q061dSXteMBMI4UHmsDzxZ5S+PFtewnpq4PAQD36U9jZx/+FZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d9940688d850587177d2e3aa53a0e9cf783d32d1afdfa276114b1035a37e2f5","last_reissued_at":"2026-07-05T10:09:54.568329Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:54.568329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.02743","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-05T10:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oO3cnosJG5hhK0Sk1cW4LiRPa/bq5JjBqFGkf57l1FneVSq/hMAFL3ESlNdhAxFgyRA6E04Jw+4oS9GEsdhiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:59:40.898882Z"},"content_sha256":"407a5c090e813f94134f3d42861da528021ca00cb15acfe9def782b1393b8b18","schema_version":"1.0","event_id":"sha256:407a5c090e813f94134f3d42861da528021ca00cb15acfe9def782b1393b8b18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NWMUA2ENQUCYOF35FY5KKOQOTT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LLM Bandit: Cost-Efficient LLM Generation via Preference-Conditioned Dynamic Routing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Yang Li","submitted_at":"2025-02-04T22:09:43Z","abstract_excerpt":"The rapid advancement in large language models (LLMs) has brought forth a diverse range of models with varying capabilities that excel in different tasks and domains. However, selecting the optimal LLM for user queries often involves a challenging trade-off between accuracy and cost, a problem exacerbated by the diverse demands of individual queries. In this work, we present a novel framework that formulates the LLM selection process as a multi-armed bandit problem, enabling dynamic and intelligent routing of queries to the most appropriate model. Our approach incorporates a preference-conditi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02743","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/2502.02743/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-05T10:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NAxTFsv2ly2eBaVmDZSYcEbKPkcxkteJdWXBxS9lk0GkOuicgIvA3tDSEHRhZy9gHUv5wkBHPETeop0nxieyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:59:40.899387Z"},"content_sha256":"1b67cc489e637162c340f2d0ebdaf78561d9f9180cf08f4997f9d291c9b7e966","schema_version":"1.0","event_id":"sha256:1b67cc489e637162c340f2d0ebdaf78561d9f9180cf08f4997f9d291c9b7e966"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWMUA2ENQUCYOF35FY5KKOQOTT/bundle.json","state_url":"https://pith.science/pith/NWMUA2ENQUCYOF35FY5KKOQOTT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWMUA2ENQUCYOF35FY5KKOQOTT/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-06T21:59:40Z","links":{"resolver":"https://pith.science/pith/NWMUA2ENQUCYOF35FY5KKOQOTT","bundle":"https://pith.science/pith/NWMUA2ENQUCYOF35FY5KKOQOTT/bundle.json","state":"https://pith.science/pith/NWMUA2ENQUCYOF35FY5KKOQOTT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWMUA2ENQUCYOF35FY5KKOQOTT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NWMUA2ENQUCYOF35FY5KKOQOTT","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":"3d3c80ae2481214f87069b5343dff1e9775661c219d9fa0019694838df010e6f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-04T22:09:43Z","title_canon_sha256":"16bc6cf0e937cc200627e6c81977f3bdd2c1dcb9ee8bb4eedee0730a0fa4c6ca"},"schema_version":"1.0","source":{"id":"2502.02743","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02743","created_at":"2026-07-05T10:09:54Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02743v1","created_at":"2026-07-05T10:09:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02743","created_at":"2026-07-05T10:09:54Z"},{"alias_kind":"pith_short_12","alias_value":"NWMUA2ENQUCY","created_at":"2026-07-05T10:09:54Z"},{"alias_kind":"pith_short_16","alias_value":"NWMUA2ENQUCYOF35","created_at":"2026-07-05T10:09:54Z"},{"alias_kind":"pith_short_8","alias_value":"NWMUA2EN","created_at":"2026-07-05T10:09:54Z"}],"graph_snapshots":[{"event_id":"sha256:1b67cc489e637162c340f2d0ebdaf78561d9f9180cf08f4997f9d291c9b7e966","target":"graph","created_at":"2026-07-05T10:09:54Z","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/2502.02743/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The rapid advancement in large language models (LLMs) has brought forth a diverse range of models with varying capabilities that excel in different tasks and domains. However, selecting the optimal LLM for user queries often involves a challenging trade-off between accuracy and cost, a problem exacerbated by the diverse demands of individual queries. In this work, we present a novel framework that formulates the LLM selection process as a multi-armed bandit problem, enabling dynamic and intelligent routing of queries to the most appropriate model. Our approach incorporates a preference-conditi","authors_text":"Yang Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-04T22:09:43Z","title":"LLM Bandit: Cost-Efficient LLM Generation via Preference-Conditioned Dynamic Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02743","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:407a5c090e813f94134f3d42861da528021ca00cb15acfe9def782b1393b8b18","target":"record","created_at":"2026-07-05T10:09:54Z","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":"3d3c80ae2481214f87069b5343dff1e9775661c219d9fa0019694838df010e6f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-04T22:09:43Z","title_canon_sha256":"16bc6cf0e937cc200627e6c81977f3bdd2c1dcb9ee8bb4eedee0730a0fa4c6ca"},"schema_version":"1.0","source":{"id":"2502.02743","kind":"arxiv","version":1}},"canonical_sha256":"6d9940688d850587177d2e3aa53a0e9cf783d32d1afdfa276114b1035a37e2f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d9940688d850587177d2e3aa53a0e9cf783d32d1afdfa276114b1035a37e2f5","first_computed_at":"2026-07-05T10:09:54.568329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:09:54.568329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bbcrn74I+KbCNm5jVqLxui/4GghjKdLxyW1Q061dSXteMBMI4UHmsDzxZ5S+PFtewnpq4PAQD36U9jZx/+FZCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:09:54.568668Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.02743","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:407a5c090e813f94134f3d42861da528021ca00cb15acfe9def782b1393b8b18","sha256:1b67cc489e637162c340f2d0ebdaf78561d9f9180cf08f4997f9d291c9b7e966"],"state_sha256":"673e9cb8dee663e6b3a4c789120e7dd3b72de7691224dd6e0378d4a4e6d10a18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yY8uTsUsIbt5pjW8mqvsymotioz33vQDcHWUiPbTe9d5izn5wj3AXSmN+V09cxNSvMr2G7aFofUWh2WyQaxyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T21:59:40.903777Z","bundle_sha256":"ed73b95aeb6fa3894de7fd12b4cde02011b8bb55a8e88cea2f4829d3965ce4e4"}}