{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HYAXQPJFS5MAETUPC66HBEVWY4","short_pith_number":"pith:HYAXQPJF","schema_version":"1.0","canonical_sha256":"3e01783d259758024e8f17bc7092b6c707d5d0920ce89352ac36de6f53b20ed9","source":{"kind":"arxiv","id":"2505.24239","version":1},"attestation_state":"computed","paper":{"title":"An Adversary-Resistant Multi-Agent LLM System via Credibility Scoring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.MA","authors_text":"Abolfazl Asudeh, Mohsen Dehghankar, Sana Ebrahimi","submitted_at":"2025-05-30T05:57:37Z","abstract_excerpt":"While multi-agent LLM systems show strong capabilities in various domains, they are highly vulnerable to adversarial and low-performing agents. To resolve this issue, in this paper, we introduce a general and adversary-resistant multi-agent LLM framework based on credibility scoring. We model the collaborative query-answering process as an iterative game, where the agents communicate and contribute to a final system output. Our system associates a credibility score that is used when aggregating the team outputs. The credibility scores are learned gradually based on the past contributions of ea"},"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":"2505.24239","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-05-30T05:57:37Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"fb7d67672190c97b2eb68147a24770f42c9b793701469bc310ee7f3775e79aef","abstract_canon_sha256":"42fa9a77c1317a169141b420b6ab2ffa3f282f61326a894649cc51bb888b1029"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:44.808678Z","signature_b64":"a7mn0wn82qyRnXiuJgoQ/0Rtl2EP1coCr5kE8pXJxP/61zCdR/OdBd1CbJ8iXOZ8qafQcy4kbCGc6fWetvezAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e01783d259758024e8f17bc7092b6c707d5d0920ce89352ac36de6f53b20ed9","last_reissued_at":"2026-07-05T11:12:44.808138Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:44.808138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Adversary-Resistant Multi-Agent LLM System via Credibility Scoring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.MA","authors_text":"Abolfazl Asudeh, Mohsen Dehghankar, Sana Ebrahimi","submitted_at":"2025-05-30T05:57:37Z","abstract_excerpt":"While multi-agent LLM systems show strong capabilities in various domains, they are highly vulnerable to adversarial and low-performing agents. To resolve this issue, in this paper, we introduce a general and adversary-resistant multi-agent LLM framework based on credibility scoring. We model the collaborative query-answering process as an iterative game, where the agents communicate and contribute to a final system output. Our system associates a credibility score that is used when aggregating the team outputs. The credibility scores are learned gradually based on the past contributions of ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24239","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/2505.24239/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":"2505.24239","created_at":"2026-07-05T11:12:44.808206+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24239v1","created_at":"2026-07-05T11:12:44.808206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24239","created_at":"2026-07-05T11:12:44.808206+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYAXQPJFS5MA","created_at":"2026-07-05T11:12:44.808206+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYAXQPJFS5MAETUP","created_at":"2026-07-05T11:12:44.808206+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYAXQPJF","created_at":"2026-07-05T11:12:44.808206+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03034","citing_title":"Capability Advertisement as a Market for Lemons: A Trust Layer for Heterogeneous Agent Networks","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15573","citing_title":"Response-Conditioned Parallel-to-Sequential Orchestration for Multi-Agent Systems","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HYAXQPJFS5MAETUPC66HBEVWY4","json":"https://pith.science/pith/HYAXQPJFS5MAETUPC66HBEVWY4.json","graph_json":"https://pith.science/api/pith-number/HYAXQPJFS5MAETUPC66HBEVWY4/graph.json","events_json":"https://pith.science/api/pith-number/HYAXQPJFS5MAETUPC66HBEVWY4/events.json","paper":"https://pith.science/paper/HYAXQPJF"},"agent_actions":{"view_html":"https://pith.science/pith/HYAXQPJFS5MAETUPC66HBEVWY4","download_json":"https://pith.science/pith/HYAXQPJFS5MAETUPC66HBEVWY4.json","view_paper":"https://pith.science/paper/HYAXQPJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24239&json=true","fetch_graph":"https://pith.science/api/pith-number/HYAXQPJFS5MAETUPC66HBEVWY4/graph.json","fetch_events":"https://pith.science/api/pith-number/HYAXQPJFS5MAETUPC66HBEVWY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYAXQPJFS5MAETUPC66HBEVWY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYAXQPJFS5MAETUPC66HBEVWY4/action/storage_attestation","attest_author":"https://pith.science/pith/HYAXQPJFS5MAETUPC66HBEVWY4/action/author_attestation","sign_citation":"https://pith.science/pith/HYAXQPJFS5MAETUPC66HBEVWY4/action/citation_signature","submit_replication":"https://pith.science/pith/HYAXQPJFS5MAETUPC66HBEVWY4/action/replication_record"}},"created_at":"2026-07-05T11:12:44.808206+00:00","updated_at":"2026-07-05T11:12:44.808206+00:00"}