{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UKUPJ6NKSYP5QGNMGE4MYIW4HR","short_pith_number":"pith:UKUPJ6NK","schema_version":"1.0","canonical_sha256":"a2a8f4f9aa961fd819ac3138cc22dc3c6d34ed6329728ef79238dd7e7e5b92b0","source":{"kind":"arxiv","id":"2312.11511","version":3},"attestation_state":"computed","paper":{"title":"ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Aghyad Deeb, Alex Fleury, Henry Bae, Kehang Zhu","submitted_at":"2023-12-12T05:38:55Z","abstract_excerpt":"We present ComplexityNet, a streamlined language model designed for assessing task complexity. This model predicts the likelihood of accurate output by various language models, each with different capabilities. Our initial application of ComplexityNet involves the Mostly Basic Python Problems (MBPP) dataset. We pioneered the creation of the first set of labels to define task complexity. ComplexityNet achieved a notable 79% accuracy in determining task complexity, a significant improvement over the 34% accuracy of the original, non fine-tuned model. Furthermore, ComplexityNet effectively reduce"},"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":"2312.11511","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-12-12T05:38:55Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"0b31cedb91b05b83a6ad7d90f5c06f45649400a80c0415983d468c561e4d873b","abstract_canon_sha256":"65965acb033bf3a70c84280d732c67dc891534e263e4c9ce1ed0cc0fead2c45b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:22.267700Z","signature_b64":"rVSTBnTUGXaiZPALo2x6oywEU5cVcb9AzdKdrGav7S3x+osg3RZJlbpo4mHcAoTkPUJIDDu66AzfFdbM0YsTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a8f4f9aa961fd819ac3138cc22dc3c6d34ed6329728ef79238dd7e7e5b92b0","last_reissued_at":"2026-07-05T09:20:22.267214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:22.267214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ComplexityNet: Increasing LLM Inference Efficiency by Learning Task Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Aghyad Deeb, Alex Fleury, Henry Bae, Kehang Zhu","submitted_at":"2023-12-12T05:38:55Z","abstract_excerpt":"We present ComplexityNet, a streamlined language model designed for assessing task complexity. This model predicts the likelihood of accurate output by various language models, each with different capabilities. Our initial application of ComplexityNet involves the Mostly Basic Python Problems (MBPP) dataset. We pioneered the creation of the first set of labels to define task complexity. ComplexityNet achieved a notable 79% accuracy in determining task complexity, a significant improvement over the 34% accuracy of the original, non fine-tuned model. Furthermore, ComplexityNet effectively reduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.11511","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/2312.11511/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":"2312.11511","created_at":"2026-07-05T09:20:22.267271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.11511v3","created_at":"2026-07-05T09:20:22.267271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.11511","created_at":"2026-07-05T09:20:22.267271+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKUPJ6NKSYP5","created_at":"2026-07-05T09:20:22.267271+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKUPJ6NKSYP5QGNM","created_at":"2026-07-05T09:20:22.267271+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKUPJ6NK","created_at":"2026-07-05T09:20:22.267271+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24734","citing_title":"Task Decomposition for Efficient Annotation","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UKUPJ6NKSYP5QGNMGE4MYIW4HR","json":"https://pith.science/pith/UKUPJ6NKSYP5QGNMGE4MYIW4HR.json","graph_json":"https://pith.science/api/pith-number/UKUPJ6NKSYP5QGNMGE4MYIW4HR/graph.json","events_json":"https://pith.science/api/pith-number/UKUPJ6NKSYP5QGNMGE4MYIW4HR/events.json","paper":"https://pith.science/paper/UKUPJ6NK"},"agent_actions":{"view_html":"https://pith.science/pith/UKUPJ6NKSYP5QGNMGE4MYIW4HR","download_json":"https://pith.science/pith/UKUPJ6NKSYP5QGNMGE4MYIW4HR.json","view_paper":"https://pith.science/paper/UKUPJ6NK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.11511&json=true","fetch_graph":"https://pith.science/api/pith-number/UKUPJ6NKSYP5QGNMGE4MYIW4HR/graph.json","fetch_events":"https://pith.science/api/pith-number/UKUPJ6NKSYP5QGNMGE4MYIW4HR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKUPJ6NKSYP5QGNMGE4MYIW4HR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKUPJ6NKSYP5QGNMGE4MYIW4HR/action/storage_attestation","attest_author":"https://pith.science/pith/UKUPJ6NKSYP5QGNMGE4MYIW4HR/action/author_attestation","sign_citation":"https://pith.science/pith/UKUPJ6NKSYP5QGNMGE4MYIW4HR/action/citation_signature","submit_replication":"https://pith.science/pith/UKUPJ6NKSYP5QGNMGE4MYIW4HR/action/replication_record"}},"created_at":"2026-07-05T09:20:22.267271+00:00","updated_at":"2026-07-05T09:20:22.267271+00:00"}