{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VRO323OOJW7MT7TLXU33W4A7CE","short_pith_number":"pith:VRO323OO","schema_version":"1.0","canonical_sha256":"ac5dbd6dce4dbec9fe6bbd37bb701f1114a4308b51bbfdaddf4ed5b16fc9a982","source":{"kind":"arxiv","id":"1410.4135","version":1},"attestation_state":"computed","paper":{"title":"Mutual Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Adam Case, Jack H. Lutz","submitted_at":"2014-10-15T16:57:38Z","abstract_excerpt":"We define the lower and upper mutual dimensions $mdim(x:y)$ and $Mdim(x:y)$ between any two points $x$ and $y$ in Euclidean space. Intuitively these are the lower and upper densities of the algorithmic information shared by $x$ and $y$. We show that these quantities satisfy the main desiderata for a satisfactory measure of mutual algorithmic information. Our main theorem, the data processing inequality for mutual dimension, says that, if $f:\\mathbb{R}^m \\rightarrow \\mathbb{R}^n$ is computable and Lipschitz, then the inequalities $mdim(f(x):y) \\leq mdim(x:y)$ and $Mdim(f(x):y) \\leq Mdim(x:y)$ h"},"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":"1410.4135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-15T16:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"6d988a44d471a51d4175c921f8b0c514a8392c13d3cf7dcf6aa4daa238938979","abstract_canon_sha256":"fd6b842a1c315fbcec49cc1a09bf89a8748abf79030deee841b58a02a9f1afc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:02.586093Z","signature_b64":"fZ8/0z2uT1NEOht6U97m+2Kpr6R7hYhqH/fKGBJtryWVlm8BQrsuTE2GlOzTo6JTQJg2eTIbqDr7kpJjbdLyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac5dbd6dce4dbec9fe6bbd37bb701f1114a4308b51bbfdaddf4ed5b16fc9a982","last_reissued_at":"2026-05-18T02:40:02.585640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:02.585640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mutual Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Adam Case, Jack H. Lutz","submitted_at":"2014-10-15T16:57:38Z","abstract_excerpt":"We define the lower and upper mutual dimensions $mdim(x:y)$ and $Mdim(x:y)$ between any two points $x$ and $y$ in Euclidean space. Intuitively these are the lower and upper densities of the algorithmic information shared by $x$ and $y$. We show that these quantities satisfy the main desiderata for a satisfactory measure of mutual algorithmic information. Our main theorem, the data processing inequality for mutual dimension, says that, if $f:\\mathbb{R}^m \\rightarrow \\mathbb{R}^n$ is computable and Lipschitz, then the inequalities $mdim(f(x):y) \\leq mdim(x:y)$ and $Mdim(f(x):y) \\leq Mdim(x:y)$ h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4135","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":"1410.4135","created_at":"2026-05-18T02:40:02.585704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4135v1","created_at":"2026-05-18T02:40:02.585704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4135","created_at":"2026-05-18T02:40:02.585704+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRO323OOJW7M","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRO323OOJW7MT7TL","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRO323OO","created_at":"2026-05-18T12:28:54.890064+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/VRO323OOJW7MT7TLXU33W4A7CE","json":"https://pith.science/pith/VRO323OOJW7MT7TLXU33W4A7CE.json","graph_json":"https://pith.science/api/pith-number/VRO323OOJW7MT7TLXU33W4A7CE/graph.json","events_json":"https://pith.science/api/pith-number/VRO323OOJW7MT7TLXU33W4A7CE/events.json","paper":"https://pith.science/paper/VRO323OO"},"agent_actions":{"view_html":"https://pith.science/pith/VRO323OOJW7MT7TLXU33W4A7CE","download_json":"https://pith.science/pith/VRO323OOJW7MT7TLXU33W4A7CE.json","view_paper":"https://pith.science/paper/VRO323OO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4135&json=true","fetch_graph":"https://pith.science/api/pith-number/VRO323OOJW7MT7TLXU33W4A7CE/graph.json","fetch_events":"https://pith.science/api/pith-number/VRO323OOJW7MT7TLXU33W4A7CE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRO323OOJW7MT7TLXU33W4A7CE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRO323OOJW7MT7TLXU33W4A7CE/action/storage_attestation","attest_author":"https://pith.science/pith/VRO323OOJW7MT7TLXU33W4A7CE/action/author_attestation","sign_citation":"https://pith.science/pith/VRO323OOJW7MT7TLXU33W4A7CE/action/citation_signature","submit_replication":"https://pith.science/pith/VRO323OOJW7MT7TLXU33W4A7CE/action/replication_record"}},"created_at":"2026-05-18T02:40:02.585704+00:00","updated_at":"2026-05-18T02:40:02.585704+00:00"}