{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UAHLLOZBOEUJXR4LAXQDQFYFF2","short_pith_number":"pith:UAHLLOZB","canonical_record":{"source":{"id":"1608.04764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-16T20:10:23Z","cross_cats_sorted":[],"title_canon_sha256":"097bbde2f9b172483c0471b0c7953a6a0dac7a751c078f865f4bfb5a7eacaf80","abstract_canon_sha256":"da21e4247829812f52435200fc7bc4015685f8a1b6dc5d4b33c62ba16393fffb"},"schema_version":"1.0"},"canonical_sha256":"a00eb5bb2171289bc78b05e03817052ead20e6eb2eb84fb0d426c8b7db96e001","source":{"kind":"arxiv","id":"1608.04764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04764","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04764v1","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04764","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"UAHLLOZBOEUJ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UAHLLOZBOEUJXR4L","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UAHLLOZB","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UAHLLOZBOEUJXR4LAXQDQFYFF2","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-16T20:10:23Z","cross_cats_sorted":[],"title_canon_sha256":"097bbde2f9b172483c0471b0c7953a6a0dac7a751c078f865f4bfb5a7eacaf80","abstract_canon_sha256":"da21e4247829812f52435200fc7bc4015685f8a1b6dc5d4b33c62ba16393fffb"},"schema_version":"1.0"},"canonical_sha256":"a00eb5bb2171289bc78b05e03817052ead20e6eb2eb84fb0d426c8b7db96e001","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:33.684921Z","signature_b64":"PhtQ070lV0LcMKbjTXDk/i5Ew8iHQfFk9B3dV/u3a6m/c1AVx94Tce9GFdQMD+G2EXTU4oOehN+dk7hp9axKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a00eb5bb2171289bc78b05e03817052ead20e6eb2eb84fb0d426c8b7db96e001","last_reissued_at":"2026-05-18T01:08:33.684337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:33.684337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04764","source_version":1,"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-18T01:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IEohtWjHyZqwshh7DIUQs4H9jAdL+w0ced8+cfOh31BVTaJs6Zan5YoPFA5rh/OKvpKdvK5znNG4XbnXoOlXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:38:30.663802Z"},"content_sha256":"0033c07b85bee63f42b2207beabeeba848d926bea21ce8b6d6e8ac1a7d292d04","schema_version":"1.0","event_id":"sha256:0033c07b85bee63f42b2207beabeeba848d926bea21ce8b6d6e8ac1a7d292d04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UAHLLOZBOEUJXR4LAXQDQFYFF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded Turing Reductions and Data Processing Inequalities for Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Adam Case","submitted_at":"2016-08-16T20:10:23Z","abstract_excerpt":"A data processing inequality states that the quantity of shared information between two entities (e.g. signals, strings) cannot be significantly increased when one of the entities is processed by certain kinds of transformations. In this paper, we prove several data processing inequalities for sequences, where the transformations are bounded Turing functionals and the shared information is measured by the lower and upper mutual dimensions between sequences.\n  We show that, for all sequences $X,Y,$ and $Z$, if $Z$ is computable Lipschitz reducible to $X$, then \\[ mdim(Z:Y) \\leq mdim(X:Y) \\text{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04764","kind":"arxiv","version":1},"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-18T01:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8pn1L7R9gpCeeqU9WPpsc+Gz6z2XOvVRL3vEniM7NNLpts9hZ4RzfPj9Svk+cDZ9Yx5B+JNP16qeSBboK+MlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:38:30.664153Z"},"content_sha256":"be69d36346fb138c513617a9cded3755522de101f78098ce39b92f0cf23691b0","schema_version":"1.0","event_id":"sha256:be69d36346fb138c513617a9cded3755522de101f78098ce39b92f0cf23691b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2/bundle.json","state_url":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2/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-26T02:38:30Z","links":{"resolver":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2","bundle":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2/bundle.json","state":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UAHLLOZBOEUJXR4LAXQDQFYFF2","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":"da21e4247829812f52435200fc7bc4015685f8a1b6dc5d4b33c62ba16393fffb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-16T20:10:23Z","title_canon_sha256":"097bbde2f9b172483c0471b0c7953a6a0dac7a751c078f865f4bfb5a7eacaf80"},"schema_version":"1.0","source":{"id":"1608.04764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04764","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04764v1","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04764","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"UAHLLOZBOEUJ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UAHLLOZBOEUJXR4L","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UAHLLOZB","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:be69d36346fb138c513617a9cded3755522de101f78098ce39b92f0cf23691b0","target":"graph","created_at":"2026-05-18T01:08:33Z","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":"A data processing inequality states that the quantity of shared information between two entities (e.g. signals, strings) cannot be significantly increased when one of the entities is processed by certain kinds of transformations. In this paper, we prove several data processing inequalities for sequences, where the transformations are bounded Turing functionals and the shared information is measured by the lower and upper mutual dimensions between sequences.\n  We show that, for all sequences $X,Y,$ and $Z$, if $Z$ is computable Lipschitz reducible to $X$, then \\[ mdim(Z:Y) \\leq mdim(X:Y) \\text{","authors_text":"Adam Case","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-16T20:10:23Z","title":"Bounded Turing Reductions and Data Processing Inequalities for Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04764","kind":"arxiv","version":1},"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:0033c07b85bee63f42b2207beabeeba848d926bea21ce8b6d6e8ac1a7d292d04","target":"record","created_at":"2026-05-18T01:08:33Z","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":"da21e4247829812f52435200fc7bc4015685f8a1b6dc5d4b33c62ba16393fffb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-16T20:10:23Z","title_canon_sha256":"097bbde2f9b172483c0471b0c7953a6a0dac7a751c078f865f4bfb5a7eacaf80"},"schema_version":"1.0","source":{"id":"1608.04764","kind":"arxiv","version":1}},"canonical_sha256":"a00eb5bb2171289bc78b05e03817052ead20e6eb2eb84fb0d426c8b7db96e001","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a00eb5bb2171289bc78b05e03817052ead20e6eb2eb84fb0d426c8b7db96e001","first_computed_at":"2026-05-18T01:08:33.684337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:33.684337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PhtQ070lV0LcMKbjTXDk/i5Ew8iHQfFk9B3dV/u3a6m/c1AVx94Tce9GFdQMD+G2EXTU4oOehN+dk7hp9axKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:33.684921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0033c07b85bee63f42b2207beabeeba848d926bea21ce8b6d6e8ac1a7d292d04","sha256:be69d36346fb138c513617a9cded3755522de101f78098ce39b92f0cf23691b0"],"state_sha256":"20d1325fc5641372b07de7113d960c0c153b45e22fd4b7449d4b7bd99a31e31e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQUCE7fg2pRMZcvBKrEvNnD/lJeMXeCSoi3viKmk1EjJIlYFtn84LgEPUX4LQXcCePWYeb8Ai+jivHGb+u65Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:38:30.666113Z","bundle_sha256":"c995ee63153c9d6b36b353a31d7de252c329725d2d8253e259db486454b9fe31"}}