{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WZRYOMZYVHXUHQ2YRXF52FLKYS","short_pith_number":"pith:WZRYOMZY","schema_version":"1.0","canonical_sha256":"b663873338a9ef43c3588dcbdd156ac49fb71df4d065a70d5fa9d9bcf3cab891","source":{"kind":"arxiv","id":"2506.07398","version":2},"attestation_state":"computed","paper":{"title":"G-Memory: Tracing Hierarchical Memory for Multi-Agent Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.MA","authors_text":"Guancheng Wan, Guibin Zhang, Kun Wang, Miao Yu, Muxin Fu, Shuicheng Yan","submitted_at":"2025-06-09T03:43:46Z","abstract_excerpt":"Large language model (LLM)-powered multi-agent systems (MAS) have demonstrated cognitive and execution capabilities that far exceed those of single LLM agents, yet their capacity for self-evolution remains hampered by underdeveloped memory architectures. Upon close inspection, we are alarmed to discover that prevailing MAS memory mechanisms (1) are overly simplistic, completely disregarding the nuanced inter-agent collaboration trajectories, and (2) lack cross-trial and agent-specific customization, in stark contrast to the expressive memory developed for single agents. To bridge this gap, we "},"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":"2506.07398","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-06-09T03:43:46Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"fec2dd9b21f630cfe3a18edeb50c96bb2680835337bde32f5762ac37d3c661f5","abstract_canon_sha256":"10cc826a7dc12997306b369482063ea84d6dab66f19df80a070ea2c655839bc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:48.577651Z","signature_b64":"aDlHmN/w07MkxhQ8hA33Y17gHvRn4yAnfMbFTHvmYSBpEJgtj0FNXR/VUUxhijRJltwbkP8jCk6+p3zpKGYOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b663873338a9ef43c3588dcbdd156ac49fb71df4d065a70d5fa9d9bcf3cab891","last_reissued_at":"2026-07-05T11:21:48.577154Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:48.577154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"G-Memory: Tracing Hierarchical Memory for Multi-Agent Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.MA","authors_text":"Guancheng Wan, Guibin Zhang, Kun Wang, Miao Yu, Muxin Fu, Shuicheng Yan","submitted_at":"2025-06-09T03:43:46Z","abstract_excerpt":"Large language model (LLM)-powered multi-agent systems (MAS) have demonstrated cognitive and execution capabilities that far exceed those of single LLM agents, yet their capacity for self-evolution remains hampered by underdeveloped memory architectures. Upon close inspection, we are alarmed to discover that prevailing MAS memory mechanisms (1) are overly simplistic, completely disregarding the nuanced inter-agent collaboration trajectories, and (2) lack cross-trial and agent-specific customization, in stark contrast to the expressive memory developed for single agents. To bridge this gap, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07398","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/2506.07398/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":"2506.07398","created_at":"2026-07-05T11:21:48.577213+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.07398v2","created_at":"2026-07-05T11:21:48.577213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07398","created_at":"2026-07-05T11:21:48.577213+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZRYOMZYVHXU","created_at":"2026-07-05T11:21:48.577213+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZRYOMZYVHXUHQ2Y","created_at":"2026-07-05T11:21:48.577213+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZRYOMZY","created_at":"2026-07-05T11:21:48.577213+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":39,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08032","citing_title":"What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agents","ref_index":146,"is_internal_anchor":true},{"citing_arxiv_id":"2606.24535","citing_title":"Governed Shared Memory for Multi-Agent LLM Systems","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2606.22385","citing_title":"MetaPS: Adaptive Programmatic Strategy Selection for Market Agents","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20295","citing_title":"Token-Operations-Oriented Inference Optimization Techniques for Large Models","ref_index":106,"is_internal_anchor":false},{"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":35,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08755","citing_title":"Co-Evolving Skill Generation and Policy Optimization","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08702","citing_title":"ConMem: Structured Memory-Guided Adaptation in Training-Free Multi-Agent Systems","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06090","citing_title":"Beyond Semantic Organization: Memory as Execution State Management for Long-Horizon Agents","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26197","citing_title":"Hierarchical Long-Term Semantic Memory for LinkedIn's Hiring Agent","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07358","citing_title":"A Comprehensive Survey on Agent Skills: Taxonomy, Techniques, and Applications","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23989","citing_title":"Towards trustworthy agentic AI: a comprehensive survey of safety, robustness, privacy, and system security","ref_index":199,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28566","citing_title":"R$^2$-Searcher: Calibrating Retrieval and Reasoning Boundaries for Agentic Search","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28773","citing_title":"Rethinking Memory as Continuously Evolving Connectivity","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21768","citing_title":"Memory-R2: Fair Credit Assignment for Long-Horizon Memory-Augmented LLM Agents","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22721","citing_title":"Self-Evolving Multi-Agent Systems via Decentralized Memory","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2510.16079","citing_title":"EvolveR: Self-Evolving LLM Agents through an Experience-Driven Lifecycle","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08216","citing_title":"MemCoT: Test-Time Scaling through Memory-Driven Chain-of-Thought","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07358","citing_title":"A Comprehensive Survey on Agent Skills: Taxonomy, Techniques, and Applications","ref_index":75,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14133","citing_title":"ClawForge: Generating Executable Interactive Benchmarks for Command-Line Agents","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17721","citing_title":"EXG: Self-Evolving Agents with Experience Graphs","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2508.03341","citing_title":"What Deserves Memory: Adaptive Memory Distillation for LLM Agents","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2510.16079","citing_title":"EvolveR: Self-Evolving LLM Agents through an Experience-Driven Lifecycle","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2511.02805","citing_title":"MemSearcher: Training LLMs to Reason, Search and Manage Memory via End-to-End Reinforcement Learning","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2602.02350","citing_title":"Context Learning for Multi-Agent Discussion","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13880","citing_title":"PREPING: Building Agent Memory without Tasks","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WZRYOMZYVHXUHQ2YRXF52FLKYS","json":"https://pith.science/pith/WZRYOMZYVHXUHQ2YRXF52FLKYS.json","graph_json":"https://pith.science/api/pith-number/WZRYOMZYVHXUHQ2YRXF52FLKYS/graph.json","events_json":"https://pith.science/api/pith-number/WZRYOMZYVHXUHQ2YRXF52FLKYS/events.json","paper":"https://pith.science/paper/WZRYOMZY"},"agent_actions":{"view_html":"https://pith.science/pith/WZRYOMZYVHXUHQ2YRXF52FLKYS","download_json":"https://pith.science/pith/WZRYOMZYVHXUHQ2YRXF52FLKYS.json","view_paper":"https://pith.science/paper/WZRYOMZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.07398&json=true","fetch_graph":"https://pith.science/api/pith-number/WZRYOMZYVHXUHQ2YRXF52FLKYS/graph.json","fetch_events":"https://pith.science/api/pith-number/WZRYOMZYVHXUHQ2YRXF52FLKYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZRYOMZYVHXUHQ2YRXF52FLKYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZRYOMZYVHXUHQ2YRXF52FLKYS/action/storage_attestation","attest_author":"https://pith.science/pith/WZRYOMZYVHXUHQ2YRXF52FLKYS/action/author_attestation","sign_citation":"https://pith.science/pith/WZRYOMZYVHXUHQ2YRXF52FLKYS/action/citation_signature","submit_replication":"https://pith.science/pith/WZRYOMZYVHXUHQ2YRXF52FLKYS/action/replication_record"}},"created_at":"2026-07-05T11:21:48.577213+00:00","updated_at":"2026-07-05T11:21:48.577213+00:00"}