{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RERGKRCDS7OWYWL5VLFA5DFS5L","short_pith_number":"pith:RERGKRCD","schema_version":"1.0","canonical_sha256":"892265444397dd6c597daaca0e8cb2eac5f3330ba74e066b7a9d0d1d52cce37a","source":{"kind":"arxiv","id":"1812.02230","version":1},"attestation_state":"computed","paper":{"title":"Towards a Definition of Disentangled Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Lerchner, Danilo Rezende, David Amos, David Pfau, Irina Higgins, Loic Matthey, Sebastien Racaniere","submitted_at":"2018-12-05T21:21:09Z","abstract_excerpt":"How can intelligent agents solve a diverse set of tasks in a data-efficient manner? The disentangled representation learning approach posits that such an agent would benefit from separating out (disentangling) the underlying structure of the world into disjoint parts of its representation. However, there is no generally agreed-upon definition of disentangling, not least because it is unclear how to formalise the notion of world structure beyond toy datasets with a known ground truth generative process. Here we propose that a principled solution to characterising disentangled representations ca"},"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":"1812.02230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-05T21:21:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"aa695e1a8d0e22732e5ddc026cb57851f2656574abebf6f484971c6041abbfc4","abstract_canon_sha256":"c03e0a092388d26a943921b8ce2e947d0c0207fd57ecc14b48d2b47176f02c77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:56.852482Z","signature_b64":"7/ehaLM6vwZzUaCT1TrhIgkFuy7pI+CfIYCDBKTgvbfB44CtIhmc7CzHAPebuoJFRezdZo+qmXEgP58htBixAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"892265444397dd6c597daaca0e8cb2eac5f3330ba74e066b7a9d0d1d52cce37a","last_reissued_at":"2026-05-17T23:58:56.851981Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:56.851981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a Definition of Disentangled Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Lerchner, Danilo Rezende, David Amos, David Pfau, Irina Higgins, Loic Matthey, Sebastien Racaniere","submitted_at":"2018-12-05T21:21:09Z","abstract_excerpt":"How can intelligent agents solve a diverse set of tasks in a data-efficient manner? The disentangled representation learning approach posits that such an agent would benefit from separating out (disentangling) the underlying structure of the world into disjoint parts of its representation. However, there is no generally agreed-upon definition of disentangling, not least because it is unclear how to formalise the notion of world structure beyond toy datasets with a known ground truth generative process. Here we propose that a principled solution to characterising disentangled representations ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02230","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":""},"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":"1812.02230","created_at":"2026-05-17T23:58:56.852047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02230v1","created_at":"2026-05-17T23:58:56.852047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02230","created_at":"2026-05-17T23:58:56.852047+00:00"},{"alias_kind":"pith_short_12","alias_value":"RERGKRCDS7OW","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RERGKRCDS7OWYWL5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RERGKRCD","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":19,"internal_anchor_count":13,"sample":[{"citing_arxiv_id":"1906.08652","citing_title":"Disentangling Influence: Using Disentangled Representations to Audit Model Predictions","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"1906.10545","citing_title":"Gauge theory and twins paradox of disentangled representations","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"1907.05274","citing_title":"Affine Disentangled GAN for Interpretable and Robust AV Perception","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"1907.09554","citing_title":"Product of Orthogonal Spheres Parameterization for Disentangled Representation Learning","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2504.19774","citing_title":"If Concept Bottlenecks are the Question, are Foundation Models the Answer?","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22531","citing_title":"Disentanglement Beyond Generative Models with Riemannian ICA","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22472","citing_title":"Winner-Take-All bottlenecks enforce disentangled symbolic representations in multi-task learning","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2506.08244","citing_title":"Algebraic Priors for Approximately Equivariant Networks","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21324","citing_title":"Stimulus symmetries can confound representational similarity analyses","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16405","citing_title":"Concepts Worth Having: Refining VLM-Guided Concept Bottleneck Models with Minimal Annotations","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13322","citing_title":"KamonBench: A Grammar-Based Dataset for Evaluating Compositional Factor Recovery in Vision-Language Models","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2509.22196","citing_title":"Mechanistic Independence: A Principle for Identifiable Disentangled Representations","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13322","citing_title":"KamonBench: A Grammar-Based Dataset for Evaluating Compositional Factor Recovery in Vision-Language Models","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03413","citing_title":"Learning to Theorize the World from Observation","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2311.03658","citing_title":"The Linear Representation Hypothesis and the Geometry of Large Language Models","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05493","citing_title":"A renormalization-group inspired lattice-based framework for piecewise generalized linear models","ref_index":266,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01381","citing_title":"A framework for analyzing concept representations in neural models","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04056","citing_title":"Transformation Categorization Based on Group Decomposition Theory Using Parameter Division","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16801","citing_title":"Continuous Limits of Coupled Flows in Representation Learning","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RERGKRCDS7OWYWL5VLFA5DFS5L","json":"https://pith.science/pith/RERGKRCDS7OWYWL5VLFA5DFS5L.json","graph_json":"https://pith.science/api/pith-number/RERGKRCDS7OWYWL5VLFA5DFS5L/graph.json","events_json":"https://pith.science/api/pith-number/RERGKRCDS7OWYWL5VLFA5DFS5L/events.json","paper":"https://pith.science/paper/RERGKRCD"},"agent_actions":{"view_html":"https://pith.science/pith/RERGKRCDS7OWYWL5VLFA5DFS5L","download_json":"https://pith.science/pith/RERGKRCDS7OWYWL5VLFA5DFS5L.json","view_paper":"https://pith.science/paper/RERGKRCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02230&json=true","fetch_graph":"https://pith.science/api/pith-number/RERGKRCDS7OWYWL5VLFA5DFS5L/graph.json","fetch_events":"https://pith.science/api/pith-number/RERGKRCDS7OWYWL5VLFA5DFS5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RERGKRCDS7OWYWL5VLFA5DFS5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RERGKRCDS7OWYWL5VLFA5DFS5L/action/storage_attestation","attest_author":"https://pith.science/pith/RERGKRCDS7OWYWL5VLFA5DFS5L/action/author_attestation","sign_citation":"https://pith.science/pith/RERGKRCDS7OWYWL5VLFA5DFS5L/action/citation_signature","submit_replication":"https://pith.science/pith/RERGKRCDS7OWYWL5VLFA5DFS5L/action/replication_record"}},"created_at":"2026-05-17T23:58:56.852047+00:00","updated_at":"2026-05-17T23:58:56.852047+00:00"}