{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GOPDTI5EFEX36VISKCPEZJCSN2","short_pith_number":"pith:GOPDTI5E","schema_version":"1.0","canonical_sha256":"339e39a3a4292fbf5512509e4ca4526e971de48d103c75bba861e36cd39a9813","source":{"kind":"arxiv","id":"2311.13184","version":3},"attestation_state":"computed","paper":{"title":"Large Language Model-Enhanced Algorithm Selection: Towards Comprehensive Algorithm Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Bingbing Jiang, Jibin Wu, Kay Chen Tan, Xingyu Wu, Yan Zhong","submitted_at":"2023-11-22T06:23:18Z","abstract_excerpt":"Algorithm selection, a critical process of automated machine learning, aims to identify the most suitable algorithm for solving a specific problem prior to execution. Mainstream algorithm selection techniques heavily rely on problem features, while the role of algorithm features remains largely unexplored. Due to the intrinsic complexity of algorithms, effective methods for universally extracting algorithm information are lacking. This paper takes a significant step towards bridging this gap by introducing Large Language Models (LLMs) into algorithm selection for the first time. By comprehendi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2311.13184","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-22T06:23:18Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"7541b1eeaf5ec765de22d789db8ae8ed00e67bf1ea7f68cd797dfbc81224898d","abstract_canon_sha256":"c0cf8070aab330c8b8361d137be109846b0e0ac339eb515d27ecb91d612be8b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:19:38.551347Z","signature_b64":"T+jAw3Fazti4W1E8OebCntrUVSRXS+3w3NRDqD6Ab5Fb+nq37stw4GyQz/5KxCuQycQpSILkCVtYES0k0jzGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"339e39a3a4292fbf5512509e4ca4526e971de48d103c75bba861e36cd39a9813","last_reissued_at":"2026-07-05T08:19:38.550768Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:19:38.550768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Language Model-Enhanced Algorithm Selection: Towards Comprehensive Algorithm Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Bingbing Jiang, Jibin Wu, Kay Chen Tan, Xingyu Wu, Yan Zhong","submitted_at":"2023-11-22T06:23:18Z","abstract_excerpt":"Algorithm selection, a critical process of automated machine learning, aims to identify the most suitable algorithm for solving a specific problem prior to execution. Mainstream algorithm selection techniques heavily rely on problem features, while the role of algorithm features remains largely unexplored. Due to the intrinsic complexity of algorithms, effective methods for universally extracting algorithm information are lacking. This paper takes a significant step towards bridging this gap by introducing Large Language Models (LLMs) into algorithm selection for the first time. By comprehendi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13184","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/2311.13184/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2311.13184","created_at":"2026-07-05T08:19:38.550846+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.13184v3","created_at":"2026-07-05T08:19:38.550846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13184","created_at":"2026-07-05T08:19:38.550846+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOPDTI5EFEX3","created_at":"2026-07-05T08:19:38.550846+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOPDTI5EFEX36VIS","created_at":"2026-07-05T08:19:38.550846+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOPDTI5E","created_at":"2026-07-05T08:19:38.550846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00862","citing_title":"Meta-Black-Box Optimization with Ensemble Surrogate Modeling for Robustness-Accuracy Trade-off within SAEA","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02933","citing_title":"Relation Reasoning with LLMs in Expensive Optimization","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GOPDTI5EFEX36VISKCPEZJCSN2","json":"https://pith.science/pith/GOPDTI5EFEX36VISKCPEZJCSN2.json","graph_json":"https://pith.science/api/pith-number/GOPDTI5EFEX36VISKCPEZJCSN2/graph.json","events_json":"https://pith.science/api/pith-number/GOPDTI5EFEX36VISKCPEZJCSN2/events.json","paper":"https://pith.science/paper/GOPDTI5E"},"agent_actions":{"view_html":"https://pith.science/pith/GOPDTI5EFEX36VISKCPEZJCSN2","download_json":"https://pith.science/pith/GOPDTI5EFEX36VISKCPEZJCSN2.json","view_paper":"https://pith.science/paper/GOPDTI5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.13184&json=true","fetch_graph":"https://pith.science/api/pith-number/GOPDTI5EFEX36VISKCPEZJCSN2/graph.json","fetch_events":"https://pith.science/api/pith-number/GOPDTI5EFEX36VISKCPEZJCSN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOPDTI5EFEX36VISKCPEZJCSN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOPDTI5EFEX36VISKCPEZJCSN2/action/storage_attestation","attest_author":"https://pith.science/pith/GOPDTI5EFEX36VISKCPEZJCSN2/action/author_attestation","sign_citation":"https://pith.science/pith/GOPDTI5EFEX36VISKCPEZJCSN2/action/citation_signature","submit_replication":"https://pith.science/pith/GOPDTI5EFEX36VISKCPEZJCSN2/action/replication_record"}},"created_at":"2026-07-05T08:19:38.550846+00:00","updated_at":"2026-07-05T08:19:38.550846+00:00"}