{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MQTRPNHTB4Q4447SOZ6EXSWYTS","short_pith_number":"pith:MQTRPNHT","canonical_record":{"source":{"id":"2010.10013","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-17T09:07:40Z","cross_cats_sorted":["cs.GT","math.OC"],"title_canon_sha256":"eaacb9c15edeff7a801e8dbfbff63893ad97c86792f9b49998ff2e8f5bd16cb9","abstract_canon_sha256":"4b79d7186fdbd942d1ca0d84ddf6a2433612df6f03d81acdb1512361a0c3ca2c"},"schema_version":"1.0"},"canonical_sha256":"642717b4f30f21ce73f2767c4bcad89ca57dedc4f3143e297e11702853b066f0","source":{"kind":"arxiv","id":"2010.10013","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.10013","created_at":"2026-07-05T02:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"2010.10013v3","created_at":"2026-07-05T02:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.10013","created_at":"2026-07-05T02:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"MQTRPNHTB4Q4","created_at":"2026-07-05T02:42:02Z"},{"alias_kind":"pith_short_16","alias_value":"MQTRPNHTB4Q4447S","created_at":"2026-07-05T02:42:02Z"},{"alias_kind":"pith_short_8","alias_value":"MQTRPNHT","created_at":"2026-07-05T02:42:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MQTRPNHTB4Q4447SOZ6EXSWYTS","target":"record","payload":{"canonical_record":{"source":{"id":"2010.10013","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-17T09:07:40Z","cross_cats_sorted":["cs.GT","math.OC"],"title_canon_sha256":"eaacb9c15edeff7a801e8dbfbff63893ad97c86792f9b49998ff2e8f5bd16cb9","abstract_canon_sha256":"4b79d7186fdbd942d1ca0d84ddf6a2433612df6f03d81acdb1512361a0c3ca2c"},"schema_version":"1.0"},"canonical_sha256":"642717b4f30f21ce73f2767c4bcad89ca57dedc4f3143e297e11702853b066f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:02.471506Z","signature_b64":"OiGseRJ6JZvA9Ztg25ZnXWLOJwq6Ctnl2kvvsZKuUZC0Aszh+PXbYmdPUsK9mViVbAymTmYUEViZ4tsMXkqEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"642717b4f30f21ce73f2767c4bcad89ca57dedc4f3143e297e11702853b066f0","last_reissued_at":"2026-07-05T02:42:02.471064Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:02.471064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.10013","source_version":3,"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-07-05T02:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cOiSLliUFcQZ3HhVSq5Z6WHoz5rG3vOs6tMMbJsYifxsG05KeD+7U+CKlnCw+1hDnvz52s/ncHirDt4xFTWSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T09:26:50.465324Z"},"content_sha256":"0c692404c919b7f8e1d36e4fc0d46a5651c2ca7dd58967430b1e4e6c01b6cbf7","schema_version":"1.0","event_id":"sha256:0c692404c919b7f8e1d36e4fc0d46a5651c2ca7dd58967430b1e4e6c01b6cbf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MQTRPNHTB4Q4447SOZ6EXSWYTS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Training Generative Adversarial Networks via stochastic Nash games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.OC"],"primary_cat":"cs.LG","authors_text":"Barbara Franci, Sergio Grammatico","submitted_at":"2020-10-17T09:07:40Z","abstract_excerpt":"Generative adversarial networks (GANs) are a class of generative models with two antagonistic neural networks: a generator and a discriminator. These two neural networks compete against each other through an adversarial process that can be modeled as a stochastic Nash equilibrium problem. Since the associated training process is challenging, it is fundamental to design reliable algorithms to compute an equilibrium. In this paper, we propose a stochastic relaxed forward-backward (SRFB) algorithm for GANs and we show convergence to an exact solution when an increasing number of data is available"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.10013","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.10013/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tzg16QuHysAwT400wkhGFgr6iUrCxIxuGLgN2wRO/byxVSipHN/Q6t/afmxxBdZ/G3zcG4jCWYLmTr5w2lsvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T09:26:50.465860Z"},"content_sha256":"a63d93f8c14db41c03cb1a3fa0812d8f2d73ec63981f617d7d9e88ef0a9ad896","schema_version":"1.0","event_id":"sha256:a63d93f8c14db41c03cb1a3fa0812d8f2d73ec63981f617d7d9e88ef0a9ad896"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQTRPNHTB4Q4447SOZ6EXSWYTS/bundle.json","state_url":"https://pith.science/pith/MQTRPNHTB4Q4447SOZ6EXSWYTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQTRPNHTB4Q4447SOZ6EXSWYTS/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-08-12T09:26:50Z","links":{"resolver":"https://pith.science/pith/MQTRPNHTB4Q4447SOZ6EXSWYTS","bundle":"https://pith.science/pith/MQTRPNHTB4Q4447SOZ6EXSWYTS/bundle.json","state":"https://pith.science/pith/MQTRPNHTB4Q4447SOZ6EXSWYTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQTRPNHTB4Q4447SOZ6EXSWYTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MQTRPNHTB4Q4447SOZ6EXSWYTS","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":"4b79d7186fdbd942d1ca0d84ddf6a2433612df6f03d81acdb1512361a0c3ca2c","cross_cats_sorted":["cs.GT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-17T09:07:40Z","title_canon_sha256":"eaacb9c15edeff7a801e8dbfbff63893ad97c86792f9b49998ff2e8f5bd16cb9"},"schema_version":"1.0","source":{"id":"2010.10013","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.10013","created_at":"2026-07-05T02:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"2010.10013v3","created_at":"2026-07-05T02:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.10013","created_at":"2026-07-05T02:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"MQTRPNHTB4Q4","created_at":"2026-07-05T02:42:02Z"},{"alias_kind":"pith_short_16","alias_value":"MQTRPNHTB4Q4447S","created_at":"2026-07-05T02:42:02Z"},{"alias_kind":"pith_short_8","alias_value":"MQTRPNHT","created_at":"2026-07-05T02:42:02Z"}],"graph_snapshots":[{"event_id":"sha256:a63d93f8c14db41c03cb1a3fa0812d8f2d73ec63981f617d7d9e88ef0a9ad896","target":"graph","created_at":"2026-07-05T02:42:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.10013/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Generative adversarial networks (GANs) are a class of generative models with two antagonistic neural networks: a generator and a discriminator. These two neural networks compete against each other through an adversarial process that can be modeled as a stochastic Nash equilibrium problem. Since the associated training process is challenging, it is fundamental to design reliable algorithms to compute an equilibrium. In this paper, we propose a stochastic relaxed forward-backward (SRFB) algorithm for GANs and we show convergence to an exact solution when an increasing number of data is available","authors_text":"Barbara Franci, Sergio Grammatico","cross_cats":["cs.GT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-17T09:07:40Z","title":"Training Generative Adversarial Networks via stochastic Nash games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.10013","kind":"arxiv","version":3},"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:0c692404c919b7f8e1d36e4fc0d46a5651c2ca7dd58967430b1e4e6c01b6cbf7","target":"record","created_at":"2026-07-05T02:42:02Z","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":"4b79d7186fdbd942d1ca0d84ddf6a2433612df6f03d81acdb1512361a0c3ca2c","cross_cats_sorted":["cs.GT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-17T09:07:40Z","title_canon_sha256":"eaacb9c15edeff7a801e8dbfbff63893ad97c86792f9b49998ff2e8f5bd16cb9"},"schema_version":"1.0","source":{"id":"2010.10013","kind":"arxiv","version":3}},"canonical_sha256":"642717b4f30f21ce73f2767c4bcad89ca57dedc4f3143e297e11702853b066f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"642717b4f30f21ce73f2767c4bcad89ca57dedc4f3143e297e11702853b066f0","first_computed_at":"2026-07-05T02:42:02.471064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:42:02.471064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OiGseRJ6JZvA9Ztg25ZnXWLOJwq6Ctnl2kvvsZKuUZC0Aszh+PXbYmdPUsK9mViVbAymTmYUEViZ4tsMXkqEDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:42:02.471506Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.10013","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c692404c919b7f8e1d36e4fc0d46a5651c2ca7dd58967430b1e4e6c01b6cbf7","sha256:a63d93f8c14db41c03cb1a3fa0812d8f2d73ec63981f617d7d9e88ef0a9ad896"],"state_sha256":"a48ddbfd03d7a22483143c656f8b761b2a915d88f7667dcc2e29a4dea6e642c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cS2lOuMeDdIhCzLuHzyjkH6lh4nHR5K4PtvHS7ULawrvx3Sa8g/290BzxA9uoAS2/aegvxoi6qd/80uOfhnQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T09:26:50.470059Z","bundle_sha256":"2cf96e0de50cdd236e71b32138bca84a927ba18a7d9f81a416cf87d020ed1cdf"}}