{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KMFWEFSFOVJ43V52MGFCNM2TRZ","short_pith_number":"pith:KMFWEFSF","canonical_record":{"source":{"id":"1808.05599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-16T17:41:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4ee4a958fe9959524fc5d7c247b9830cf8ffde5252f9abd7e92773bf3019bb07","abstract_canon_sha256":"b009f74c504e8d9bb009726c189556d320d6cc2c738e53601fae62b78f52bbf7"},"schema_version":"1.0"},"canonical_sha256":"530b6216457553cdd7ba618a26b3538e718d4bca726dd0577a7f1c289a26c48e","source":{"kind":"arxiv","id":"1808.05599","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05599","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05599v2","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05599","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"pith_short_12","alias_value":"KMFWEFSFOVJ4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KMFWEFSFOVJ43V52","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KMFWEFSF","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KMFWEFSFOVJ43V52MGFCNM2TRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.05599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-16T17:41:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4ee4a958fe9959524fc5d7c247b9830cf8ffde5252f9abd7e92773bf3019bb07","abstract_canon_sha256":"b009f74c504e8d9bb009726c189556d320d6cc2c738e53601fae62b78f52bbf7"},"schema_version":"1.0"},"canonical_sha256":"530b6216457553cdd7ba618a26b3538e718d4bca726dd0577a7f1c289a26c48e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:22.649218Z","signature_b64":"rKV3PIlrenqJ+h4ku3zmG48m8B1Qm+gNhjMeoxvLbqgx59Z8qryJq3aSr8iNb5DIS0aIC4k8jp87hoWX1cOOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"530b6216457553cdd7ba618a26b3538e718d4bca726dd0577a7f1c289a26c48e","last_reissued_at":"2026-05-17T23:54:22.648429Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:22.648429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.05599","source_version":2,"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:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4/IQsChdKyF7Wdmr7Is8tpVw7TFpJndHjcleXfLAzmqVE8mOMJv827SEqXi/357c3ye62KBJj+OJ9H0eq2WDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:44:12.415165Z"},"content_sha256":"ea5098ffc36877b91c71526a70d732b21c4127eb43804eedacab93f0b68b21f5","schema_version":"1.0","event_id":"sha256:ea5098ffc36877b91c71526a70d732b21c4127eb43804eedacab93f0b68b21f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KMFWEFSFOVJ43V52MGFCNM2TRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Conditional Sequence Generative Adversarial Networks by Stepwise Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CL","authors_text":"Hung-yi Lee, Yi-Lin Tuan","submitted_at":"2018-08-16T17:41:00Z","abstract_excerpt":"Sequence generative adversarial networks (SeqGAN) have been used to improve conditional sequence generation tasks, for example, chit-chat dialogue generation. To stabilize the training of SeqGAN, Monte Carlo tree search (MCTS) or reward at every generation step (REGS) is used to evaluate the goodness of a generated subsequence. MCTS is computationally intensive, but the performance of REGS is worse than MCTS. In this paper, we propose stepwise GAN (StepGAN), in which the discriminator is modified to automatically assign scores quantifying the goodness of each subsequence at every generation st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05599","kind":"arxiv","version":2},"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:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CiRRag2cDZpDnDZ7TCehyOiJwXd/LExp5WiC6g2ZRKs9gVjXxtsPRVHwOUXhBSZDMTSF5tv9sx96qqWGaDy+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:44:12.415544Z"},"content_sha256":"d59b061f228f8dbcc82e7108bb36f08fb35b05e6256e7fa3da595f38306574d3","schema_version":"1.0","event_id":"sha256:d59b061f228f8dbcc82e7108bb36f08fb35b05e6256e7fa3da595f38306574d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMFWEFSFOVJ43V52MGFCNM2TRZ/bundle.json","state_url":"https://pith.science/pith/KMFWEFSFOVJ43V52MGFCNM2TRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMFWEFSFOVJ43V52MGFCNM2TRZ/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-06-12T10:44:12Z","links":{"resolver":"https://pith.science/pith/KMFWEFSFOVJ43V52MGFCNM2TRZ","bundle":"https://pith.science/pith/KMFWEFSFOVJ43V52MGFCNM2TRZ/bundle.json","state":"https://pith.science/pith/KMFWEFSFOVJ43V52MGFCNM2TRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMFWEFSFOVJ43V52MGFCNM2TRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KMFWEFSFOVJ43V52MGFCNM2TRZ","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":"b009f74c504e8d9bb009726c189556d320d6cc2c738e53601fae62b78f52bbf7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-16T17:41:00Z","title_canon_sha256":"4ee4a958fe9959524fc5d7c247b9830cf8ffde5252f9abd7e92773bf3019bb07"},"schema_version":"1.0","source":{"id":"1808.05599","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05599","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05599v2","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05599","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"pith_short_12","alias_value":"KMFWEFSFOVJ4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KMFWEFSFOVJ43V52","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KMFWEFSF","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:d59b061f228f8dbcc82e7108bb36f08fb35b05e6256e7fa3da595f38306574d3","target":"graph","created_at":"2026-05-17T23:54:22Z","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":"Sequence generative adversarial networks (SeqGAN) have been used to improve conditional sequence generation tasks, for example, chit-chat dialogue generation. To stabilize the training of SeqGAN, Monte Carlo tree search (MCTS) or reward at every generation step (REGS) is used to evaluate the goodness of a generated subsequence. MCTS is computationally intensive, but the performance of REGS is worse than MCTS. In this paper, we propose stepwise GAN (StepGAN), in which the discriminator is modified to automatically assign scores quantifying the goodness of each subsequence at every generation st","authors_text":"Hung-yi Lee, Yi-Lin Tuan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-16T17:41:00Z","title":"Improving Conditional Sequence Generative Adversarial Networks by Stepwise Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05599","kind":"arxiv","version":2},"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:ea5098ffc36877b91c71526a70d732b21c4127eb43804eedacab93f0b68b21f5","target":"record","created_at":"2026-05-17T23:54:22Z","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":"b009f74c504e8d9bb009726c189556d320d6cc2c738e53601fae62b78f52bbf7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-16T17:41:00Z","title_canon_sha256":"4ee4a958fe9959524fc5d7c247b9830cf8ffde5252f9abd7e92773bf3019bb07"},"schema_version":"1.0","source":{"id":"1808.05599","kind":"arxiv","version":2}},"canonical_sha256":"530b6216457553cdd7ba618a26b3538e718d4bca726dd0577a7f1c289a26c48e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"530b6216457553cdd7ba618a26b3538e718d4bca726dd0577a7f1c289a26c48e","first_computed_at":"2026-05-17T23:54:22.648429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:22.648429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rKV3PIlrenqJ+h4ku3zmG48m8B1Qm+gNhjMeoxvLbqgx59Z8qryJq3aSr8iNb5DIS0aIC4k8jp87hoWX1cOOCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:22.649218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.05599","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea5098ffc36877b91c71526a70d732b21c4127eb43804eedacab93f0b68b21f5","sha256:d59b061f228f8dbcc82e7108bb36f08fb35b05e6256e7fa3da595f38306574d3"],"state_sha256":"565c5747bc817ee1605a7c7c59b47e3a44274963563c4c6d611cecd70ce2af3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyz4RV1S6+MPiw0JU7ofCemT1pvFh/N1hqJLbsxvp9TlbHQv4/fiqwkwv2Rb557x+GubQ/IfZA0oM0lKZqFvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:44:12.417959Z","bundle_sha256":"615e4d42c6ebb15b95e4f34231545edab1d7e744ca18cae2f9a1f0739393677d"}}