{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3HWARPZ5CUM2QBVWDMRJU3HMMZ","short_pith_number":"pith:3HWARPZ5","canonical_record":{"source":{"id":"1904.09775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-22T08:53:18Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"beb7096a6904a6f2ac53754817542a0d6d9d27061f62afc26994355695e2d9f8","abstract_canon_sha256":"d2dc34cde9ff6ae8894ff64acc5622beb84f8cb437a828a42c8ece48b2d383eb"},"schema_version":"1.0"},"canonical_sha256":"d9ec08bf3d1519a806b61b229a6cec665c5e3d9702019fd0473501cacd721271","source":{"kind":"arxiv","id":"1904.09775","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09775","created_at":"2026-05-17T23:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09775v1","created_at":"2026-05-17T23:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09775","created_at":"2026-05-17T23:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"3HWARPZ5CUM2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3HWARPZ5CUM2QBVW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3HWARPZ5","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3HWARPZ5CUM2QBVWDMRJU3HMMZ","target":"record","payload":{"canonical_record":{"source":{"id":"1904.09775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-22T08:53:18Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"beb7096a6904a6f2ac53754817542a0d6d9d27061f62afc26994355695e2d9f8","abstract_canon_sha256":"d2dc34cde9ff6ae8894ff64acc5622beb84f8cb437a828a42c8ece48b2d383eb"},"schema_version":"1.0"},"canonical_sha256":"d9ec08bf3d1519a806b61b229a6cec665c5e3d9702019fd0473501cacd721271","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:03.376764Z","signature_b64":"thjGH3fSm6aRCBuyoMs04Wa6qJSSUyAxRderr0nvi3CoF9cPEW0MZ2aicQ3lK5cItWvXItQqp5ZhBFzCG51dCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9ec08bf3d1519a806b61b229a6cec665c5e3d9702019fd0473501cacd721271","last_reissued_at":"2026-05-17T23:48:03.376084Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:03.376084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.09775","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-17T23:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTY8YATWQ/KH2bxeglxuf2b2dr5m6CUwlrQHm9dKtX7RmTfuuE4plQIslIPqVTr2xWa+fnbok3FDAGUUTSlsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:24:13.732236Z"},"content_sha256":"a77d03eb6bd643d049f69911f58213f52dc10152749d9aae264dc87a55ba6437","schema_version":"1.0","event_id":"sha256:a77d03eb6bd643d049f69911f58213f52dc10152749d9aae264dc87a55ba6437"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3HWARPZ5CUM2QBVWDMRJU3HMMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Training generative networks using random discriminators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Babak Barazandeh, Maziar Sanjabi, Meisam Razaviyayn","submitted_at":"2019-04-22T08:53:18Z","abstract_excerpt":"In recent years, Generative Adversarial Networks (GANs) have drawn a lot of attentions for learning the underlying distribution of data in various applications. Despite their wide applicability, training GANs is notoriously difficult. This difficulty is due to the min-max nature of the resulting optimization problem and the lack of proper tools of solving general (non-convex, non-concave) min-max optimization problems. In this paper, we try to alleviate this problem by proposing a new generative network that relies on the use of random discriminators instead of adversarial design. This design "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09775","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-17T23:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oaQQOca50XGGH18CglDjmi1dpzNuVU1NJo3ZwcnCAQauuMgPXM29D8yEO+IlQjNoYPQpaeEnc5TI3ea7CcAoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:24:13.732958Z"},"content_sha256":"7add7bb5487e3588f96953d2b23eca94b1329906f9c83b5cb0660c3b0261271f","schema_version":"1.0","event_id":"sha256:7add7bb5487e3588f96953d2b23eca94b1329906f9c83b5cb0660c3b0261271f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HWARPZ5CUM2QBVWDMRJU3HMMZ/bundle.json","state_url":"https://pith.science/pith/3HWARPZ5CUM2QBVWDMRJU3HMMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HWARPZ5CUM2QBVWDMRJU3HMMZ/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-30T07:24:13Z","links":{"resolver":"https://pith.science/pith/3HWARPZ5CUM2QBVWDMRJU3HMMZ","bundle":"https://pith.science/pith/3HWARPZ5CUM2QBVWDMRJU3HMMZ/bundle.json","state":"https://pith.science/pith/3HWARPZ5CUM2QBVWDMRJU3HMMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HWARPZ5CUM2QBVWDMRJU3HMMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3HWARPZ5CUM2QBVWDMRJU3HMMZ","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":"d2dc34cde9ff6ae8894ff64acc5622beb84f8cb437a828a42c8ece48b2d383eb","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-22T08:53:18Z","title_canon_sha256":"beb7096a6904a6f2ac53754817542a0d6d9d27061f62afc26994355695e2d9f8"},"schema_version":"1.0","source":{"id":"1904.09775","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09775","created_at":"2026-05-17T23:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09775v1","created_at":"2026-05-17T23:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09775","created_at":"2026-05-17T23:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"3HWARPZ5CUM2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3HWARPZ5CUM2QBVW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3HWARPZ5","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:7add7bb5487e3588f96953d2b23eca94b1329906f9c83b5cb0660c3b0261271f","target":"graph","created_at":"2026-05-17T23:48:03Z","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":"In recent years, Generative Adversarial Networks (GANs) have drawn a lot of attentions for learning the underlying distribution of data in various applications. Despite their wide applicability, training GANs is notoriously difficult. This difficulty is due to the min-max nature of the resulting optimization problem and the lack of proper tools of solving general (non-convex, non-concave) min-max optimization problems. In this paper, we try to alleviate this problem by proposing a new generative network that relies on the use of random discriminators instead of adversarial design. This design ","authors_text":"Babak Barazandeh, Maziar Sanjabi, Meisam Razaviyayn","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-22T08:53:18Z","title":"Training generative networks using random discriminators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09775","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:a77d03eb6bd643d049f69911f58213f52dc10152749d9aae264dc87a55ba6437","target":"record","created_at":"2026-05-17T23:48:03Z","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":"d2dc34cde9ff6ae8894ff64acc5622beb84f8cb437a828a42c8ece48b2d383eb","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-22T08:53:18Z","title_canon_sha256":"beb7096a6904a6f2ac53754817542a0d6d9d27061f62afc26994355695e2d9f8"},"schema_version":"1.0","source":{"id":"1904.09775","kind":"arxiv","version":1}},"canonical_sha256":"d9ec08bf3d1519a806b61b229a6cec665c5e3d9702019fd0473501cacd721271","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9ec08bf3d1519a806b61b229a6cec665c5e3d9702019fd0473501cacd721271","first_computed_at":"2026-05-17T23:48:03.376084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:03.376084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"thjGH3fSm6aRCBuyoMs04Wa6qJSSUyAxRderr0nvi3CoF9cPEW0MZ2aicQ3lK5cItWvXItQqp5ZhBFzCG51dCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:03.376764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09775","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a77d03eb6bd643d049f69911f58213f52dc10152749d9aae264dc87a55ba6437","sha256:7add7bb5487e3588f96953d2b23eca94b1329906f9c83b5cb0660c3b0261271f"],"state_sha256":"52fbb0e549f7f2e3d066392cbb17e8259d535a13cecf82e543168c7c89cac4f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LbQohuBk2cqjkK9O6KIaTJ8E5BgGcu6rOWdAdZwUWMhU17mIbtz/cxvflaJsARAMIfirBgOf7P7vFxivBGL0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:24:13.736518Z","bundle_sha256":"8221e433d3611a3ec9e7339ab29c991a17f67e2de2090c3c7078eff0ac52e66b"}}