{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U76CL6JEN7YEOKSEBAXD4CLCZ2","short_pith_number":"pith:U76CL6JE","canonical_record":{"source":{"id":"1710.08446","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T18:30:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9bcfb8cd531cea8cf72d705b6805413f6443a3338a4b5a9220bbeccf23f84abd","abstract_canon_sha256":"93fc78c448b26a10e58798abce74cabe16f04a56173a61ff433d578941681403"},"schema_version":"1.0"},"canonical_sha256":"a7fc25f9246ff0472a44082e3e0962ce807050cbca906e91bc436154db0933ec","source":{"kind":"arxiv","id":"1710.08446","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08446","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08446v3","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08446","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"U76CL6JEN7YE","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U76CL6JEN7YEOKSE","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U76CL6JE","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U76CL6JEN7YEOKSEBAXD4CLCZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08446","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T18:30:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9bcfb8cd531cea8cf72d705b6805413f6443a3338a4b5a9220bbeccf23f84abd","abstract_canon_sha256":"93fc78c448b26a10e58798abce74cabe16f04a56173a61ff433d578941681403"},"schema_version":"1.0"},"canonical_sha256":"a7fc25f9246ff0472a44082e3e0962ce807050cbca906e91bc436154db0933ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:52.497497Z","signature_b64":"2C0x98xoa95ogM4s2nOafqio76C+97d/FV7/gTVvTR1/jHEUacIQwpVb4Y77k/SpedJdTc8mbJL3S4xQiiwYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7fc25f9246ff0472a44082e3e0962ce807050cbca906e91bc436154db0933ec","last_reissued_at":"2026-05-18T00:22:52.497074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:52.497074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08446","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-05-18T00:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34PATskS6ndQxQeF6hbrnBmfM2cidxmhLr/jOx5tbm6FfSyb4DEVH2MeqwlMZfNK4gFvFUdW1FBFVOmBymtZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T20:44:11.613102Z"},"content_sha256":"937290dbbbc7a645ee7927edf679b5516e9fff495a9f0fbd7cc9ab43dbb8c64e","schema_version":"1.0","event_id":"sha256:937290dbbbc7a645ee7927edf679b5516e9fff495a9f0fbd7cc9ab43dbb8c64e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U76CL6JEN7YEOKSEBAXD4CLCZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Many Paths to Equilibrium: GANs Do Not Need to Decrease a Divergence At Every Step","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andrew M. Dai, Balaji Lakshminarayanan, Ian Goodfellow, Mihaela Rosca, Shakir Mohamed, William Fedus","submitted_at":"2017-10-23T18:30:56Z","abstract_excerpt":"Generative adversarial networks (GANs) are a family of generative models that do not minimize a single training criterion. Unlike other generative models, the data distribution is learned via a game between a generator (the generative model) and a discriminator (a teacher providing training signal) that each minimize their own cost. GANs are designed to reach a Nash equilibrium at which each player cannot reduce their cost without changing the other players' parameters. One useful approach for the theory of GANs is to show that a divergence between the training distribution and the model distr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08446","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":""},"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-18T00:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2Ar2BXPjszXvAV7DFZto6ZnvtCoghpSMtKEKT3rJYwFVZUn67LKRdHx3ZF4DXy46ceG0CV5tCH7FUwmexO5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T20:44:11.613491Z"},"content_sha256":"6cfc4b7f9ef63c22e9fcb67de441850b899f10458baeb122d4b41d91ebbbd5fa","schema_version":"1.0","event_id":"sha256:6cfc4b7f9ef63c22e9fcb67de441850b899f10458baeb122d4b41d91ebbbd5fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U76CL6JEN7YEOKSEBAXD4CLCZ2/bundle.json","state_url":"https://pith.science/pith/U76CL6JEN7YEOKSEBAXD4CLCZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U76CL6JEN7YEOKSEBAXD4CLCZ2/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-07-11T20:44:11Z","links":{"resolver":"https://pith.science/pith/U76CL6JEN7YEOKSEBAXD4CLCZ2","bundle":"https://pith.science/pith/U76CL6JEN7YEOKSEBAXD4CLCZ2/bundle.json","state":"https://pith.science/pith/U76CL6JEN7YEOKSEBAXD4CLCZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U76CL6JEN7YEOKSEBAXD4CLCZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U76CL6JEN7YEOKSEBAXD4CLCZ2","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":"93fc78c448b26a10e58798abce74cabe16f04a56173a61ff433d578941681403","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T18:30:56Z","title_canon_sha256":"9bcfb8cd531cea8cf72d705b6805413f6443a3338a4b5a9220bbeccf23f84abd"},"schema_version":"1.0","source":{"id":"1710.08446","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08446","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08446v3","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08446","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"U76CL6JEN7YE","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U76CL6JEN7YEOKSE","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U76CL6JE","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:6cfc4b7f9ef63c22e9fcb67de441850b899f10458baeb122d4b41d91ebbbd5fa","target":"graph","created_at":"2026-05-18T00:22:52Z","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":"Generative adversarial networks (GANs) are a family of generative models that do not minimize a single training criterion. Unlike other generative models, the data distribution is learned via a game between a generator (the generative model) and a discriminator (a teacher providing training signal) that each minimize their own cost. GANs are designed to reach a Nash equilibrium at which each player cannot reduce their cost without changing the other players' parameters. One useful approach for the theory of GANs is to show that a divergence between the training distribution and the model distr","authors_text":"Andrew M. Dai, Balaji Lakshminarayanan, Ian Goodfellow, Mihaela Rosca, Shakir Mohamed, William Fedus","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T18:30:56Z","title":"Many Paths to Equilibrium: GANs Do Not Need to Decrease a Divergence At Every Step"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08446","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:937290dbbbc7a645ee7927edf679b5516e9fff495a9f0fbd7cc9ab43dbb8c64e","target":"record","created_at":"2026-05-18T00:22:52Z","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":"93fc78c448b26a10e58798abce74cabe16f04a56173a61ff433d578941681403","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T18:30:56Z","title_canon_sha256":"9bcfb8cd531cea8cf72d705b6805413f6443a3338a4b5a9220bbeccf23f84abd"},"schema_version":"1.0","source":{"id":"1710.08446","kind":"arxiv","version":3}},"canonical_sha256":"a7fc25f9246ff0472a44082e3e0962ce807050cbca906e91bc436154db0933ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7fc25f9246ff0472a44082e3e0962ce807050cbca906e91bc436154db0933ec","first_computed_at":"2026-05-18T00:22:52.497074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:52.497074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2C0x98xoa95ogM4s2nOafqio76C+97d/FV7/gTVvTR1/jHEUacIQwpVb4Y77k/SpedJdTc8mbJL3S4xQiiwYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:52.497497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08446","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:937290dbbbc7a645ee7927edf679b5516e9fff495a9f0fbd7cc9ab43dbb8c64e","sha256:6cfc4b7f9ef63c22e9fcb67de441850b899f10458baeb122d4b41d91ebbbd5fa"],"state_sha256":"04a9e496f41304b731f7c4a2845183b5866e96be11f5f38842e99986106bde1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AyTo4/rAm3dpfPOgcVprqrJHaJYZsg9oJyefASsDtZo69BicBNEU67ZeaTOPcp3x+d9/zJOlJOndIzwblT4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T20:44:11.616279Z","bundle_sha256":"2a3abd6b4296a62e7b41669036d07688b43a0ba78f2297e45dbb4fdd23922e77"}}