{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TJWMRSQTVV3LXSAZQOBOODAL7G","short_pith_number":"pith:TJWMRSQT","schema_version":"1.0","canonical_sha256":"9a6cc8ca13ad76bbc8198382e70c0bf9a28422e63d079ef8c047f9d80e952a35","source":{"kind":"arxiv","id":"1909.02373","version":3},"attestation_state":"computed","paper":{"title":"LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Makoto Yamada, Ruslan Salakhutdinov, Tam Le, Yanbin Liu, Yao-Hung Hubert Tsai, Yi Yang","submitted_at":"2019-09-05T12:58:20Z","abstract_excerpt":"Estimating mutual information is an important statistics and machine learning problem. To estimate the mutual information from data, a common practice is preparing a set of paired samples $\\{(\\mathbf{x}_i,\\mathbf{y}_i)\\}_{i=1}^n \\stackrel{\\mathrm{i.i.d.}}{\\sim} p(\\mathbf{x},\\mathbf{y})$. However, in many situations, it is difficult to obtain a large number of data pairs. To address this problem, we propose the semi-supervised Squared-loss Mutual Information (SMI) estimation method using a small number of paired samples and the available unpaired ones. We first represent SMI through the density"},"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":"1909.02373","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-09-05T12:58:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"91e7fa44fe41b1d2a5502288b7463bc11712d39809d456a49e32e5edf427a602","abstract_canon_sha256":"5820810150ebc4a054ef8405a11692eea34c3a33e2b4c66fe5bab17c031637f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:47.569429Z","signature_b64":"lGP0vJnOYwCH9i5ICye5rB7MTh9J6PHyA9WXB7/b6VblvSic1KvJqhEi9//mNmwltaewY09+RpU7LsfIdmw2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a6cc8ca13ad76bbc8198382e70c0bf9a28422e63d079ef8c047f9d80e952a35","last_reissued_at":"2026-07-05T08:43:47.568932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:47.568932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Makoto Yamada, Ruslan Salakhutdinov, Tam Le, Yanbin Liu, Yao-Hung Hubert Tsai, Yi Yang","submitted_at":"2019-09-05T12:58:20Z","abstract_excerpt":"Estimating mutual information is an important statistics and machine learning problem. To estimate the mutual information from data, a common practice is preparing a set of paired samples $\\{(\\mathbf{x}_i,\\mathbf{y}_i)\\}_{i=1}^n \\stackrel{\\mathrm{i.i.d.}}{\\sim} p(\\mathbf{x},\\mathbf{y})$. However, in many situations, it is difficult to obtain a large number of data pairs. To address this problem, we propose the semi-supervised Squared-loss Mutual Information (SMI) estimation method using a small number of paired samples and the available unpaired ones. We first represent SMI through the density"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.02373","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.02373/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.02373","created_at":"2026-07-05T08:43:47.568995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.02373v3","created_at":"2026-07-05T08:43:47.568995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.02373","created_at":"2026-07-05T08:43:47.568995+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJWMRSQTVV3L","created_at":"2026-07-05T08:43:47.568995+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJWMRSQTVV3LXSAZ","created_at":"2026-07-05T08:43:47.568995+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJWMRSQT","created_at":"2026-07-05T08:43:47.568995+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/TJWMRSQTVV3LXSAZQOBOODAL7G","json":"https://pith.science/pith/TJWMRSQTVV3LXSAZQOBOODAL7G.json","graph_json":"https://pith.science/api/pith-number/TJWMRSQTVV3LXSAZQOBOODAL7G/graph.json","events_json":"https://pith.science/api/pith-number/TJWMRSQTVV3LXSAZQOBOODAL7G/events.json","paper":"https://pith.science/paper/TJWMRSQT"},"agent_actions":{"view_html":"https://pith.science/pith/TJWMRSQTVV3LXSAZQOBOODAL7G","download_json":"https://pith.science/pith/TJWMRSQTVV3LXSAZQOBOODAL7G.json","view_paper":"https://pith.science/paper/TJWMRSQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.02373&json=true","fetch_graph":"https://pith.science/api/pith-number/TJWMRSQTVV3LXSAZQOBOODAL7G/graph.json","fetch_events":"https://pith.science/api/pith-number/TJWMRSQTVV3LXSAZQOBOODAL7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJWMRSQTVV3LXSAZQOBOODAL7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJWMRSQTVV3LXSAZQOBOODAL7G/action/storage_attestation","attest_author":"https://pith.science/pith/TJWMRSQTVV3LXSAZQOBOODAL7G/action/author_attestation","sign_citation":"https://pith.science/pith/TJWMRSQTVV3LXSAZQOBOODAL7G/action/citation_signature","submit_replication":"https://pith.science/pith/TJWMRSQTVV3LXSAZQOBOODAL7G/action/replication_record"}},"created_at":"2026-07-05T08:43:47.568995+00:00","updated_at":"2026-07-05T08:43:47.568995+00:00"}