{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ELQAQH3MYGOVN4ML44JPDSG54Y","short_pith_number":"pith:ELQAQH3M","schema_version":"1.0","canonical_sha256":"22e0081f6cc19d56f18be712f1c8dde60fd8733b760e923fc61d06ad249f9c78","source":{"kind":"arxiv","id":"1410.5165","version":1},"attestation_state":"computed","paper":{"title":"Sparsity Methods for Networked Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Masaaki Nagahara","submitted_at":"2014-10-20T06:44:06Z","abstract_excerpt":"In this presentation, we introduce sparsity methods for networked control systems and show the effectiveness of sparse control. In networked control, efficient data transmission is important since transmission delay and error can critically deteriorate the stability and performance. We will show that this problem is solved by sparse control designed by recent sparse optimization methods."},"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":"1410.5165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-10-20T06:44:06Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4d01208f7c984ab784ded7ed3f29ebf28931798160dda1eb21d7a4881b42ec29","abstract_canon_sha256":"76bc0ab74d17675a3ff5e487059b6fb81b0439259e3bf82962863c89a28460d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:46.686189Z","signature_b64":"FBNLcseFzNJEBIKxoRddr1+1aa3u0Lq7e8Ne5KaheVw+xnGdB7Rjb2TMkBpByB9ik7rFvBgMUh4FD2YlNZ/pDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22e0081f6cc19d56f18be712f1c8dde60fd8733b760e923fc61d06ad249f9c78","last_reissued_at":"2026-05-18T02:39:46.685771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:46.685771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsity Methods for Networked Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Masaaki Nagahara","submitted_at":"2014-10-20T06:44:06Z","abstract_excerpt":"In this presentation, we introduce sparsity methods for networked control systems and show the effectiveness of sparse control. In networked control, efficient data transmission is important since transmission delay and error can critically deteriorate the stability and performance. We will show that this problem is solved by sparse control designed by recent sparse optimization methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5165","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.5165","created_at":"2026-05-18T02:39:46.685835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5165v1","created_at":"2026-05-18T02:39:46.685835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5165","created_at":"2026-05-18T02:39:46.685835+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELQAQH3MYGOV","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELQAQH3MYGOVN4ML","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELQAQH3M","created_at":"2026-05-18T12:28:28.263976+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/ELQAQH3MYGOVN4ML44JPDSG54Y","json":"https://pith.science/pith/ELQAQH3MYGOVN4ML44JPDSG54Y.json","graph_json":"https://pith.science/api/pith-number/ELQAQH3MYGOVN4ML44JPDSG54Y/graph.json","events_json":"https://pith.science/api/pith-number/ELQAQH3MYGOVN4ML44JPDSG54Y/events.json","paper":"https://pith.science/paper/ELQAQH3M"},"agent_actions":{"view_html":"https://pith.science/pith/ELQAQH3MYGOVN4ML44JPDSG54Y","download_json":"https://pith.science/pith/ELQAQH3MYGOVN4ML44JPDSG54Y.json","view_paper":"https://pith.science/paper/ELQAQH3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5165&json=true","fetch_graph":"https://pith.science/api/pith-number/ELQAQH3MYGOVN4ML44JPDSG54Y/graph.json","fetch_events":"https://pith.science/api/pith-number/ELQAQH3MYGOVN4ML44JPDSG54Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELQAQH3MYGOVN4ML44JPDSG54Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELQAQH3MYGOVN4ML44JPDSG54Y/action/storage_attestation","attest_author":"https://pith.science/pith/ELQAQH3MYGOVN4ML44JPDSG54Y/action/author_attestation","sign_citation":"https://pith.science/pith/ELQAQH3MYGOVN4ML44JPDSG54Y/action/citation_signature","submit_replication":"https://pith.science/pith/ELQAQH3MYGOVN4ML44JPDSG54Y/action/replication_record"}},"created_at":"2026-05-18T02:39:46.685835+00:00","updated_at":"2026-05-18T02:39:46.685835+00:00"}