{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U736YREQAUH2KMIQXXW5PKLYK5","short_pith_number":"pith:U736YREQ","canonical_record":{"source":{"id":"1709.09856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-28T09:06:06Z","cross_cats_sorted":[],"title_canon_sha256":"a24530f6134bfa10ec92283a9bbce7f99f0544fc69c0a300fff2b61723b0d9ab","abstract_canon_sha256":"a781d5b6f4abbf60a38a5bb71ecf375dab07b1c7e58f920b3fff99fa348e0e9a"},"schema_version":"1.0"},"canonical_sha256":"a7f7ec4490050fa53110bdedd7a978577fa506a43173a64d35009cbf5ecf76d4","source":{"kind":"arxiv","id":"1709.09856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09856","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09856v1","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09856","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"U736YREQAUH2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U736YREQAUH2KMIQ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U736YREQ","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U736YREQAUH2KMIQXXW5PKLYK5","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-28T09:06:06Z","cross_cats_sorted":[],"title_canon_sha256":"a24530f6134bfa10ec92283a9bbce7f99f0544fc69c0a300fff2b61723b0d9ab","abstract_canon_sha256":"a781d5b6f4abbf60a38a5bb71ecf375dab07b1c7e58f920b3fff99fa348e0e9a"},"schema_version":"1.0"},"canonical_sha256":"a7f7ec4490050fa53110bdedd7a978577fa506a43173a64d35009cbf5ecf76d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:06.487415Z","signature_b64":"TcgenF/Nu2QmpiDba7KqNPK0bxAinKnDEm4NaItQoKcd3fDRmd8/diRAq3RMl5FGN3XXxO+utOU+UGrwSsTzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7f7ec4490050fa53110bdedd7a978577fa506a43173a64d35009cbf5ecf76d4","last_reissued_at":"2026-05-18T00:34:06.486752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:06.486752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09856","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-18T00:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUVxQ9KIIr5/VnMiYLXA9fmoXOX92F8ZU2sbDPFE0vi2hCCsSG2rKVS4UU6opyVFKA452jjC3kCO57o32sxxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:31:55.790266Z"},"content_sha256":"ccdd82f529f56f969d45b6cc35297a46c62bb608f7912b30a17cce4f23242046","schema_version":"1.0","event_id":"sha256:ccdd82f529f56f969d45b6cc35297a46c62bb608f7912b30a17cce4f23242046"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U736YREQAUH2KMIQXXW5PKLYK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsity-Promoting Iterative Learning Control for Resource-Constrained Control Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Burak Demirel, Daniel E. Quevedo, Euhanna Ghadimi","submitted_at":"2017-09-28T09:06:06Z","abstract_excerpt":"We propose novel iterative learning control algorithms to track a reference trajectory in resource-constrained control systems. In many applications, there are constraints on the number of control actions, delivered to the actuator from the controller, due to the limited bandwidth of communication channels or battery-operated sensors and actuators. We devise iterative learning techniques that create sparse control sequences with reduced communication and actuation instances while providing sensible reference tracking precision. Numerical simulations are provided to demonstrate the effectivenes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09856","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-18T00:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05A5Hib4qOPY1aQmDPyFwHq7I32ixdAe9YQUvErvK3O75cRMo4CEeNDf8vSLMDJ+k4y+rf39ZMp9dRzRGn/RBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:31:55.790635Z"},"content_sha256":"8ac43810ca2d8ed3f1afc3ec08eb715c4b3d0a24d03e47751edb7dda53273579","schema_version":"1.0","event_id":"sha256:8ac43810ca2d8ed3f1afc3ec08eb715c4b3d0a24d03e47751edb7dda53273579"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U736YREQAUH2KMIQXXW5PKLYK5/bundle.json","state_url":"https://pith.science/pith/U736YREQAUH2KMIQXXW5PKLYK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U736YREQAUH2KMIQXXW5PKLYK5/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-07-01T12:31:55Z","links":{"resolver":"https://pith.science/pith/U736YREQAUH2KMIQXXW5PKLYK5","bundle":"https://pith.science/pith/U736YREQAUH2KMIQXXW5PKLYK5/bundle.json","state":"https://pith.science/pith/U736YREQAUH2KMIQXXW5PKLYK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U736YREQAUH2KMIQXXW5PKLYK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U736YREQAUH2KMIQXXW5PKLYK5","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":"a781d5b6f4abbf60a38a5bb71ecf375dab07b1c7e58f920b3fff99fa348e0e9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-28T09:06:06Z","title_canon_sha256":"a24530f6134bfa10ec92283a9bbce7f99f0544fc69c0a300fff2b61723b0d9ab"},"schema_version":"1.0","source":{"id":"1709.09856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09856","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09856v1","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09856","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"U736YREQAUH2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U736YREQAUH2KMIQ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U736YREQ","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:8ac43810ca2d8ed3f1afc3ec08eb715c4b3d0a24d03e47751edb7dda53273579","target":"graph","created_at":"2026-05-18T00:34:06Z","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":"We propose novel iterative learning control algorithms to track a reference trajectory in resource-constrained control systems. In many applications, there are constraints on the number of control actions, delivered to the actuator from the controller, due to the limited bandwidth of communication channels or battery-operated sensors and actuators. We devise iterative learning techniques that create sparse control sequences with reduced communication and actuation instances while providing sensible reference tracking precision. Numerical simulations are provided to demonstrate the effectivenes","authors_text":"Burak Demirel, Daniel E. Quevedo, Euhanna Ghadimi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-28T09:06:06Z","title":"Sparsity-Promoting Iterative Learning Control for Resource-Constrained Control Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09856","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:ccdd82f529f56f969d45b6cc35297a46c62bb608f7912b30a17cce4f23242046","target":"record","created_at":"2026-05-18T00:34:06Z","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":"a781d5b6f4abbf60a38a5bb71ecf375dab07b1c7e58f920b3fff99fa348e0e9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-28T09:06:06Z","title_canon_sha256":"a24530f6134bfa10ec92283a9bbce7f99f0544fc69c0a300fff2b61723b0d9ab"},"schema_version":"1.0","source":{"id":"1709.09856","kind":"arxiv","version":1}},"canonical_sha256":"a7f7ec4490050fa53110bdedd7a978577fa506a43173a64d35009cbf5ecf76d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7f7ec4490050fa53110bdedd7a978577fa506a43173a64d35009cbf5ecf76d4","first_computed_at":"2026-05-18T00:34:06.486752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:06.486752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TcgenF/Nu2QmpiDba7KqNPK0bxAinKnDEm4NaItQoKcd3fDRmd8/diRAq3RMl5FGN3XXxO+utOU+UGrwSsTzBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:06.487415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccdd82f529f56f969d45b6cc35297a46c62bb608f7912b30a17cce4f23242046","sha256:8ac43810ca2d8ed3f1afc3ec08eb715c4b3d0a24d03e47751edb7dda53273579"],"state_sha256":"f7d0f2fdec5e2443ef080681f8d4ceae02db88e9ad6f2918ea745c73109b6233"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OSoHhKvD6FVnxVnx3Vx+oLO/VdYrokDb0LAqgIF05tCyFsWF/qwc2XzHAVveOyPTwUnpBAiA3FOtQQhV1TjHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T12:31:55.792663Z","bundle_sha256":"67df73a2c2ea3ae4ec5022da3f5af19b186115f088ce4a51306c07dc01771fa1"}}