{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OFFF3ZH3L2XPBOTTYUZXZMZQBM","short_pith_number":"pith:OFFF3ZH3","canonical_record":{"source":{"id":"1903.11267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-27T07:08:15Z","cross_cats_sorted":["cs.SY","math.NA"],"title_canon_sha256":"0d1e9b5691e9658132212c16772a70c772e7a91b142428fc4cf87fac7c4b080d","abstract_canon_sha256":"a3ad5d924858346b2fc7cfaa0f66b407050382435b2bb0547899cdf4cd81608c"},"schema_version":"1.0"},"canonical_sha256":"714a5de4fb5eaef0ba73c5337cb3300b2eec99515e4316b6e1450d6f68be28e6","source":{"kind":"arxiv","id":"1903.11267","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OFFF3ZH3L2XPBOTTYUZXZMZQBM","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-27T07:08:15Z","cross_cats_sorted":["cs.SY","math.NA"],"title_canon_sha256":"0d1e9b5691e9658132212c16772a70c772e7a91b142428fc4cf87fac7c4b080d","abstract_canon_sha256":"a3ad5d924858346b2fc7cfaa0f66b407050382435b2bb0547899cdf4cd81608c"},"schema_version":"1.0"},"canonical_sha256":"714a5de4fb5eaef0ba73c5337cb3300b2eec99515e4316b6e1450d6f68be28e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:03.724348Z","signature_b64":"QRvg14xPDXsfHZGq00/+MjzvkHYfKaOtu2Zpa+LLp+4cyPPygPnVox9HIdPV57AY3XdG7ZI1L31GZ+CSjyf2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"714a5de4fb5eaef0ba73c5337cb3300b2eec99515e4316b6e1450d6f68be28e6","last_reissued_at":"2026-05-17T23:50:03.723733Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:03.723733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11267","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UoRo9pywwugN/8qdo/8R9nsrqMNQif6XNX4qYTCmM5UL4WmlpBq3Nuxc7qhPdR2VSa4LwqZwruYcT0We9PhvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:47:42.036191Z"},"content_sha256":"347249613676b97ca7e2b6a1d8530871c3ed72975329175b9dcaaadadc888df1","schema_version":"1.0","event_id":"sha256:347249613676b97ca7e2b6a1d8530871c3ed72975329175b9dcaaadadc888df1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OFFF3ZH3L2XPBOTTYUZXZMZQBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsity Preserving Discretization With Error Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.NA"],"primary_cat":"math.OC","authors_text":"James Anderson, Nikolai Matni, Yuxiao Chen","submitted_at":"2019-03-27T07:08:15Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11267","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5xS3NeJ5azBHg9GUzC0juK6P643ct+aH99JdkOJSfcgUkQlSJi4u5jksNXGO6jYzijFgGLgKq/B4k5JNzYpkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:47:42.036557Z"},"content_sha256":"7188c5ba00847deab3145dafb2c3602ee7c767ac893f30bf0a4c36b27576ceac","schema_version":"1.0","event_id":"sha256:7188c5ba00847deab3145dafb2c3602ee7c767ac893f30bf0a4c36b27576ceac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFFF3ZH3L2XPBOTTYUZXZMZQBM/bundle.json","state_url":"https://pith.science/pith/OFFF3ZH3L2XPBOTTYUZXZMZQBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFFF3ZH3L2XPBOTTYUZXZMZQBM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T13:47:42Z","links":{"resolver":"https://pith.science/pith/OFFF3ZH3L2XPBOTTYUZXZMZQBM","bundle":"https://pith.science/pith/OFFF3ZH3L2XPBOTTYUZXZMZQBM/bundle.json","state":"https://pith.science/pith/OFFF3ZH3L2XPBOTTYUZXZMZQBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFFF3ZH3L2XPBOTTYUZXZMZQBM/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImRoZdijdcaPVdigzXZc6M0qvDh/EU9LFVcZMIhWlogoKhXtZy6bZFjrHED5+788k3Zc24LTHwTq/OTp2ixYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:47:42.038494Z","bundle_sha256":"5e53653337c58f914e5f2b30225747306d0278fbfccfa0880187faadd8192510"}}