{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FCIO5KTRYTB3DMVLSJLP67I34V","short_pith_number":"pith:FCIO5KTR","schema_version":"1.0","canonical_sha256":"2890eeaa71c4c3b1b2ab9256ff7d1be54d8708752ba71d5c534cfebc90b3f74a","source":{"kind":"arxiv","id":"1903.04923","version":4},"attestation_state":"computed","paper":{"title":"Network Identification for Diffusively-Coupled Systems with Minimal Time Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Daniel Zelazo, Miel Sharf","submitted_at":"2019-03-11T17:02:02Z","abstract_excerpt":"The theory of network identification, namely identifying the (weighted) interaction topology among a known number of agents, has been widely developed for linear agents. However, the theory for nonlinear agents using probing inputs is far less developed, relying on dynamics linearization, and thus cannot be applied to networks with non-smooth or discontinuous dynamics. We use global convergence properties of the network, which can be assured using passivity theory, to present a network identification method for nonlinear agents. We do so by linearizing the steady-state equations rather than th"},"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.04923","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-03-11T17:02:02Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"30d46ba238a2b92d18ce125ae50da9ef3fc583cb2665b33da25addaf65834482","abstract_canon_sha256":"cab15027b4c84d04e04e2d7d801da54871632e3e345bf7a2efaa37dbd78f4298"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:14:12.546774Z","signature_b64":"hk6l7kOg9kXEsQfiGwbVzKbeDgiyQvMAn9nfHX2nIfCFMwV8o59S19WfeRBc1x/tgZLnlgCglVrI6vpN2MTfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2890eeaa71c4c3b1b2ab9256ff7d1be54d8708752ba71d5c534cfebc90b3f74a","last_reissued_at":"2026-06-04T20:14:12.546352Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:14:12.546352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Identification for Diffusively-Coupled Systems with Minimal Time Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Daniel Zelazo, Miel Sharf","submitted_at":"2019-03-11T17:02:02Z","abstract_excerpt":"The theory of network identification, namely identifying the (weighted) interaction topology among a known number of agents, has been widely developed for linear agents. However, the theory for nonlinear agents using probing inputs is far less developed, relying on dynamics linearization, and thus cannot be applied to networks with non-smooth or discontinuous dynamics. We use global convergence properties of the network, which can be assured using passivity theory, to present a network identification method for nonlinear agents. We do so by linearizing the steady-state equations rather than th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04923","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/1903.04923/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.04923","created_at":"2026-06-04T20:14:12.546414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04923v4","created_at":"2026-06-04T20:14:12.546414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04923","created_at":"2026-06-04T20:14:12.546414+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCIO5KTRYTB3","created_at":"2026-06-04T20:14:12.546414+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCIO5KTRYTB3DMVL","created_at":"2026-06-04T20:14:12.546414+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCIO5KTR","created_at":"2026-06-04T20:14:12.546414+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FCIO5KTRYTB3DMVLSJLP67I34V","json":"https://pith.science/pith/FCIO5KTRYTB3DMVLSJLP67I34V.json","graph_json":"https://pith.science/api/pith-number/FCIO5KTRYTB3DMVLSJLP67I34V/graph.json","events_json":"https://pith.science/api/pith-number/FCIO5KTRYTB3DMVLSJLP67I34V/events.json","paper":"https://pith.science/paper/FCIO5KTR"},"agent_actions":{"view_html":"https://pith.science/pith/FCIO5KTRYTB3DMVLSJLP67I34V","download_json":"https://pith.science/pith/FCIO5KTRYTB3DMVLSJLP67I34V.json","view_paper":"https://pith.science/paper/FCIO5KTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04923&json=true","fetch_graph":"https://pith.science/api/pith-number/FCIO5KTRYTB3DMVLSJLP67I34V/graph.json","fetch_events":"https://pith.science/api/pith-number/FCIO5KTRYTB3DMVLSJLP67I34V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCIO5KTRYTB3DMVLSJLP67I34V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCIO5KTRYTB3DMVLSJLP67I34V/action/storage_attestation","attest_author":"https://pith.science/pith/FCIO5KTRYTB3DMVLSJLP67I34V/action/author_attestation","sign_citation":"https://pith.science/pith/FCIO5KTRYTB3DMVLSJLP67I34V/action/citation_signature","submit_replication":"https://pith.science/pith/FCIO5KTRYTB3DMVLSJLP67I34V/action/replication_record"}},"created_at":"2026-06-04T20:14:12.546414+00:00","updated_at":"2026-06-04T20:14:12.546414+00:00"}