{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PY6G422JKZ3ZDN4PMCYZE64ZXR","short_pith_number":"pith:PY6G422J","canonical_record":{"source":{"id":"1711.06600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-11-17T15:50:34Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"68527974f0b71c9afd7fff5147a7fb5040279093736ddb7d199539077983a797","abstract_canon_sha256":"0f62a960b41f59e2528ae18559293fefbfa9325edab86f35d56eb2df6479b5fc"},"schema_version":"1.0"},"canonical_sha256":"7e3c6e6b49567791b78f60b1927b99bc7481d5fd0d0034d4a2a8256f336511d9","source":{"kind":"arxiv","id":"1711.06600","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06600","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06600v2","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06600","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"PY6G422JKZ3Z","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PY6G422JKZ3ZDN4P","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PY6G422J","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PY6G422JKZ3ZDN4PMCYZE64ZXR","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-11-17T15:50:34Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"68527974f0b71c9afd7fff5147a7fb5040279093736ddb7d199539077983a797","abstract_canon_sha256":"0f62a960b41f59e2528ae18559293fefbfa9325edab86f35d56eb2df6479b5fc"},"schema_version":"1.0"},"canonical_sha256":"7e3c6e6b49567791b78f60b1927b99bc7481d5fd0d0034d4a2a8256f336511d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:41.558043Z","signature_b64":"miR4cQZ1qt+42INDodQf6rkCVdVD3EMgVHfJZAfispU5pEopsfg9DjfOx29Och0Z3ASANJPjA82R9owDzu/0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e3c6e6b49567791b78f60b1927b99bc7481d5fd0d0034d4a2a8256f336511d9","last_reissued_at":"2026-05-18T00:19:41.557341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:41.557341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06600","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-18T00:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GiAzMHtCMBYBEnYO95xuH93BT/VPs+2I3iG+wObMMFabcwVfHVAYQTTLBINqqQ0rGcnghnSxjt6j1nLinOFVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:20:30.933883Z"},"content_sha256":"1a927661e6f376a987ab2630176086cf027dd29230ee77dd878dbea2982c76c9","schema_version":"1.0","event_id":"sha256:1a927661e6f376a987ab2630176086cf027dd29230ee77dd878dbea2982c76c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PY6G422JKZ3ZDN4PMCYZE64ZXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On optimal coding of non-linear dynamical systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"math.DS","authors_text":"Christoph Kawan, Serdar Y\\\"uksel","submitted_at":"2017-11-17T15:50:34Z","abstract_excerpt":"We consider the problem of zero-delay coding of a dynamical system over a discrete noiseless channel under three estimation criteria concerned with the low-distortion regime. For these three criteria, formulated stochastically in terms of a probability distribution for the initial state, we characterize the smallest channel capacities above which the estimation objectives can be achieved. The results establish further connections between topological and metric entropy of dynamical systems and information theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06600","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":""},"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:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LrFo2Ce+neHMgcpodcVAKLO6g6JxV3mE4m85XnYSH6q7xO9bI8/AeJERm+0IOAM65B7phE6umOb10rEm7C2oAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:20:30.934230Z"},"content_sha256":"24c633fa689b3971283ab3cc5dbd0ad6a4e3062d9e74f14ea9b5b0d893ee37d6","schema_version":"1.0","event_id":"sha256:24c633fa689b3971283ab3cc5dbd0ad6a4e3062d9e74f14ea9b5b0d893ee37d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PY6G422JKZ3ZDN4PMCYZE64ZXR/bundle.json","state_url":"https://pith.science/pith/PY6G422JKZ3ZDN4PMCYZE64ZXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PY6G422JKZ3ZDN4PMCYZE64ZXR/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-02T11:20:30Z","links":{"resolver":"https://pith.science/pith/PY6G422JKZ3ZDN4PMCYZE64ZXR","bundle":"https://pith.science/pith/PY6G422JKZ3ZDN4PMCYZE64ZXR/bundle.json","state":"https://pith.science/pith/PY6G422JKZ3ZDN4PMCYZE64ZXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PY6G422JKZ3ZDN4PMCYZE64ZXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PY6G422JKZ3ZDN4PMCYZE64ZXR","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":"0f62a960b41f59e2528ae18559293fefbfa9325edab86f35d56eb2df6479b5fc","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-11-17T15:50:34Z","title_canon_sha256":"68527974f0b71c9afd7fff5147a7fb5040279093736ddb7d199539077983a797"},"schema_version":"1.0","source":{"id":"1711.06600","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06600","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06600v2","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06600","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"PY6G422JKZ3Z","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PY6G422JKZ3ZDN4P","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PY6G422J","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:24c633fa689b3971283ab3cc5dbd0ad6a4e3062d9e74f14ea9b5b0d893ee37d6","target":"graph","created_at":"2026-05-18T00:19:41Z","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 zero-delay coding of a dynamical system over a discrete noiseless channel under three estimation criteria concerned with the low-distortion regime. For these three criteria, formulated stochastically in terms of a probability distribution for the initial state, we characterize the smallest channel capacities above which the estimation objectives can be achieved. The results establish further connections between topological and metric entropy of dynamical systems and information theory.","authors_text":"Christoph Kawan, Serdar Y\\\"uksel","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-11-17T15:50:34Z","title":"On optimal coding of non-linear dynamical systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06600","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:1a927661e6f376a987ab2630176086cf027dd29230ee77dd878dbea2982c76c9","target":"record","created_at":"2026-05-18T00:19:41Z","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":"0f62a960b41f59e2528ae18559293fefbfa9325edab86f35d56eb2df6479b5fc","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-11-17T15:50:34Z","title_canon_sha256":"68527974f0b71c9afd7fff5147a7fb5040279093736ddb7d199539077983a797"},"schema_version":"1.0","source":{"id":"1711.06600","kind":"arxiv","version":2}},"canonical_sha256":"7e3c6e6b49567791b78f60b1927b99bc7481d5fd0d0034d4a2a8256f336511d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e3c6e6b49567791b78f60b1927b99bc7481d5fd0d0034d4a2a8256f336511d9","first_computed_at":"2026-05-18T00:19:41.557341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:41.557341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"miR4cQZ1qt+42INDodQf6rkCVdVD3EMgVHfJZAfispU5pEopsfg9DjfOx29Och0Z3ASANJPjA82R9owDzu/0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:41.558043Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06600","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a927661e6f376a987ab2630176086cf027dd29230ee77dd878dbea2982c76c9","sha256:24c633fa689b3971283ab3cc5dbd0ad6a4e3062d9e74f14ea9b5b0d893ee37d6"],"state_sha256":"6f398100de3920d1def2d07628e6b6c233edf0274505c20a8f446ed73767c7c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9RIPlOgvov+Nmv5V6WKmDuokPYuhGput7ZtukX5P6aZBbFQNoXR2j27732sWX6jtbydKxOWCD5ImIa+duQ6pDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:20:30.936195Z","bundle_sha256":"60e211263f20b9c7d8afa371964b65cd3b3fe27c4677ea5e7a3f1aa0cabf9036"}}