{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JJNNIRXKSPKCRT7EYDHQ7NFM46","short_pith_number":"pith:JJNNIRXK","schema_version":"1.0","canonical_sha256":"4a5ad446ea93d428cfe4c0cf0fb4ace79eb79644a71a9bd7d3cf719b5a480f33","source":{"kind":"arxiv","id":"2402.16713","version":2},"attestation_state":"computed","paper":{"title":"Navigating Complexity: Orchestrated Problem Solving with Multi-Agent LLMs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"E. J. Hauer, Sumedh Rasal","submitted_at":"2024-02-26T16:31:01Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated remarkable capabilities in solving various tasks, yet they often struggle with comprehensively addressing complex and vague problems. Existing approaches, including multi-agent LLM systems, offer solutions to certain challenges but still require manual setup and lack scalability. To address this gap, we propose a novel approach leveraging decomposition to enable LLMs to tackle vague problems effectively.\n  Our approach involves an orchestrating LLM that interacts with users to understand the problem and then decomposes it into tangible sub-problem"},"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":"2402.16713","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.MA","submitted_at":"2024-02-26T16:31:01Z","cross_cats_sorted":[],"title_canon_sha256":"38efe5e63271d83592a28da912147ac40c97fd70a5d5fd62f7eecfd98b7ae0d1","abstract_canon_sha256":"47fcf1b065d0ddebd675c193f707ef1864bae909dc6e666a6778ca839787a157"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:02.167229Z","signature_b64":"utH3FgaYE3dKbMQ97tjXeul8PXq0IlcqfmHV5rQJtAsgJRuZpcMJ44Uezvi530wcXj3q/K+0Wb5ltUg/ZxVFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a5ad446ea93d428cfe4c0cf0fb4ace79eb79644a71a9bd7d3cf719b5a480f33","last_reissued_at":"2026-07-05T08:42:02.166743Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:02.166743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Navigating Complexity: Orchestrated Problem Solving with Multi-Agent LLMs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"E. J. Hauer, Sumedh Rasal","submitted_at":"2024-02-26T16:31:01Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated remarkable capabilities in solving various tasks, yet they often struggle with comprehensively addressing complex and vague problems. Existing approaches, including multi-agent LLM systems, offer solutions to certain challenges but still require manual setup and lack scalability. To address this gap, we propose a novel approach leveraging decomposition to enable LLMs to tackle vague problems effectively.\n  Our approach involves an orchestrating LLM that interacts with users to understand the problem and then decomposes it into tangible sub-problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.16713","kind":"arxiv","version":2},"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/2402.16713/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":"2402.16713","created_at":"2026-07-05T08:42:02.166800+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.16713v2","created_at":"2026-07-05T08:42:02.166800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.16713","created_at":"2026-07-05T08:42:02.166800+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJNNIRXKSPKC","created_at":"2026-07-05T08:42:02.166800+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJNNIRXKSPKCRT7E","created_at":"2026-07-05T08:42:02.166800+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJNNIRXK","created_at":"2026-07-05T08:42:02.166800+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.20791","citing_title":"From Cool Demos to Production-Ready FMware: Core Challenges and a Technology Roadmap","ref_index":85,"is_internal_anchor":false},{"citing_arxiv_id":"2509.11295","citing_title":"The Prompt Engineering Report Distilled: Quick Start Guide for Life Sciences","ref_index":102,"is_internal_anchor":false},{"citing_arxiv_id":"2509.11295","citing_title":"The Prompt Engineering Report Distilled: Quick Start Guide for Life Sciences","ref_index":103,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08686","citing_title":"Iterative Critique-and-Routing Controller for Multi-Agent Systems with Heterogeneous LLMs","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJNNIRXKSPKCRT7EYDHQ7NFM46","json":"https://pith.science/pith/JJNNIRXKSPKCRT7EYDHQ7NFM46.json","graph_json":"https://pith.science/api/pith-number/JJNNIRXKSPKCRT7EYDHQ7NFM46/graph.json","events_json":"https://pith.science/api/pith-number/JJNNIRXKSPKCRT7EYDHQ7NFM46/events.json","paper":"https://pith.science/paper/JJNNIRXK"},"agent_actions":{"view_html":"https://pith.science/pith/JJNNIRXKSPKCRT7EYDHQ7NFM46","download_json":"https://pith.science/pith/JJNNIRXKSPKCRT7EYDHQ7NFM46.json","view_paper":"https://pith.science/paper/JJNNIRXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.16713&json=true","fetch_graph":"https://pith.science/api/pith-number/JJNNIRXKSPKCRT7EYDHQ7NFM46/graph.json","fetch_events":"https://pith.science/api/pith-number/JJNNIRXKSPKCRT7EYDHQ7NFM46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJNNIRXKSPKCRT7EYDHQ7NFM46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJNNIRXKSPKCRT7EYDHQ7NFM46/action/storage_attestation","attest_author":"https://pith.science/pith/JJNNIRXKSPKCRT7EYDHQ7NFM46/action/author_attestation","sign_citation":"https://pith.science/pith/JJNNIRXKSPKCRT7EYDHQ7NFM46/action/citation_signature","submit_replication":"https://pith.science/pith/JJNNIRXKSPKCRT7EYDHQ7NFM46/action/replication_record"}},"created_at":"2026-07-05T08:42:02.166800+00:00","updated_at":"2026-07-05T08:42:02.166800+00:00"}