{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G6ESSD5MQ4ZI6QJYS34AA3QBBH","short_pith_number":"pith:G6ESSD5M","schema_version":"1.0","canonical_sha256":"3789290fac87328f413896f8006e0109e04923cfa7563d4fa7d5c70f5e44d154","source":{"kind":"arxiv","id":"1905.12784","version":2},"attestation_state":"computed","paper":{"title":"Intrinsic dimension of data representations in deep neural networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Laio, Alessio Ansuini, Davide Zoccolan, Jakob H. Macke","submitted_at":"2019-05-29T23:36:34Z","abstract_excerpt":"Deep neural networks progressively transform their inputs across multiple processing layers. What are the geometrical properties of the representations learned by these networks? Here we study the intrinsic dimensionality (ID) of data-representations, i.e. the minimal number of parameters needed to describe a representation. We find that, in a trained network, the ID is orders of magnitude smaller than the number of units in each layer. Across layers, the ID first increases and then progressively decreases in the final layers. Remarkably, the ID of the last hidden layer predicts classification"},"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":"1905.12784","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T23:36:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"66570236e804a02fcedba6cd4c1170a8662b766745fa4bd5341a1e08391f6323","abstract_canon_sha256":"691e0bfc878e771e87e9f38a03db8453aa9f6a3d4786ab351abda02d2b93a796"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:05.647980Z","signature_b64":"pPnwTtFje50QBjbh4Izaoo1F51II/GII+qmWKY96EtVE4nSEkRqxCWrqx5MHmLd3qdickV/I72/U/o5APxehAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3789290fac87328f413896f8006e0109e04923cfa7563d4fa7d5c70f5e44d154","last_reissued_at":"2026-07-05T00:15:05.647500Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:05.647500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intrinsic dimension of data representations in deep neural networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Laio, Alessio Ansuini, Davide Zoccolan, Jakob H. Macke","submitted_at":"2019-05-29T23:36:34Z","abstract_excerpt":"Deep neural networks progressively transform their inputs across multiple processing layers. What are the geometrical properties of the representations learned by these networks? Here we study the intrinsic dimensionality (ID) of data-representations, i.e. the minimal number of parameters needed to describe a representation. We find that, in a trained network, the ID is orders of magnitude smaller than the number of units in each layer. Across layers, the ID first increases and then progressively decreases in the final layers. Remarkably, the ID of the last hidden layer predicts classification"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12784","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.12784/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.12784","created_at":"2026-07-05T00:15:05.647558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12784v2","created_at":"2026-07-05T00:15:05.647558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12784","created_at":"2026-07-05T00:15:05.647558+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6ESSD5MQ4ZI","created_at":"2026-07-05T00:15:05.647558+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6ESSD5MQ4ZI6QJY","created_at":"2026-07-05T00:15:05.647558+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6ESSD5M","created_at":"2026-07-05T00:15:05.647558+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19268","citing_title":"Patnaik-Pearson intrinsic dimension for internal representations of neural networks","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2606.19268","citing_title":"Patnaik-Pearson intrinsic dimension for internal representations of neural networks","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06854","citing_title":"The Geometry of Last-Layer Model Stealing","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01443","citing_title":"UR-JEPA: Uniform Rectifiability as a Regularizer for Joint-Embedding Predictive Architectures","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13082","citing_title":"The Long Delay to Arithmetic Generalization: When Learned Representations Outrun Behavior","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G6ESSD5MQ4ZI6QJYS34AA3QBBH","json":"https://pith.science/pith/G6ESSD5MQ4ZI6QJYS34AA3QBBH.json","graph_json":"https://pith.science/api/pith-number/G6ESSD5MQ4ZI6QJYS34AA3QBBH/graph.json","events_json":"https://pith.science/api/pith-number/G6ESSD5MQ4ZI6QJYS34AA3QBBH/events.json","paper":"https://pith.science/paper/G6ESSD5M"},"agent_actions":{"view_html":"https://pith.science/pith/G6ESSD5MQ4ZI6QJYS34AA3QBBH","download_json":"https://pith.science/pith/G6ESSD5MQ4ZI6QJYS34AA3QBBH.json","view_paper":"https://pith.science/paper/G6ESSD5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12784&json=true","fetch_graph":"https://pith.science/api/pith-number/G6ESSD5MQ4ZI6QJYS34AA3QBBH/graph.json","fetch_events":"https://pith.science/api/pith-number/G6ESSD5MQ4ZI6QJYS34AA3QBBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6ESSD5MQ4ZI6QJYS34AA3QBBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6ESSD5MQ4ZI6QJYS34AA3QBBH/action/storage_attestation","attest_author":"https://pith.science/pith/G6ESSD5MQ4ZI6QJYS34AA3QBBH/action/author_attestation","sign_citation":"https://pith.science/pith/G6ESSD5MQ4ZI6QJYS34AA3QBBH/action/citation_signature","submit_replication":"https://pith.science/pith/G6ESSD5MQ4ZI6QJYS34AA3QBBH/action/replication_record"}},"created_at":"2026-07-05T00:15:05.647558+00:00","updated_at":"2026-07-05T00:15:05.647558+00:00"}