{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YLWEBBNLB3CKW64VPNSYTW2G22","short_pith_number":"pith:YLWEBBNL","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"},"canonical_sha256":"c2ec4085ab0ec4ab7b957b6589db46d69a597bce24dfa370f5a7a19c4d25abc9","source":{"kind":"arxiv","id":"2512.11492","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.11492","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"2512.11492v2","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.11492","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"YLWEBBNLB3CK","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_16","alias_value":"YLWEBBNLB3CKW64V","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_8","alias_value":"YLWEBBNL","created_at":"2026-05-20T00:01:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YLWEBBNLB3CKW64VPNSYTW2G22","target":"record","payload":{"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"},"canonical_sha256":"c2ec4085ab0ec4ab7b957b6589db46d69a597bce24dfa370f5a7a19c4d25abc9","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"},"source_kind":"arxiv","source_id":"2512.11492","source_version":2,"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-20T00:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ft68H4GM7eqqozVbyAPamVsCb8dyxfGHqqWJFGG1wGeIWujpNU+7CsV6+Fdg1j6p0RJ7bQaBSsGJeFNliqQECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:11:51.539838Z"},"content_sha256":"01a295f9d9a31148f84ae96aec08e4d4618c785a1897d2f2c739264190eb0e5e","schema_version":"1.0","event_id":"sha256:01a295f9d9a31148f84ae96aec08e4d4618c785a1897d2f2c739264190eb0e5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YLWEBBNLB3CKW64VPNSYTW2G22","target":"graph","payload":{"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"},"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-20T00:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBsI3SIivslpkkgkhN7ZuynzozjI3BjlJtpGftnVnbKdkB9lpYHdIudz1ma44S07ZCttE7En4ZpUndw6bPO9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:11:51.540249Z"},"content_sha256":"6795f6d2c6ba9dd2c60c7f20ef8e41cd435e1bea8c11a252438006b7deb37647","schema_version":"1.0","event_id":"sha256:6795f6d2c6ba9dd2c60c7f20ef8e41cd435e1bea8c11a252438006b7deb37647"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22/bundle.json","state_url":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLWEBBNLB3CKW64VPNSYTW2G22/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-04T14:11:51Z","links":{"resolver":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22","bundle":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22/bundle.json","state":"https://pith.science/pith/YLWEBBNLB3CKW64VPNSYTW2G22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLWEBBNLB3CKW64VPNSYTW2G22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YLWEBBNLB3CKW64VPNSYTW2G22","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":"4ade923807e00e1ce87a44deff3aedea011521ab8e126bd7be8cb50bf9bc7bda","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-12-12T11:39:54Z","title_canon_sha256":"3c41289ff928277a2b4d51e90eee5d3149b80f352b0ede228d23fc10645bf113"},"schema_version":"1.0","source":{"id":"2512.11492","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.11492","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"2512.11492v2","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.11492","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"YLWEBBNLB3CK","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_16","alias_value":"YLWEBBNLB3CKW64V","created_at":"2026-05-20T00:01:37Z"},{"alias_kind":"pith_short_8","alias_value":"YLWEBBNL","created_at":"2026-05-20T00:01:37Z"}],"graph_snapshots":[{"event_id":"sha256:6795f6d2c6ba9dd2c60c7f20ef8e41cd435e1bea8c11a252438006b7deb37647","target":"graph","created_at":"2026-05-20T00:01:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2512.11492/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Katarina Stanojevic, Sandra Hirche, Severin Beger, Yihui Lin","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-12-12T11:39:54Z","title":"Optimal Delay Compensation in Networked Predictive Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.11492","kind":"arxiv","version":2},"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:01a295f9d9a31148f84ae96aec08e4d4618c785a1897d2f2c739264190eb0e5e","target":"record","created_at":"2026-05-20T00:01:37Z","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":"4ade923807e00e1ce87a44deff3aedea011521ab8e126bd7be8cb50bf9bc7bda","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-12-12T11:39:54Z","title_canon_sha256":"3c41289ff928277a2b4d51e90eee5d3149b80f352b0ede228d23fc10645bf113"},"schema_version":"1.0","source":{"id":"2512.11492","kind":"arxiv","version":2}},"canonical_sha256":"c2ec4085ab0ec4ab7b957b6589db46d69a597bce24dfa370f5a7a19c4d25abc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2ec4085ab0ec4ab7b957b6589db46d69a597bce24dfa370f5a7a19c4d25abc9","first_computed_at":"2026-05-20T00:01:37.701245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:37.701245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gb6icIFeNPXbXnXKDkQxaxi+eX2i4wM07f6iuK/oz6z6jdGLTDPOxyad3yxQUR2f6lR3xkRa7LrSYMM9e0JdCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:37.702021Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.11492","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01a295f9d9a31148f84ae96aec08e4d4618c785a1897d2f2c739264190eb0e5e","sha256:6795f6d2c6ba9dd2c60c7f20ef8e41cd435e1bea8c11a252438006b7deb37647"],"state_sha256":"1c61582c5329abf4c4b58e065a5463595197c975ef14633cd1bd6c662ec53e13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8L7PnM73xpJe7HL+eKOPuZr3cfB9WPMobiDYOVzDk5VzJU9if7IsWqkh0l7NHhJiIz3RtJDqd8+GwGdKImsyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T14:11:51.542461Z","bundle_sha256":"5e7def43c3557f96a8190e2fec6b8c4041379ace4fa679b6eda9cbd622caa05a"}}