{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:S6GJDRTCUUOWHCGPDNCPRI7RJO","short_pith_number":"pith:S6GJDRTC","schema_version":"1.0","canonical_sha256":"978c91c662a51d6388cf1b44f8a3f14b80275320ca085973fe12c32fddaaed6b","source":{"kind":"arxiv","id":"2402.00738","version":1},"attestation_state":"computed","paper":{"title":"FM3Q: Factorized Multi-Agent MiniMax Q-Learning for Two-Team Zero-Sum Markov Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dongbin Zhao, Guangzheng Hu, Haoran Li, Yuanheng Zhu","submitted_at":"2024-02-01T16:37:21Z","abstract_excerpt":"Many real-world applications involve some agents that fall into two teams, with payoffs that are equal within the same team but of opposite sign across the opponent team. The so-called two-team zero-sum Markov games (2t0sMGs) can be resolved with reinforcement learning in recent years. However, existing methods are thus inefficient in light of insufficient consideration of intra-team credit assignment, data utilization and computational intractability. In this paper, we propose the individual-global-minimax (IGMM) principle to ensure the coherence between two-team minimax behaviors and the ind"},"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":"2402.00738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-02-01T16:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"605b0b45e9fb841e44e424d22312abae74bc9cd024a3eae7c4c48640de6959e3","abstract_canon_sha256":"1d71f2c57260cc21d0cda2bf01801dbc727b2c7afefa0dd167a426a6da3685a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:17.131153Z","signature_b64":"bcA/Dj9sksP74woQE5Sb8xobObODuN9jmCvTMepogvg3krZYjfp5UREJS1A/KEGmWUsh+Bb0I03zGh8P0iwwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"978c91c662a51d6388cf1b44f8a3f14b80275320ca085973fe12c32fddaaed6b","last_reissued_at":"2026-07-05T07:40:17.130677Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:17.130677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FM3Q: Factorized Multi-Agent MiniMax Q-Learning for Two-Team Zero-Sum Markov Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dongbin Zhao, Guangzheng Hu, Haoran Li, Yuanheng Zhu","submitted_at":"2024-02-01T16:37:21Z","abstract_excerpt":"Many real-world applications involve some agents that fall into two teams, with payoffs that are equal within the same team but of opposite sign across the opponent team. The so-called two-team zero-sum Markov games (2t0sMGs) can be resolved with reinforcement learning in recent years. However, existing methods are thus inefficient in light of insufficient consideration of intra-team credit assignment, data utilization and computational intractability. In this paper, we propose the individual-global-minimax (IGMM) principle to ensure the coherence between two-team minimax behaviors and the ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.00738","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/2402.00738/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":"2402.00738","created_at":"2026-07-05T07:40:17.130740+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.00738v1","created_at":"2026-07-05T07:40:17.130740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.00738","created_at":"2026-07-05T07:40:17.130740+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6GJDRTCUUOW","created_at":"2026-07-05T07:40:17.130740+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6GJDRTCUUOWHCGP","created_at":"2026-07-05T07:40:17.130740+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6GJDRTC","created_at":"2026-07-05T07:40:17.130740+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/S6GJDRTCUUOWHCGPDNCPRI7RJO","json":"https://pith.science/pith/S6GJDRTCUUOWHCGPDNCPRI7RJO.json","graph_json":"https://pith.science/api/pith-number/S6GJDRTCUUOWHCGPDNCPRI7RJO/graph.json","events_json":"https://pith.science/api/pith-number/S6GJDRTCUUOWHCGPDNCPRI7RJO/events.json","paper":"https://pith.science/paper/S6GJDRTC"},"agent_actions":{"view_html":"https://pith.science/pith/S6GJDRTCUUOWHCGPDNCPRI7RJO","download_json":"https://pith.science/pith/S6GJDRTCUUOWHCGPDNCPRI7RJO.json","view_paper":"https://pith.science/paper/S6GJDRTC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.00738&json=true","fetch_graph":"https://pith.science/api/pith-number/S6GJDRTCUUOWHCGPDNCPRI7RJO/graph.json","fetch_events":"https://pith.science/api/pith-number/S6GJDRTCUUOWHCGPDNCPRI7RJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6GJDRTCUUOWHCGPDNCPRI7RJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6GJDRTCUUOWHCGPDNCPRI7RJO/action/storage_attestation","attest_author":"https://pith.science/pith/S6GJDRTCUUOWHCGPDNCPRI7RJO/action/author_attestation","sign_citation":"https://pith.science/pith/S6GJDRTCUUOWHCGPDNCPRI7RJO/action/citation_signature","submit_replication":"https://pith.science/pith/S6GJDRTCUUOWHCGPDNCPRI7RJO/action/replication_record"}},"created_at":"2026-07-05T07:40:17.130740+00:00","updated_at":"2026-07-05T07:40:17.130740+00:00"}