{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IGJZWRARWBJZ7RG24EZQQFUEJ4","short_pith_number":"pith:IGJZWRAR","schema_version":"1.0","canonical_sha256":"41939b4411b0539fc4dae1330816844f045048a538a895c0f7d9640b41aa279b","source":{"kind":"arxiv","id":"2510.19420","version":2},"attestation_state":"computed","paper":{"title":"Securing Multi-Agent Systems Against Corruptions via Node Contribution Backpropagation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.MA","math.OC"],"primary_cat":"cs.CR","authors_text":"Chengcan Wu, Meng Sun, Mingqian Xu, Zeming Wei, Zhixin Zhang","submitted_at":"2025-10-22T09:43:32Z","abstract_excerpt":"Multi-Agent Systems (MAS) have become a prevalent paradigm for Large Language Model (LLM) applications. However, the complex multi-agent design in MAS introduces unique trustworthiness concerns: adversarial agents can inject misleading information that propagates contagiously through the system, corrupting benign agents and leading to false outputs. Existing graph-based defenses model agents as nodes and communications as edges, yet are limited to static-graph defenses. In this paper, we propose a dynamic defense paradigm that models MAS communication as a signed directed acyclic graph and com"},"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":"2510.19420","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-10-22T09:43:32Z","cross_cats_sorted":["cs.AI","cs.LG","cs.MA","math.OC"],"title_canon_sha256":"b7de4adaf9209262f6acc9b7e0a6820cfa695fec87d9ec2ff1d85d0e7c4a3356","abstract_canon_sha256":"243a27febc894d6970df4349935ba5bf36b672f0726f6448214242b2b5d92b4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T02:05:07.188047Z","signature_b64":"FKF0o3ykiv5KHZBeI6cGfGtbgN6ZdDv1IJHsWQelgjA6xs0IdsFBiMgckd/zW4Rm7SsSuMbtQ6L/KyJavGEmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41939b4411b0539fc4dae1330816844f045048a538a895c0f7d9640b41aa279b","last_reissued_at":"2026-05-27T02:05:07.187180Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T02:05:07.187180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Securing Multi-Agent Systems Against Corruptions via Node Contribution Backpropagation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.MA","math.OC"],"primary_cat":"cs.CR","authors_text":"Chengcan Wu, Meng Sun, Mingqian Xu, Zeming Wei, Zhixin Zhang","submitted_at":"2025-10-22T09:43:32Z","abstract_excerpt":"Multi-Agent Systems (MAS) have become a prevalent paradigm for Large Language Model (LLM) applications. However, the complex multi-agent design in MAS introduces unique trustworthiness concerns: adversarial agents can inject misleading information that propagates contagiously through the system, corrupting benign agents and leading to false outputs. Existing graph-based defenses model agents as nodes and communications as edges, yet are limited to static-graph defenses. In this paper, we propose a dynamic defense paradigm that models MAS communication as a signed directed acyclic graph and com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.19420","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/2510.19420/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":"2510.19420","created_at":"2026-05-27T02:05:07.187309+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.19420v2","created_at":"2026-05-27T02:05:07.187309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.19420","created_at":"2026-05-27T02:05:07.187309+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGJZWRARWBJZ","created_at":"2026-05-27T02:05:07.187309+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGJZWRARWBJZ7RG2","created_at":"2026-05-27T02:05:07.187309+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGJZWRAR","created_at":"2026-05-27T02:05:07.187309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGJZWRARWBJZ7RG24EZQQFUEJ4","json":"https://pith.science/pith/IGJZWRARWBJZ7RG24EZQQFUEJ4.json","graph_json":"https://pith.science/api/pith-number/IGJZWRARWBJZ7RG24EZQQFUEJ4/graph.json","events_json":"https://pith.science/api/pith-number/IGJZWRARWBJZ7RG24EZQQFUEJ4/events.json","paper":"https://pith.science/paper/IGJZWRAR"},"agent_actions":{"view_html":"https://pith.science/pith/IGJZWRARWBJZ7RG24EZQQFUEJ4","download_json":"https://pith.science/pith/IGJZWRARWBJZ7RG24EZQQFUEJ4.json","view_paper":"https://pith.science/paper/IGJZWRAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.19420&json=true","fetch_graph":"https://pith.science/api/pith-number/IGJZWRARWBJZ7RG24EZQQFUEJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/IGJZWRARWBJZ7RG24EZQQFUEJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGJZWRARWBJZ7RG24EZQQFUEJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGJZWRARWBJZ7RG24EZQQFUEJ4/action/storage_attestation","attest_author":"https://pith.science/pith/IGJZWRARWBJZ7RG24EZQQFUEJ4/action/author_attestation","sign_citation":"https://pith.science/pith/IGJZWRARWBJZ7RG24EZQQFUEJ4/action/citation_signature","submit_replication":"https://pith.science/pith/IGJZWRARWBJZ7RG24EZQQFUEJ4/action/replication_record"}},"created_at":"2026-05-27T02:05:07.187309+00:00","updated_at":"2026-05-27T02:05:07.187309+00:00"}