{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:55QDCQMA6PQYF4ZR4XQTGCK5JZ","short_pith_number":"pith:55QDCQMA","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"},"canonical_sha256":"ef60314180f3e182f331e5e133095d4e7a2b7d839a2e8a9547f9a4f3b61b004e","source":{"kind":"arxiv","id":"1606.03657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03657","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03657v1","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03657","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"55QDCQMA6PQY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"55QDCQMA6PQYF4ZR","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"55QDCQMA","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:55QDCQMA6PQYF4ZR4XQTGCK5JZ","target":"record","payload":{"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"},"canonical_sha256":"ef60314180f3e182f331e5e133095d4e7a2b7d839a2e8a9547f9a4f3b61b004e","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"},"source_kind":"arxiv","source_id":"1606.03657","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXfPk5liD3hEzABIpwIa1wtDM0G78/YvAcVRWllFEvxbdVzz5ObyRe8R8/VcmTbqa9rZ63Nf5d32s3ku+sJ+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:10:31.601087Z"},"content_sha256":"af896045c33afa6d9fc0d2de00eadff9892469a397bcd46c2bb418a085863c60","schema_version":"1.0","event_id":"sha256:af896045c33afa6d9fc0d2de00eadff9892469a397bcd46c2bb418a085863c60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:55QDCQMA6PQYF4ZR4XQTGCK5JZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z8Vt4eoDHxvGRvucAP/e8ucQNjH2vLxHEha2lbIggKur1D2NUAx+He2eX4UkxN+Tg9py6lpOJX+MQjWM+I6ZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:10:31.601799Z"},"content_sha256":"ed1d8bca90f5b4e65a71ae2543619a64923db59a2c21879060f039d822c0d5bd","schema_version":"1.0","event_id":"sha256:ed1d8bca90f5b4e65a71ae2543619a64923db59a2c21879060f039d822c0d5bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ/bundle.json","state_url":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T01:10:31Z","links":{"resolver":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ","bundle":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ/bundle.json","state":"https://pith.science/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55QDCQMA6PQYF4ZR4XQTGCK5JZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:55QDCQMA6PQYF4ZR4XQTGCK5JZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ec694273edb2a1d6aace38455178bfafa48f4921ac2957c182ae504bd6da0fc1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-12T02:14:31Z","title_canon_sha256":"44df00c627280315b81002c3161e04f117fd28eec6dcc4c8d12d32a4d7fb2988"},"schema_version":"1.0","source":{"id":"1606.03657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03657","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03657v1","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03657","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"55QDCQMA6PQY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"55QDCQMA6PQYF4ZR","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"55QDCQMA","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:ed1d8bca90f5b4e65a71ae2543619a64923db59a2c21879060f039d822c0d5bd","target":"graph","created_at":"2026-05-18T01:12:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ilya Sutskever, John Schulman, Pieter Abbeel, Rein Houthooft, Xi Chen, Yan Duan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-12T02:14:31Z","title":"InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03657","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:af896045c33afa6d9fc0d2de00eadff9892469a397bcd46c2bb418a085863c60","target":"record","created_at":"2026-05-18T01:12:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ec694273edb2a1d6aace38455178bfafa48f4921ac2957c182ae504bd6da0fc1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-12T02:14:31Z","title_canon_sha256":"44df00c627280315b81002c3161e04f117fd28eec6dcc4c8d12d32a4d7fb2988"},"schema_version":"1.0","source":{"id":"1606.03657","kind":"arxiv","version":1}},"canonical_sha256":"ef60314180f3e182f331e5e133095d4e7a2b7d839a2e8a9547f9a4f3b61b004e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef60314180f3e182f331e5e133095d4e7a2b7d839a2e8a9547f9a4f3b61b004e","first_computed_at":"2026-05-18T01:12:33.430968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:33.430968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KRBQ1lRSSrTQFuqbwvIMA3ju37caqQA7kTZvL8k9FfAdypoOuSzslC9QUNwPdNZeSjZIpFWU32kKsCN4dX7OAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:33.431461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af896045c33afa6d9fc0d2de00eadff9892469a397bcd46c2bb418a085863c60","sha256:ed1d8bca90f5b4e65a71ae2543619a64923db59a2c21879060f039d822c0d5bd"],"state_sha256":"868a222298ff1b80a2084de0c0ffa2e6ec3460529ce6f81ef82aa832c163aefe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xO/AvJ56M0SbeVHuV9RtzYZiyrBqdFYnJXpQKzAyEjOUMTKWgtbJhMIJPfC00rHZpwBF/1tB3dd5bzJThVvGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T01:10:31.605415Z","bundle_sha256":"d7e2e273f5900cb9dcbd07b7612f3ab075c3cd781a5cdccee3bf7aef037ece0c"}}