{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:64LSJYUEBNM4XBDFFQ3JYJT2NB","short_pith_number":"pith:64LSJYUE","canonical_record":{"source":{"id":"2410.10347","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-14T10:00:49Z","cross_cats_sorted":[],"title_canon_sha256":"83a438af189350c6782ec3d78f1b4909b6543e7fbede4abb4b5541db48edaf23","abstract_canon_sha256":"891e75e1676fd9a10be8eaebe89aa710eae4de5749dcec1d4a52b72d04224ee2"},"schema_version":"1.0"},"canonical_sha256":"f71724e2840b59cb84652c369c267a687507d4916d934bb118df9f35108564d6","source":{"kind":"arxiv","id":"2410.10347","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.10347","created_at":"2026-07-05T11:07:15Z"},{"alias_kind":"arxiv_version","alias_value":"2410.10347v3","created_at":"2026-07-05T11:07:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10347","created_at":"2026-07-05T11:07:15Z"},{"alias_kind":"pith_short_12","alias_value":"64LSJYUEBNM4","created_at":"2026-07-05T11:07:15Z"},{"alias_kind":"pith_short_16","alias_value":"64LSJYUEBNM4XBDF","created_at":"2026-07-05T11:07:15Z"},{"alias_kind":"pith_short_8","alias_value":"64LSJYUE","created_at":"2026-07-05T11:07:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:64LSJYUEBNM4XBDFFQ3JYJT2NB","target":"record","payload":{"canonical_record":{"source":{"id":"2410.10347","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-14T10:00:49Z","cross_cats_sorted":[],"title_canon_sha256":"83a438af189350c6782ec3d78f1b4909b6543e7fbede4abb4b5541db48edaf23","abstract_canon_sha256":"891e75e1676fd9a10be8eaebe89aa710eae4de5749dcec1d4a52b72d04224ee2"},"schema_version":"1.0"},"canonical_sha256":"f71724e2840b59cb84652c369c267a687507d4916d934bb118df9f35108564d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:15.534297Z","signature_b64":"GGi0Ora50pLtxhVSKd56R3H5DdZ3f4P8DsAH8xWk3RW4038HCI+fAzPUa916Xjf65ym9IoB/e6+PFUfaiickCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f71724e2840b59cb84652c369c267a687507d4916d934bb118df9f35108564d6","last_reissued_at":"2026-07-05T11:07:15.533800Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:15.533800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.10347","source_version":3,"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-05T11:07:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pnJj9Pr+sCWG2lqvIJBQSZWLSQw1FYlBbdzkGW+NRUQCji0OXnhqqvjlR5Xcq9JGQfmZa7UpOtNE5fR0svZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:05:10.011143Z"},"content_sha256":"5bcfb4c608477d757b6fbaf571fe4a6d280702daca1f2fc0477413fb67acd865","schema_version":"1.0","event_id":"sha256:5bcfb4c608477d757b6fbaf571fe4a6d280702daca1f2fc0477413fb67acd865"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:64LSJYUEBNM4XBDFFQ3JYJT2NB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Approach to Routing and Cascading for LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jasper Dekoninck, Martin Vechev, Maximilian Baader","submitted_at":"2024-10-14T10:00:49Z","abstract_excerpt":"The availability of a wide range of large language models (LLMs) embedded in various agentic systems has significantly increased the potential of model selection strategies to improve the cost-performance tradeoff. Existing strategies involve either routing, where a single model is chosen per query, or cascading, which sequentially runs increasingly larger models until a satisfactory answer is found. However, current approaches face three key limitations: they (1) lack formal proofs of optimality, (2) fail to identify the conditions under which these strategies are most effective to improve th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10347","kind":"arxiv","version":3},"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/2410.10347/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-05T11:07:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SdiEPNeJKx4J0r03Tkkrp0zGGTzeROS6befUH6WyZQW8jTjXoWezw8gMV72oKO5S00Qnjjm5HMAVQ3mV9QOYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:05:10.011737Z"},"content_sha256":"2b5f800bed97df53df444d11ff7334ea9c0c1c7d06487bdc37f600080c8f3ba0","schema_version":"1.0","event_id":"sha256:2b5f800bed97df53df444d11ff7334ea9c0c1c7d06487bdc37f600080c8f3ba0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64LSJYUEBNM4XBDFFQ3JYJT2NB/bundle.json","state_url":"https://pith.science/pith/64LSJYUEBNM4XBDFFQ3JYJT2NB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64LSJYUEBNM4XBDFFQ3JYJT2NB/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-07T01:05:10Z","links":{"resolver":"https://pith.science/pith/64LSJYUEBNM4XBDFFQ3JYJT2NB","bundle":"https://pith.science/pith/64LSJYUEBNM4XBDFFQ3JYJT2NB/bundle.json","state":"https://pith.science/pith/64LSJYUEBNM4XBDFFQ3JYJT2NB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64LSJYUEBNM4XBDFFQ3JYJT2NB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:64LSJYUEBNM4XBDFFQ3JYJT2NB","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":"891e75e1676fd9a10be8eaebe89aa710eae4de5749dcec1d4a52b72d04224ee2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-14T10:00:49Z","title_canon_sha256":"83a438af189350c6782ec3d78f1b4909b6543e7fbede4abb4b5541db48edaf23"},"schema_version":"1.0","source":{"id":"2410.10347","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.10347","created_at":"2026-07-05T11:07:15Z"},{"alias_kind":"arxiv_version","alias_value":"2410.10347v3","created_at":"2026-07-05T11:07:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10347","created_at":"2026-07-05T11:07:15Z"},{"alias_kind":"pith_short_12","alias_value":"64LSJYUEBNM4","created_at":"2026-07-05T11:07:15Z"},{"alias_kind":"pith_short_16","alias_value":"64LSJYUEBNM4XBDF","created_at":"2026-07-05T11:07:15Z"},{"alias_kind":"pith_short_8","alias_value":"64LSJYUE","created_at":"2026-07-05T11:07:15Z"}],"graph_snapshots":[{"event_id":"sha256:2b5f800bed97df53df444d11ff7334ea9c0c1c7d06487bdc37f600080c8f3ba0","target":"graph","created_at":"2026-07-05T11:07:15Z","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/2410.10347/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The availability of a wide range of large language models (LLMs) embedded in various agentic systems has significantly increased the potential of model selection strategies to improve the cost-performance tradeoff. Existing strategies involve either routing, where a single model is chosen per query, or cascading, which sequentially runs increasingly larger models until a satisfactory answer is found. However, current approaches face three key limitations: they (1) lack formal proofs of optimality, (2) fail to identify the conditions under which these strategies are most effective to improve th","authors_text":"Jasper Dekoninck, Martin Vechev, Maximilian Baader","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10347","kind":"arxiv","version":3},"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:5bcfb4c608477d757b6fbaf571fe4a6d280702daca1f2fc0477413fb67acd865","target":"record","created_at":"2026-07-05T11:07:15Z","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":"891e75e1676fd9a10be8eaebe89aa710eae4de5749dcec1d4a52b72d04224ee2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-14T10:00:49Z","title_canon_sha256":"83a438af189350c6782ec3d78f1b4909b6543e7fbede4abb4b5541db48edaf23"},"schema_version":"1.0","source":{"id":"2410.10347","kind":"arxiv","version":3}},"canonical_sha256":"f71724e2840b59cb84652c369c267a687507d4916d934bb118df9f35108564d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f71724e2840b59cb84652c369c267a687507d4916d934bb118df9f35108564d6","first_computed_at":"2026-07-05T11:07:15.533800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:07:15.533800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GGi0Ora50pLtxhVSKd56R3H5DdZ3f4P8DsAH8xWk3RW4038HCI+fAzPUa916Xjf65ym9IoB/e6+PFUfaiickCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:07:15.534297Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.10347","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bcfb4c608477d757b6fbaf571fe4a6d280702daca1f2fc0477413fb67acd865","sha256:2b5f800bed97df53df444d11ff7334ea9c0c1c7d06487bdc37f600080c8f3ba0"],"state_sha256":"ef07ff0b30c02b5f0ecbcd3830e6defd5c737d442887057557d1aa6572a4cdca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f6FQORqXQ6ClhmpUMYA7XmSBgF3ELzbkpM/zUcXWxUx4X9qa1jI7/ZO3Yi75UKPbxQ2OtzfFnA7Frwf5FjKBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T01:05:10.017643Z","bundle_sha256":"8b2f2c292050770ef600dca01c9e83424bc0d9c6a5c39c8f9a7f65e047ac7363"}}