{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZOTB2K6A5CRNKGH3V4T2WKCSR7","short_pith_number":"pith:ZOTB2K6A","schema_version":"1.0","canonical_sha256":"cba61d2bc0e8a2d518fbaf27ab28528fe920628cea70c646eb8be066e7b8ef84","source":{"kind":"arxiv","id":"1908.09961","version":3},"attestation_state":"computed","paper":{"title":"Theory and Evaluation Metrics for Learning Disentangled Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kien Do, Truyen Tran","submitted_at":"2019-08-26T23:55:11Z","abstract_excerpt":"We make two theoretical contributions to disentanglement learning by (a) defining precise semantics of disentangled representations, and (b) establishing robust metrics for evaluation. First, we characterize the concept \"disentangled representations\" used in supervised and unsupervised methods along three dimensions-informativeness, separability and interpretability - which can be expressed and quantified explicitly using information-theoretic constructs. This helps explain the behaviors of several well-known disentanglement learning models. We then propose robust metrics for measuring informa"},"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":"1908.09961","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-26T23:55:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1790255e4f6d97f9284656025b0e34a21253ca3660d2118d5cc9d7e416b59250","abstract_canon_sha256":"3e200c0f3fdd929e2b7e28592c57a0f2c036abe5cb03b6990266b50254082431"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:24:27.595851Z","signature_b64":"rZbcuQIWEYQ+h4R58trApx9RYGw7UtArz3m9DSfJgOhojQNbwywwVSjX6AL0fSnA6+71ZnuthxxjG822WCAmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cba61d2bc0e8a2d518fbaf27ab28528fe920628cea70c646eb8be066e7b8ef84","last_reissued_at":"2026-07-05T02:24:27.595388Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:24:27.595388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Theory and Evaluation Metrics for Learning Disentangled Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kien Do, Truyen Tran","submitted_at":"2019-08-26T23:55:11Z","abstract_excerpt":"We make two theoretical contributions to disentanglement learning by (a) defining precise semantics of disentangled representations, and (b) establishing robust metrics for evaluation. First, we characterize the concept \"disentangled representations\" used in supervised and unsupervised methods along three dimensions-informativeness, separability and interpretability - which can be expressed and quantified explicitly using information-theoretic constructs. This helps explain the behaviors of several well-known disentanglement learning models. We then propose robust metrics for measuring informa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09961","kind":"arxiv","version":3},"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/1908.09961/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":"1908.09961","created_at":"2026-07-05T02:24:27.595447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09961v3","created_at":"2026-07-05T02:24:27.595447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09961","created_at":"2026-07-05T02:24:27.595447+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOTB2K6A5CRN","created_at":"2026-07-05T02:24:27.595447+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOTB2K6A5CRNKGH3","created_at":"2026-07-05T02:24:27.595447+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOTB2K6A","created_at":"2026-07-05T02:24:27.595447+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02385","citing_title":"How Optimality Structures Sparse Dictionaries: A Theory for Understanding SAE Representations","ref_index":244,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZOTB2K6A5CRNKGH3V4T2WKCSR7","json":"https://pith.science/pith/ZOTB2K6A5CRNKGH3V4T2WKCSR7.json","graph_json":"https://pith.science/api/pith-number/ZOTB2K6A5CRNKGH3V4T2WKCSR7/graph.json","events_json":"https://pith.science/api/pith-number/ZOTB2K6A5CRNKGH3V4T2WKCSR7/events.json","paper":"https://pith.science/paper/ZOTB2K6A"},"agent_actions":{"view_html":"https://pith.science/pith/ZOTB2K6A5CRNKGH3V4T2WKCSR7","download_json":"https://pith.science/pith/ZOTB2K6A5CRNKGH3V4T2WKCSR7.json","view_paper":"https://pith.science/paper/ZOTB2K6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09961&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOTB2K6A5CRNKGH3V4T2WKCSR7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOTB2K6A5CRNKGH3V4T2WKCSR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOTB2K6A5CRNKGH3V4T2WKCSR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOTB2K6A5CRNKGH3V4T2WKCSR7/action/storage_attestation","attest_author":"https://pith.science/pith/ZOTB2K6A5CRNKGH3V4T2WKCSR7/action/author_attestation","sign_citation":"https://pith.science/pith/ZOTB2K6A5CRNKGH3V4T2WKCSR7/action/citation_signature","submit_replication":"https://pith.science/pith/ZOTB2K6A5CRNKGH3V4T2WKCSR7/action/replication_record"}},"created_at":"2026-07-05T02:24:27.595447+00:00","updated_at":"2026-07-05T02:24:27.595447+00:00"}