{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:M6VLWVDW6QFIXWY7OMDK7TW25B","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":"aed64e3177801e136c574cd2fde8628d442c9dd2eed629cb0890bd795bb8c0b8","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-04T15:12:47Z","title_canon_sha256":"2fbf9ad2a80d608ad161b7b316ce3b2d696776ffaef881e65ea1a5345a9fc971"},"schema_version":"1.0","source":{"id":"1611.01414","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01414","created_at":"2026-05-18T00:19:47Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01414v3","created_at":"2026-05-18T00:19:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01414","created_at":"2026-05-18T00:19:47Z"},{"alias_kind":"pith_short_12","alias_value":"M6VLWVDW6QFI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M6VLWVDW6QFIXWY7","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M6VLWVDW","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:9eaeb4b0ac3ee8f8bf9f93850e3aba41ebd2824a2e9c309d08e69ecb01bbaf05","target":"graph","created_at":"2026-05-18T00:19:47Z","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":"While Shannon's mutual information has widespread applications in many disciplines, for practical applications it is often difficult to calculate its value accurately for high-dimensional variables because of the curse of dimensionality. This paper is focused on effective approximation methods for evaluating mutual information in the context of neural population coding. For large but finite neural populations, we derive several information-theoretic asymptotic bounds and approximation formulas that remain valid in high-dimensional spaces. We prove that optimizing the population density distrib","authors_text":"Kechen Zhang, Wentao Huang","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-04T15:12:47Z","title":"Information-Theoretic Bounds and Approximations in Neural Population Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01414","kind":"arxiv","version":3},"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:8187c3ac72e08e3cc3227b0e56d5a0b8213476dbf5ae37ed39ae545db12d3034","target":"record","created_at":"2026-05-18T00:19:47Z","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":"aed64e3177801e136c574cd2fde8628d442c9dd2eed629cb0890bd795bb8c0b8","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-04T15:12:47Z","title_canon_sha256":"2fbf9ad2a80d608ad161b7b316ce3b2d696776ffaef881e65ea1a5345a9fc971"},"schema_version":"1.0","source":{"id":"1611.01414","kind":"arxiv","version":3}},"canonical_sha256":"67aabb5476f40a8bdb1f7306afcedae863274a7371f9721913a1dba87358c421","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67aabb5476f40a8bdb1f7306afcedae863274a7371f9721913a1dba87358c421","first_computed_at":"2026-05-18T00:19:47.760843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:47.760843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6WZM0owMGhZQbb+YMBAW0ngNPM5sLRzyQyF7NP1w/bRNDyPxRTnSuTn6HTh8kymRcAK1lVNC9vn/om8MAzGfCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:47.761585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01414","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8187c3ac72e08e3cc3227b0e56d5a0b8213476dbf5ae37ed39ae545db12d3034","sha256:9eaeb4b0ac3ee8f8bf9f93850e3aba41ebd2824a2e9c309d08e69ecb01bbaf05"],"state_sha256":"a3240016d74807016bc8cccd4d338d13415830c0ee4a4958055ec68d3f996272"}