{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AFQVAIMDTA4TTUPZNXFHTJSKS7","short_pith_number":"pith:AFQVAIMD","schema_version":"1.0","canonical_sha256":"0161502183983939d1f96dca79a64a97cf3ea62815647c14a7ba15c219049a0b","source":{"kind":"arxiv","id":"1404.0048","version":2},"attestation_state":"computed","paper":{"title":"Compositional Symbolic Models for Networks of Incrementally Stable Control Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Giordano Pola, Maria Domenica Di Benedetto, Pierdomenico Pepe","submitted_at":"2014-03-31T22:05:08Z","abstract_excerpt":"Symbolic models have recently spurred the interest of the research community because they offer a correct-by-design approach to the control of embedded and cyber-physical systems. In this paper we address construction of symbolic models for networks of discrete-time nonlinear control systems. The main result of the paper shows that under some small gain theorem-type conditions, a network of symbolic models can be constructed which approximates a network of incrementally stable control systems in the sense of approximate bisimulation with any desired accuracy. Compositional design of quantizati"},"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":"1404.0048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-31T22:05:08Z","cross_cats_sorted":[],"title_canon_sha256":"891acb3501aa557c2669f468350a3ea2d3aa49d756ca8b36968fbd42125dba85","abstract_canon_sha256":"ce410a351d1ffabf32913caffd194ac07716c9201e8b699c96bf2533b40fc4b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:14.172557Z","signature_b64":"cOpVOs0/Mt/KbZ01O9J6SZ4CcRpdbpexEyXk+XlRDx/sXnkFciT5s7tq7WztbO8vRs9qpOd8dHae2mHdcJz/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0161502183983939d1f96dca79a64a97cf3ea62815647c14a7ba15c219049a0b","last_reissued_at":"2026-05-18T02:45:14.172080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:14.172080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositional Symbolic Models for Networks of Incrementally Stable Control Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Giordano Pola, Maria Domenica Di Benedetto, Pierdomenico Pepe","submitted_at":"2014-03-31T22:05:08Z","abstract_excerpt":"Symbolic models have recently spurred the interest of the research community because they offer a correct-by-design approach to the control of embedded and cyber-physical systems. In this paper we address construction of symbolic models for networks of discrete-time nonlinear control systems. The main result of the paper shows that under some small gain theorem-type conditions, a network of symbolic models can be constructed which approximates a network of incrementally stable control systems in the sense of approximate bisimulation with any desired accuracy. Compositional design of quantizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0048","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.0048","created_at":"2026-05-18T02:45:14.172150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0048v2","created_at":"2026-05-18T02:45:14.172150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0048","created_at":"2026-05-18T02:45:14.172150+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFQVAIMDTA4T","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFQVAIMDTA4TTUPZ","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFQVAIMD","created_at":"2026-05-18T12:28:19.803747+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/AFQVAIMDTA4TTUPZNXFHTJSKS7","json":"https://pith.science/pith/AFQVAIMDTA4TTUPZNXFHTJSKS7.json","graph_json":"https://pith.science/api/pith-number/AFQVAIMDTA4TTUPZNXFHTJSKS7/graph.json","events_json":"https://pith.science/api/pith-number/AFQVAIMDTA4TTUPZNXFHTJSKS7/events.json","paper":"https://pith.science/paper/AFQVAIMD"},"agent_actions":{"view_html":"https://pith.science/pith/AFQVAIMDTA4TTUPZNXFHTJSKS7","download_json":"https://pith.science/pith/AFQVAIMDTA4TTUPZNXFHTJSKS7.json","view_paper":"https://pith.science/paper/AFQVAIMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0048&json=true","fetch_graph":"https://pith.science/api/pith-number/AFQVAIMDTA4TTUPZNXFHTJSKS7/graph.json","fetch_events":"https://pith.science/api/pith-number/AFQVAIMDTA4TTUPZNXFHTJSKS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFQVAIMDTA4TTUPZNXFHTJSKS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFQVAIMDTA4TTUPZNXFHTJSKS7/action/storage_attestation","attest_author":"https://pith.science/pith/AFQVAIMDTA4TTUPZNXFHTJSKS7/action/author_attestation","sign_citation":"https://pith.science/pith/AFQVAIMDTA4TTUPZNXFHTJSKS7/action/citation_signature","submit_replication":"https://pith.science/pith/AFQVAIMDTA4TTUPZNXFHTJSKS7/action/replication_record"}},"created_at":"2026-05-18T02:45:14.172150+00:00","updated_at":"2026-05-18T02:45:14.172150+00:00"}