{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FEVNYUU45LUHDYTTFFHQC4WA2V","short_pith_number":"pith:FEVNYUU4","schema_version":"1.0","canonical_sha256":"292adc529ceae871e273294f0172c0d5780f115e20b950ed726c4a9778114958","source":{"kind":"arxiv","id":"2105.02423","version":1},"attestation_state":"computed","paper":{"title":"Attack-Resilient Distributed Convex Optimization of Linear Multi-Agent Systems Against Malicious Cyber-Attacks over Random Digraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Guoqiang Hu, Zhi Feng","submitted_at":"2021-05-06T03:37:52Z","abstract_excerpt":"This paper addresses a resilient exponential distributed convex optimization problem for a heterogeneous linear multi-agent system under Denial-of-Service (DoS) attacks over random digraphs. The random digraphs are caused by unreliable networks and the DoS attacks, allowed to occur aperiodically, refer to an interruption of the communication channels carried out by the intelligent adversaries. In contrast to many existing distributed convex optimization works over a prefect communication network, the global optimal solution might not be sought under the adverse influences that result in perfor"},"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":"2105.02423","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-06T03:37:52Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"39239d2b6b7531b245dd1e21ff1b4277d4072be594ce38a2e4448dbbb1657e4e","abstract_canon_sha256":"585f3d321615841fecbc746d975511e4cae8489a2409d1e662256636210acad2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:38:01.132529Z","signature_b64":"k9cUuamkXTiipzdk57wdQE9ShgZ5pzq288gNtLKfqQTlsbn6kYHeqNkIcDEG/GVaHDDaKznlDoqUmWo82bDeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"292adc529ceae871e273294f0172c0d5780f115e20b950ed726c4a9778114958","last_reissued_at":"2026-07-05T02:38:01.132133Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:38:01.132133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Attack-Resilient Distributed Convex Optimization of Linear Multi-Agent Systems Against Malicious Cyber-Attacks over Random Digraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Guoqiang Hu, Zhi Feng","submitted_at":"2021-05-06T03:37:52Z","abstract_excerpt":"This paper addresses a resilient exponential distributed convex optimization problem for a heterogeneous linear multi-agent system under Denial-of-Service (DoS) attacks over random digraphs. The random digraphs are caused by unreliable networks and the DoS attacks, allowed to occur aperiodically, refer to an interruption of the communication channels carried out by the intelligent adversaries. In contrast to many existing distributed convex optimization works over a prefect communication network, the global optimal solution might not be sought under the adverse influences that result in perfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.02423","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/2105.02423/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":"2105.02423","created_at":"2026-07-05T02:38:01.132188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.02423v1","created_at":"2026-07-05T02:38:01.132188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.02423","created_at":"2026-07-05T02:38:01.132188+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEVNYUU45LUH","created_at":"2026-07-05T02:38:01.132188+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEVNYUU45LUHDYTT","created_at":"2026-07-05T02:38:01.132188+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEVNYUU4","created_at":"2026-07-05T02:38:01.132188+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.17976","citing_title":"KoopAGRU: A Koopman-based Anomaly Detection in Time-Series using Gated Recurrent Units","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FEVNYUU45LUHDYTTFFHQC4WA2V","json":"https://pith.science/pith/FEVNYUU45LUHDYTTFFHQC4WA2V.json","graph_json":"https://pith.science/api/pith-number/FEVNYUU45LUHDYTTFFHQC4WA2V/graph.json","events_json":"https://pith.science/api/pith-number/FEVNYUU45LUHDYTTFFHQC4WA2V/events.json","paper":"https://pith.science/paper/FEVNYUU4"},"agent_actions":{"view_html":"https://pith.science/pith/FEVNYUU45LUHDYTTFFHQC4WA2V","download_json":"https://pith.science/pith/FEVNYUU45LUHDYTTFFHQC4WA2V.json","view_paper":"https://pith.science/paper/FEVNYUU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.02423&json=true","fetch_graph":"https://pith.science/api/pith-number/FEVNYUU45LUHDYTTFFHQC4WA2V/graph.json","fetch_events":"https://pith.science/api/pith-number/FEVNYUU45LUHDYTTFFHQC4WA2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEVNYUU45LUHDYTTFFHQC4WA2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEVNYUU45LUHDYTTFFHQC4WA2V/action/storage_attestation","attest_author":"https://pith.science/pith/FEVNYUU45LUHDYTTFFHQC4WA2V/action/author_attestation","sign_citation":"https://pith.science/pith/FEVNYUU45LUHDYTTFFHQC4WA2V/action/citation_signature","submit_replication":"https://pith.science/pith/FEVNYUU45LUHDYTTFFHQC4WA2V/action/replication_record"}},"created_at":"2026-07-05T02:38:01.132188+00:00","updated_at":"2026-07-05T02:38:01.132188+00:00"}