{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5MQDEH7LSJ274IV3ZKMTEH33TG","short_pith_number":"pith:5MQDEH7L","schema_version":"1.0","canonical_sha256":"eb20321feb9275fe22bbca99321f7b99a0ca530589bf8554d71adea69a363b9a","source":{"kind":"arxiv","id":"1308.0799","version":1},"attestation_state":"computed","paper":{"title":"Compressive Sampling for Remote Control Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"cs.SY","authors_text":"Kazunori Hayashi, Masaaki Nagahara, Takahiro Matsuda","submitted_at":"2013-08-04T12:11:57Z","abstract_excerpt":"In remote control, efficient compression or representation of control signals is essential to send them through rate-limited channels. For this purpose, we propose an approach of sparse control signal representation using the compressive sampling technique. The problem of obtaining sparse representation is formulated by cardinality-constrained L2 optimization of the control performance, which is reducible to L1-L2 optimization. The low rate random sampling employed in the proposed method based on the compressive sampling, in addition to the fact that the L1-L2 optimization can be effectively s"},"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":"1308.0799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-08-04T12:11:57Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"b951ef60b4c89372109e897c6f4f4660ec1d4e7907752ec1d95fcd7e07ab9975","abstract_canon_sha256":"98982b964f0399808fca6b41d45dbca4e7209a61fedd5e96b805a3396efc67db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:24.104069Z","signature_b64":"OeEvB5pqggKyR7l2aUqO1Q85Ja/tImz9dvgo3f5+chH3ic1lHZmHue9QkLZO9u1NgbaoD8e2ureoiZxXxvLXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb20321feb9275fe22bbca99321f7b99a0ca530589bf8554d71adea69a363b9a","last_reissued_at":"2026-05-18T01:48:24.103270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:24.103270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressive Sampling for Remote Control Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"cs.SY","authors_text":"Kazunori Hayashi, Masaaki Nagahara, Takahiro Matsuda","submitted_at":"2013-08-04T12:11:57Z","abstract_excerpt":"In remote control, efficient compression or representation of control signals is essential to send them through rate-limited channels. For this purpose, we propose an approach of sparse control signal representation using the compressive sampling technique. The problem of obtaining sparse representation is formulated by cardinality-constrained L2 optimization of the control performance, which is reducible to L1-L2 optimization. The low rate random sampling employed in the proposed method based on the compressive sampling, in addition to the fact that the L1-L2 optimization can be effectively s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0799","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":"1308.0799","created_at":"2026-05-18T01:48:24.103425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0799v1","created_at":"2026-05-18T01:48:24.103425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0799","created_at":"2026-05-18T01:48:24.103425+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MQDEH7LSJ27","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MQDEH7LSJ274IV3","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MQDEH7L","created_at":"2026-05-18T12:27:34.582898+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/5MQDEH7LSJ274IV3ZKMTEH33TG","json":"https://pith.science/pith/5MQDEH7LSJ274IV3ZKMTEH33TG.json","graph_json":"https://pith.science/api/pith-number/5MQDEH7LSJ274IV3ZKMTEH33TG/graph.json","events_json":"https://pith.science/api/pith-number/5MQDEH7LSJ274IV3ZKMTEH33TG/events.json","paper":"https://pith.science/paper/5MQDEH7L"},"agent_actions":{"view_html":"https://pith.science/pith/5MQDEH7LSJ274IV3ZKMTEH33TG","download_json":"https://pith.science/pith/5MQDEH7LSJ274IV3ZKMTEH33TG.json","view_paper":"https://pith.science/paper/5MQDEH7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0799&json=true","fetch_graph":"https://pith.science/api/pith-number/5MQDEH7LSJ274IV3ZKMTEH33TG/graph.json","fetch_events":"https://pith.science/api/pith-number/5MQDEH7LSJ274IV3ZKMTEH33TG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MQDEH7LSJ274IV3ZKMTEH33TG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MQDEH7LSJ274IV3ZKMTEH33TG/action/storage_attestation","attest_author":"https://pith.science/pith/5MQDEH7LSJ274IV3ZKMTEH33TG/action/author_attestation","sign_citation":"https://pith.science/pith/5MQDEH7LSJ274IV3ZKMTEH33TG/action/citation_signature","submit_replication":"https://pith.science/pith/5MQDEH7LSJ274IV3ZKMTEH33TG/action/replication_record"}},"created_at":"2026-05-18T01:48:24.103425+00:00","updated_at":"2026-05-18T01:48:24.103425+00:00"}