{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LBQJGMNZCO55BLH7LPRANHINQX","short_pith_number":"pith:LBQJGMNZ","canonical_record":{"source":{"id":"1905.03319","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T20:22:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"33a7a3b080b1615d9d909d35b18472159b6bbbb2a8e648acf94de3d2caa033ba","abstract_canon_sha256":"5e646540302e3ac775ab48eeeb4e7ad6e780d0f1dc975b1283b3b7f6f6bca447"},"schema_version":"1.0"},"canonical_sha256":"58609331b913bbd0acff5be2069d0d85fcb43e65d85a82b2606dba25c5df5d4f","source":{"kind":"arxiv","id":"1905.03319","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03319","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03319v2","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03319","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"LBQJGMNZCO55","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LBQJGMNZCO55BLH7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LBQJGMNZ","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LBQJGMNZCO55BLH7LPRANHINQX","target":"record","payload":{"canonical_record":{"source":{"id":"1905.03319","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T20:22:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"33a7a3b080b1615d9d909d35b18472159b6bbbb2a8e648acf94de3d2caa033ba","abstract_canon_sha256":"5e646540302e3ac775ab48eeeb4e7ad6e780d0f1dc975b1283b3b7f6f6bca447"},"schema_version":"1.0"},"canonical_sha256":"58609331b913bbd0acff5be2069d0d85fcb43e65d85a82b2606dba25c5df5d4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:08.900264Z","signature_b64":"y/W7f4ZK7oYhHr4K9vEbQOkW3E8iNMAzK5LB/42mOLC7ry7YzERlbsqSCK33W9t2iGlj+VLFgnYGLiEBwYW5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58609331b913bbd0acff5be2069d0d85fcb43e65d85a82b2606dba25c5df5d4f","last_reissued_at":"2026-05-17T23:45:08.899378Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:08.899378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.03319","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCv0xEs+uOUVNZ71Di5BetW2Fsp8H7uyAGdGA0YExGpMB5IVQl3wcluEgwjWqXZOO/ptvGc+49ZDPXrAilUdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:59:13.508668Z"},"content_sha256":"871cb57a6993abfbb1543cc5ef3466ab95b7dfcbd6256424e740a34ea6d64a83","schema_version":"1.0","event_id":"sha256:871cb57a6993abfbb1543cc5ef3466ab95b7dfcbd6256424e740a34ea6d64a83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LBQJGMNZCO55BLH7LPRANHINQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-Efficient Mutual Information Neural Estimator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ajay Divakaran, Indranil Sur, Mohamed R. Amer, Samuel A. Nastase, Uri Hasson, Xiao Lin","submitted_at":"2019-05-08T20:22:13Z","abstract_excerpt":"Measuring Mutual Information (MI) between high-dimensional, continuous, random variables from observed samples has wide theoretical and practical applications. Recent work, MINE (Belghazi et al. 2018), focused on estimating tight variational lower bounds of MI using neural networks, but assumed unlimited supply of samples to prevent overfitting. In real world applications, data is not always available at a surplus. In this work, we focus on improving data efficiency and propose a Data-Efficient MINE Estimator (DEMINE), by developing a relaxed predictive MI lower bound that can be estimated at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03319","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIwQyOYcuMPZd+3Fso6IFFhYnNVxc7rX50W7UdU4zeZ2byRzLTzi74AP6ZbrfzvJTluMIVzrKJAvoTj45WI+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:59:13.509029Z"},"content_sha256":"9e065e4e0c427d74daf059b85ac4e65341cb069bdac80aa6dba3cf69a5d72fd0","schema_version":"1.0","event_id":"sha256:9e065e4e0c427d74daf059b85ac4e65341cb069bdac80aa6dba3cf69a5d72fd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBQJGMNZCO55BLH7LPRANHINQX/bundle.json","state_url":"https://pith.science/pith/LBQJGMNZCO55BLH7LPRANHINQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBQJGMNZCO55BLH7LPRANHINQX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T21:59:13Z","links":{"resolver":"https://pith.science/pith/LBQJGMNZCO55BLH7LPRANHINQX","bundle":"https://pith.science/pith/LBQJGMNZCO55BLH7LPRANHINQX/bundle.json","state":"https://pith.science/pith/LBQJGMNZCO55BLH7LPRANHINQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBQJGMNZCO55BLH7LPRANHINQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LBQJGMNZCO55BLH7LPRANHINQX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5e646540302e3ac775ab48eeeb4e7ad6e780d0f1dc975b1283b3b7f6f6bca447","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T20:22:13Z","title_canon_sha256":"33a7a3b080b1615d9d909d35b18472159b6bbbb2a8e648acf94de3d2caa033ba"},"schema_version":"1.0","source":{"id":"1905.03319","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03319","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03319v2","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03319","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"LBQJGMNZCO55","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LBQJGMNZCO55BLH7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LBQJGMNZ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:9e065e4e0c427d74daf059b85ac4e65341cb069bdac80aa6dba3cf69a5d72fd0","target":"graph","created_at":"2026-05-17T23:45:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Measuring Mutual Information (MI) between high-dimensional, continuous, random variables from observed samples has wide theoretical and practical applications. Recent work, MINE (Belghazi et al. 2018), focused on estimating tight variational lower bounds of MI using neural networks, but assumed unlimited supply of samples to prevent overfitting. In real world applications, data is not always available at a surplus. In this work, we focus on improving data efficiency and propose a Data-Efficient MINE Estimator (DEMINE), by developing a relaxed predictive MI lower bound that can be estimated at ","authors_text":"Ajay Divakaran, Indranil Sur, Mohamed R. Amer, Samuel A. Nastase, Uri Hasson, Xiao Lin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T20:22:13Z","title":"Data-Efficient Mutual Information Neural Estimator"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03319","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:871cb57a6993abfbb1543cc5ef3466ab95b7dfcbd6256424e740a34ea6d64a83","target":"record","created_at":"2026-05-17T23:45:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5e646540302e3ac775ab48eeeb4e7ad6e780d0f1dc975b1283b3b7f6f6bca447","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T20:22:13Z","title_canon_sha256":"33a7a3b080b1615d9d909d35b18472159b6bbbb2a8e648acf94de3d2caa033ba"},"schema_version":"1.0","source":{"id":"1905.03319","kind":"arxiv","version":2}},"canonical_sha256":"58609331b913bbd0acff5be2069d0d85fcb43e65d85a82b2606dba25c5df5d4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58609331b913bbd0acff5be2069d0d85fcb43e65d85a82b2606dba25c5df5d4f","first_computed_at":"2026-05-17T23:45:08.899378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:08.899378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y/W7f4ZK7oYhHr4K9vEbQOkW3E8iNMAzK5LB/42mOLC7ry7YzERlbsqSCK33W9t2iGlj+VLFgnYGLiEBwYW5Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:08.900264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03319","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:871cb57a6993abfbb1543cc5ef3466ab95b7dfcbd6256424e740a34ea6d64a83","sha256:9e065e4e0c427d74daf059b85ac4e65341cb069bdac80aa6dba3cf69a5d72fd0"],"state_sha256":"165cd4ad2c571a4b5c66353e7a6b551cd6487c51cf06ffe3ae9a3db56cd8779b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwXvmQ5vfn874fzYpGfsvP6fFEHgHXXLu9WB/1F0ndPQTI16F2FCe5q4ixO//d0Ova1N6D1bcC3l4ugsG6hFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:59:13.510937Z","bundle_sha256":"9d91f8d3137f07c9d0570974956c4705a26ce5c49592e4d4d0bd4dd3e38f5218"}}