{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AHYZTFQCXDNBIUDTNR37REW2MZ","short_pith_number":"pith:AHYZTFQC","canonical_record":{"source":{"id":"1906.04106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-10T16:27:34Z","cross_cats_sorted":[],"title_canon_sha256":"8e33d741ff9312118efcec0fb347e80c3ac779558f5c62203a261847f8db935e","abstract_canon_sha256":"ab5693fa9abd944617417f7e9d34519e6e75d947f27425cf605c24cf0cfab3df"},"schema_version":"1.0"},"canonical_sha256":"01f1999602b8da1450736c77f892da66426c5d81896ea8d3af0cc757cd925cd4","source":{"kind":"arxiv","id":"1906.04106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04106","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04106v1","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04106","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"AHYZTFQCXDNB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AHYZTFQCXDNBIUDT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AHYZTFQC","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AHYZTFQCXDNBIUDTNR37REW2MZ","target":"record","payload":{"canonical_record":{"source":{"id":"1906.04106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-10T16:27:34Z","cross_cats_sorted":[],"title_canon_sha256":"8e33d741ff9312118efcec0fb347e80c3ac779558f5c62203a261847f8db935e","abstract_canon_sha256":"ab5693fa9abd944617417f7e9d34519e6e75d947f27425cf605c24cf0cfab3df"},"schema_version":"1.0"},"canonical_sha256":"01f1999602b8da1450736c77f892da66426c5d81896ea8d3af0cc757cd925cd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:43.865598Z","signature_b64":"pml4BkLDaa+s1rWlP8Eel7AuKW1918fr2+riTvV3U2LkCaQoRxmh9saAbVcRcW84gwRKjxw01EBccfEUD9aGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01f1999602b8da1450736c77f892da66426c5d81896ea8d3af0cc757cd925cd4","last_reissued_at":"2026-05-17T23:43:43.864919Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:43.864919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.04106","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:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"83Q/LFf9mkWvFpfBaq/JxHp3mPEC5FGba53OIhU1ZOPCvrZWwurCjzftDoFDtQ0SwqFdopGscZvibJElw2XCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:40:48.941326Z"},"content_sha256":"644ce35d6579e42b909a50bafd60685465fa51f59261ac2447f4b6e757a934bd","schema_version":"1.0","event_id":"sha256:644ce35d6579e42b909a50bafd60685465fa51f59261ac2447f4b6e757a934bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AHYZTFQCXDNBIUDTNR37REW2MZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Keyphrase Generation via Reinforcement Learning with Adaptive Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hou Pong Chan, Irwin King, Lu Wang, Wang Chen","submitted_at":"2019-06-10T16:27:34Z","abstract_excerpt":"Generating keyphrases that summarize the main points of a document is a fundamental task in natural language processing. Although existing generative models are capable of predicting multiple keyphrases for an input document as well as determining the number of keyphrases to generate, they still suffer from the problem of generating too few keyphrases. To address this problem, we propose a reinforcement learning (RL) approach for keyphrase generation, with an adaptive reward function that encourages a model to generate both sufficient and accurate keyphrases. Furthermore, we introduce a new ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04106","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:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pOx2bZVsTZPZHs4PbpYw0KnyurMoY7ZXA+vmBFtW5rMVCL41RIWO0lfunCgNvTTiVMoKMzWL05kAFziYexHECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:40:48.941829Z"},"content_sha256":"d4d52a53c57e984e047c3ccc2dc4c6deb83e228de493fa09b14f44fb3a953e44","schema_version":"1.0","event_id":"sha256:d4d52a53c57e984e047c3ccc2dc4c6deb83e228de493fa09b14f44fb3a953e44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHYZTFQCXDNBIUDTNR37REW2MZ/bundle.json","state_url":"https://pith.science/pith/AHYZTFQCXDNBIUDTNR37REW2MZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHYZTFQCXDNBIUDTNR37REW2MZ/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-27T20:40:48Z","links":{"resolver":"https://pith.science/pith/AHYZTFQCXDNBIUDTNR37REW2MZ","bundle":"https://pith.science/pith/AHYZTFQCXDNBIUDTNR37REW2MZ/bundle.json","state":"https://pith.science/pith/AHYZTFQCXDNBIUDTNR37REW2MZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHYZTFQCXDNBIUDTNR37REW2MZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AHYZTFQCXDNBIUDTNR37REW2MZ","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":"ab5693fa9abd944617417f7e9d34519e6e75d947f27425cf605c24cf0cfab3df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-10T16:27:34Z","title_canon_sha256":"8e33d741ff9312118efcec0fb347e80c3ac779558f5c62203a261847f8db935e"},"schema_version":"1.0","source":{"id":"1906.04106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04106","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04106v1","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04106","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"AHYZTFQCXDNB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AHYZTFQCXDNBIUDT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AHYZTFQC","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:d4d52a53c57e984e047c3ccc2dc4c6deb83e228de493fa09b14f44fb3a953e44","target":"graph","created_at":"2026-05-17T23:43:43Z","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":"Generating keyphrases that summarize the main points of a document is a fundamental task in natural language processing. Although existing generative models are capable of predicting multiple keyphrases for an input document as well as determining the number of keyphrases to generate, they still suffer from the problem of generating too few keyphrases. To address this problem, we propose a reinforcement learning (RL) approach for keyphrase generation, with an adaptive reward function that encourages a model to generate both sufficient and accurate keyphrases. Furthermore, we introduce a new ev","authors_text":"Hou Pong Chan, Irwin King, Lu Wang, Wang Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-10T16:27:34Z","title":"Neural Keyphrase Generation via Reinforcement Learning with Adaptive Rewards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04106","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:644ce35d6579e42b909a50bafd60685465fa51f59261ac2447f4b6e757a934bd","target":"record","created_at":"2026-05-17T23:43:43Z","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":"ab5693fa9abd944617417f7e9d34519e6e75d947f27425cf605c24cf0cfab3df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-10T16:27:34Z","title_canon_sha256":"8e33d741ff9312118efcec0fb347e80c3ac779558f5c62203a261847f8db935e"},"schema_version":"1.0","source":{"id":"1906.04106","kind":"arxiv","version":1}},"canonical_sha256":"01f1999602b8da1450736c77f892da66426c5d81896ea8d3af0cc757cd925cd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01f1999602b8da1450736c77f892da66426c5d81896ea8d3af0cc757cd925cd4","first_computed_at":"2026-05-17T23:43:43.864919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:43.864919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pml4BkLDaa+s1rWlP8Eel7AuKW1918fr2+riTvV3U2LkCaQoRxmh9saAbVcRcW84gwRKjxw01EBccfEUD9aGCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:43.865598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.04106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:644ce35d6579e42b909a50bafd60685465fa51f59261ac2447f4b6e757a934bd","sha256:d4d52a53c57e984e047c3ccc2dc4c6deb83e228de493fa09b14f44fb3a953e44"],"state_sha256":"ddc8663c8b725bb56edb86ba1f9f5bf49fbd1b64b66adaabfbc2f628ebc76d58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VpmM0MyCtDov0eGWzhqqJUDl8msaDAy2Mu88evmMzOhQWXCmUXH+bMzg7iOstOMYNboJlesVwQLx7gyvaBVrAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:40:48.944693Z","bundle_sha256":"516de859943d5d8683edabfc4e2c775d97a8353cd813c5a88e35242a02c92baf"}}