{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S77TD6JSKQ3V2KV5D6MGZDNZQL","short_pith_number":"pith:S77TD6JS","canonical_record":{"source":{"id":"1603.04172","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-14T09:10:10Z","cross_cats_sorted":["math.DS","math.IT","math.OC"],"title_canon_sha256":"07cb51bf5e6c0a60dc9c0fcf09ad50f481712d438fcad834bb01102bdc427dd5","abstract_canon_sha256":"66caf04416d45e7cc971b1352be67a1f12447a265452c674782125447071f5c1"},"schema_version":"1.0"},"canonical_sha256":"97ff31f93254375d2abd1f986c8db982f111bf06299098f323575a5803efdb61","source":{"kind":"arxiv","id":"1603.04172","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04172","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04172v3","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04172","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"S77TD6JSKQ3V","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"S77TD6JSKQ3V2KV5","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"S77TD6JS","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S77TD6JSKQ3V2KV5D6MGZDNZQL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04172","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-14T09:10:10Z","cross_cats_sorted":["math.DS","math.IT","math.OC"],"title_canon_sha256":"07cb51bf5e6c0a60dc9c0fcf09ad50f481712d438fcad834bb01102bdc427dd5","abstract_canon_sha256":"66caf04416d45e7cc971b1352be67a1f12447a265452c674782125447071f5c1"},"schema_version":"1.0"},"canonical_sha256":"97ff31f93254375d2abd1f986c8db982f111bf06299098f323575a5803efdb61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:01.376674Z","signature_b64":"qY3n7k9tVJl3dMPx37+oh4dDo2UZQeU8UxQ3ddsC7e6wEYTgZcU3yFhQeH5Lj74D43flH37dsT2xkBI5KHpfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97ff31f93254375d2abd1f986c8db982f111bf06299098f323575a5803efdb61","last_reissued_at":"2026-05-18T00:51:01.376198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:01.376198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04172","source_version":3,"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:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0bTOvjb1Rd0lfnRX1xlIpvl3xG5scInZpIiOJrT28fEB/WU/NWlWszWklUY6N5QNO+AtO0eGxGTMv1jdEhQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:01:23.680194Z"},"content_sha256":"e95df0134e640980c81aad75e94d3215f8bcd6330026aa40fec04a311a686633","schema_version":"1.0","event_id":"sha256:e95df0134e640980c81aad75e94d3215f8bcd6330026aa40fec04a311a686633"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S77TD6JSKQ3V2KV5D6MGZDNZQL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Estimation via Nonanticipative Rate Distortion Function and Applications to Time-Varying Gauss-Markov Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Photios A. Stavrou, Sergey Loyka, Themistoklis Charalambous","submitted_at":"2016-03-14T09:10:10Z","abstract_excerpt":"In this paper, we develop {finite-time horizon} causal filters using the nonanticipative rate distortion theory. We apply the {developed} theory to {design optimal filters for} time-varying multidimensional Gauss-Markov processes, subject to a mean square error fidelity constraint. We show that such filters are equivalent to the design of an optimal \\texttt{\\{encoder, channel, decoder\\}}, which ensures that the error satisfies {a} fidelity constraint. Moreover, we derive a universal lower bound on the mean square error of any estimator of time-varying multidimensional Gauss-Markov processes in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04172","kind":"arxiv","version":3},"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:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlP7ItBWgp1IyFV51bgLGWDONOeadaON8FQ+S22979Z4ByNtJBfMF9fNdAocH2+Bqz8kCj7jCx0oTBVtn6VEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:01:23.680568Z"},"content_sha256":"051fd07f010e1a6ee3ec6a96a884853eef104ef4811d31d6db1ff3a33766cb6f","schema_version":"1.0","event_id":"sha256:051fd07f010e1a6ee3ec6a96a884853eef104ef4811d31d6db1ff3a33766cb6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S77TD6JSKQ3V2KV5D6MGZDNZQL/bundle.json","state_url":"https://pith.science/pith/S77TD6JSKQ3V2KV5D6MGZDNZQL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S77TD6JSKQ3V2KV5D6MGZDNZQL/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-03T05:01:23Z","links":{"resolver":"https://pith.science/pith/S77TD6JSKQ3V2KV5D6MGZDNZQL","bundle":"https://pith.science/pith/S77TD6JSKQ3V2KV5D6MGZDNZQL/bundle.json","state":"https://pith.science/pith/S77TD6JSKQ3V2KV5D6MGZDNZQL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S77TD6JSKQ3V2KV5D6MGZDNZQL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S77TD6JSKQ3V2KV5D6MGZDNZQL","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":"66caf04416d45e7cc971b1352be67a1f12447a265452c674782125447071f5c1","cross_cats_sorted":["math.DS","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-14T09:10:10Z","title_canon_sha256":"07cb51bf5e6c0a60dc9c0fcf09ad50f481712d438fcad834bb01102bdc427dd5"},"schema_version":"1.0","source":{"id":"1603.04172","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04172","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04172v3","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04172","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"S77TD6JSKQ3V","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"S77TD6JSKQ3V2KV5","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"S77TD6JS","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:051fd07f010e1a6ee3ec6a96a884853eef104ef4811d31d6db1ff3a33766cb6f","target":"graph","created_at":"2026-05-18T00:51:01Z","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":"In this paper, we develop {finite-time horizon} causal filters using the nonanticipative rate distortion theory. We apply the {developed} theory to {design optimal filters for} time-varying multidimensional Gauss-Markov processes, subject to a mean square error fidelity constraint. We show that such filters are equivalent to the design of an optimal \\texttt{\\{encoder, channel, decoder\\}}, which ensures that the error satisfies {a} fidelity constraint. Moreover, we derive a universal lower bound on the mean square error of any estimator of time-varying multidimensional Gauss-Markov processes in","authors_text":"Charalambos D. Charalambous, Photios A. Stavrou, Sergey Loyka, Themistoklis Charalambous","cross_cats":["math.DS","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-14T09:10:10Z","title":"Optimal Estimation via Nonanticipative Rate Distortion Function and Applications to Time-Varying Gauss-Markov Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04172","kind":"arxiv","version":3},"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:e95df0134e640980c81aad75e94d3215f8bcd6330026aa40fec04a311a686633","target":"record","created_at":"2026-05-18T00:51:01Z","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":"66caf04416d45e7cc971b1352be67a1f12447a265452c674782125447071f5c1","cross_cats_sorted":["math.DS","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-14T09:10:10Z","title_canon_sha256":"07cb51bf5e6c0a60dc9c0fcf09ad50f481712d438fcad834bb01102bdc427dd5"},"schema_version":"1.0","source":{"id":"1603.04172","kind":"arxiv","version":3}},"canonical_sha256":"97ff31f93254375d2abd1f986c8db982f111bf06299098f323575a5803efdb61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97ff31f93254375d2abd1f986c8db982f111bf06299098f323575a5803efdb61","first_computed_at":"2026-05-18T00:51:01.376198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:01.376198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qY3n7k9tVJl3dMPx37+oh4dDo2UZQeU8UxQ3ddsC7e6wEYTgZcU3yFhQeH5Lj74D43flH37dsT2xkBI5KHpfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:01.376674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04172","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e95df0134e640980c81aad75e94d3215f8bcd6330026aa40fec04a311a686633","sha256:051fd07f010e1a6ee3ec6a96a884853eef104ef4811d31d6db1ff3a33766cb6f"],"state_sha256":"21d93ba4f68054bf82c5be26dc96f8478c69f191b7776c3bcf26c4deba31a69c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMcFbuYuzbiPhvZ4Am8WV5+eTeQa6oA2cHmwq7pZdfk2tiVIUq76yV8mUgzFVVcRPkrghKRsNSiHTB2idHkdCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:01:23.682551Z","bundle_sha256":"fb14a04aa24aadaf51b5f55e3fd22e7dab7cc8473cb7e9231b6ff81b6ea1aade"}}