{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LC2CLQNHUQ5K3DQO7MTZVUXHV5","short_pith_number":"pith:LC2CLQNH","schema_version":"1.0","canonical_sha256":"58b425c1a7a43aad8e0efb279ad2e7af5d0ef70f2849a6d7b5d992472438306a","source":{"kind":"arxiv","id":"2311.13967","version":3},"attestation_state":"computed","paper":{"title":"Unconstrained learning of networked nonlinear systems via free parametrization of stable interconnected operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Danilo Saccani, Giancarlo Ferrari-Trecate, Leonardo Massai, Luca Furieri","submitted_at":"2023-11-23T12:31:28Z","abstract_excerpt":"This paper characterizes a new parametrization of nonlinear networked incrementally $L_2$-bounded operators in discrete time. The distinctive novelty is that our parametrization is \\emph{free} -- that is, a sparse large-scale operator with bounded incremental $L_2$ gain is obtained for any choice of the real values of our parameters. This property allows one to freely search over optimal parameters via unconstrained gradient descent, enabling direct applications in large-scale optimal control and system identification. Further, we can embed prior knowledge about the interconnection topology an"},"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":"2311.13967","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2023-11-23T12:31:28Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"a1ae163e86eb4b8ab348e8c07e11e026a5d991cd0c8e7da703e764ab32798ed9","abstract_canon_sha256":"94b0d17ecf6b1587842a39b8dcf23235073e442e31dc1c82a5c796e451faf425"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:17.138452Z","signature_b64":"P5j0LWIfdJBoPCy6Wc09qewjij6V8RsNxGiOhKOzuGmYAUPQ6q/OK3C2rC2yRJSQWQ7WRXHGpHzGduHE/AboCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58b425c1a7a43aad8e0efb279ad2e7af5d0ef70f2849a6d7b5d992472438306a","last_reissued_at":"2026-07-05T08:01:17.137992Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:17.137992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unconstrained learning of networked nonlinear systems via free parametrization of stable interconnected operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Danilo Saccani, Giancarlo Ferrari-Trecate, Leonardo Massai, Luca Furieri","submitted_at":"2023-11-23T12:31:28Z","abstract_excerpt":"This paper characterizes a new parametrization of nonlinear networked incrementally $L_2$-bounded operators in discrete time. The distinctive novelty is that our parametrization is \\emph{free} -- that is, a sparse large-scale operator with bounded incremental $L_2$ gain is obtained for any choice of the real values of our parameters. This property allows one to freely search over optimal parameters via unconstrained gradient descent, enabling direct applications in large-scale optimal control and system identification. Further, we can embed prior knowledge about the interconnection topology an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13967","kind":"arxiv","version":3},"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/2311.13967/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":"2311.13967","created_at":"2026-07-05T08:01:17.138047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.13967v3","created_at":"2026-07-05T08:01:17.138047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13967","created_at":"2026-07-05T08:01:17.138047+00:00"},{"alias_kind":"pith_short_12","alias_value":"LC2CLQNHUQ5K","created_at":"2026-07-05T08:01:17.138047+00:00"},{"alias_kind":"pith_short_16","alias_value":"LC2CLQNHUQ5K3DQO","created_at":"2026-07-05T08:01:17.138047+00:00"},{"alias_kind":"pith_short_8","alias_value":"LC2CLQNH","created_at":"2026-07-05T08:01:17.138047+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10096","citing_title":"Neural Port-Hamiltonian Models for Nonlinear Distributed Control: An Unconstrained Parametrization Approach","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LC2CLQNHUQ5K3DQO7MTZVUXHV5","json":"https://pith.science/pith/LC2CLQNHUQ5K3DQO7MTZVUXHV5.json","graph_json":"https://pith.science/api/pith-number/LC2CLQNHUQ5K3DQO7MTZVUXHV5/graph.json","events_json":"https://pith.science/api/pith-number/LC2CLQNHUQ5K3DQO7MTZVUXHV5/events.json","paper":"https://pith.science/paper/LC2CLQNH"},"agent_actions":{"view_html":"https://pith.science/pith/LC2CLQNHUQ5K3DQO7MTZVUXHV5","download_json":"https://pith.science/pith/LC2CLQNHUQ5K3DQO7MTZVUXHV5.json","view_paper":"https://pith.science/paper/LC2CLQNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.13967&json=true","fetch_graph":"https://pith.science/api/pith-number/LC2CLQNHUQ5K3DQO7MTZVUXHV5/graph.json","fetch_events":"https://pith.science/api/pith-number/LC2CLQNHUQ5K3DQO7MTZVUXHV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LC2CLQNHUQ5K3DQO7MTZVUXHV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LC2CLQNHUQ5K3DQO7MTZVUXHV5/action/storage_attestation","attest_author":"https://pith.science/pith/LC2CLQNHUQ5K3DQO7MTZVUXHV5/action/author_attestation","sign_citation":"https://pith.science/pith/LC2CLQNHUQ5K3DQO7MTZVUXHV5/action/citation_signature","submit_replication":"https://pith.science/pith/LC2CLQNHUQ5K3DQO7MTZVUXHV5/action/replication_record"}},"created_at":"2026-07-05T08:01:17.138047+00:00","updated_at":"2026-07-05T08:01:17.138047+00:00"}