{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TUDUROAJ4VEU3U3ITQPQZUHN5S","short_pith_number":"pith:TUDUROAJ","schema_version":"1.0","canonical_sha256":"9d0748b809e5494dd3689c1f0cd0edeca5c9330ee9685ea05d41724a0cd58907","source":{"kind":"arxiv","id":"2603.02630","version":2},"attestation_state":"computed","paper":{"title":"MASPOB: Bandit-Based Prompt Optimization for Multi-Agent Systems with Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiahang Sun, Mingze Kong, Qian Zhang, Xiangyi Wang, Yao Shu, Zhi Hong, Zhiwei Shang, Zhongxiang Dai","submitted_at":"2026-03-03T05:59:05Z","abstract_excerpt":"Large Language Models (LLMs) have achieved great success in many real-world applications, especially the one serving as the cognitive backbone of Multi-Agent Systems (MAS) to orchestrate complex workflows in practice. Since many deployment scenarios preclude MAS workflow modifications and its performance is highly sensitive to the input prompts, prompt optimization emerges as a more natural approach to improve its performance. However, real-world prompt optimization for MAS is impeded by three key challenges: (1) the need of sample efficiency due to prohibitive evaluation costs, (2) topology-i"},"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":"2603.02630","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-03-03T05:59:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"33075993b06218955075d340e70c535cea91ed45821cf60cd4f365c29d288834","abstract_canon_sha256":"de1817bb159849081fca52401918fd9a1134b89c26b2cffe8ceba3226e90e88a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:03:36.118973Z","signature_b64":"0QqkASJ7XYQsC4vnfoFKkUZ9XubYIHOAMKaFZpYm6qiydxCEK8ENyT2gIR4JII6cKnoKRJRg8z2LqiQdjOg/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d0748b809e5494dd3689c1f0cd0edeca5c9330ee9685ea05d41724a0cd58907","last_reissued_at":"2026-06-01T02:03:36.118033Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:03:36.118033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MASPOB: Bandit-Based Prompt Optimization for Multi-Agent Systems with Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiahang Sun, Mingze Kong, Qian Zhang, Xiangyi Wang, Yao Shu, Zhi Hong, Zhiwei Shang, Zhongxiang Dai","submitted_at":"2026-03-03T05:59:05Z","abstract_excerpt":"Large Language Models (LLMs) have achieved great success in many real-world applications, especially the one serving as the cognitive backbone of Multi-Agent Systems (MAS) to orchestrate complex workflows in practice. Since many deployment scenarios preclude MAS workflow modifications and its performance is highly sensitive to the input prompts, prompt optimization emerges as a more natural approach to improve its performance. However, real-world prompt optimization for MAS is impeded by three key challenges: (1) the need of sample efficiency due to prohibitive evaluation costs, (2) topology-i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.02630","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/2603.02630/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":"2603.02630","created_at":"2026-06-01T02:03:36.118165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.02630v2","created_at":"2026-06-01T02:03:36.118165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.02630","created_at":"2026-06-01T02:03:36.118165+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUDUROAJ4VEU","created_at":"2026-06-01T02:03:36.118165+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUDUROAJ4VEU3U3I","created_at":"2026-06-01T02:03:36.118165+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUDUROAJ","created_at":"2026-06-01T02:03:36.118165+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.08468","citing_title":"PYTHALAB-MERA: Validation-Grounded Memory, Retrieval, and Acceptance Control for Frozen-LLM Coding Agents","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TUDUROAJ4VEU3U3ITQPQZUHN5S","json":"https://pith.science/pith/TUDUROAJ4VEU3U3ITQPQZUHN5S.json","graph_json":"https://pith.science/api/pith-number/TUDUROAJ4VEU3U3ITQPQZUHN5S/graph.json","events_json":"https://pith.science/api/pith-number/TUDUROAJ4VEU3U3ITQPQZUHN5S/events.json","paper":"https://pith.science/paper/TUDUROAJ"},"agent_actions":{"view_html":"https://pith.science/pith/TUDUROAJ4VEU3U3ITQPQZUHN5S","download_json":"https://pith.science/pith/TUDUROAJ4VEU3U3ITQPQZUHN5S.json","view_paper":"https://pith.science/paper/TUDUROAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.02630&json=true","fetch_graph":"https://pith.science/api/pith-number/TUDUROAJ4VEU3U3ITQPQZUHN5S/graph.json","fetch_events":"https://pith.science/api/pith-number/TUDUROAJ4VEU3U3ITQPQZUHN5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUDUROAJ4VEU3U3ITQPQZUHN5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUDUROAJ4VEU3U3ITQPQZUHN5S/action/storage_attestation","attest_author":"https://pith.science/pith/TUDUROAJ4VEU3U3ITQPQZUHN5S/action/author_attestation","sign_citation":"https://pith.science/pith/TUDUROAJ4VEU3U3ITQPQZUHN5S/action/citation_signature","submit_replication":"https://pith.science/pith/TUDUROAJ4VEU3U3ITQPQZUHN5S/action/replication_record"}},"created_at":"2026-06-01T02:03:36.118165+00:00","updated_at":"2026-06-01T02:03:36.118165+00:00"}