{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JFEZAQQ2HAMEPH3PNA4ZTILIGU","short_pith_number":"pith:JFEZAQQ2","schema_version":"1.0","canonical_sha256":"494990421a3818479f6f683999a168352d17b8de3cd36b708bab7cecdccfae31","source":{"kind":"arxiv","id":"1703.04387","version":3},"attestation_state":"computed","paper":{"title":"Mutual information decay for factors of IID","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.PR","authors_text":"Bal\\'azs Gerencs\\'er, Viktor Harangi","submitted_at":"2017-03-13T13:43:52Z","abstract_excerpt":"This paper is concerned with factor of i.i.d. processes on the $d$-regular tree for $d \\geq 3$. We study the mutual information of the values on two given vertices. If the vertices are neighbors (i.e., their distance is $1$), then a known inequality between the entropy of a vertex and the entropy of an edge provides an upper bound for the (normalized) mutual information. In this paper we obtain upper bounds for vertices at an arbitrary distance $k$, of order $(d-1)^{-k/2}$. Although these bounds are sharp, we also show that an interesting phenomenon occurs here: for any fixed process the rate "},"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":"1703.04387","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-13T13:43:52Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"b334734d2240b525f814e5bf64128ced0d34b9d9b45d4aee8083e35a11ab7b20","abstract_canon_sha256":"e88264bffc1d362ba18463fa33fb37160da1e4bcd51459b79be992e7c756f9d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:46.620666Z","signature_b64":"wyKvVpIRhPj18hhupPFZ5U2KuLQVuOxGkKHPh19uHgqtBLoesS3UCBOYPebUSR0ay68KhaxHiRO/qK0oZksODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"494990421a3818479f6f683999a168352d17b8de3cd36b708bab7cecdccfae31","last_reissued_at":"2026-05-18T00:39:46.619915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:46.619915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mutual information decay for factors of IID","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.PR","authors_text":"Bal\\'azs Gerencs\\'er, Viktor Harangi","submitted_at":"2017-03-13T13:43:52Z","abstract_excerpt":"This paper is concerned with factor of i.i.d. processes on the $d$-regular tree for $d \\geq 3$. We study the mutual information of the values on two given vertices. If the vertices are neighbors (i.e., their distance is $1$), then a known inequality between the entropy of a vertex and the entropy of an edge provides an upper bound for the (normalized) mutual information. In this paper we obtain upper bounds for vertices at an arbitrary distance $k$, of order $(d-1)^{-k/2}$. Although these bounds are sharp, we also show that an interesting phenomenon occurs here: for any fixed process the rate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04387","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.04387","created_at":"2026-05-18T00:39:46.620043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04387v3","created_at":"2026-05-18T00:39:46.620043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04387","created_at":"2026-05-18T00:39:46.620043+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFEZAQQ2HAME","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFEZAQQ2HAMEPH3P","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFEZAQQ2","created_at":"2026-05-18T12:31:24.725408+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/JFEZAQQ2HAMEPH3PNA4ZTILIGU","json":"https://pith.science/pith/JFEZAQQ2HAMEPH3PNA4ZTILIGU.json","graph_json":"https://pith.science/api/pith-number/JFEZAQQ2HAMEPH3PNA4ZTILIGU/graph.json","events_json":"https://pith.science/api/pith-number/JFEZAQQ2HAMEPH3PNA4ZTILIGU/events.json","paper":"https://pith.science/paper/JFEZAQQ2"},"agent_actions":{"view_html":"https://pith.science/pith/JFEZAQQ2HAMEPH3PNA4ZTILIGU","download_json":"https://pith.science/pith/JFEZAQQ2HAMEPH3PNA4ZTILIGU.json","view_paper":"https://pith.science/paper/JFEZAQQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04387&json=true","fetch_graph":"https://pith.science/api/pith-number/JFEZAQQ2HAMEPH3PNA4ZTILIGU/graph.json","fetch_events":"https://pith.science/api/pith-number/JFEZAQQ2HAMEPH3PNA4ZTILIGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFEZAQQ2HAMEPH3PNA4ZTILIGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFEZAQQ2HAMEPH3PNA4ZTILIGU/action/storage_attestation","attest_author":"https://pith.science/pith/JFEZAQQ2HAMEPH3PNA4ZTILIGU/action/author_attestation","sign_citation":"https://pith.science/pith/JFEZAQQ2HAMEPH3PNA4ZTILIGU/action/citation_signature","submit_replication":"https://pith.science/pith/JFEZAQQ2HAMEPH3PNA4ZTILIGU/action/replication_record"}},"created_at":"2026-05-18T00:39:46.620043+00:00","updated_at":"2026-05-18T00:39:46.620043+00:00"}