{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YLWEBBNLB3CKW64VPNSYTW2G22","short_pith_number":"pith:YLWEBBNL","schema_version":"1.0","canonical_sha256":"c2ec4085ab0ec4ab7b957b6589db46d69a597bce24dfa370f5a7a19c4d25abc9","source":{"kind":"arxiv","id":"2512.11492","version":2},"attestation_state":"computed","paper":{"title":"Optimal Delay Compensation in Networked Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Katarina Stanojevic, Sandra Hirche, Severin Beger, Yihui Lin","submitted_at":"2025-12-12T11:39:54Z","abstract_excerpt":"Networked Predictive Control is widely used to mitigate the effect of delays and dropouts in Networked Control Systems, particularly when these exceed the sampling time. A key design choice of these methods is the delay bound, which determines the prediction horizon and the robustness to information loss. This work develops a systematic method to select the optimal bound by quantifying the trade-off between prediction errors and open-loop operation caused by communication losses. Simulation studies demonstrate the performance gains achieved with the optimal bound."},"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":"2512.11492","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-12-12T11:39:54Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"3c41289ff928277a2b4d51e90eee5d3149b80f352b0ede228d23fc10645bf113","abstract_canon_sha256":"4ade923807e00e1ce87a44deff3aedea011521ab8e126bd7be8cb50bf9bc7bda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:37.702021Z","signature_b64":"Gb6icIFeNPXbXnXKDkQxaxi+eX2i4wM07f6iuK/oz6z6jdGLTDPOxyad3yxQUR2f6lR3xkRa7LrSYMM9e0JdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2ec4085ab0ec4ab7b957b6589db46d69a597bce24dfa370f5a7a19c4d25abc9","last_reissued_at":"2026-05-20T00:01:37.701245Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:37.701245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Delay Compensation in Networked Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Katarina Stanojevic, Sandra Hirche, Severin Beger, Yihui Lin","submitted_at":"2025-12-12T11:39:54Z","abstract_excerpt":"Networked Predictive Control is widely used to mitigate the effect of delays and dropouts in Networked Control Systems, particularly when these exceed the sampling time. A key design choice of these methods is the delay bound, which determines the prediction horizon and the robustness to information loss. This work develops a systematic method to select the optimal bound by quantifying the trade-off between prediction errors and open-loop operation caused by communication losses. Simulation studies demonstrate the performance gains achieved with the optimal bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.11492","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.11492/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2512.11492","created_at":"2026-05-20T00:01:37.701380+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.11492v2","created_at":"2026-05-20T00:01:37.701380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.11492","created_at":"2026-05-20T00:01:37.701380+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLWEBBNLB3CK","created_at":"2026-05-20T00:01:37.701380+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLWEBBNLB3CKW64V","created_at":"2026-05-20T00:01:37.701380+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLWEBBNL","created_at":"2026-05-20T00:01:37.701380+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/YLWEBBNLB3CKW64VPNSYTW2G22","json":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22.json","graph_json":"https://pith.science/api/pith-number/YLWEBBNLB3CKW64VPNSYTW2G22/graph.json","events_json":"https://pith.science/api/pith-number/YLWEBBNLB3CKW64VPNSYTW2G22/events.json","paper":"https://pith.science/paper/YLWEBBNL"},"agent_actions":{"view_html":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22","download_json":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22.json","view_paper":"https://pith.science/paper/YLWEBBNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.11492&json=true","fetch_graph":"https://pith.science/api/pith-number/YLWEBBNLB3CKW64VPNSYTW2G22/graph.json","fetch_events":"https://pith.science/api/pith-number/YLWEBBNLB3CKW64VPNSYTW2G22/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22/action/storage_attestation","attest_author":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22/action/author_attestation","sign_citation":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22/action/citation_signature","submit_replication":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22/action/replication_record"}},"created_at":"2026-05-20T00:01:37.701380+00:00","updated_at":"2026-05-20T00:01:37.701380+00:00"}