{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6COBELEPBCJEK7TJGGREKJSFMI","short_pith_number":"pith:6COBELEP","canonical_record":{"source":{"id":"1612.00564","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-02T04:38:55Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ae282437acc052a32c728ac00a18476e58120006803a33d2fae5bfce9cef1440","abstract_canon_sha256":"95c1858c43d8460f017469b3bc053eede3b7c77204a1a0fa4d7a2e5a5b066b92"},"schema_version":"1.0"},"canonical_sha256":"f09c122c8f0892457e6931a24526456216f1b29233a100727ec2e43cfce3a91e","source":{"kind":"arxiv","id":"1612.00564","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00564","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00564v3","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00564","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"pith_short_12","alias_value":"6COBELEPBCJE","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6COBELEPBCJEK7TJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6COBELEP","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6COBELEPBCJEK7TJGGREKJSFMI","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00564","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-02T04:38:55Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ae282437acc052a32c728ac00a18476e58120006803a33d2fae5bfce9cef1440","abstract_canon_sha256":"95c1858c43d8460f017469b3bc053eede3b7c77204a1a0fa4d7a2e5a5b066b92"},"schema_version":"1.0"},"canonical_sha256":"f09c122c8f0892457e6931a24526456216f1b29233a100727ec2e43cfce3a91e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:14.410812Z","signature_b64":"qiGQ1NCz7iljG3Iut5aRH4CsO+EMt10Kfx09ipbTtu97FJpf6IJ0UdIkrL5XO3t5qz7xgJkWSlfAuhibWQe8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f09c122c8f0892457e6931a24526456216f1b29233a100727ec2e43cfce3a91e","last_reissued_at":"2026-05-18T00:12:14.410380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:14.410380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00564","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:12:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f6IOrKp4DeEbuUVcYvAASp4Uja1LsXgcOPmAJsOGwXQswEz8Trz3s0xpfq3jjhsPmSr490CpbMsy0tX1HYqDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:18:57.118624Z"},"content_sha256":"6784bdbd20d5ab075ee6731af4ca002d63a49cfb33666e5a1b171d380c997aac","schema_version":"1.0","event_id":"sha256:6784bdbd20d5ab075ee6731af4ca002d63a49cfb33666e5a1b171d380c997aac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6COBELEPBCJEK7TJGGREKJSFMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Metric and topological entropy bounds for optimal coding of stochastic dynamical systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Christoph Kawan, Serdar Y\\\"uksel","submitted_at":"2016-12-02T04:38:55Z","abstract_excerpt":"We consider the problem of optimal zero-delay coding and estimation of a stochastic dynamical system over a noisy communication channel under three estimation criteria concerned with the low-distortion regime. The criteria considered are (i) a strong and (ii) a weak form of almost sure stability of the estimation error as well as (ii) quadratic stability in expectation. For all three objectives, we derive lower bounds on the smallest channel capacity $C_0$ above which the objective can be achieved with an arbitrarily small error. We first obtain bounds through a dynamical systems approach by c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00564","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:12:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2DbGTHBAsd+p6nof/qBNrbmiHf56GuxSfQyWy+KyY1+lSElb3JNcwdIO5SVhmJHef7TB1Szk5BlzDIBJWyCQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:18:57.119231Z"},"content_sha256":"0334d7f24147dfd470e39f96063fd09bf218fbdfb512254b80671ba533dc2f4c","schema_version":"1.0","event_id":"sha256:0334d7f24147dfd470e39f96063fd09bf218fbdfb512254b80671ba533dc2f4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6COBELEPBCJEK7TJGGREKJSFMI/bundle.json","state_url":"https://pith.science/pith/6COBELEPBCJEK7TJGGREKJSFMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6COBELEPBCJEK7TJGGREKJSFMI/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-02T01:18:57Z","links":{"resolver":"https://pith.science/pith/6COBELEPBCJEK7TJGGREKJSFMI","bundle":"https://pith.science/pith/6COBELEPBCJEK7TJGGREKJSFMI/bundle.json","state":"https://pith.science/pith/6COBELEPBCJEK7TJGGREKJSFMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6COBELEPBCJEK7TJGGREKJSFMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6COBELEPBCJEK7TJGGREKJSFMI","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":"95c1858c43d8460f017469b3bc053eede3b7c77204a1a0fa4d7a2e5a5b066b92","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-02T04:38:55Z","title_canon_sha256":"ae282437acc052a32c728ac00a18476e58120006803a33d2fae5bfce9cef1440"},"schema_version":"1.0","source":{"id":"1612.00564","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00564","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00564v3","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00564","created_at":"2026-05-18T00:12:14Z"},{"alias_kind":"pith_short_12","alias_value":"6COBELEPBCJE","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6COBELEPBCJEK7TJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6COBELEP","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:0334d7f24147dfd470e39f96063fd09bf218fbdfb512254b80671ba533dc2f4c","target":"graph","created_at":"2026-05-18T00:12:14Z","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 consider the problem of optimal zero-delay coding and estimation of a stochastic dynamical system over a noisy communication channel under three estimation criteria concerned with the low-distortion regime. The criteria considered are (i) a strong and (ii) a weak form of almost sure stability of the estimation error as well as (ii) quadratic stability in expectation. For all three objectives, we derive lower bounds on the smallest channel capacity $C_0$ above which the objective can be achieved with an arbitrarily small error. We first obtain bounds through a dynamical systems approach by c","authors_text":"Christoph Kawan, Serdar Y\\\"uksel","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-02T04:38:55Z","title":"Metric and topological entropy bounds for optimal coding of stochastic dynamical systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00564","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:6784bdbd20d5ab075ee6731af4ca002d63a49cfb33666e5a1b171d380c997aac","target":"record","created_at":"2026-05-18T00:12:14Z","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":"95c1858c43d8460f017469b3bc053eede3b7c77204a1a0fa4d7a2e5a5b066b92","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-02T04:38:55Z","title_canon_sha256":"ae282437acc052a32c728ac00a18476e58120006803a33d2fae5bfce9cef1440"},"schema_version":"1.0","source":{"id":"1612.00564","kind":"arxiv","version":3}},"canonical_sha256":"f09c122c8f0892457e6931a24526456216f1b29233a100727ec2e43cfce3a91e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f09c122c8f0892457e6931a24526456216f1b29233a100727ec2e43cfce3a91e","first_computed_at":"2026-05-18T00:12:14.410380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:14.410380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qiGQ1NCz7iljG3Iut5aRH4CsO+EMt10Kfx09ipbTtu97FJpf6IJ0UdIkrL5XO3t5qz7xgJkWSlfAuhibWQe8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:14.410812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00564","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6784bdbd20d5ab075ee6731af4ca002d63a49cfb33666e5a1b171d380c997aac","sha256:0334d7f24147dfd470e39f96063fd09bf218fbdfb512254b80671ba533dc2f4c"],"state_sha256":"1207a125ada371727858d65bd1136d9826483473e65cbe487f3ea6b4d14d330f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYaaiKMFuAFT61z1UyAxGU9qIsbgKlZKRfe1bd+Pg8T9cabu65sr5YT2QDGYErtQynE9UKUyrDN2EfF7SR7UDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:18:57.122512Z","bundle_sha256":"fa5d16c2c2e3f4c32496ad5848d8ecd26050e59de00116fd66b0fc0f79477aa3"}}