{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:R562YQ3E6X7ETOI6PR63TTEIFA","short_pith_number":"pith:R562YQ3E","schema_version":"1.0","canonical_sha256":"8f7dac4364f5fe49b91e7c7db9cc88280a1c798e01612dfd54d078ea41cbef4c","source":{"kind":"arxiv","id":"2506.19565","version":4},"attestation_state":"computed","paper":{"title":"On finite-horizon approximation of an infinite-horizon feedback Nash equilibrium in discrete-time LQ games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Shengyuan Huang, Wenjun Mei, Xiaoguang Yang, Yifen Mu","submitted_at":"2025-06-24T12:27:22Z","abstract_excerpt":"In infinite-horizon discrete-time linear-quadratic (LQ) dynamic games, computing feedback Nash equilibria (FNEs) remains computationally challenging. Motivated by this, we study a finite-horizon strategy for approximating one of the infinite-horizon FNEs. The finite-horizon strategy is as follows. Each player $i$ has an individual prediction horizon $T^i$. In the infinite-horizon game, at each stage, each player $i$ computes its control in the following way: player $i$ envisions an auxiliary $T^i$-stage game in which the same set of players play, computes the unique FNE of the auxiliary game u"},"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":"2506.19565","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-06-24T12:27:22Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"a1eef278c461a4368801a3d17e48b6170c51374fa629a6bc9eda50fb7d565701","abstract_canon_sha256":"0469ebe50dac80987a2e88dade49b6a94947f53723b9d6199cbde8b8006ce71c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:19.129639Z","signature_b64":"4WvwrFKslA6MUKh0EmjmwFtACkPHlE2HhvbIJeC4y6oh5QOCLDpMkEHhJa7BqY/WI7tyfQzlP81VOe58aOa+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f7dac4364f5fe49b91e7c7db9cc88280a1c798e01612dfd54d078ea41cbef4c","last_reissued_at":"2026-07-08T01:18:19.129028Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:19.129028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On finite-horizon approximation of an infinite-horizon feedback Nash equilibrium in discrete-time LQ games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Shengyuan Huang, Wenjun Mei, Xiaoguang Yang, Yifen Mu","submitted_at":"2025-06-24T12:27:22Z","abstract_excerpt":"In infinite-horizon discrete-time linear-quadratic (LQ) dynamic games, computing feedback Nash equilibria (FNEs) remains computationally challenging. Motivated by this, we study a finite-horizon strategy for approximating one of the infinite-horizon FNEs. The finite-horizon strategy is as follows. Each player $i$ has an individual prediction horizon $T^i$. In the infinite-horizon game, at each stage, each player $i$ computes its control in the following way: player $i$ envisions an auxiliary $T^i$-stage game in which the same set of players play, computes the unique FNE of the auxiliary game u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.19565","kind":"arxiv","version":4},"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/2506.19565/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":"2506.19565","created_at":"2026-07-08T01:18:19.129092+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.19565v4","created_at":"2026-07-08T01:18:19.129092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.19565","created_at":"2026-07-08T01:18:19.129092+00:00"},{"alias_kind":"pith_short_12","alias_value":"R562YQ3E6X7E","created_at":"2026-07-08T01:18:19.129092+00:00"},{"alias_kind":"pith_short_16","alias_value":"R562YQ3E6X7ETOI6","created_at":"2026-07-08T01:18:19.129092+00:00"},{"alias_kind":"pith_short_8","alias_value":"R562YQ3E","created_at":"2026-07-08T01:18:19.129092+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22073","citing_title":"Linear-Quadratic Discrete-Time Dynamic Games with Unknown Dynamics","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R562YQ3E6X7ETOI6PR63TTEIFA","json":"https://pith.science/pith/R562YQ3E6X7ETOI6PR63TTEIFA.json","graph_json":"https://pith.science/api/pith-number/R562YQ3E6X7ETOI6PR63TTEIFA/graph.json","events_json":"https://pith.science/api/pith-number/R562YQ3E6X7ETOI6PR63TTEIFA/events.json","paper":"https://pith.science/paper/R562YQ3E"},"agent_actions":{"view_html":"https://pith.science/pith/R562YQ3E6X7ETOI6PR63TTEIFA","download_json":"https://pith.science/pith/R562YQ3E6X7ETOI6PR63TTEIFA.json","view_paper":"https://pith.science/paper/R562YQ3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.19565&json=true","fetch_graph":"https://pith.science/api/pith-number/R562YQ3E6X7ETOI6PR63TTEIFA/graph.json","fetch_events":"https://pith.science/api/pith-number/R562YQ3E6X7ETOI6PR63TTEIFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R562YQ3E6X7ETOI6PR63TTEIFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R562YQ3E6X7ETOI6PR63TTEIFA/action/storage_attestation","attest_author":"https://pith.science/pith/R562YQ3E6X7ETOI6PR63TTEIFA/action/author_attestation","sign_citation":"https://pith.science/pith/R562YQ3E6X7ETOI6PR63TTEIFA/action/citation_signature","submit_replication":"https://pith.science/pith/R562YQ3E6X7ETOI6PR63TTEIFA/action/replication_record"}},"created_at":"2026-07-08T01:18:19.129092+00:00","updated_at":"2026-07-08T01:18:19.129092+00:00"}