{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L5IZOYVJP5UWYBGOURTJN2AI2Z","short_pith_number":"pith:L5IZOYVJ","schema_version":"1.0","canonical_sha256":"5f519762a97f696c04cea46696e808d66e92ce0fcc9662fbbd3ae47fe0d27533","source":{"kind":"arxiv","id":"1906.00804","version":1},"attestation_state":"computed","paper":{"title":"DualDis: Dual-Branch Disentangling with Adversarial Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Matthieu Cord, Nicolas Thome, Thomas Robert","submitted_at":"2019-06-03T13:42:59Z","abstract_excerpt":"In computer vision, disentangling techniques aim at improving latent representations of images by modeling factors of variation. In this paper, we propose DualDis, a new auto-encoder-based framework that disentangles and linearizes class and attribute information. This is achieved thanks to a two-branch architecture forcing the separation of the two kinds of information, accompanied by a decoder for image reconstruction and generation. To effectively separate the information, we propose to use a combination of regular and adversarial classifiers to guide the two branches in specializing for cl"},"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":"1906.00804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-03T13:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"225a0fb64a88f0c0cce82181ee177f0393a7cb106605ab14975a1dd6eca3d22a","abstract_canon_sha256":"43a533bfd8c9b51ca0a5909caa47d323c5ba09c5d75b59f8af6bbb0d7442052c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:23.838857Z","signature_b64":"TfMrfkfKCZBPLBiQj8MlOZqjH5IT0eunxkcYOjR1wBpC/1f4+j/1zO4vWJgCk1b1w7hNDfmxJk5eGFLy6xjSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f519762a97f696c04cea46696e808d66e92ce0fcc9662fbbd3ae47fe0d27533","last_reissued_at":"2026-05-17T23:44:23.838343Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:23.838343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DualDis: Dual-Branch Disentangling with Adversarial Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Matthieu Cord, Nicolas Thome, Thomas Robert","submitted_at":"2019-06-03T13:42:59Z","abstract_excerpt":"In computer vision, disentangling techniques aim at improving latent representations of images by modeling factors of variation. In this paper, we propose DualDis, a new auto-encoder-based framework that disentangles and linearizes class and attribute information. This is achieved thanks to a two-branch architecture forcing the separation of the two kinds of information, accompanied by a decoder for image reconstruction and generation. To effectively separate the information, we propose to use a combination of regular and adversarial classifiers to guide the two branches in specializing for cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00804","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":"1906.00804","created_at":"2026-05-17T23:44:23.838411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00804v1","created_at":"2026-05-17T23:44:23.838411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00804","created_at":"2026-05-17T23:44:23.838411+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5IZOYVJP5UW","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5IZOYVJP5UWYBGO","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5IZOYVJ","created_at":"2026-05-18T12:33:21.387695+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/L5IZOYVJP5UWYBGOURTJN2AI2Z","json":"https://pith.science/pith/L5IZOYVJP5UWYBGOURTJN2AI2Z.json","graph_json":"https://pith.science/api/pith-number/L5IZOYVJP5UWYBGOURTJN2AI2Z/graph.json","events_json":"https://pith.science/api/pith-number/L5IZOYVJP5UWYBGOURTJN2AI2Z/events.json","paper":"https://pith.science/paper/L5IZOYVJ"},"agent_actions":{"view_html":"https://pith.science/pith/L5IZOYVJP5UWYBGOURTJN2AI2Z","download_json":"https://pith.science/pith/L5IZOYVJP5UWYBGOURTJN2AI2Z.json","view_paper":"https://pith.science/paper/L5IZOYVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00804&json=true","fetch_graph":"https://pith.science/api/pith-number/L5IZOYVJP5UWYBGOURTJN2AI2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/L5IZOYVJP5UWYBGOURTJN2AI2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5IZOYVJP5UWYBGOURTJN2AI2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5IZOYVJP5UWYBGOURTJN2AI2Z/action/storage_attestation","attest_author":"https://pith.science/pith/L5IZOYVJP5UWYBGOURTJN2AI2Z/action/author_attestation","sign_citation":"https://pith.science/pith/L5IZOYVJP5UWYBGOURTJN2AI2Z/action/citation_signature","submit_replication":"https://pith.science/pith/L5IZOYVJP5UWYBGOURTJN2AI2Z/action/replication_record"}},"created_at":"2026-05-17T23:44:23.838411+00:00","updated_at":"2026-05-17T23:44:23.838411+00:00"}