{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XUMWGQ44PHABCY3YVMLH7SI263","short_pith_number":"pith:XUMWGQ44","schema_version":"1.0","canonical_sha256":"bd1963439c79c0116378ab167fc91af6fcad2e73aeb42857212f222666f1ff20","source":{"kind":"arxiv","id":"2402.08902","version":3},"attestation_state":"computed","paper":{"title":"Auto-Encoding Bayesian Inverse Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG","cs.MA","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"David Fridovich-Keil, Javier Alonso-Mora, Lasse Peters, Ufuk Topcu, Xinjie Liu","submitted_at":"2024-02-14T02:17:37Z","abstract_excerpt":"When multiple agents interact in a common environment, each agent's actions impact others' future decisions, and noncooperative dynamic games naturally capture this coupling. In interactive motion planning, however, agents typically do not have access to a complete model of the game, e.g., due to unknown objectives of other players. Therefore, we consider the inverse game problem, in which some properties of the game are unknown a priori and must be inferred from observations. Existing maximum likelihood estimation (MLE) approaches to solve inverse games provide only point estimates of unknown"},"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.08902","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-02-14T02:17:37Z","cross_cats_sorted":["cs.GT","cs.LG","cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"2ef54d4bb1586b9f397b5cc7be77040374c0f21030b18225a437ac5737af054a","abstract_canon_sha256":"62bc18616a791aab7259f415b2f3df7911a18422571e392e6fef74f3d67a0652"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:32.699058Z","signature_b64":"ZKSNw1iOZA/rLIY9j3z7oiAvjleEAPZUyI6LW7myeVxpJ/lsjP56Cic4PBRxz+VwK9OlU3VMsuuZe7YzZB7xAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd1963439c79c0116378ab167fc91af6fcad2e73aeb42857212f222666f1ff20","last_reissued_at":"2026-07-05T09:24:32.698545Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:32.698545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Auto-Encoding Bayesian Inverse Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG","cs.MA","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"David Fridovich-Keil, Javier Alonso-Mora, Lasse Peters, Ufuk Topcu, Xinjie Liu","submitted_at":"2024-02-14T02:17:37Z","abstract_excerpt":"When multiple agents interact in a common environment, each agent's actions impact others' future decisions, and noncooperative dynamic games naturally capture this coupling. In interactive motion planning, however, agents typically do not have access to a complete model of the game, e.g., due to unknown objectives of other players. Therefore, we consider the inverse game problem, in which some properties of the game are unknown a priori and must be inferred from observations. Existing maximum likelihood estimation (MLE) approaches to solve inverse games provide only point estimates of unknown"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08902","kind":"arxiv","version":3},"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.08902/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.08902","created_at":"2026-07-05T09:24:32.698609+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.08902v3","created_at":"2026-07-05T09:24:32.698609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08902","created_at":"2026-07-05T09:24:32.698609+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUMWGQ44PHAB","created_at":"2026-07-05T09:24:32.698609+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUMWGQ44PHABCY3Y","created_at":"2026-07-05T09:24:32.698609+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUMWGQ44","created_at":"2026-07-05T09:24:32.698609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.03356","citing_title":"Inverse Mixed Strategy Games with Generative Trajectory Models","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XUMWGQ44PHABCY3YVMLH7SI263","json":"https://pith.science/pith/XUMWGQ44PHABCY3YVMLH7SI263.json","graph_json":"https://pith.science/api/pith-number/XUMWGQ44PHABCY3YVMLH7SI263/graph.json","events_json":"https://pith.science/api/pith-number/XUMWGQ44PHABCY3YVMLH7SI263/events.json","paper":"https://pith.science/paper/XUMWGQ44"},"agent_actions":{"view_html":"https://pith.science/pith/XUMWGQ44PHABCY3YVMLH7SI263","download_json":"https://pith.science/pith/XUMWGQ44PHABCY3YVMLH7SI263.json","view_paper":"https://pith.science/paper/XUMWGQ44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.08902&json=true","fetch_graph":"https://pith.science/api/pith-number/XUMWGQ44PHABCY3YVMLH7SI263/graph.json","fetch_events":"https://pith.science/api/pith-number/XUMWGQ44PHABCY3YVMLH7SI263/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUMWGQ44PHABCY3YVMLH7SI263/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUMWGQ44PHABCY3YVMLH7SI263/action/storage_attestation","attest_author":"https://pith.science/pith/XUMWGQ44PHABCY3YVMLH7SI263/action/author_attestation","sign_citation":"https://pith.science/pith/XUMWGQ44PHABCY3YVMLH7SI263/action/citation_signature","submit_replication":"https://pith.science/pith/XUMWGQ44PHABCY3YVMLH7SI263/action/replication_record"}},"created_at":"2026-07-05T09:24:32.698609+00:00","updated_at":"2026-07-05T09:24:32.698609+00:00"}