{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IDIBSDMAT3IOMAK7LS3TPL3IZF","short_pith_number":"pith:IDIBSDMA","canonical_record":{"source":{"id":"2506.02951","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T14:46:00Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"15a79ded30a2cc797d0bf2446caec6f1f696c2cf7320c6e393d58a4e0feb9470","abstract_canon_sha256":"c3e247522aab8e50536b9e50e9d080cce2ed82985e4c852d404fc2bb5cd6cce4"},"schema_version":"1.0"},"canonical_sha256":"40d0190d809ed0e6015f5cb737af68c957d5e404e33ba0c01085f055a8f679af","source":{"kind":"arxiv","id":"2506.02951","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02951","created_at":"2026-07-05T11:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02951v3","created_at":"2026-07-05T11:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02951","created_at":"2026-07-05T11:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"IDIBSDMAT3IO","created_at":"2026-07-05T11:41:42Z"},{"alias_kind":"pith_short_16","alias_value":"IDIBSDMAT3IOMAK7","created_at":"2026-07-05T11:41:42Z"},{"alias_kind":"pith_short_8","alias_value":"IDIBSDMA","created_at":"2026-07-05T11:41:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IDIBSDMAT3IOMAK7LS3TPL3IZF","target":"record","payload":{"canonical_record":{"source":{"id":"2506.02951","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T14:46:00Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"15a79ded30a2cc797d0bf2446caec6f1f696c2cf7320c6e393d58a4e0feb9470","abstract_canon_sha256":"c3e247522aab8e50536b9e50e9d080cce2ed82985e4c852d404fc2bb5cd6cce4"},"schema_version":"1.0"},"canonical_sha256":"40d0190d809ed0e6015f5cb737af68c957d5e404e33ba0c01085f055a8f679af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:41:42.674364Z","signature_b64":"y7riHuW7LiMH0T/T3c4iyqew2tZVu0A7F1YqNFgPQc9iHmsQoj4XyUrpQ9tUXOav8nC70SFbHOxdESfjfbcZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40d0190d809ed0e6015f5cb737af68c957d5e404e33ba0c01085f055a8f679af","last_reissued_at":"2026-07-05T11:41:42.673878Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:41:42.673878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.02951","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aR7dvYP6nXqyshEGWsIIIO8SWxYm/DvwPqnjylxMmpLlvwEkAGnk24bt3Um+NE4YQnuUITKHysrmpU12OHKcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:28:31.936181Z"},"content_sha256":"ac1b50bccd6e8717b17343140c078a9895d5845d02aff91b3ce45593459eb35e","schema_version":"1.0","event_id":"sha256:ac1b50bccd6e8717b17343140c078a9895d5845d02aff91b3ce45593459eb35e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IDIBSDMAT3IOMAK7LS3TPL3IZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Graph Pruning for Multi-Agent Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.CL","authors_text":"Boyi Li, Der-Horng Lee, Gaoang Wang, Zhonghan Zhao","submitted_at":"2025-06-03T14:46:00Z","abstract_excerpt":"Large Language Model (LLM) based multi-agent systems have shown remarkable performance in various tasks, especially when enhanced through collaborative communication. However, current methods often rely on a fixed number of agents and static communication structures, limiting their ability to adapt to varying task complexities. In this paper, we propose Adaptive Graph Pruning (AGP), a novel task-adaptive multi-agent collaboration framework that jointly optimizes agent quantity (hard-pruning) and communication topology (soft-pruning). Specifically, our method employs a two-stage training strate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02951","kind":"arxiv","version":3},"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/2506.02951/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"euVzalJ/s9WokvnIBtX+etoDKGkkN4s7f+hk+7fnvH48RMOjoMTHgdmHpJzkV5D/HdWTyx5tGR1rNJvrDM7bBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:28:31.936675Z"},"content_sha256":"eece3729f90cee2050ac5cfe245381eebf26f125fca974411426acc300c9ca8c","schema_version":"1.0","event_id":"sha256:eece3729f90cee2050ac5cfe245381eebf26f125fca974411426acc300c9ca8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF/bundle.json","state_url":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T17:28:31Z","links":{"resolver":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF","bundle":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF/bundle.json","state":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IDIBSDMAT3IOMAK7LS3TPL3IZF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c3e247522aab8e50536b9e50e9d080cce2ed82985e4c852d404fc2bb5cd6cce4","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T14:46:00Z","title_canon_sha256":"15a79ded30a2cc797d0bf2446caec6f1f696c2cf7320c6e393d58a4e0feb9470"},"schema_version":"1.0","source":{"id":"2506.02951","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02951","created_at":"2026-07-05T11:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02951v3","created_at":"2026-07-05T11:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02951","created_at":"2026-07-05T11:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"IDIBSDMAT3IO","created_at":"2026-07-05T11:41:42Z"},{"alias_kind":"pith_short_16","alias_value":"IDIBSDMAT3IOMAK7","created_at":"2026-07-05T11:41:42Z"},{"alias_kind":"pith_short_8","alias_value":"IDIBSDMA","created_at":"2026-07-05T11:41:42Z"}],"graph_snapshots":[{"event_id":"sha256:eece3729f90cee2050ac5cfe245381eebf26f125fca974411426acc300c9ca8c","target":"graph","created_at":"2026-07-05T11:41:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.02951/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large Language Model (LLM) based multi-agent systems have shown remarkable performance in various tasks, especially when enhanced through collaborative communication. However, current methods often rely on a fixed number of agents and static communication structures, limiting their ability to adapt to varying task complexities. In this paper, we propose Adaptive Graph Pruning (AGP), a novel task-adaptive multi-agent collaboration framework that jointly optimizes agent quantity (hard-pruning) and communication topology (soft-pruning). Specifically, our method employs a two-stage training strate","authors_text":"Boyi Li, Der-Horng Lee, Gaoang Wang, Zhonghan Zhao","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T14:46:00Z","title":"Adaptive Graph Pruning for Multi-Agent Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02951","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ac1b50bccd6e8717b17343140c078a9895d5845d02aff91b3ce45593459eb35e","target":"record","created_at":"2026-07-05T11:41:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c3e247522aab8e50536b9e50e9d080cce2ed82985e4c852d404fc2bb5cd6cce4","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T14:46:00Z","title_canon_sha256":"15a79ded30a2cc797d0bf2446caec6f1f696c2cf7320c6e393d58a4e0feb9470"},"schema_version":"1.0","source":{"id":"2506.02951","kind":"arxiv","version":3}},"canonical_sha256":"40d0190d809ed0e6015f5cb737af68c957d5e404e33ba0c01085f055a8f679af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40d0190d809ed0e6015f5cb737af68c957d5e404e33ba0c01085f055a8f679af","first_computed_at":"2026-07-05T11:41:42.673878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:41:42.673878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y7riHuW7LiMH0T/T3c4iyqew2tZVu0A7F1YqNFgPQc9iHmsQoj4XyUrpQ9tUXOav8nC70SFbHOxdESfjfbcZAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:41:42.674364Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.02951","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac1b50bccd6e8717b17343140c078a9895d5845d02aff91b3ce45593459eb35e","sha256:eece3729f90cee2050ac5cfe245381eebf26f125fca974411426acc300c9ca8c"],"state_sha256":"1a853d5d9c4bc985d710f711b61fe0aeb1e7c5459aaf24bbeea28dbad7753c38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wd+QUFHS6+7NNFXjdooMKL0OmPawUfLZoeqiz+ZOfQDsGdvfapwgIXW8bApfc3sT3/c+/RpNVs8o5f3rMO/sCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T17:28:31.940667Z","bundle_sha256":"8e28d549a2b595b3ee3c0cc51527ea1c58742aefe9db9ecbf3ac5b9f288647b6"}}