{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OFFF3ZH3L2XPBOTTYUZXZMZQBM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a3ad5d924858346b2fc7cfaa0f66b407050382435b2bb0547899cdf4cd81608c","cross_cats_sorted":["cs.SY","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-27T07:08:15Z","title_canon_sha256":"0d1e9b5691e9658132212c16772a70c772e7a91b142428fc4cf87fac7c4b080d"},"schema_version":"1.0","source":{"id":"1903.11267","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11267","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11267v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11267","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"OFFF3ZH3L2XP","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OFFF3ZH3L2XPBOTT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OFFF3ZH3","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:7188c5ba00847deab3145dafb2c3602ee7c767ac893f30bf0a4c36b27576ceac","target":"graph","created_at":"2026-05-17T23:50:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Typically when designing distributed controllers it is assumed that the state-space model of the plant consists of sparse matrices. However, in the discrete-time setting, if one begins with a continuous-time model, the discretization process annihilates any sparsity in the model. In this work we propose a discretization procedure that maintains the sparsity of the continuous-time model. We show that this discretization out-performs a simple truncation method in terms of its ability to approximate the \"ground truth\" model. Leveraging results from numerical analysis we are also able to upper-bou","authors_text":"James Anderson, Nikolai Matni, Yuxiao Chen","cross_cats":["cs.SY","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-27T07:08:15Z","title":"Sparsity Preserving Discretization With Error Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11267","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:347249613676b97ca7e2b6a1d8530871c3ed72975329175b9dcaaadadc888df1","target":"record","created_at":"2026-05-17T23:50:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a3ad5d924858346b2fc7cfaa0f66b407050382435b2bb0547899cdf4cd81608c","cross_cats_sorted":["cs.SY","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-27T07:08:15Z","title_canon_sha256":"0d1e9b5691e9658132212c16772a70c772e7a91b142428fc4cf87fac7c4b080d"},"schema_version":"1.0","source":{"id":"1903.11267","kind":"arxiv","version":1}},"canonical_sha256":"714a5de4fb5eaef0ba73c5337cb3300b2eec99515e4316b6e1450d6f68be28e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"714a5de4fb5eaef0ba73c5337cb3300b2eec99515e4316b6e1450d6f68be28e6","first_computed_at":"2026-05-17T23:50:03.723733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:03.723733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QRvg14xPDXsfHZGq00/+MjzvkHYfKaOtu2Zpa+LLp+4cyPPygPnVox9HIdPV57AY3XdG7ZI1L31GZ+CSjyf2CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:03.724348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11267","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:347249613676b97ca7e2b6a1d8530871c3ed72975329175b9dcaaadadc888df1","sha256:7188c5ba00847deab3145dafb2c3602ee7c767ac893f30bf0a4c36b27576ceac"],"state_sha256":"61429fde98d0bb195dca0b037222b063dc8776adccf9388c0da483aded1f6e1c"}