{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3RN5TYJMMG7PTIKH44G5PRUWUN","short_pith_number":"pith:3RN5TYJM","canonical_record":{"source":{"id":"1907.11414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-26T07:52:13Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"ad970d35c27445a01332f9c3c86f21fc634981a9db44dba9da1f56a0604ea560","abstract_canon_sha256":"83cbc6ea6ef1c4903c6f7ae6f2710b888389df772147e2c3173f58dc609ee241"},"schema_version":"1.0"},"canonical_sha256":"dc5bd9e12c61bef9a147e70dd7c696a37cecc2c0e042416136298fb35d972d9a","source":{"kind":"arxiv","id":"1907.11414","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11414","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11414v1","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11414","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"3RN5TYJMMG7P","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3RN5TYJMMG7PTIKH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3RN5TYJM","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3RN5TYJMMG7PTIKH44G5PRUWUN","target":"record","payload":{"canonical_record":{"source":{"id":"1907.11414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-26T07:52:13Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"ad970d35c27445a01332f9c3c86f21fc634981a9db44dba9da1f56a0604ea560","abstract_canon_sha256":"83cbc6ea6ef1c4903c6f7ae6f2710b888389df772147e2c3173f58dc609ee241"},"schema_version":"1.0"},"canonical_sha256":"dc5bd9e12c61bef9a147e70dd7c696a37cecc2c0e042416136298fb35d972d9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:29.147214Z","signature_b64":"fdcQafc0VDm+2PLouCTc5UUgUor7ZuiDXGS6DchFItnzQXr/KR0Ri1OnD4Wc13kdAJPAZLddTvrUOcKUQ5VWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc5bd9e12c61bef9a147e70dd7c696a37cecc2c0e042416136298fb35d972d9a","last_reissued_at":"2026-05-17T23:39:29.146576Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:29.146576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.11414","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-05-17T23:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qRxPtiDAkYvMsLH7J+EmGEJCnbGyX4mI0pC4I4IpkBKNRkmWR0ZN6YOdEG3/GkFe+WTtvIHNH8B+gibDJE3OAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:40:58.858381Z"},"content_sha256":"aaae70290b0320eb6237e23f96d6137c7da857eae6f01d1e3bb28da1741faf4c","schema_version":"1.0","event_id":"sha256:aaae70290b0320eb6237e23f96d6137c7da857eae6f01d1e3bb28da1741faf4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3RN5TYJMMG7PTIKH44G5PRUWUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust On-Line ADP-based Solution of a Class of Hierarchical Nonlinear Differential Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Abolhassan Razminia, Hamed Kebriaei, Mohammad Javad Yazdanpanah, Mohammad reza Satouri","submitted_at":"2019-07-26T07:52:13Z","abstract_excerpt":"In this paper, a hierarchical one-leader-multi-followers game for a class of continuous-time nonlinear systems with disturbance is investigated by a novel policy iteration reinforcement learning technique in which, the game model consists both of the zero-sum and nonzero-sum games, simultaneously. An adaptive dynamic programming (ADP), method is developed to achieve optimal control strategy under the worst case of disturbance. This algorithm reduces the number of neural networks which are used for estimation for about thirty percent. The proposed algorithm uses neural networks to estimate valu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11414","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":""},"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-05-17T23:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SIer4Eo+Zzfz1bkeUFcX5+j8Ifan4CvCfRoLV+bSCPhoZ/YSgMxTncDJaSeo1k32n4tANUEmj/2efFTmm8/bBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:40:58.858754Z"},"content_sha256":"560ab1c4f91b006e94600ccd30cf83739c4058ccd972e1cdaac1d079c0143187","schema_version":"1.0","event_id":"sha256:560ab1c4f91b006e94600ccd30cf83739c4058ccd972e1cdaac1d079c0143187"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RN5TYJMMG7PTIKH44G5PRUWUN/bundle.json","state_url":"https://pith.science/pith/3RN5TYJMMG7PTIKH44G5PRUWUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RN5TYJMMG7PTIKH44G5PRUWUN/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-05-30T08:40:58Z","links":{"resolver":"https://pith.science/pith/3RN5TYJMMG7PTIKH44G5PRUWUN","bundle":"https://pith.science/pith/3RN5TYJMMG7PTIKH44G5PRUWUN/bundle.json","state":"https://pith.science/pith/3RN5TYJMMG7PTIKH44G5PRUWUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RN5TYJMMG7PTIKH44G5PRUWUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3RN5TYJMMG7PTIKH44G5PRUWUN","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":"83cbc6ea6ef1c4903c6f7ae6f2710b888389df772147e2c3173f58dc609ee241","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-26T07:52:13Z","title_canon_sha256":"ad970d35c27445a01332f9c3c86f21fc634981a9db44dba9da1f56a0604ea560"},"schema_version":"1.0","source":{"id":"1907.11414","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11414","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11414v1","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11414","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"3RN5TYJMMG7P","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3RN5TYJMMG7PTIKH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3RN5TYJM","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:560ab1c4f91b006e94600ccd30cf83739c4058ccd972e1cdaac1d079c0143187","target":"graph","created_at":"2026-05-17T23:39:29Z","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"},"paper":{"abstract_excerpt":"In this paper, a hierarchical one-leader-multi-followers game for a class of continuous-time nonlinear systems with disturbance is investigated by a novel policy iteration reinforcement learning technique in which, the game model consists both of the zero-sum and nonzero-sum games, simultaneously. An adaptive dynamic programming (ADP), method is developed to achieve optimal control strategy under the worst case of disturbance. This algorithm reduces the number of neural networks which are used for estimation for about thirty percent. The proposed algorithm uses neural networks to estimate valu","authors_text":"Abolhassan Razminia, Hamed Kebriaei, Mohammad Javad Yazdanpanah, Mohammad reza Satouri","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-26T07:52:13Z","title":"Robust On-Line ADP-based Solution of a Class of Hierarchical Nonlinear Differential Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11414","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:aaae70290b0320eb6237e23f96d6137c7da857eae6f01d1e3bb28da1741faf4c","target":"record","created_at":"2026-05-17T23:39:29Z","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":"83cbc6ea6ef1c4903c6f7ae6f2710b888389df772147e2c3173f58dc609ee241","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-26T07:52:13Z","title_canon_sha256":"ad970d35c27445a01332f9c3c86f21fc634981a9db44dba9da1f56a0604ea560"},"schema_version":"1.0","source":{"id":"1907.11414","kind":"arxiv","version":1}},"canonical_sha256":"dc5bd9e12c61bef9a147e70dd7c696a37cecc2c0e042416136298fb35d972d9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc5bd9e12c61bef9a147e70dd7c696a37cecc2c0e042416136298fb35d972d9a","first_computed_at":"2026-05-17T23:39:29.146576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:29.146576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fdcQafc0VDm+2PLouCTc5UUgUor7ZuiDXGS6DchFItnzQXr/KR0Ri1OnD4Wc13kdAJPAZLddTvrUOcKUQ5VWCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:29.147214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11414","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaae70290b0320eb6237e23f96d6137c7da857eae6f01d1e3bb28da1741faf4c","sha256:560ab1c4f91b006e94600ccd30cf83739c4058ccd972e1cdaac1d079c0143187"],"state_sha256":"b45dc3a31f90a40064b0313c6738a4f5fbde321c456bdc630d8d9669b6eeb045"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LSwTLYK2NOeUxR3SMo4vRiCRL/AsAvWMpvj+su6vOkDg5K8gtbWPSIvx3G7vhuqB2AIL8INiDwP6J1af//9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:40:58.860827Z","bundle_sha256":"fe165a9fcfe81961d7ef55da7dcff18d629d5ce693873a373b3b2b77f9ae2a90"}}