{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:URLCOVY3KMMB3J6OOWOMZPC5L5","short_pith_number":"pith:URLCOVY3","schema_version":"1.0","canonical_sha256":"a45627571b53181da7ce759cccbc5d5f51210920c5fdfbf15697809cda78349c","source":{"kind":"arxiv","id":"1903.02587","version":1},"attestation_state":"computed","paper":{"title":"Dynamic NE Seeking for Multi-Integrator Networked Agents with Disturbance Rejection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.DS"],"primary_cat":"math.OC","authors_text":"Andrew R Romano, Lacra Pavel","submitted_at":"2019-03-06T19:22:15Z","abstract_excerpt":"In this paper, we consider game problems played by (multi)-integrator agents, subject to external disturbances. We propose Nash equilibrium seeking dynamics based on gradient-play, augmented with a dynamic internal-model based component, which is a reduced-order observer of the disturbance. We consider single-, double- and extensions to multi-integrator agents, in a partial-information setting, where agents have only partial knowledge on the others' decisions over a network. The lack of global information is offset by each agent maintaining an estimate of the others' states, based on local com"},"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":"1903.02587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-06T19:22:15Z","cross_cats_sorted":["cs.SY","eess.SY","math.DS"],"title_canon_sha256":"ea51ab8c9deb544eee7511db31177a72d662dba48f2fbd817a156f2c83c2f84a","abstract_canon_sha256":"4d6c9042a7152c70105d6aa965061c5e581f90273ca5ef7940ade47d73e0e00f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:13:58.784801Z","signature_b64":"dYJ+oF31WJsLLwEVxfcA32fhVndL+3TVFaDQVpgccRr8m8a60n6uHDI0AxyNyHEsga4DjOYOnr6TrgHguQ7dBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a45627571b53181da7ce759cccbc5d5f51210920c5fdfbf15697809cda78349c","last_reissued_at":"2026-06-04T20:13:58.783899Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:13:58.783899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic NE Seeking for Multi-Integrator Networked Agents with Disturbance Rejection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.DS"],"primary_cat":"math.OC","authors_text":"Andrew R Romano, Lacra Pavel","submitted_at":"2019-03-06T19:22:15Z","abstract_excerpt":"In this paper, we consider game problems played by (multi)-integrator agents, subject to external disturbances. We propose Nash equilibrium seeking dynamics based on gradient-play, augmented with a dynamic internal-model based component, which is a reduced-order observer of the disturbance. We consider single-, double- and extensions to multi-integrator agents, in a partial-information setting, where agents have only partial knowledge on the others' decisions over a network. The lack of global information is offset by each agent maintaining an estimate of the others' states, based on local com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02587","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/1903.02587/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":"1903.02587","created_at":"2026-06-04T20:13:58.784011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02587v1","created_at":"2026-06-04T20:13:58.784011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02587","created_at":"2026-06-04T20:13:58.784011+00:00"},{"alias_kind":"pith_short_12","alias_value":"URLCOVY3KMMB","created_at":"2026-06-04T20:13:58.784011+00:00"},{"alias_kind":"pith_short_16","alias_value":"URLCOVY3KMMB3J6O","created_at":"2026-06-04T20:13:58.784011+00:00"},{"alias_kind":"pith_short_8","alias_value":"URLCOVY3","created_at":"2026-06-04T20:13:58.784011+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.03034","citing_title":"Stable Agentic Control: Tool-Mediated LLM Architecture for Autonomous Cyber Defense","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/URLCOVY3KMMB3J6OOWOMZPC5L5","json":"https://pith.science/pith/URLCOVY3KMMB3J6OOWOMZPC5L5.json","graph_json":"https://pith.science/api/pith-number/URLCOVY3KMMB3J6OOWOMZPC5L5/graph.json","events_json":"https://pith.science/api/pith-number/URLCOVY3KMMB3J6OOWOMZPC5L5/events.json","paper":"https://pith.science/paper/URLCOVY3"},"agent_actions":{"view_html":"https://pith.science/pith/URLCOVY3KMMB3J6OOWOMZPC5L5","download_json":"https://pith.science/pith/URLCOVY3KMMB3J6OOWOMZPC5L5.json","view_paper":"https://pith.science/paper/URLCOVY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02587&json=true","fetch_graph":"https://pith.science/api/pith-number/URLCOVY3KMMB3J6OOWOMZPC5L5/graph.json","fetch_events":"https://pith.science/api/pith-number/URLCOVY3KMMB3J6OOWOMZPC5L5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URLCOVY3KMMB3J6OOWOMZPC5L5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URLCOVY3KMMB3J6OOWOMZPC5L5/action/storage_attestation","attest_author":"https://pith.science/pith/URLCOVY3KMMB3J6OOWOMZPC5L5/action/author_attestation","sign_citation":"https://pith.science/pith/URLCOVY3KMMB3J6OOWOMZPC5L5/action/citation_signature","submit_replication":"https://pith.science/pith/URLCOVY3KMMB3J6OOWOMZPC5L5/action/replication_record"}},"created_at":"2026-06-04T20:13:58.784011+00:00","updated_at":"2026-06-04T20:13:58.784011+00:00"}