{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UAHLLOZBOEUJXR4LAXQDQFYFF2","short_pith_number":"pith:UAHLLOZB","schema_version":"1.0","canonical_sha256":"a00eb5bb2171289bc78b05e03817052ead20e6eb2eb84fb0d426c8b7db96e001","source":{"kind":"arxiv","id":"1608.04764","version":1},"attestation_state":"computed","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{"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.04764","created_at":"2026-05-18T01:08:33.684439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04764v1","created_at":"2026-05-18T01:08:33.684439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04764","created_at":"2026-05-18T01:08:33.684439+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAHLLOZBOEUJ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAHLLOZBOEUJXR4L","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAHLLOZB","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2","json":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2.json","graph_json":"https://pith.science/api/pith-number/UAHLLOZBOEUJXR4LAXQDQFYFF2/graph.json","events_json":"https://pith.science/api/pith-number/UAHLLOZBOEUJXR4LAXQDQFYFF2/events.json","paper":"https://pith.science/paper/UAHLLOZB"},"agent_actions":{"view_html":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2","download_json":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2.json","view_paper":"https://pith.science/paper/UAHLLOZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04764&json=true","fetch_graph":"https://pith.science/api/pith-number/UAHLLOZBOEUJXR4LAXQDQFYFF2/graph.json","fetch_events":"https://pith.science/api/pith-number/UAHLLOZBOEUJXR4LAXQDQFYFF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2/action/storage_attestation","attest_author":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2/action/author_attestation","sign_citation":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2/action/citation_signature","submit_replication":"https://pith.science/pith/UAHLLOZBOEUJXR4LAXQDQFYFF2/action/replication_record"}},"created_at":"2026-05-18T01:08:33.684439+00:00","updated_at":"2026-05-18T01:08:33.684439+00:00"}