{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MST6GACJXJ4CK72LPUKBYZNAF7","short_pith_number":"pith:MST6GACJ","schema_version":"1.0","canonical_sha256":"64a7e30049ba78257f4b7d141c65a02fdf01ba43152e977d7a478d51599cd825","source":{"kind":"arxiv","id":"2508.12981","version":1},"attestation_state":"computed","paper":{"title":"Analyzing Information Sharing and Coordination in Multi-Agent Planning","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Daniel Fried, Saujas Vaduguru, Tianyue Ou","submitted_at":"2025-08-18T14:57:02Z","abstract_excerpt":"Multi-agent systems (MASs) have pushed the boundaries of large language model (LLM) agents in domains such as web research and software engineering. However, long-horizon, multi-constraint planning tasks involve conditioning on detailed information and satisfying complex interdependent constraints, which can pose a challenge for these systems. In this study, we construct an LLM-based MAS for a travel planning task which is representative of these challenges. We evaluate the impact of a notebook to facilitate information sharing, and evaluate an orchestrator agent to improve coordination in fre"},"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":"2508.12981","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2025-08-18T14:57:02Z","cross_cats_sorted":[],"title_canon_sha256":"1b24ddba1f17a613fcb10ff49be340270f3f3c654ef378050e771bbc360cba71","abstract_canon_sha256":"39f36cf2cad0d72114acff1cb5086ddadbedf63188d8541fdd75a9f690fafc71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:30.297541Z","signature_b64":"CqwrVj+03hPnD9BhMwlZyWn2ANTIneVfJM9LnRw8y5jHCNEZnuHFyhr63jAd2lQML0ylQc1n+795xsr+/MpWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64a7e30049ba78257f4b7d141c65a02fdf01ba43152e977d7a478d51599cd825","last_reissued_at":"2026-07-05T11:55:30.297114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:30.297114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analyzing Information Sharing and Coordination in Multi-Agent Planning","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Daniel Fried, Saujas Vaduguru, Tianyue Ou","submitted_at":"2025-08-18T14:57:02Z","abstract_excerpt":"Multi-agent systems (MASs) have pushed the boundaries of large language model (LLM) agents in domains such as web research and software engineering. However, long-horizon, multi-constraint planning tasks involve conditioning on detailed information and satisfying complex interdependent constraints, which can pose a challenge for these systems. In this study, we construct an LLM-based MAS for a travel planning task which is representative of these challenges. We evaluate the impact of a notebook to facilitate information sharing, and evaluate an orchestrator agent to improve coordination in fre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.12981","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/2508.12981/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":"2508.12981","created_at":"2026-07-05T11:55:30.297170+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.12981v1","created_at":"2026-07-05T11:55:30.297170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.12981","created_at":"2026-07-05T11:55:30.297170+00:00"},{"alias_kind":"pith_short_12","alias_value":"MST6GACJXJ4C","created_at":"2026-07-05T11:55:30.297170+00:00"},{"alias_kind":"pith_short_16","alias_value":"MST6GACJXJ4CK72L","created_at":"2026-07-05T11:55:30.297170+00:00"},{"alias_kind":"pith_short_8","alias_value":"MST6GACJ","created_at":"2026-07-05T11:55:30.297170+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20695","citing_title":"How Much Coordination Gain Is Real? A Paired Noise-Floor Protocol for Multi-Agent LLM Benchmarks","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MST6GACJXJ4CK72LPUKBYZNAF7","json":"https://pith.science/pith/MST6GACJXJ4CK72LPUKBYZNAF7.json","graph_json":"https://pith.science/api/pith-number/MST6GACJXJ4CK72LPUKBYZNAF7/graph.json","events_json":"https://pith.science/api/pith-number/MST6GACJXJ4CK72LPUKBYZNAF7/events.json","paper":"https://pith.science/paper/MST6GACJ"},"agent_actions":{"view_html":"https://pith.science/pith/MST6GACJXJ4CK72LPUKBYZNAF7","download_json":"https://pith.science/pith/MST6GACJXJ4CK72LPUKBYZNAF7.json","view_paper":"https://pith.science/paper/MST6GACJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.12981&json=true","fetch_graph":"https://pith.science/api/pith-number/MST6GACJXJ4CK72LPUKBYZNAF7/graph.json","fetch_events":"https://pith.science/api/pith-number/MST6GACJXJ4CK72LPUKBYZNAF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MST6GACJXJ4CK72LPUKBYZNAF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MST6GACJXJ4CK72LPUKBYZNAF7/action/storage_attestation","attest_author":"https://pith.science/pith/MST6GACJXJ4CK72LPUKBYZNAF7/action/author_attestation","sign_citation":"https://pith.science/pith/MST6GACJXJ4CK72LPUKBYZNAF7/action/citation_signature","submit_replication":"https://pith.science/pith/MST6GACJXJ4CK72LPUKBYZNAF7/action/replication_record"}},"created_at":"2026-07-05T11:55:30.297170+00:00","updated_at":"2026-07-05T11:55:30.297170+00:00"}