{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A6UQLYKAXJF46XC4RDGEBTXTC4","short_pith_number":"pith:A6UQLYKA","schema_version":"1.0","canonical_sha256":"07a905e140ba4bcf5c5c88cc40cef317346ee03eb8055ae7cb1c6ee071fe9994","source":{"kind":"arxiv","id":"1410.7404","version":2},"attestation_state":"computed","paper":{"title":"Maximally Informative Hierarchical Representations of High-Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.data-an"],"primary_cat":"stat.ML","authors_text":"Aram Galstyan, Greg Ver Steeg","submitted_at":"2014-10-27T20:00:40Z","abstract_excerpt":"We consider a set of probabilistic functions of some input variables as a representation of the inputs. We present bounds on how informative a representation is about input data. We extend these bounds to hierarchical representations so that we can quantify the contribution of each layer towards capturing the information in the original data. The special form of these bounds leads to a simple, bottom-up optimization procedure to construct hierarchical representations that are also maximally informative about the data. This optimization has linear computational complexity and constant sample co"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1410.7404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-27T20:00:40Z","cross_cats_sorted":["cs.LG","physics.data-an"],"title_canon_sha256":"541248f9baf41db4b106f28d4d48a8e1db7a887dab1846ca947b1b01691f3586","abstract_canon_sha256":"92f4782f90525d647cb7006dc5d3284f04b7d3b4f42507e9285a74208e5f63c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:13.234676Z","signature_b64":"ILAKD30K+dPYVyDsOzFOAAcf7WaCLFBWA9zrSrArCIWQmG6Vi3yqhOW5lZiWsiThwKKofZzOvSV0ccowBp0RCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07a905e140ba4bcf5c5c88cc40cef317346ee03eb8055ae7cb1c6ee071fe9994","last_reissued_at":"2026-05-18T02:28:13.234175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:13.234175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximally Informative Hierarchical Representations of High-Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.data-an"],"primary_cat":"stat.ML","authors_text":"Aram Galstyan, Greg Ver Steeg","submitted_at":"2014-10-27T20:00:40Z","abstract_excerpt":"We consider a set of probabilistic functions of some input variables as a representation of the inputs. We present bounds on how informative a representation is about input data. We extend these bounds to hierarchical representations so that we can quantify the contribution of each layer towards capturing the information in the original data. The special form of these bounds leads to a simple, bottom-up optimization procedure to construct hierarchical representations that are also maximally informative about the data. This optimization has linear computational complexity and constant sample co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7404","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.7404","created_at":"2026-05-18T02:28:13.234258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7404v2","created_at":"2026-05-18T02:28:13.234258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7404","created_at":"2026-05-18T02:28:13.234258+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6UQLYKAXJF4","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6UQLYKAXJF46XC4","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6UQLYKA","created_at":"2026-05-18T12:28:19.803747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A6UQLYKAXJF46XC4RDGEBTXTC4","json":"https://pith.science/pith/A6UQLYKAXJF46XC4RDGEBTXTC4.json","graph_json":"https://pith.science/api/pith-number/A6UQLYKAXJF46XC4RDGEBTXTC4/graph.json","events_json":"https://pith.science/api/pith-number/A6UQLYKAXJF46XC4RDGEBTXTC4/events.json","paper":"https://pith.science/paper/A6UQLYKA"},"agent_actions":{"view_html":"https://pith.science/pith/A6UQLYKAXJF46XC4RDGEBTXTC4","download_json":"https://pith.science/pith/A6UQLYKAXJF46XC4RDGEBTXTC4.json","view_paper":"https://pith.science/paper/A6UQLYKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7404&json=true","fetch_graph":"https://pith.science/api/pith-number/A6UQLYKAXJF46XC4RDGEBTXTC4/graph.json","fetch_events":"https://pith.science/api/pith-number/A6UQLYKAXJF46XC4RDGEBTXTC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6UQLYKAXJF46XC4RDGEBTXTC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6UQLYKAXJF46XC4RDGEBTXTC4/action/storage_attestation","attest_author":"https://pith.science/pith/A6UQLYKAXJF46XC4RDGEBTXTC4/action/author_attestation","sign_citation":"https://pith.science/pith/A6UQLYKAXJF46XC4RDGEBTXTC4/action/citation_signature","submit_replication":"https://pith.science/pith/A6UQLYKAXJF46XC4RDGEBTXTC4/action/replication_record"}},"created_at":"2026-05-18T02:28:13.234258+00:00","updated_at":"2026-05-18T02:28:13.234258+00:00"}