{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KJH4VWYR7BJ6IVVQFXD6IUHRBW","short_pith_number":"pith:KJH4VWYR","canonical_record":{"source":{"id":"2410.03834","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-04T18:02:48Z","cross_cats_sorted":[],"title_canon_sha256":"710c38a1728ee39f918d97ef9c8d2a5781d48abe9488a730d591435d6f293140","abstract_canon_sha256":"01b282de59944e78225979560598779804b39ec5ef13baf1605a13e1b0ba27b0"},"schema_version":"1.0"},"canonical_sha256":"524fcadb11f853e456b02dc7e450f10da21d36db0faa5b60186aff2af0a66e82","source":{"kind":"arxiv","id":"2410.03834","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.03834","created_at":"2026-07-05T10:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"2410.03834v2","created_at":"2026-07-05T10:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03834","created_at":"2026-07-05T10:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"KJH4VWYR7BJ6","created_at":"2026-07-05T10:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"KJH4VWYR7BJ6IVVQ","created_at":"2026-07-05T10:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"KJH4VWYR","created_at":"2026-07-05T10:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KJH4VWYR7BJ6IVVQFXD6IUHRBW","target":"record","payload":{"canonical_record":{"source":{"id":"2410.03834","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-04T18:02:48Z","cross_cats_sorted":[],"title_canon_sha256":"710c38a1728ee39f918d97ef9c8d2a5781d48abe9488a730d591435d6f293140","abstract_canon_sha256":"01b282de59944e78225979560598779804b39ec5ef13baf1605a13e1b0ba27b0"},"schema_version":"1.0"},"canonical_sha256":"524fcadb11f853e456b02dc7e450f10da21d36db0faa5b60186aff2af0a66e82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:31.752642Z","signature_b64":"mGGbUJ5312rDwF8AZFHanqcn8oNBnFXKVATUYyUQq5eRKKEAae1HV2c0Tor3oUmPwAgdjyJQ9y+1VR2pXIDYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"524fcadb11f853e456b02dc7e450f10da21d36db0faa5b60186aff2af0a66e82","last_reissued_at":"2026-07-05T10:32:31.751842Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:31.751842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.03834","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-05T10:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYPJEXJVY9zRte7bYmlVCxgz1pdA/LevFbpo/mEjWXpEp838UDTdcHud0cDaJxNkYaCxW3AVzJOmexZB4BrcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:47:59.051338Z"},"content_sha256":"a024715a5f26470398000fd438bf7733791ac5d1dc497cf06fcdc0b3a0680447","schema_version":"1.0","event_id":"sha256:a024715a5f26470398000fd438bf7733791ac5d1dc497cf06fcdc0b3a0680447"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KJH4VWYR7BJ6IVVQFXD6IUHRBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphRouter: A Graph-based Router for LLM Selections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiaxuan You, Tao Feng, Yanzhen Shen","submitted_at":"2024-10-04T18:02:48Z","abstract_excerpt":"The rapidly growing number and variety of Large Language Models (LLMs) present significant challenges in efficiently selecting the appropriate LLM for a given query, especially considering the trade-offs between performance and computational cost. Current LLM selection methods often struggle to generalize across new LLMs and different tasks because of their limited ability to leverage contextual interactions among tasks, queries, and LLMs, as well as their dependence on a transductive learning framework. To address these shortcomings, we introduce a novel inductive graph framework, named as Gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03834","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/2410.03834/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:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Nnx8h8PiYVf48N1gd7IKTW87h/fkVLpMoQdrlRGGdaE/y4l3KZ4APssq0/QiL22fTlJJXd2tpIbX/uCNAHnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:47:59.051852Z"},"content_sha256":"a2238fab24b6cfff50ee7a391f221235a1e61e1b8be19b9302647ce400e39325","schema_version":"1.0","event_id":"sha256:a2238fab24b6cfff50ee7a391f221235a1e61e1b8be19b9302647ce400e39325"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW/bundle.json","state_url":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW/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-03T15:47:59Z","links":{"resolver":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW","bundle":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW/bundle.json","state":"https://pith.science/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJH4VWYR7BJ6IVVQFXD6IUHRBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KJH4VWYR7BJ6IVVQFXD6IUHRBW","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":"01b282de59944e78225979560598779804b39ec5ef13baf1605a13e1b0ba27b0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-04T18:02:48Z","title_canon_sha256":"710c38a1728ee39f918d97ef9c8d2a5781d48abe9488a730d591435d6f293140"},"schema_version":"1.0","source":{"id":"2410.03834","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.03834","created_at":"2026-07-05T10:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"2410.03834v2","created_at":"2026-07-05T10:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03834","created_at":"2026-07-05T10:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"KJH4VWYR7BJ6","created_at":"2026-07-05T10:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"KJH4VWYR7BJ6IVVQ","created_at":"2026-07-05T10:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"KJH4VWYR","created_at":"2026-07-05T10:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:a2238fab24b6cfff50ee7a391f221235a1e61e1b8be19b9302647ce400e39325","target":"graph","created_at":"2026-07-05T10:32:31Z","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.03834/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The rapidly growing number and variety of Large Language Models (LLMs) present significant challenges in efficiently selecting the appropriate LLM for a given query, especially considering the trade-offs between performance and computational cost. Current LLM selection methods often struggle to generalize across new LLMs and different tasks because of their limited ability to leverage contextual interactions among tasks, queries, and LLMs, as well as their dependence on a transductive learning framework. To address these shortcomings, we introduce a novel inductive graph framework, named as Gr","authors_text":"Jiaxuan You, Tao Feng, Yanzhen Shen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-04T18:02:48Z","title":"GraphRouter: A Graph-based Router for LLM Selections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03834","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:a024715a5f26470398000fd438bf7733791ac5d1dc497cf06fcdc0b3a0680447","target":"record","created_at":"2026-07-05T10:32:31Z","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":"01b282de59944e78225979560598779804b39ec5ef13baf1605a13e1b0ba27b0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-04T18:02:48Z","title_canon_sha256":"710c38a1728ee39f918d97ef9c8d2a5781d48abe9488a730d591435d6f293140"},"schema_version":"1.0","source":{"id":"2410.03834","kind":"arxiv","version":2}},"canonical_sha256":"524fcadb11f853e456b02dc7e450f10da21d36db0faa5b60186aff2af0a66e82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"524fcadb11f853e456b02dc7e450f10da21d36db0faa5b60186aff2af0a66e82","first_computed_at":"2026-07-05T10:32:31.751842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:32:31.751842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mGGbUJ5312rDwF8AZFHanqcn8oNBnFXKVATUYyUQq5eRKKEAae1HV2c0Tor3oUmPwAgdjyJQ9y+1VR2pXIDYDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:32:31.752642Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.03834","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a024715a5f26470398000fd438bf7733791ac5d1dc497cf06fcdc0b3a0680447","sha256:a2238fab24b6cfff50ee7a391f221235a1e61e1b8be19b9302647ce400e39325"],"state_sha256":"28831aef1064a72f568e1a67c00d0dc0c17c8f68c67e2a97dfb69cd9d69b766b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gd4XgbWM4umFfD6wshMfi6vUHttwcNMmWF28aS5jatGJc7kcBeNIDIg4qHbkmBwu9iIe6/8jviG8Vdi550pvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:47:59.057849Z","bundle_sha256":"f950aef33c01b204d4b9c7f240c13ef9306ffb50732f2ff50a77cf6d8e3bd89e"}}