{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:P3FLX3VJICVPCG5ZIFPIT25VXV","short_pith_number":"pith:P3FLX3VJ","schema_version":"1.0","canonical_sha256":"7ecabbeea940aaf11bb9415e89ebb5bd5716ccd5e9e07a6b4f20a3712b82647e","source":{"kind":"arxiv","id":"2409.02141","version":1},"attestation_state":"computed","paper":{"title":"Efficient and Scalable Estimation of Tool Representations in Vector Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Amir Gholami, Kurt Keutzer, Lutfi Eren Erdogan, Sehoon Kim, Siddharth Jha, Suhong Moon, Woosang Lim","submitted_at":"2024-09-02T19:39:24Z","abstract_excerpt":"Recent advancements in function calling and tool use have significantly enhanced the capabilities of large language models (LLMs) by enabling them to interact with external information sources and execute complex tasks. However, the limited context window of LLMs presents challenges when a large number of tools are available, necessitating efficient methods to manage prompt length and maintain accuracy. Existing approaches, such as fine-tuning LLMs or leveraging their reasoning capabilities, either require frequent retraining or incur significant latency overhead. A more efficient solution inv"},"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":"2409.02141","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-02T19:39:24Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"e27392f3a95c12c1ff810bd4596546cad1b720524280ae3f9662ea2d01616000","abstract_canon_sha256":"b5f1fee3e8fce8f8a54ad9fecb4d8956c88ac17f93891fd08d674b8944e2117f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:42.631382Z","signature_b64":"+uweaZiWDPFO/ckrRWdQcPx1yMBcl8Y3gvKeOCFoUw/6TgCCGiwLu1m5aD2O6Lq0/qF4IXa7+QRb9qT5fV0eDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ecabbeea940aaf11bb9415e89ebb5bd5716ccd5e9e07a6b4f20a3712b82647e","last_reissued_at":"2026-07-05T09:02:42.630853Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:42.630853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Scalable Estimation of Tool Representations in Vector Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Amir Gholami, Kurt Keutzer, Lutfi Eren Erdogan, Sehoon Kim, Siddharth Jha, Suhong Moon, Woosang Lim","submitted_at":"2024-09-02T19:39:24Z","abstract_excerpt":"Recent advancements in function calling and tool use have significantly enhanced the capabilities of large language models (LLMs) by enabling them to interact with external information sources and execute complex tasks. However, the limited context window of LLMs presents challenges when a large number of tools are available, necessitating efficient methods to manage prompt length and maintain accuracy. Existing approaches, such as fine-tuning LLMs or leveraging their reasoning capabilities, either require frequent retraining or incur significant latency overhead. A more efficient solution inv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02141","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/2409.02141/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":"2409.02141","created_at":"2026-07-05T09:02:42.630918+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.02141v1","created_at":"2026-07-05T09:02:42.630918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02141","created_at":"2026-07-05T09:02:42.630918+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3FLX3VJICVP","created_at":"2026-07-05T09:02:42.630918+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3FLX3VJICVPCG5Z","created_at":"2026-07-05T09:02:42.630918+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3FLX3VJ","created_at":"2026-07-05T09:02:42.630918+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17910","citing_title":"Non-negative Elastic Net Decoding for Information Retrieval","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02411","citing_title":"FitText: Evolving Agent Tool Ecologies via Memetic Retrieval","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15077","citing_title":"Concurrency without Model Changes: Future-based Asynchronous Function Calling for LLMs","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2503.09572","citing_title":"Plan-and-Act: Improving Planning of Agents for Long-Horizon Tasks","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02411","citing_title":"FitText: Evolving Agent Tool Ecologies via Memetic Retrieval","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P3FLX3VJICVPCG5ZIFPIT25VXV","json":"https://pith.science/pith/P3FLX3VJICVPCG5ZIFPIT25VXV.json","graph_json":"https://pith.science/api/pith-number/P3FLX3VJICVPCG5ZIFPIT25VXV/graph.json","events_json":"https://pith.science/api/pith-number/P3FLX3VJICVPCG5ZIFPIT25VXV/events.json","paper":"https://pith.science/paper/P3FLX3VJ"},"agent_actions":{"view_html":"https://pith.science/pith/P3FLX3VJICVPCG5ZIFPIT25VXV","download_json":"https://pith.science/pith/P3FLX3VJICVPCG5ZIFPIT25VXV.json","view_paper":"https://pith.science/paper/P3FLX3VJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.02141&json=true","fetch_graph":"https://pith.science/api/pith-number/P3FLX3VJICVPCG5ZIFPIT25VXV/graph.json","fetch_events":"https://pith.science/api/pith-number/P3FLX3VJICVPCG5ZIFPIT25VXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3FLX3VJICVPCG5ZIFPIT25VXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3FLX3VJICVPCG5ZIFPIT25VXV/action/storage_attestation","attest_author":"https://pith.science/pith/P3FLX3VJICVPCG5ZIFPIT25VXV/action/author_attestation","sign_citation":"https://pith.science/pith/P3FLX3VJICVPCG5ZIFPIT25VXV/action/citation_signature","submit_replication":"https://pith.science/pith/P3FLX3VJICVPCG5ZIFPIT25VXV/action/replication_record"}},"created_at":"2026-07-05T09:02:42.630918+00:00","updated_at":"2026-07-05T09:02:42.630918+00:00"}