{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GTTKHFYBAVI4EOLZQVNK73UGZM","short_pith_number":"pith:GTTKHFYB","schema_version":"1.0","canonical_sha256":"34e6a397010551c23979855aafee86cb13a99ed790e3ce08228f4759d656923c","source":{"kind":"arxiv","id":"2507.19344","version":1},"attestation_state":"computed","paper":{"title":"Joint Inference of Trajectory and Obstacle in Mean-Field Games via Bilevel Optimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Han Huang, Jiajia Yu, Rongjie Lai, Tianyi Chen","submitted_at":"2025-07-25T14:53:50Z","abstract_excerpt":"Mean field game (MFG) is an expressive modeling framework for systems with a continuum of interacting agents. While many approaches exist for solving the forward MFG, few have studied its \\textit{inverse} problem. In this work, we seek to recover optimal agent trajectories and the unseen spatial obstacle given partial observation on the former. To this end, we use a special type of generative models, normalizing flow, to represent the trajectories and propose a novel formulation of inverse MFG as a bilevel optimization (BLO) problem. We demonstrate the effectiveness of our approach across vari"},"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":"2507.19344","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-25T14:53:50Z","cross_cats_sorted":[],"title_canon_sha256":"4595dea35f5901b77e7681b9505855e7cc7a9b31255cb664f0dcac908bde0be7","abstract_canon_sha256":"b20f8993551befe172429eb33104e5baba3f8cf2dd6055cfd7e4b61651ad33f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:23.865579Z","signature_b64":"giyDB37setRA41DgXDOJa/qs49tuQ2RaNgPPQptr2RESRaSimpQTUH3NZzfXHdFBFfdatdMCtgaAuHYDfE65DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34e6a397010551c23979855aafee86cb13a99ed790e3ce08228f4759d656923c","last_reissued_at":"2026-07-05T11:43:23.864980Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:23.864980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Inference of Trajectory and Obstacle in Mean-Field Games via Bilevel Optimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Han Huang, Jiajia Yu, Rongjie Lai, Tianyi Chen","submitted_at":"2025-07-25T14:53:50Z","abstract_excerpt":"Mean field game (MFG) is an expressive modeling framework for systems with a continuum of interacting agents. While many approaches exist for solving the forward MFG, few have studied its \\textit{inverse} problem. In this work, we seek to recover optimal agent trajectories and the unseen spatial obstacle given partial observation on the former. To this end, we use a special type of generative models, normalizing flow, to represent the trajectories and propose a novel formulation of inverse MFG as a bilevel optimization (BLO) problem. We demonstrate the effectiveness of our approach across vari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19344","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/2507.19344/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":"2507.19344","created_at":"2026-07-05T11:43:23.865051+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.19344v1","created_at":"2026-07-05T11:43:23.865051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19344","created_at":"2026-07-05T11:43:23.865051+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTTKHFYBAVI4","created_at":"2026-07-05T11:43:23.865051+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTTKHFYBAVI4EOLZ","created_at":"2026-07-05T11:43:23.865051+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTTKHFYB","created_at":"2026-07-05T11:43:23.865051+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.00217","citing_title":"Truncated Differentiation Through Primal-Dual Solvers for Inverse Potential Mean-Field Games","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GTTKHFYBAVI4EOLZQVNK73UGZM","json":"https://pith.science/pith/GTTKHFYBAVI4EOLZQVNK73UGZM.json","graph_json":"https://pith.science/api/pith-number/GTTKHFYBAVI4EOLZQVNK73UGZM/graph.json","events_json":"https://pith.science/api/pith-number/GTTKHFYBAVI4EOLZQVNK73UGZM/events.json","paper":"https://pith.science/paper/GTTKHFYB"},"agent_actions":{"view_html":"https://pith.science/pith/GTTKHFYBAVI4EOLZQVNK73UGZM","download_json":"https://pith.science/pith/GTTKHFYBAVI4EOLZQVNK73UGZM.json","view_paper":"https://pith.science/paper/GTTKHFYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.19344&json=true","fetch_graph":"https://pith.science/api/pith-number/GTTKHFYBAVI4EOLZQVNK73UGZM/graph.json","fetch_events":"https://pith.science/api/pith-number/GTTKHFYBAVI4EOLZQVNK73UGZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTTKHFYBAVI4EOLZQVNK73UGZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTTKHFYBAVI4EOLZQVNK73UGZM/action/storage_attestation","attest_author":"https://pith.science/pith/GTTKHFYBAVI4EOLZQVNK73UGZM/action/author_attestation","sign_citation":"https://pith.science/pith/GTTKHFYBAVI4EOLZQVNK73UGZM/action/citation_signature","submit_replication":"https://pith.science/pith/GTTKHFYBAVI4EOLZQVNK73UGZM/action/replication_record"}},"created_at":"2026-07-05T11:43:23.865051+00:00","updated_at":"2026-07-05T11:43:23.865051+00:00"}