{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6BKUB4NIF2WK63EJDYJ3PJU5PX","short_pith_number":"pith:6BKUB4NI","schema_version":"1.0","canonical_sha256":"f05540f1a82eacaf6c891e13b7a69d7de6e5f6a8257c9f263e0349b097f18fb6","source":{"kind":"arxiv","id":"2403.18056","version":1},"attestation_state":"computed","paper":{"title":"Self-Clustering Hierarchical Multi-Agent Reinforcement Learning with Extensible Cooperation Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jianqiang Yi, Qingxu Fu, Tenghai Qiu, Xiaolin Ai, Zhiqiang Pu","submitted_at":"2024-03-26T19:19:16Z","abstract_excerpt":"Multi-Agent Reinforcement Learning (MARL) has been successful in solving many cooperative challenges. However, classic non-hierarchical MARL algorithms still cannot address various complex multi-agent problems that require hierarchical cooperative behaviors. The cooperative knowledge and policies learned in non-hierarchical algorithms are implicit and not interpretable, thereby restricting the integration of existing knowledge. This paper proposes a novel hierarchical MARL model called Hierarchical Cooperation Graph Learning (HCGL) for solving general multi-agent problems. HCGL has three compo"},"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":"2403.18056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-03-26T19:19:16Z","cross_cats_sorted":[],"title_canon_sha256":"cdde081c0d55535c763b67a13d46043578f9a4388bc544f7ed06a81a496c790c","abstract_canon_sha256":"e5bef3ef6026d38d8ac9194b167c04fe348233e8b8d9c26f58015c8127b3d7d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:04.188584Z","signature_b64":"2e9DpWACrkyQPHaPuYb7hoJ6pdIXkGJwZ9pPllPGY9kbYaZHQBlMYvyGvExDabK2TVfeRO76a9y1yAqnLFAGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f05540f1a82eacaf6c891e13b7a69d7de6e5f6a8257c9f263e0349b097f18fb6","last_reissued_at":"2026-07-05T08:01:04.188167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:04.188167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Clustering Hierarchical Multi-Agent Reinforcement Learning with Extensible Cooperation Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jianqiang Yi, Qingxu Fu, Tenghai Qiu, Xiaolin Ai, Zhiqiang Pu","submitted_at":"2024-03-26T19:19:16Z","abstract_excerpt":"Multi-Agent Reinforcement Learning (MARL) has been successful in solving many cooperative challenges. However, classic non-hierarchical MARL algorithms still cannot address various complex multi-agent problems that require hierarchical cooperative behaviors. The cooperative knowledge and policies learned in non-hierarchical algorithms are implicit and not interpretable, thereby restricting the integration of existing knowledge. This paper proposes a novel hierarchical MARL model called Hierarchical Cooperation Graph Learning (HCGL) for solving general multi-agent problems. HCGL has three compo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18056","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/2403.18056/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":"2403.18056","created_at":"2026-07-05T08:01:04.188225+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.18056v1","created_at":"2026-07-05T08:01:04.188225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18056","created_at":"2026-07-05T08:01:04.188225+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BKUB4NIF2WK","created_at":"2026-07-05T08:01:04.188225+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BKUB4NIF2WK63EJ","created_at":"2026-07-05T08:01:04.188225+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BKUB4NI","created_at":"2026-07-05T08:01:04.188225+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.06706","citing_title":"Bi-level Mean Field: Dynamic Grouping for Large-Scale MARL","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6BKUB4NIF2WK63EJDYJ3PJU5PX","json":"https://pith.science/pith/6BKUB4NIF2WK63EJDYJ3PJU5PX.json","graph_json":"https://pith.science/api/pith-number/6BKUB4NIF2WK63EJDYJ3PJU5PX/graph.json","events_json":"https://pith.science/api/pith-number/6BKUB4NIF2WK63EJDYJ3PJU5PX/events.json","paper":"https://pith.science/paper/6BKUB4NI"},"agent_actions":{"view_html":"https://pith.science/pith/6BKUB4NIF2WK63EJDYJ3PJU5PX","download_json":"https://pith.science/pith/6BKUB4NIF2WK63EJDYJ3PJU5PX.json","view_paper":"https://pith.science/paper/6BKUB4NI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.18056&json=true","fetch_graph":"https://pith.science/api/pith-number/6BKUB4NIF2WK63EJDYJ3PJU5PX/graph.json","fetch_events":"https://pith.science/api/pith-number/6BKUB4NIF2WK63EJDYJ3PJU5PX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BKUB4NIF2WK63EJDYJ3PJU5PX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BKUB4NIF2WK63EJDYJ3PJU5PX/action/storage_attestation","attest_author":"https://pith.science/pith/6BKUB4NIF2WK63EJDYJ3PJU5PX/action/author_attestation","sign_citation":"https://pith.science/pith/6BKUB4NIF2WK63EJDYJ3PJU5PX/action/citation_signature","submit_replication":"https://pith.science/pith/6BKUB4NIF2WK63EJDYJ3PJU5PX/action/replication_record"}},"created_at":"2026-07-05T08:01:04.188225+00:00","updated_at":"2026-07-05T08:01:04.188225+00:00"}