{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:HTEMJXRPTKAYXWN2CTXL4653MW","short_pith_number":"pith:HTEMJXRP","canonical_record":{"source":{"id":"2006.08558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-15T17:23:55Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"ebfbbc9eaed63031c3de31c376261296b67f8ac829c138e2d6ae9a31b98238ff","abstract_canon_sha256":"6959f2445083ba166db592d0ba668933a3e604624f8fdb4b1267000dc4d3da2d"},"schema_version":"1.0"},"canonical_sha256":"3cc8c4de2f9a818bd9ba14eebe7bbb659524a0eda63e4f6d74a64818c637e70f","source":{"kind":"arxiv","id":"2006.08558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.08558","created_at":"2026-07-05T01:10:22Z"},{"alias_kind":"arxiv_version","alias_value":"2006.08558v1","created_at":"2026-07-05T01:10:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08558","created_at":"2026-07-05T01:10:22Z"},{"alias_kind":"pith_short_12","alias_value":"HTEMJXRPTKAY","created_at":"2026-07-05T01:10:22Z"},{"alias_kind":"pith_short_16","alias_value":"HTEMJXRPTKAYXWN2","created_at":"2026-07-05T01:10:22Z"},{"alias_kind":"pith_short_8","alias_value":"HTEMJXRP","created_at":"2026-07-05T01:10:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:HTEMJXRPTKAYXWN2CTXL4653MW","target":"record","payload":{"canonical_record":{"source":{"id":"2006.08558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-15T17:23:55Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"ebfbbc9eaed63031c3de31c376261296b67f8ac829c138e2d6ae9a31b98238ff","abstract_canon_sha256":"6959f2445083ba166db592d0ba668933a3e604624f8fdb4b1267000dc4d3da2d"},"schema_version":"1.0"},"canonical_sha256":"3cc8c4de2f9a818bd9ba14eebe7bbb659524a0eda63e4f6d74a64818c637e70f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:22.621800Z","signature_b64":"vNbufh1LymFJ51yDJeLOBxQ2IuwuHiNXIMWN4VGg9TsLW3M+vRdyxDAzUXihtli8nHxbiA75Slm5VuPS/W8PCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cc8c4de2f9a818bd9ba14eebe7bbb659524a0eda63e4f6d74a64818c637e70f","last_reissued_at":"2026-07-05T01:10:22.621355Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:22.621355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.08558","source_version":1,"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-07-05T01:10:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQmqEv7FHzD+FwvyLIpm/QgIZLGlpCaJZXB0AO07mRgSJubGITzSJ0PLomtUFzfcnp9al1HlyaXG7ETHK0ekDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:20:34.818847Z"},"content_sha256":"083e2b66d39f8193e097387ef022257546a2a6172f05ac086438d721d0a27ca4","schema_version":"1.0","event_id":"sha256:083e2b66d39f8193e097387ef022257546a2a6172f05ac086438d721d0a27ca4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:HTEMJXRPTKAYXWN2CTXL4653MW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chaobing Song, Chong You, Kwan Ho Ryan Chan, Yaodong Yu, Yi Ma","submitted_at":"2020-06-15T17:23:55Z","abstract_excerpt":"To learn intrinsic low-dimensional structures from high-dimensional data that most discriminate between classes, we propose the principle of Maximal Coding Rate Reduction ($\\text{MCR}^2$), an information-theoretic measure that maximizes the coding rate difference between the whole dataset and the sum of each individual class. We clarify its relationships with most existing frameworks such as cross-entropy, information bottleneck, information gain, contractive and contrastive learning, and provide theoretical guarantees for learning diverse and discriminative features. The coding rate can be ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08558","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.08558/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"},"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-07-05T01:10:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jjqOHxxlEJszCOjWGM25Pu0kg3YFVpR93YYBjfgvF+F3+Mm+9pN7hkkNPXGRb+wa1izqndP+wEYkOSl9+MobBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:20:34.820487Z"},"content_sha256":"1c27fa99a2b2cbf9ae230d8fb87e79145b11800110e4ed1ccbf317e68452339b","schema_version":"1.0","event_id":"sha256:1c27fa99a2b2cbf9ae230d8fb87e79145b11800110e4ed1ccbf317e68452339b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTEMJXRPTKAYXWN2CTXL4653MW/bundle.json","state_url":"https://pith.science/pith/HTEMJXRPTKAYXWN2CTXL4653MW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTEMJXRPTKAYXWN2CTXL4653MW/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-08-05T14:20:34Z","links":{"resolver":"https://pith.science/pith/HTEMJXRPTKAYXWN2CTXL4653MW","bundle":"https://pith.science/pith/HTEMJXRPTKAYXWN2CTXL4653MW/bundle.json","state":"https://pith.science/pith/HTEMJXRPTKAYXWN2CTXL4653MW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTEMJXRPTKAYXWN2CTXL4653MW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HTEMJXRPTKAYXWN2CTXL4653MW","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":"6959f2445083ba166db592d0ba668933a3e604624f8fdb4b1267000dc4d3da2d","cross_cats_sorted":["cs.CV","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-15T17:23:55Z","title_canon_sha256":"ebfbbc9eaed63031c3de31c376261296b67f8ac829c138e2d6ae9a31b98238ff"},"schema_version":"1.0","source":{"id":"2006.08558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.08558","created_at":"2026-07-05T01:10:22Z"},{"alias_kind":"arxiv_version","alias_value":"2006.08558v1","created_at":"2026-07-05T01:10:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08558","created_at":"2026-07-05T01:10:22Z"},{"alias_kind":"pith_short_12","alias_value":"HTEMJXRPTKAY","created_at":"2026-07-05T01:10:22Z"},{"alias_kind":"pith_short_16","alias_value":"HTEMJXRPTKAYXWN2","created_at":"2026-07-05T01:10:22Z"},{"alias_kind":"pith_short_8","alias_value":"HTEMJXRP","created_at":"2026-07-05T01:10:22Z"}],"graph_snapshots":[{"event_id":"sha256:1c27fa99a2b2cbf9ae230d8fb87e79145b11800110e4ed1ccbf317e68452339b","target":"graph","created_at":"2026-07-05T01:10:22Z","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/2006.08558/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To learn intrinsic low-dimensional structures from high-dimensional data that most discriminate between classes, we propose the principle of Maximal Coding Rate Reduction ($\\text{MCR}^2$), an information-theoretic measure that maximizes the coding rate difference between the whole dataset and the sum of each individual class. We clarify its relationships with most existing frameworks such as cross-entropy, information bottleneck, information gain, contractive and contrastive learning, and provide theoretical guarantees for learning diverse and discriminative features. The coding rate can be ac","authors_text":"Chaobing Song, Chong You, Kwan Ho Ryan Chan, Yaodong Yu, Yi Ma","cross_cats":["cs.CV","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-15T17:23:55Z","title":"Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08558","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:083e2b66d39f8193e097387ef022257546a2a6172f05ac086438d721d0a27ca4","target":"record","created_at":"2026-07-05T01:10:22Z","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":"6959f2445083ba166db592d0ba668933a3e604624f8fdb4b1267000dc4d3da2d","cross_cats_sorted":["cs.CV","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-15T17:23:55Z","title_canon_sha256":"ebfbbc9eaed63031c3de31c376261296b67f8ac829c138e2d6ae9a31b98238ff"},"schema_version":"1.0","source":{"id":"2006.08558","kind":"arxiv","version":1}},"canonical_sha256":"3cc8c4de2f9a818bd9ba14eebe7bbb659524a0eda63e4f6d74a64818c637e70f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cc8c4de2f9a818bd9ba14eebe7bbb659524a0eda63e4f6d74a64818c637e70f","first_computed_at":"2026-07-05T01:10:22.621355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:10:22.621355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vNbufh1LymFJ51yDJeLOBxQ2IuwuHiNXIMWN4VGg9TsLW3M+vRdyxDAzUXihtli8nHxbiA75Slm5VuPS/W8PCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:10:22.621800Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.08558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:083e2b66d39f8193e097387ef022257546a2a6172f05ac086438d721d0a27ca4","sha256:1c27fa99a2b2cbf9ae230d8fb87e79145b11800110e4ed1ccbf317e68452339b"],"state_sha256":"ebc24448c2eae00690e9665e589c8540b1d9d30251859290e36a35c0976a35b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L7SnGvXhoQ2lT6c3I1flbcWm2wisjnAvP1DOH2hVJczMc3067H5BmoU+m8g4HimiPKPXlXW3yualSzKUdrayDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T14:20:34.830010Z","bundle_sha256":"ac36375fe506658450d354d1baec909ce50228fc59e1968a18d95ac8558acf1f"}}