{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AOI42RXBTN3FJOWV27WKTTYV6N","short_pith_number":"pith:AOI42RXB","schema_version":"1.0","canonical_sha256":"0391cd46e19b7654bad5d7eca9cf15f36c807f3d84d4c749c192f3ebd98bde03","source":{"kind":"arxiv","id":"2301.08164","version":3},"attestation_state":"computed","paper":{"title":"DiME: Maximizing Mutual Information by a Difference of Matrix-Based Entropies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Austin J. Brockmeier, Jhoan Keider Hoyos Osorio, Luis Gonzalo Sanchez Giraldo, Oscar Skean","submitted_at":"2023-01-19T16:56:21Z","abstract_excerpt":"We introduce an information-theoretic quantity with similar properties to mutual information that can be estimated from data without making explicit assumptions on the underlying distribution. This quantity is based on a recently proposed matrix-based entropy that uses the eigenvalues of a normalized Gram matrix to compute an estimate of the eigenvalues of an uncentered covariance operator in a reproducing kernel Hilbert space. We show that a difference of matrix-based entropies (DiME) is well suited for problems involving the maximization of mutual information between random variables. While "},"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":"2301.08164","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-19T16:56:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"48a32ff1dfe2448a3edceedeecd2526a9adcf06cfc3eaa682247c6d1cc02c36d","abstract_canon_sha256":"a44439cc39e1f707299371360e17040d989445056e3061bb85fd4b667d3ba48f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:35:25.827779Z","signature_b64":"jkVmXNSoLB95kII8Tcmruv2WjGXJ4J4L23wSKKvc3jy+r+L0nZBTwsEtTTOOzjFCjWvH/z4GzwY22McDsR8oAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0391cd46e19b7654bad5d7eca9cf15f36c807f3d84d4c749c192f3ebd98bde03","last_reissued_at":"2026-07-05T06:35:25.827303Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:35:25.827303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DiME: Maximizing Mutual Information by a Difference of Matrix-Based Entropies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Austin J. Brockmeier, Jhoan Keider Hoyos Osorio, Luis Gonzalo Sanchez Giraldo, Oscar Skean","submitted_at":"2023-01-19T16:56:21Z","abstract_excerpt":"We introduce an information-theoretic quantity with similar properties to mutual information that can be estimated from data without making explicit assumptions on the underlying distribution. This quantity is based on a recently proposed matrix-based entropy that uses the eigenvalues of a normalized Gram matrix to compute an estimate of the eigenvalues of an uncentered covariance operator in a reproducing kernel Hilbert space. We show that a difference of matrix-based entropies (DiME) is well suited for problems involving the maximization of mutual information between random variables. While "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08164","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/2301.08164/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":"2301.08164","created_at":"2026-07-05T06:35:25.827369+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.08164v3","created_at":"2026-07-05T06:35:25.827369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08164","created_at":"2026-07-05T06:35:25.827369+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOI42RXBTN3F","created_at":"2026-07-05T06:35:25.827369+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOI42RXBTN3FJOWV","created_at":"2026-07-05T06:35:25.827369+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOI42RXB","created_at":"2026-07-05T06:35:25.827369+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06392","citing_title":"InsideSSL: Understanding Self-Supervised Speech Representations using a Model-Centric Perspective","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2606.22873","citing_title":"SingGuard: A Policy-Adaptive Multimodal LLM Guardrail with Dynamic Reasoning","ref_index":80,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11023","citing_title":"Generative Archetype-Grounded Item Representations for Sequential Recommendation","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2606.22873","citing_title":"SingGuard: A Policy-Adaptive Multimodal LLM Guardrail with Dynamic Reasoning","ref_index":80,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05668","citing_title":"Large Vision-Language Models Get Lost in Attention","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AOI42RXBTN3FJOWV27WKTTYV6N","json":"https://pith.science/pith/AOI42RXBTN3FJOWV27WKTTYV6N.json","graph_json":"https://pith.science/api/pith-number/AOI42RXBTN3FJOWV27WKTTYV6N/graph.json","events_json":"https://pith.science/api/pith-number/AOI42RXBTN3FJOWV27WKTTYV6N/events.json","paper":"https://pith.science/paper/AOI42RXB"},"agent_actions":{"view_html":"https://pith.science/pith/AOI42RXBTN3FJOWV27WKTTYV6N","download_json":"https://pith.science/pith/AOI42RXBTN3FJOWV27WKTTYV6N.json","view_paper":"https://pith.science/paper/AOI42RXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.08164&json=true","fetch_graph":"https://pith.science/api/pith-number/AOI42RXBTN3FJOWV27WKTTYV6N/graph.json","fetch_events":"https://pith.science/api/pith-number/AOI42RXBTN3FJOWV27WKTTYV6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOI42RXBTN3FJOWV27WKTTYV6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOI42RXBTN3FJOWV27WKTTYV6N/action/storage_attestation","attest_author":"https://pith.science/pith/AOI42RXBTN3FJOWV27WKTTYV6N/action/author_attestation","sign_citation":"https://pith.science/pith/AOI42RXBTN3FJOWV27WKTTYV6N/action/citation_signature","submit_replication":"https://pith.science/pith/AOI42RXBTN3FJOWV27WKTTYV6N/action/replication_record"}},"created_at":"2026-07-05T06:35:25.827369+00:00","updated_at":"2026-07-05T06:35:25.827369+00:00"}