{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:E47PCOXI7LB7BAKNVZ36LN32SG","short_pith_number":"pith:E47PCOXI","schema_version":"1.0","canonical_sha256":"273ef13ae8fac3f0814dae77e5b77a91930e9de4986a6e5083686fbd04c39814","source":{"kind":"arxiv","id":"1907.05484","version":1},"attestation_state":"computed","paper":{"title":"Generalized Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Zhiyi Zhang","submitted_at":"2019-07-11T20:57:19Z","abstract_excerpt":"Mutual information is one of the essential building blocks of information theory. Yet, it is only finitely defined for distributions with fast decaying tails on a countable joint alphabet of two random elements. The unboundedness of mutual information over the general class of all distributions on a joint alphabet prevents its potential utility to be fully realized. This is in fact a void in the foundation of information theory that needs to be filled. This article proposes a family of generalized mutual information all of whose members 1) are finitely defined for each and every distribution o"},"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":"1907.05484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-11T20:57:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4074aba914e790d9e48181bc4b4f186025d8e5314d65df7c2bcf77fa0d946355","abstract_canon_sha256":"3fc9eea5bff3e3288b4cc7d5acdf2bc993c331d040f4d099d5d5bf5cd0a74727"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:48.265907Z","signature_b64":"VQGMKSF1N7mxog4jfQ2hKUYZbLDqy7TwV6PMmFM6PSr50xyiOA5gdPlWLx3J7iELA3a0yvsn4MfVqhdNDEZZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"273ef13ae8fac3f0814dae77e5b77a91930e9de4986a6e5083686fbd04c39814","last_reissued_at":"2026-05-17T23:40:48.265158Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:48.265158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Zhiyi Zhang","submitted_at":"2019-07-11T20:57:19Z","abstract_excerpt":"Mutual information is one of the essential building blocks of information theory. Yet, it is only finitely defined for distributions with fast decaying tails on a countable joint alphabet of two random elements. The unboundedness of mutual information over the general class of all distributions on a joint alphabet prevents its potential utility to be fully realized. This is in fact a void in the foundation of information theory that needs to be filled. This article proposes a family of generalized mutual information all of whose members 1) are finitely defined for each and every distribution o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05484","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":"1907.05484","created_at":"2026-05-17T23:40:48.265285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05484v1","created_at":"2026-05-17T23:40:48.265285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05484","created_at":"2026-05-17T23:40:48.265285+00:00"},{"alias_kind":"pith_short_12","alias_value":"E47PCOXI7LB7","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"E47PCOXI7LB7BAKN","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"E47PCOXI","created_at":"2026-05-18T12:33:15.570797+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/E47PCOXI7LB7BAKNVZ36LN32SG","json":"https://pith.science/pith/E47PCOXI7LB7BAKNVZ36LN32SG.json","graph_json":"https://pith.science/api/pith-number/E47PCOXI7LB7BAKNVZ36LN32SG/graph.json","events_json":"https://pith.science/api/pith-number/E47PCOXI7LB7BAKNVZ36LN32SG/events.json","paper":"https://pith.science/paper/E47PCOXI"},"agent_actions":{"view_html":"https://pith.science/pith/E47PCOXI7LB7BAKNVZ36LN32SG","download_json":"https://pith.science/pith/E47PCOXI7LB7BAKNVZ36LN32SG.json","view_paper":"https://pith.science/paper/E47PCOXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05484&json=true","fetch_graph":"https://pith.science/api/pith-number/E47PCOXI7LB7BAKNVZ36LN32SG/graph.json","fetch_events":"https://pith.science/api/pith-number/E47PCOXI7LB7BAKNVZ36LN32SG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E47PCOXI7LB7BAKNVZ36LN32SG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E47PCOXI7LB7BAKNVZ36LN32SG/action/storage_attestation","attest_author":"https://pith.science/pith/E47PCOXI7LB7BAKNVZ36LN32SG/action/author_attestation","sign_citation":"https://pith.science/pith/E47PCOXI7LB7BAKNVZ36LN32SG/action/citation_signature","submit_replication":"https://pith.science/pith/E47PCOXI7LB7BAKNVZ36LN32SG/action/replication_record"}},"created_at":"2026-05-17T23:40:48.265285+00:00","updated_at":"2026-05-17T23:40:48.265285+00:00"}