{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WXQ44RIG6KEU6TJ3QBZBPAMJ2S","short_pith_number":"pith:WXQ44RIG","schema_version":"1.0","canonical_sha256":"b5e1ce4506f2894f4d3b8072178189d4bf29d502e18baedab178f17a8432ca54","source":{"kind":"arxiv","id":"2411.10297","version":1},"attestation_state":"computed","paper":{"title":"Offline and Online Nonlinear Inverse Differential Games with Known and Approximated Cost and Value Function Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Balint Varga, Philipp Karg, S\\\"oren Hohmann","submitted_at":"2024-11-15T15:54:59Z","abstract_excerpt":"In this work, we propose novel offline and online Inverse Differential Game (IDG) methods for nonlinear Differential Games (DG), which identify the cost functions of all players from control and state trajectories constituting a feedback Nash equilibrium. The offline approach computes the sets of all equivalent cost function parameters that yield the observed trajectories. Our online method is guaranteed to converge to cost function parameters of the offline calculated sets. For both methods, we additionally analyze the case where the cost and value functions are not given by known parameteriz"},"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":"2411.10297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-15T15:54:59Z","cross_cats_sorted":[],"title_canon_sha256":"5b2eec7f768a536743f4789fbd8700ed62d65ba028761076565ab57f8e06d9df","abstract_canon_sha256":"28495f3a659fa44742b61b4185c43753068724565f381977b0902a2b6d2e08eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:03.103129Z","signature_b64":"bAC21/WbI+Yq3HoLa3U2AzFLK47kXItx7i1aedZ4Q/YMFpSTIgO7tqJs6zqN0vgUc1M37skz34Fz7f/tBuKOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5e1ce4506f2894f4d3b8072178189d4bf29d502e18baedab178f17a8432ca54","last_reissued_at":"2026-07-05T09:36:03.102695Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:03.102695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Offline and Online Nonlinear Inverse Differential Games with Known and Approximated Cost and Value Function Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Balint Varga, Philipp Karg, S\\\"oren Hohmann","submitted_at":"2024-11-15T15:54:59Z","abstract_excerpt":"In this work, we propose novel offline and online Inverse Differential Game (IDG) methods for nonlinear Differential Games (DG), which identify the cost functions of all players from control and state trajectories constituting a feedback Nash equilibrium. The offline approach computes the sets of all equivalent cost function parameters that yield the observed trajectories. Our online method is guaranteed to converge to cost function parameters of the offline calculated sets. For both methods, we additionally analyze the case where the cost and value functions are not given by known parameteriz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10297","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/2411.10297/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":"2411.10297","created_at":"2026-07-05T09:36:03.102757+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.10297v1","created_at":"2026-07-05T09:36:03.102757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10297","created_at":"2026-07-05T09:36:03.102757+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXQ44RIG6KEU","created_at":"2026-07-05T09:36:03.102757+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXQ44RIG6KEU6TJ3","created_at":"2026-07-05T09:36:03.102757+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXQ44RIG","created_at":"2026-07-05T09:36:03.102757+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30906","citing_title":"Trajectory Planning for Non-Communicating Mobile Robots using Inverse Optimal Control","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WXQ44RIG6KEU6TJ3QBZBPAMJ2S","json":"https://pith.science/pith/WXQ44RIG6KEU6TJ3QBZBPAMJ2S.json","graph_json":"https://pith.science/api/pith-number/WXQ44RIG6KEU6TJ3QBZBPAMJ2S/graph.json","events_json":"https://pith.science/api/pith-number/WXQ44RIG6KEU6TJ3QBZBPAMJ2S/events.json","paper":"https://pith.science/paper/WXQ44RIG"},"agent_actions":{"view_html":"https://pith.science/pith/WXQ44RIG6KEU6TJ3QBZBPAMJ2S","download_json":"https://pith.science/pith/WXQ44RIG6KEU6TJ3QBZBPAMJ2S.json","view_paper":"https://pith.science/paper/WXQ44RIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.10297&json=true","fetch_graph":"https://pith.science/api/pith-number/WXQ44RIG6KEU6TJ3QBZBPAMJ2S/graph.json","fetch_events":"https://pith.science/api/pith-number/WXQ44RIG6KEU6TJ3QBZBPAMJ2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXQ44RIG6KEU6TJ3QBZBPAMJ2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXQ44RIG6KEU6TJ3QBZBPAMJ2S/action/storage_attestation","attest_author":"https://pith.science/pith/WXQ44RIG6KEU6TJ3QBZBPAMJ2S/action/author_attestation","sign_citation":"https://pith.science/pith/WXQ44RIG6KEU6TJ3QBZBPAMJ2S/action/citation_signature","submit_replication":"https://pith.science/pith/WXQ44RIG6KEU6TJ3QBZBPAMJ2S/action/replication_record"}},"created_at":"2026-07-05T09:36:03.102757+00:00","updated_at":"2026-07-05T09:36:03.102757+00:00"}