{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AIVFZDUCUO2H6HYCFWZC5CP7ZQ","short_pith_number":"pith:AIVFZDUC","canonical_record":{"source":{"id":"2410.03106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-04T03:01:21Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"fabad8fb7c534884effc6b784540ede914f47db7fba3995519de401e5c0baddb","abstract_canon_sha256":"807f88d9a24cf4c475e221e1fcf7802773ef2d04c2a8d7a943212df81beabf27"},"schema_version":"1.0"},"canonical_sha256":"022a5c8e82a3b47f1f022db22e89ffcc2844198c56b28aab2a61309479ae5ff3","source":{"kind":"arxiv","id":"2410.03106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.03106","created_at":"2026-07-05T09:15:44Z"},{"alias_kind":"arxiv_version","alias_value":"2410.03106v1","created_at":"2026-07-05T09:15:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03106","created_at":"2026-07-05T09:15:44Z"},{"alias_kind":"pith_short_12","alias_value":"AIVFZDUCUO2H","created_at":"2026-07-05T09:15:44Z"},{"alias_kind":"pith_short_16","alias_value":"AIVFZDUCUO2H6HYC","created_at":"2026-07-05T09:15:44Z"},{"alias_kind":"pith_short_8","alias_value":"AIVFZDUC","created_at":"2026-07-05T09:15:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AIVFZDUCUO2H6HYCFWZC5CP7ZQ","target":"record","payload":{"canonical_record":{"source":{"id":"2410.03106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-04T03:01:21Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"fabad8fb7c534884effc6b784540ede914f47db7fba3995519de401e5c0baddb","abstract_canon_sha256":"807f88d9a24cf4c475e221e1fcf7802773ef2d04c2a8d7a943212df81beabf27"},"schema_version":"1.0"},"canonical_sha256":"022a5c8e82a3b47f1f022db22e89ffcc2844198c56b28aab2a61309479ae5ff3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:44.379042Z","signature_b64":"j5c3OfTdrgDUbbclQ0QM+9WS6QL9/OYUJC3RAtQk39MwNi2noJ4z29gLKHM0Lwb4S3itB5k/k7jzd4VxemSaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"022a5c8e82a3b47f1f022db22e89ffcc2844198c56b28aab2a61309479ae5ff3","last_reissued_at":"2026-07-05T09:15:44.378508Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:44.378508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.03106","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:15:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/VRPYEVe9E3p7fg4P6YByD9OURyrpWq+V48M7Dd9L2iqUnMenGPErwx/8uT1cTv1q014hrDJh4SOPuLMn5XsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:30:44.006358Z"},"content_sha256":"690835edc125b473aff500bd130a72f9d9f620871732082e7ced4320fea9d22b","schema_version":"1.0","event_id":"sha256:690835edc125b473aff500bd130a72f9d9f620871732082e7ced4320fea9d22b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AIVFZDUCUO2H6HYCFWZC5CP7ZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Policy Iteration Algorithm for N-player General-Sum Linear Quadratic Dynamic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Giulio Salizzoni, Maryam Kamgarpour, Tyler H. Summers, Yuxiang Guan","submitted_at":"2024-10-04T03:01:21Z","abstract_excerpt":"We present a policy iteration algorithm for the infinite-horizon N-player general-sum deterministic linear quadratic dynamic games and compare it to policy gradient methods. We demonstrate that the proposed policy iteration algorithm is distinct from the Gauss-Newton policy gradient method in the N-player game setting, in contrast to the single-player setting where under suitable choice of step size they are equivalent. We illustrate in numerical experiments that the convergence rate of the proposed policy iteration algorithm significantly surpasses that of the Gauss-Newton policy gradient met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03106","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/2410.03106/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:15:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yndyqVk8BNaFIUYH2cnYzFIpybw9FlKNBq4CH9YVixJiYPV2S066dG05kI1gIM903M5Wv+6ob8J7VToXzlfPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:30:44.007038Z"},"content_sha256":"9666a74bac9d665160e66c0705819f2fcfb9d0348df4296c2b3981cf48dcc28c","schema_version":"1.0","event_id":"sha256:9666a74bac9d665160e66c0705819f2fcfb9d0348df4296c2b3981cf48dcc28c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIVFZDUCUO2H6HYCFWZC5CP7ZQ/bundle.json","state_url":"https://pith.science/pith/AIVFZDUCUO2H6HYCFWZC5CP7ZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIVFZDUCUO2H6HYCFWZC5CP7ZQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T17:30:44Z","links":{"resolver":"https://pith.science/pith/AIVFZDUCUO2H6HYCFWZC5CP7ZQ","bundle":"https://pith.science/pith/AIVFZDUCUO2H6HYCFWZC5CP7ZQ/bundle.json","state":"https://pith.science/pith/AIVFZDUCUO2H6HYCFWZC5CP7ZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIVFZDUCUO2H6HYCFWZC5CP7ZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AIVFZDUCUO2H6HYCFWZC5CP7ZQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"807f88d9a24cf4c475e221e1fcf7802773ef2d04c2a8d7a943212df81beabf27","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-04T03:01:21Z","title_canon_sha256":"fabad8fb7c534884effc6b784540ede914f47db7fba3995519de401e5c0baddb"},"schema_version":"1.0","source":{"id":"2410.03106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.03106","created_at":"2026-07-05T09:15:44Z"},{"alias_kind":"arxiv_version","alias_value":"2410.03106v1","created_at":"2026-07-05T09:15:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03106","created_at":"2026-07-05T09:15:44Z"},{"alias_kind":"pith_short_12","alias_value":"AIVFZDUCUO2H","created_at":"2026-07-05T09:15:44Z"},{"alias_kind":"pith_short_16","alias_value":"AIVFZDUCUO2H6HYC","created_at":"2026-07-05T09:15:44Z"},{"alias_kind":"pith_short_8","alias_value":"AIVFZDUC","created_at":"2026-07-05T09:15:44Z"}],"graph_snapshots":[{"event_id":"sha256:9666a74bac9d665160e66c0705819f2fcfb9d0348df4296c2b3981cf48dcc28c","target":"graph","created_at":"2026-07-05T09:15:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.03106/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a policy iteration algorithm for the infinite-horizon N-player general-sum deterministic linear quadratic dynamic games and compare it to policy gradient methods. We demonstrate that the proposed policy iteration algorithm is distinct from the Gauss-Newton policy gradient method in the N-player game setting, in contrast to the single-player setting where under suitable choice of step size they are equivalent. We illustrate in numerical experiments that the convergence rate of the proposed policy iteration algorithm significantly surpasses that of the Gauss-Newton policy gradient met","authors_text":"Giulio Salizzoni, Maryam Kamgarpour, Tyler H. Summers, Yuxiang Guan","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-04T03:01:21Z","title":"A Policy Iteration Algorithm for N-player General-Sum Linear Quadratic Dynamic Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03106","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:690835edc125b473aff500bd130a72f9d9f620871732082e7ced4320fea9d22b","target":"record","created_at":"2026-07-05T09:15:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"807f88d9a24cf4c475e221e1fcf7802773ef2d04c2a8d7a943212df81beabf27","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-04T03:01:21Z","title_canon_sha256":"fabad8fb7c534884effc6b784540ede914f47db7fba3995519de401e5c0baddb"},"schema_version":"1.0","source":{"id":"2410.03106","kind":"arxiv","version":1}},"canonical_sha256":"022a5c8e82a3b47f1f022db22e89ffcc2844198c56b28aab2a61309479ae5ff3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"022a5c8e82a3b47f1f022db22e89ffcc2844198c56b28aab2a61309479ae5ff3","first_computed_at":"2026-07-05T09:15:44.378508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:15:44.378508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j5c3OfTdrgDUbbclQ0QM+9WS6QL9/OYUJC3RAtQk39MwNi2noJ4z29gLKHM0Lwb4S3itB5k/k7jzd4VxemSaBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:15:44.379042Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.03106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:690835edc125b473aff500bd130a72f9d9f620871732082e7ced4320fea9d22b","sha256:9666a74bac9d665160e66c0705819f2fcfb9d0348df4296c2b3981cf48dcc28c"],"state_sha256":"17a78f106359cd0a13ad6ab28ca0f0b022aaedff298de2d2a5fb98bfbb1500e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7waqkuvjRN4HkA2ArmL9O/G48kQzqTQqi5whud8Nq8CQ77KMYLE+XY9PeZ4W//7GcBmCVC1d+F+/KHdWAxRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T17:30:44.014309Z","bundle_sha256":"e1e39119c0631f5b670f0db1fc1e307551664c2f5c54b48649a14027157e7c5e"}}