{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PKTT57NED5S3A2OYKRE3CSU3AR","short_pith_number":"pith:PKTT57NE","schema_version":"1.0","canonical_sha256":"7aa73efda41f65b069d85449b14a9b0448eb80335b198cc2540ff68e2f937b11","source":{"kind":"arxiv","id":"2406.02081","version":2},"attestation_state":"computed","paper":{"title":"FightLadder: A Benchmark for Competitive Multi-Agent Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.MA","authors_text":"Chi Jin, Seth Karten, Wenzhe Li, Zihan Ding","submitted_at":"2024-06-04T08:04:23Z","abstract_excerpt":"Recent advances in reinforcement learning (RL) heavily rely on a variety of well-designed benchmarks, which provide environmental platforms and consistent criteria to evaluate existing and novel algorithms. Specifically, in multi-agent RL (MARL), a plethora of benchmarks based on cooperative games have spurred the development of algorithms that improve the scalability of cooperative multi-agent systems. However, for the competitive setting, a lightweight and open-sourced benchmark with challenging gaming dynamics and visual inputs has not yet been established. In this work, we present FightLad"},"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":"2406.02081","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-06-04T08:04:23Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d7c5c40422f97546a6cb2636d06a9e44a0967bd656aa078cd91a63c1f73d90de","abstract_canon_sha256":"9c4f547e9c470c6955066fd39c8d6e1badd5eee89eef2f0b6f26c08ca4f6fa70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:46.903688Z","signature_b64":"UgomqCQiAdG0rJwdyOJ+XswNslIycqPK7HMhuZQV1Olqv76CY8IaqpAdHugHTJf+ARfvft/IApUsP8wb+QbQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aa73efda41f65b069d85449b14a9b0448eb80335b198cc2540ff68e2f937b11","last_reissued_at":"2026-07-05T08:35:46.903230Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:46.903230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FightLadder: A Benchmark for Competitive Multi-Agent Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.MA","authors_text":"Chi Jin, Seth Karten, Wenzhe Li, Zihan Ding","submitted_at":"2024-06-04T08:04:23Z","abstract_excerpt":"Recent advances in reinforcement learning (RL) heavily rely on a variety of well-designed benchmarks, which provide environmental platforms and consistent criteria to evaluate existing and novel algorithms. Specifically, in multi-agent RL (MARL), a plethora of benchmarks based on cooperative games have spurred the development of algorithms that improve the scalability of cooperative multi-agent systems. However, for the competitive setting, a lightweight and open-sourced benchmark with challenging gaming dynamics and visual inputs has not yet been established. In this work, we present FightLad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02081","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/2406.02081/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":"2406.02081","created_at":"2026-07-05T08:35:46.903290+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.02081v2","created_at":"2026-07-05T08:35:46.903290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02081","created_at":"2026-07-05T08:35:46.903290+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKTT57NED5S3","created_at":"2026-07-05T08:35:46.903290+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKTT57NED5S3A2OY","created_at":"2026-07-05T08:35:46.903290+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKTT57NE","created_at":"2026-07-05T08:35:46.903290+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20911","citing_title":"For How Long Should We Be Punching? Learning Action Duration in Fighting Games","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25088","citing_title":"Cooperate to Compete: Strategic Coordination in Multi-Agent Conquest","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00347","citing_title":"Odysseus: Scaling VLMs to 100+ Turn Decision-Making in Games via Reinforcement Learning","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PKTT57NED5S3A2OYKRE3CSU3AR","json":"https://pith.science/pith/PKTT57NED5S3A2OYKRE3CSU3AR.json","graph_json":"https://pith.science/api/pith-number/PKTT57NED5S3A2OYKRE3CSU3AR/graph.json","events_json":"https://pith.science/api/pith-number/PKTT57NED5S3A2OYKRE3CSU3AR/events.json","paper":"https://pith.science/paper/PKTT57NE"},"agent_actions":{"view_html":"https://pith.science/pith/PKTT57NED5S3A2OYKRE3CSU3AR","download_json":"https://pith.science/pith/PKTT57NED5S3A2OYKRE3CSU3AR.json","view_paper":"https://pith.science/paper/PKTT57NE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.02081&json=true","fetch_graph":"https://pith.science/api/pith-number/PKTT57NED5S3A2OYKRE3CSU3AR/graph.json","fetch_events":"https://pith.science/api/pith-number/PKTT57NED5S3A2OYKRE3CSU3AR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKTT57NED5S3A2OYKRE3CSU3AR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKTT57NED5S3A2OYKRE3CSU3AR/action/storage_attestation","attest_author":"https://pith.science/pith/PKTT57NED5S3A2OYKRE3CSU3AR/action/author_attestation","sign_citation":"https://pith.science/pith/PKTT57NED5S3A2OYKRE3CSU3AR/action/citation_signature","submit_replication":"https://pith.science/pith/PKTT57NED5S3A2OYKRE3CSU3AR/action/replication_record"}},"created_at":"2026-07-05T08:35:46.903290+00:00","updated_at":"2026-07-05T08:35:46.903290+00:00"}