{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3DXIRZ45QCQU3KDEUL4IURLOGO","short_pith_number":"pith:3DXIRZ45","canonical_record":{"source":{"id":"1611.01886","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-07T04:17:28Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","q-bio.NC","stat.ML"],"title_canon_sha256":"4a8f9e4126aabe6c2796776ec5cfb607406bb9133ba426d1bb5b60a0d3cbe341","abstract_canon_sha256":"f6e877e6340e2ed94c29ed3c710f79e33042dd9dade61b300d8d5f958afb6b7f"},"schema_version":"1.0"},"canonical_sha256":"d8ee88e79d80a14da864a2f88a456e339ed3a51d46dc7f6dd43258c811e2737d","source":{"kind":"arxiv","id":"1611.01886","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01886","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01886v4","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01886","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"3DXIRZ45QCQU","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3DXIRZ45QCQU3KDE","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3DXIRZ45","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3DXIRZ45QCQU3KDEUL4IURLOGO","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01886","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-07T04:17:28Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","q-bio.NC","stat.ML"],"title_canon_sha256":"4a8f9e4126aabe6c2796776ec5cfb607406bb9133ba426d1bb5b60a0d3cbe341","abstract_canon_sha256":"f6e877e6340e2ed94c29ed3c710f79e33042dd9dade61b300d8d5f958afb6b7f"},"schema_version":"1.0"},"canonical_sha256":"d8ee88e79d80a14da864a2f88a456e339ed3a51d46dc7f6dd43258c811e2737d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:59.739445Z","signature_b64":"9Lwz2royxoX4hqOCnmYbvbXFnrLiJyDsVRb8YxiBQycDAH1JpcJrMwd4EI74kQ7Mcm7AX5mbndqSw3dAAm9cBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8ee88e79d80a14da864a2f88a456e339ed3a51d46dc7f6dd43258c811e2737d","last_reissued_at":"2026-05-18T00:48:59.738755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:59.738755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01886","source_version":4,"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-18T00:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HstByaxpHnDloFbZE2nGNsr3pLKYBSC/rYE9aZRpCv0e7r/C5ce/bexE2Qt2Yd6NJ+1O8EF6ooCogk4gd0lBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:20:23.644770Z"},"content_sha256":"f9428ede6afdc6208f1b34a2f7a390155289339cf45e544031b551e9697f576c","schema_version":"1.0","event_id":"sha256:f9428ede6afdc6208f1b34a2f7a390155289339cf45e544031b551e9697f576c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3DXIRZ45QCQU3KDEUL4IURLOGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Information-Theoretic Framework for Fast and Robust Unsupervised Learning via Neural Population Infomax","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","q-bio.NC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kechen Zhang, Wentao Huang","submitted_at":"2016-11-07T04:17:28Z","abstract_excerpt":"A framework is presented for unsupervised learning of representations based on infomax principle for large-scale neural populations. We use an asymptotic approximation to the Shannon's mutual information for a large neural population to demonstrate that a good initial approximation to the global information-theoretic optimum can be obtained by a hierarchical infomax method. Starting from the initial solution, an efficient algorithm based on gradient descent of the final objective function is proposed to learn representations from the input datasets, and the method works for complete, overcompl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01886","kind":"arxiv","version":4},"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-18T00:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zhy7qAefLeqcfvE3cUrpgV5pQW2UNgEaeen8i0b9MKAetc4/NRehPeNW6qGnVwIF3euWflrzHymGiOhEDGJoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:20:23.645116Z"},"content_sha256":"1b3cf54794c99886e894af9405391f692e69af8937272e12212ed68794e05ce5","schema_version":"1.0","event_id":"sha256:1b3cf54794c99886e894af9405391f692e69af8937272e12212ed68794e05ce5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DXIRZ45QCQU3KDEUL4IURLOGO/bundle.json","state_url":"https://pith.science/pith/3DXIRZ45QCQU3KDEUL4IURLOGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DXIRZ45QCQU3KDEUL4IURLOGO/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-24T09:20:23Z","links":{"resolver":"https://pith.science/pith/3DXIRZ45QCQU3KDEUL4IURLOGO","bundle":"https://pith.science/pith/3DXIRZ45QCQU3KDEUL4IURLOGO/bundle.json","state":"https://pith.science/pith/3DXIRZ45QCQU3KDEUL4IURLOGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DXIRZ45QCQU3KDEUL4IURLOGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3DXIRZ45QCQU3KDEUL4IURLOGO","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":"f6e877e6340e2ed94c29ed3c710f79e33042dd9dade61b300d8d5f958afb6b7f","cross_cats_sorted":["cs.AI","cs.IT","math.IT","q-bio.NC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-07T04:17:28Z","title_canon_sha256":"4a8f9e4126aabe6c2796776ec5cfb607406bb9133ba426d1bb5b60a0d3cbe341"},"schema_version":"1.0","source":{"id":"1611.01886","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01886","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01886v4","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01886","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"3DXIRZ45QCQU","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3DXIRZ45QCQU3KDE","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3DXIRZ45","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:1b3cf54794c99886e894af9405391f692e69af8937272e12212ed68794e05ce5","target":"graph","created_at":"2026-05-18T00:48:59Z","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":"A framework is presented for unsupervised learning of representations based on infomax principle for large-scale neural populations. We use an asymptotic approximation to the Shannon's mutual information for a large neural population to demonstrate that a good initial approximation to the global information-theoretic optimum can be obtained by a hierarchical infomax method. Starting from the initial solution, an efficient algorithm based on gradient descent of the final objective function is proposed to learn representations from the input datasets, and the method works for complete, overcompl","authors_text":"Kechen Zhang, Wentao Huang","cross_cats":["cs.AI","cs.IT","math.IT","q-bio.NC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-07T04:17:28Z","title":"An Information-Theoretic Framework for Fast and Robust Unsupervised Learning via Neural Population Infomax"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01886","kind":"arxiv","version":4},"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:f9428ede6afdc6208f1b34a2f7a390155289339cf45e544031b551e9697f576c","target":"record","created_at":"2026-05-18T00:48:59Z","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":"f6e877e6340e2ed94c29ed3c710f79e33042dd9dade61b300d8d5f958afb6b7f","cross_cats_sorted":["cs.AI","cs.IT","math.IT","q-bio.NC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-07T04:17:28Z","title_canon_sha256":"4a8f9e4126aabe6c2796776ec5cfb607406bb9133ba426d1bb5b60a0d3cbe341"},"schema_version":"1.0","source":{"id":"1611.01886","kind":"arxiv","version":4}},"canonical_sha256":"d8ee88e79d80a14da864a2f88a456e339ed3a51d46dc7f6dd43258c811e2737d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8ee88e79d80a14da864a2f88a456e339ed3a51d46dc7f6dd43258c811e2737d","first_computed_at":"2026-05-18T00:48:59.738755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:59.738755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Lwz2royxoX4hqOCnmYbvbXFnrLiJyDsVRb8YxiBQycDAH1JpcJrMwd4EI74kQ7Mcm7AX5mbndqSw3dAAm9cBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:59.739445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01886","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9428ede6afdc6208f1b34a2f7a390155289339cf45e544031b551e9697f576c","sha256:1b3cf54794c99886e894af9405391f692e69af8937272e12212ed68794e05ce5"],"state_sha256":"13bb4adc80891d296e3dcd3d85314e1a2570c21a05d08e98c7fe5b9c7f8bdc76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38EZdXpxBZYQ1M5m7Ne+65L6oaEfg4wl9UW1gl90znyeq1mVOWuzo9FVMnCE/fRaX+ZPcoJDjjyyXveR+ARgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T09:20:23.647073Z","bundle_sha256":"92a5f84537c05ad3f5c62de172c302e51d75965dca02d497a34c1c46b6b923f4"}}