{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ISGSAUJIUXGS2LU4PSD5EP5265","short_pith_number":"pith:ISGSAUJI","schema_version":"1.0","canonical_sha256":"448d205128a5cd2d2e9c7c87d23fbaf76a0af30cd8ddbbdee695b7b2cb36c2cf","source":{"kind":"arxiv","id":"1807.07603","version":1},"attestation_state":"computed","paper":{"title":"Doubly Stochastic Adversarial Autoencoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mahdi Azarafrooz","submitted_at":"2018-07-19T18:51:31Z","abstract_excerpt":"Any autoencoder network can be turned into a generative model by imposing an arbitrary prior distribution on its hidden code vector. Variational Autoencoder (VAE) [2] uses a KL divergence penalty to impose the prior, whereas Adversarial Autoencoder (AAE) [1] uses {\\it generative adversarial networks} GAN [3]. GAN trades the complexities of {\\it sampling} algorithms with the complexities of {\\it searching} Nash equilibrium in minimax games. Such minimax architectures get trained with the help of data examples and gradients flowing through a generator and an adversary. A straightforward modifica"},"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":"1807.07603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-19T18:51:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"446881e344848350b54fc2ef0a512c5727e0410ce1a9500cb6af853ef428dcf3","abstract_canon_sha256":"828f2aa42b4ec550407e48cc78a5a0ec8e30da533f6fb6e41f97e53783c3c60b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:16.133953Z","signature_b64":"2u0ySF3JXXGn3aacGHwRMnT5mo5uaMYtMawaMBVSaYq862Ii4e2bujv1AZRnypu2rt+2W/TYhRt2STnkYTZDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"448d205128a5cd2d2e9c7c87d23fbaf76a0af30cd8ddbbdee695b7b2cb36c2cf","last_reissued_at":"2026-05-18T00:10:16.133206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:16.133206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doubly Stochastic Adversarial Autoencoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mahdi Azarafrooz","submitted_at":"2018-07-19T18:51:31Z","abstract_excerpt":"Any autoencoder network can be turned into a generative model by imposing an arbitrary prior distribution on its hidden code vector. Variational Autoencoder (VAE) [2] uses a KL divergence penalty to impose the prior, whereas Adversarial Autoencoder (AAE) [1] uses {\\it generative adversarial networks} GAN [3]. GAN trades the complexities of {\\it sampling} algorithms with the complexities of {\\it searching} Nash equilibrium in minimax games. Such minimax architectures get trained with the help of data examples and gradients flowing through a generator and an adversary. A straightforward modifica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07603","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":"1807.07603","created_at":"2026-05-18T00:10:16.133311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07603v1","created_at":"2026-05-18T00:10:16.133311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07603","created_at":"2026-05-18T00:10:16.133311+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISGSAUJIUXGS","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISGSAUJIUXGS2LU4","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISGSAUJI","created_at":"2026-05-18T12:32:31.084164+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/ISGSAUJIUXGS2LU4PSD5EP5265","json":"https://pith.science/pith/ISGSAUJIUXGS2LU4PSD5EP5265.json","graph_json":"https://pith.science/api/pith-number/ISGSAUJIUXGS2LU4PSD5EP5265/graph.json","events_json":"https://pith.science/api/pith-number/ISGSAUJIUXGS2LU4PSD5EP5265/events.json","paper":"https://pith.science/paper/ISGSAUJI"},"agent_actions":{"view_html":"https://pith.science/pith/ISGSAUJIUXGS2LU4PSD5EP5265","download_json":"https://pith.science/pith/ISGSAUJIUXGS2LU4PSD5EP5265.json","view_paper":"https://pith.science/paper/ISGSAUJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07603&json=true","fetch_graph":"https://pith.science/api/pith-number/ISGSAUJIUXGS2LU4PSD5EP5265/graph.json","fetch_events":"https://pith.science/api/pith-number/ISGSAUJIUXGS2LU4PSD5EP5265/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISGSAUJIUXGS2LU4PSD5EP5265/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISGSAUJIUXGS2LU4PSD5EP5265/action/storage_attestation","attest_author":"https://pith.science/pith/ISGSAUJIUXGS2LU4PSD5EP5265/action/author_attestation","sign_citation":"https://pith.science/pith/ISGSAUJIUXGS2LU4PSD5EP5265/action/citation_signature","submit_replication":"https://pith.science/pith/ISGSAUJIUXGS2LU4PSD5EP5265/action/replication_record"}},"created_at":"2026-05-18T00:10:16.133311+00:00","updated_at":"2026-05-18T00:10:16.133311+00:00"}