{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XE4OSSO35WQBQC77XY6VTH2Q6X","short_pith_number":"pith:XE4OSSO3","schema_version":"1.0","canonical_sha256":"b938e949dbeda0180bffbe3d599f50f5e61cb60aa0cfc4ebd5700d0aea13747e","source":{"kind":"arxiv","id":"2506.10525","version":1},"attestation_state":"computed","paper":{"title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Chengru Wu, Fang Liu, Junhang Cheng, Li Zhang","submitted_at":"2025-06-12T09:43:48Z","abstract_excerpt":"While Large Language Models (LLMs) have significantly advanced code generation efficiency, they face inherent challenges in balancing performance and inference costs across diverse programming tasks. Dynamically selecting the optimal LLM based on task difficulty and resource constraints offers a promising approach to achieve an optimal balance between efficiency and performance. However, existing model selection methods are resource-intensive and often neglect cost efficiency. Moreover, these approaches rely on human-annotated difficulty labels that are frequently inaccessible in real-world se"},"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":"2506.10525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2025-06-12T09:43:48Z","cross_cats_sorted":[],"title_canon_sha256":"d016bfb159aa7265312f9d6d8b89e8a7216f765d05dcfc8838270c2abfe30682","abstract_canon_sha256":"fc0e4d425ccb864bb27bc424ae6e2b7074146da1956182a7b6c7c2b624add660"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:25.460106Z","signature_b64":"iI/8ZgGNcBPKpBgWZ9qdZd4E901HLy0jWk7Nh82Zz1FX09076Avpt3aPuGIGhwyOfTu+yJdo9/HTZr+3P4NJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b938e949dbeda0180bffbe3d599f50f5e61cb60aa0cfc4ebd5700d0aea13747e","last_reissued_at":"2026-07-05T11:20:25.459478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:25.459478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AdaptiveLLM: A Framework for Selecting Optimal Cost-Efficient LLM for Code-Generation Based on CoT Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Chengru Wu, Fang Liu, Junhang Cheng, Li Zhang","submitted_at":"2025-06-12T09:43:48Z","abstract_excerpt":"While Large Language Models (LLMs) have significantly advanced code generation efficiency, they face inherent challenges in balancing performance and inference costs across diverse programming tasks. Dynamically selecting the optimal LLM based on task difficulty and resource constraints offers a promising approach to achieve an optimal balance between efficiency and performance. However, existing model selection methods are resource-intensive and often neglect cost efficiency. Moreover, these approaches rely on human-annotated difficulty labels that are frequently inaccessible in real-world se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10525","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/2506.10525/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":"2506.10525","created_at":"2026-07-05T11:20:25.459562+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.10525v1","created_at":"2026-07-05T11:20:25.459562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10525","created_at":"2026-07-05T11:20:25.459562+00:00"},{"alias_kind":"pith_short_12","alias_value":"XE4OSSO35WQB","created_at":"2026-07-05T11:20:25.459562+00:00"},{"alias_kind":"pith_short_16","alias_value":"XE4OSSO35WQBQC77","created_at":"2026-07-05T11:20:25.459562+00:00"},{"alias_kind":"pith_short_8","alias_value":"XE4OSSO3","created_at":"2026-07-05T11:20:25.459562+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.09567","citing_title":"Towards Reasoning Era: A Survey of Long Chain-of-Thought for Reasoning Large Language Models","ref_index":122,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XE4OSSO35WQBQC77XY6VTH2Q6X","json":"https://pith.science/pith/XE4OSSO35WQBQC77XY6VTH2Q6X.json","graph_json":"https://pith.science/api/pith-number/XE4OSSO35WQBQC77XY6VTH2Q6X/graph.json","events_json":"https://pith.science/api/pith-number/XE4OSSO35WQBQC77XY6VTH2Q6X/events.json","paper":"https://pith.science/paper/XE4OSSO3"},"agent_actions":{"view_html":"https://pith.science/pith/XE4OSSO35WQBQC77XY6VTH2Q6X","download_json":"https://pith.science/pith/XE4OSSO35WQBQC77XY6VTH2Q6X.json","view_paper":"https://pith.science/paper/XE4OSSO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.10525&json=true","fetch_graph":"https://pith.science/api/pith-number/XE4OSSO35WQBQC77XY6VTH2Q6X/graph.json","fetch_events":"https://pith.science/api/pith-number/XE4OSSO35WQBQC77XY6VTH2Q6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XE4OSSO35WQBQC77XY6VTH2Q6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XE4OSSO35WQBQC77XY6VTH2Q6X/action/storage_attestation","attest_author":"https://pith.science/pith/XE4OSSO35WQBQC77XY6VTH2Q6X/action/author_attestation","sign_citation":"https://pith.science/pith/XE4OSSO35WQBQC77XY6VTH2Q6X/action/citation_signature","submit_replication":"https://pith.science/pith/XE4OSSO35WQBQC77XY6VTH2Q6X/action/replication_record"}},"created_at":"2026-07-05T11:20:25.459562+00:00","updated_at":"2026-07-05T11:20:25.459562+00:00"}