{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:KABMBNJWG2QIUD2E3YCXHZTYCV","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":"a04a5e4764b5213c4d1b4ce4a066c1a3613bdf5999368c13a6d44fdfaf86fe8f","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-01T08:20:04Z","title_canon_sha256":"498ef6626de884ee7fa9064efd79fa274708e3340aa0d2c27ab0a521abe4cbac"},"schema_version":"1.0","source":{"id":"2105.00191","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.00191","created_at":"2026-07-05T02:36:35Z"},{"alias_kind":"arxiv_version","alias_value":"2105.00191v1","created_at":"2026-07-05T02:36:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.00191","created_at":"2026-07-05T02:36:35Z"},{"alias_kind":"pith_short_12","alias_value":"KABMBNJWG2QI","created_at":"2026-07-05T02:36:35Z"},{"alias_kind":"pith_short_16","alias_value":"KABMBNJWG2QIUD2E","created_at":"2026-07-05T02:36:35Z"},{"alias_kind":"pith_short_8","alias_value":"KABMBNJW","created_at":"2026-07-05T02:36:35Z"}],"graph_snapshots":[{"event_id":"sha256:b1bd8737c75b97fa962689d5856faeaafa690ffcc338859554a2815e7f5efcf3","target":"graph","created_at":"2026-07-05T02:36:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.00191/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Feature ranking and selection is a widely used approach in various applications of supervised dimensionality reduction in discriminative machine learning. Nevertheless there exists significant evidence on feature ranking and selection algorithms based on any criterion leading to potentially sub-optimal solutions for class separability. In that regard, we introduce emerging information theoretic feature transformation protocols as an end-to-end neural network training approach. We present a dimensionality reduction network (MMINet) training procedure based on the stochastic estimate of the mutu","authors_text":"Deniz Erdogmus, Ozan Ozdenizci","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-01T08:20:04Z","title":"Stochastic Mutual Information Gradient Estimation for Dimensionality Reduction Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.00191","kind":"arxiv","version":1},"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:06aa099ef99245a4f7715031335b0a17abe84ebaa2f910a86c1b3d8ae212c2c9","target":"record","created_at":"2026-07-05T02:36:35Z","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":"a04a5e4764b5213c4d1b4ce4a066c1a3613bdf5999368c13a6d44fdfaf86fe8f","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-01T08:20:04Z","title_canon_sha256":"498ef6626de884ee7fa9064efd79fa274708e3340aa0d2c27ab0a521abe4cbac"},"schema_version":"1.0","source":{"id":"2105.00191","kind":"arxiv","version":1}},"canonical_sha256":"5002c0b53636a08a0f44de0573e67815402e3983ad14cf96f3a367f97b300f71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5002c0b53636a08a0f44de0573e67815402e3983ad14cf96f3a367f97b300f71","first_computed_at":"2026-07-05T02:36:35.015554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:36:35.015554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wOfUckAp2K0bd/oRim5TVrPBx8ORigNX0z5A2itxp3OnfSq6HOE53jWbvd6qWyPEZYK6j5M4OdCLZpxkDtrPDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:36:35.016011Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.00191","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06aa099ef99245a4f7715031335b0a17abe84ebaa2f910a86c1b3d8ae212c2c9","sha256:b1bd8737c75b97fa962689d5856faeaafa690ffcc338859554a2815e7f5efcf3"],"state_sha256":"0da8c503ce9a6288c0261ff6b46b66332f6d412898b0b93bac462a69e9729f46"}