{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:55QDCQMA6PQYF4ZR4XQTGCK5JZ","short_pith_number":"pith:55QDCQMA","schema_version":"1.0","canonical_sha256":"ef60314180f3e182f331e5e133095d4e7a2b7d839a2e8a9547f9a4f3b61b004e","source":{"kind":"arxiv","id":"1606.03657","version":1},"attestation_state":"computed","paper":{"title":"InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ilya Sutskever, John Schulman, Pieter Abbeel, Rein Houthooft, Xi Chen, Yan Duan","submitted_at":"2016-06-12T02:14:31Z","abstract_excerpt":"This paper describes InfoGAN, an information-theoretic extension to the Generative Adversarial Network that is able to learn disentangled representations in a completely unsupervised manner. InfoGAN is a generative adversarial network that also maximizes the mutual information between a small subset of the latent variables and the observation. We derive a lower bound to the mutual information objective that can be optimized efficiently, and show that our training procedure can be interpreted as a variation of the Wake-Sleep algorithm. Specifically, InfoGAN successfully disentangles writing sty"},"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":"1606.03657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-12T02:14:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"44df00c627280315b81002c3161e04f117fd28eec6dcc4c8d12d32a4d7fb2988","abstract_canon_sha256":"ec694273edb2a1d6aace38455178bfafa48f4921ac2957c182ae504bd6da0fc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:33.431461Z","signature_b64":"KRBQ1lRSSrTQFuqbwvIMA3ju37caqQA7kTZvL8k9FfAdypoOuSzslC9QUNwPdNZeSjZIpFWU32kKsCN4dX7OAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef60314180f3e182f331e5e133095d4e7a2b7d839a2e8a9547f9a4f3b61b004e","last_reissued_at":"2026-05-18T01:12:33.430968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:33.430968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ilya Sutskever, John Schulman, Pieter Abbeel, Rein Houthooft, Xi Chen, Yan Duan","submitted_at":"2016-06-12T02:14:31Z","abstract_excerpt":"This paper describes InfoGAN, an information-theoretic extension to the Generative Adversarial Network that is able to learn disentangled representations in a completely unsupervised manner. InfoGAN is a generative adversarial network that also maximizes the mutual information between a small subset of the latent variables and the observation. We derive a lower bound to the mutual information objective that can be optimized efficiently, and show that our training procedure can be interpreted as a variation of the Wake-Sleep algorithm. Specifically, InfoGAN successfully disentangles writing sty"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03657","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":"1606.03657","created_at":"2026-05-18T01:12:33.431034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03657v1","created_at":"2026-05-18T01:12:33.431034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03657","created_at":"2026-05-18T01:12:33.431034+00:00"},{"alias_kind":"pith_short_12","alias_value":"55QDCQMA6PQY","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"55QDCQMA6PQYF4ZR","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"55QDCQMA","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1907.05274","citing_title":"Affine Disentangled GAN for Interpretable and Robust AV Perception","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2102.01293","citing_title":"Scaling Laws for Transfer","ref_index":120,"is_internal_anchor":true},{"citing_arxiv_id":"2512.19469","citing_title":"GLUE: Coordinating Pre-Trained Generative Models for System-Level Design","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"1611.01144","citing_title":"Categorical Reparameterization with Gumbel-Softmax","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2112.00861","citing_title":"A General Language Assistant as a Laboratory for Alignment","ref_index":162,"is_internal_anchor":false},{"citing_arxiv_id":"2308.00352","citing_title":"MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework","ref_index":258,"is_internal_anchor":false},{"citing_arxiv_id":"2207.05221","citing_title":"Language Models (Mostly) Know What They Know","ref_index":239,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ","json":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ.json","graph_json":"https://pith.science/api/pith-number/55QDCQMA6PQYF4ZR4XQTGCK5JZ/graph.json","events_json":"https://pith.science/api/pith-number/55QDCQMA6PQYF4ZR4XQTGCK5JZ/events.json","paper":"https://pith.science/paper/55QDCQMA"},"agent_actions":{"view_html":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ","download_json":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ.json","view_paper":"https://pith.science/paper/55QDCQMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03657&json=true","fetch_graph":"https://pith.science/api/pith-number/55QDCQMA6PQYF4ZR4XQTGCK5JZ/graph.json","fetch_events":"https://pith.science/api/pith-number/55QDCQMA6PQYF4ZR4XQTGCK5JZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ/action/storage_attestation","attest_author":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ/action/author_attestation","sign_citation":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ/action/citation_signature","submit_replication":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ/action/replication_record"}},"created_at":"2026-05-18T01:12:33.431034+00:00","updated_at":"2026-05-18T01:12:33.431034+00:00"}