{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HMKEVTEDWPG37YIGB4RSOLFHWF","short_pith_number":"pith:HMKEVTED","schema_version":"1.0","canonical_sha256":"3b144acc83b3cdbfe1060f23272ca7b14581a128a120e24d9e744fb23a7d3cc4","source":{"kind":"arxiv","id":"2312.04511","version":3},"attestation_state":"computed","paper":{"title":"An LLM Compiler for Parallel Function Calling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Amir Gholami, Kurt Keutzer, Michael W. Mahoney, Nicholas Lee, Ryan Tabrizi, Sehoon Kim, Suhong Moon","submitted_at":"2023-12-07T18:32:04Z","abstract_excerpt":"The reasoning capabilities of the recent LLMs enable them to execute external function calls to overcome their inherent limitations, such as knowledge cutoffs, poor arithmetic skills, or lack of access to private data. This development has allowed LLMs to select and coordinate multiple functions based on the context to tackle more complex problems. However, current methods for function calling often require sequential reasoning and acting for each function which can result in high latency, cost, and sometimes inaccurate behavior. To address this, we introduce LLMCompiler, which executes functi"},"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.04511","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-12-07T18:32:04Z","cross_cats_sorted":[],"title_canon_sha256":"965870d9d0328d0e7d852d4fa32aae8cbe6326e086c59ff113675594970e876f","abstract_canon_sha256":"598a239471a2e31a81224cf7a6abc974b0a282e6f7c9ce8e902bb6a5faeb2a85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:23.988122Z","signature_b64":"USqTvQIIUqFEywpYB3eqFZ/dz2ncK3ss9sSb2qoATSUnmZhbUJeV6wu1YZVBHB5em7T+T4SHDMC3G77AJJSbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b144acc83b3cdbfe1060f23272ca7b14581a128a120e24d9e744fb23a7d3cc4","last_reissued_at":"2026-07-05T08:27:23.987642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:23.987642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An LLM Compiler for Parallel Function Calling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Amir Gholami, Kurt Keutzer, Michael W. Mahoney, Nicholas Lee, Ryan Tabrizi, Sehoon Kim, Suhong Moon","submitted_at":"2023-12-07T18:32:04Z","abstract_excerpt":"The reasoning capabilities of the recent LLMs enable them to execute external function calls to overcome their inherent limitations, such as knowledge cutoffs, poor arithmetic skills, or lack of access to private data. This development has allowed LLMs to select and coordinate multiple functions based on the context to tackle more complex problems. However, current methods for function calling often require sequential reasoning and acting for each function which can result in high latency, cost, and sometimes inaccurate behavior. To address this, we introduce LLMCompiler, which executes functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.04511","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.04511/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.04511","created_at":"2026-07-05T08:27:23.987700+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.04511v3","created_at":"2026-07-05T08:27:23.987700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.04511","created_at":"2026-07-05T08:27:23.987700+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMKEVTEDWPG3","created_at":"2026-07-05T08:27:23.987700+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMKEVTEDWPG37YIG","created_at":"2026-07-05T08:27:23.987700+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMKEVTED","created_at":"2026-07-05T08:27:23.987700+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13643","citing_title":"Recursive Agent Harnesses","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06820","citing_title":"SCALE: Scalable Cross-Attention Learning with Extrapolation for Agentic Workflow Scheduling","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01803","citing_title":"OctoT2I: A Self-Evolving Agentic Text-to-Image Router","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03353","citing_title":"SkCC: Portable and Secure Skill Compilation for Cross-Framework LLM Agents","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2511.00413","citing_title":"Tree Training: Accelerating Agentic LLMs Training via Shared Prefix Reuse","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2503.09572","citing_title":"Plan-and-Act: Improving Planning of Agents for Long-Horizon Tasks","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08580","citing_title":"Slipstream: Trajectory-Grounded Compaction Validation for Long-Horizon Agents","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2312.07104","citing_title":"SGLang: Efficient Execution of Structured Language Model Programs","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03353","citing_title":"SkCC: Portable and Secure Skill Compilation for Cross-Framework LLM Agents","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13092","citing_title":"PlanCompiler: A Deterministic Compilation Architecture for Structured Multi-Step LLM Pipelines","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13092","citing_title":"PlanCompiler: A Deterministic Compilation Architecture for Structured Multi-Step LLM Pipelines","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HMKEVTEDWPG37YIGB4RSOLFHWF","json":"https://pith.science/pith/HMKEVTEDWPG37YIGB4RSOLFHWF.json","graph_json":"https://pith.science/api/pith-number/HMKEVTEDWPG37YIGB4RSOLFHWF/graph.json","events_json":"https://pith.science/api/pith-number/HMKEVTEDWPG37YIGB4RSOLFHWF/events.json","paper":"https://pith.science/paper/HMKEVTED"},"agent_actions":{"view_html":"https://pith.science/pith/HMKEVTEDWPG37YIGB4RSOLFHWF","download_json":"https://pith.science/pith/HMKEVTEDWPG37YIGB4RSOLFHWF.json","view_paper":"https://pith.science/paper/HMKEVTED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.04511&json=true","fetch_graph":"https://pith.science/api/pith-number/HMKEVTEDWPG37YIGB4RSOLFHWF/graph.json","fetch_events":"https://pith.science/api/pith-number/HMKEVTEDWPG37YIGB4RSOLFHWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMKEVTEDWPG37YIGB4RSOLFHWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMKEVTEDWPG37YIGB4RSOLFHWF/action/storage_attestation","attest_author":"https://pith.science/pith/HMKEVTEDWPG37YIGB4RSOLFHWF/action/author_attestation","sign_citation":"https://pith.science/pith/HMKEVTEDWPG37YIGB4RSOLFHWF/action/citation_signature","submit_replication":"https://pith.science/pith/HMKEVTEDWPG37YIGB4RSOLFHWF/action/replication_record"}},"created_at":"2026-07-05T08:27:23.987700+00:00","updated_at":"2026-07-05T08:27:23.987700+00:00"}