{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:H6NGEFXFTTMBI4ZG3REM36QCKK","short_pith_number":"pith:H6NGEFXF","schema_version":"1.0","canonical_sha256":"3f9a6216e59cd8147326dc48cdfa0252867ba00bdcbfea3d7ccabd751395cec9","source":{"kind":"arxiv","id":"2201.12925","version":2},"attestation_state":"computed","paper":{"title":"Multimodal Maximum Entropy Dynamic Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"Evangelos A. Theodorou, Kyle Stachowicz, Oswin So","submitted_at":"2022-01-30T21:41:13Z","abstract_excerpt":"Environments with multi-agent interactions often result a rich set of modalities of behavior between agents due to the inherent suboptimality of decision making processes when agents settle for satisfactory decisions. However, existing algorithms for solving these dynamic games are strictly unimodal and fail to capture the intricate multimodal behaviors of the agents. In this paper, we propose MMELQGames (Multimodal Maximum-Entropy Linear Quadratic Games), a novel constrained multimodal maximum entropy formulation of the Differential Dynamic Programming algorithm for solving generalized Nash e"},"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":"2201.12925","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-01-30T21:41:13Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"3915c2f3b5b526364b7641d660e7470b04f78463169c279a3dded341dbd4d0fb","abstract_canon_sha256":"f188e396a99879f039e5382254e5d9d81814d5a39461b921f0807b7237157f5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:53:39.380011Z","signature_b64":"8p8nPIXEGjI7RsVuAJuIDrLHCabuec6oJUL5rDtrkCqmsekdIFmXpOLPI/OGnZ55YVKkL8E9e2gplihTL/TZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f9a6216e59cd8147326dc48cdfa0252867ba00bdcbfea3d7ccabd751395cec9","last_reissued_at":"2026-07-05T03:53:39.379539Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:53:39.379539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multimodal Maximum Entropy Dynamic Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"Evangelos A. Theodorou, Kyle Stachowicz, Oswin So","submitted_at":"2022-01-30T21:41:13Z","abstract_excerpt":"Environments with multi-agent interactions often result a rich set of modalities of behavior between agents due to the inherent suboptimality of decision making processes when agents settle for satisfactory decisions. However, existing algorithms for solving these dynamic games are strictly unimodal and fail to capture the intricate multimodal behaviors of the agents. In this paper, we propose MMELQGames (Multimodal Maximum-Entropy Linear Quadratic Games), a novel constrained multimodal maximum entropy formulation of the Differential Dynamic Programming algorithm for solving generalized Nash e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12925","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/2201.12925/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":"2201.12925","created_at":"2026-07-05T03:53:39.379608+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12925v2","created_at":"2026-07-05T03:53:39.379608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12925","created_at":"2026-07-05T03:53:39.379608+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6NGEFXFTTMB","created_at":"2026-07-05T03:53:39.379608+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6NGEFXFTTMBI4ZG","created_at":"2026-07-05T03:53:39.379608+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6NGEFXF","created_at":"2026-07-05T03:53:39.379608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.12174","citing_title":"Fast and Scalable Game-Theoretic Trajectory Planning with Intentional Uncertainties","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H6NGEFXFTTMBI4ZG3REM36QCKK","json":"https://pith.science/pith/H6NGEFXFTTMBI4ZG3REM36QCKK.json","graph_json":"https://pith.science/api/pith-number/H6NGEFXFTTMBI4ZG3REM36QCKK/graph.json","events_json":"https://pith.science/api/pith-number/H6NGEFXFTTMBI4ZG3REM36QCKK/events.json","paper":"https://pith.science/paper/H6NGEFXF"},"agent_actions":{"view_html":"https://pith.science/pith/H6NGEFXFTTMBI4ZG3REM36QCKK","download_json":"https://pith.science/pith/H6NGEFXFTTMBI4ZG3REM36QCKK.json","view_paper":"https://pith.science/paper/H6NGEFXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12925&json=true","fetch_graph":"https://pith.science/api/pith-number/H6NGEFXFTTMBI4ZG3REM36QCKK/graph.json","fetch_events":"https://pith.science/api/pith-number/H6NGEFXFTTMBI4ZG3REM36QCKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6NGEFXFTTMBI4ZG3REM36QCKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6NGEFXFTTMBI4ZG3REM36QCKK/action/storage_attestation","attest_author":"https://pith.science/pith/H6NGEFXFTTMBI4ZG3REM36QCKK/action/author_attestation","sign_citation":"https://pith.science/pith/H6NGEFXFTTMBI4ZG3REM36QCKK/action/citation_signature","submit_replication":"https://pith.science/pith/H6NGEFXFTTMBI4ZG3REM36QCKK/action/replication_record"}},"created_at":"2026-07-05T03:53:39.379608+00:00","updated_at":"2026-07-05T03:53:39.379608+00:00"}