{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XXL72RQLE5IZWCAFOVBFVPEK3J","short_pith_number":"pith:XXL72RQL","schema_version":"1.0","canonical_sha256":"bdd7fd460b27519b080575425abc8ada4b1c2412b0c10e420fc2e5e9839ead6c","source":{"kind":"arxiv","id":"2201.05302","version":1},"attestation_state":"computed","paper":{"title":"Applying a Generic Sequence-to-Sequence Model for Simple and Effective Keyphrase Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Alfio Gliozzo, Gaetano Rossiello, Md Faisal Mahbub Chowdhury, Michael Glass, Nandana Mihindukulasooriya","submitted_at":"2022-01-14T04:50:28Z","abstract_excerpt":"In recent years, a number of keyphrase generation (KPG) approaches were proposed consisting of complex model architectures, dedicated training paradigms and decoding strategies. In this work, we opt for simplicity and show how a commonly used seq2seq language model, BART, can be easily adapted to generate keyphrases from the text in a single batch computation using a simple training procedure. Empirical results on five benchmarks show that our approach is as good as the existing state-of-the-art KPG systems, but using a much simpler and easy to deploy framework."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2201.05302","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-01-14T04:50:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"369caed21e23824c8b0b17a3e0eb2cebe60977f15bdb9315a0bc6209383c4ab3","abstract_canon_sha256":"e7d2dcbee6d985db7abd222f485feb0b610325dd1871805b5101d5c60981d177"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:22.084871Z","signature_b64":"+9niKJVtt6RKQcPFiLWu2pPa/Je1dkRuHEn21/QZ8utaJxFybmH6jP80waRibMbHPD6jPv7iFA9WV2+5Tu0iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdd7fd460b27519b080575425abc8ada4b1c2412b0c10e420fc2e5e9839ead6c","last_reissued_at":"2026-07-05T03:48:22.084499Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:22.084499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Applying a Generic Sequence-to-Sequence Model for Simple and Effective Keyphrase Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Alfio Gliozzo, Gaetano Rossiello, Md Faisal Mahbub Chowdhury, Michael Glass, Nandana Mihindukulasooriya","submitted_at":"2022-01-14T04:50:28Z","abstract_excerpt":"In recent years, a number of keyphrase generation (KPG) approaches were proposed consisting of complex model architectures, dedicated training paradigms and decoding strategies. In this work, we opt for simplicity and show how a commonly used seq2seq language model, BART, can be easily adapted to generate keyphrases from the text in a single batch computation using a simple training procedure. Empirical results on five benchmarks show that our approach is as good as the existing state-of-the-art KPG systems, but using a much simpler and easy to deploy framework."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.05302","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.05302/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2201.05302","created_at":"2026-07-05T03:48:22.084555+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.05302v1","created_at":"2026-07-05T03:48:22.084555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.05302","created_at":"2026-07-05T03:48:22.084555+00:00"},{"alias_kind":"pith_short_12","alias_value":"XXL72RQLE5IZ","created_at":"2026-07-05T03:48:22.084555+00:00"},{"alias_kind":"pith_short_16","alias_value":"XXL72RQLE5IZWCAF","created_at":"2026-07-05T03:48:22.084555+00:00"},{"alias_kind":"pith_short_8","alias_value":"XXL72RQL","created_at":"2026-07-05T03:48:22.084555+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.18480","citing_title":"QExplorer: Large Language Model Based Query Extraction for Toxic Content Exploration","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XXL72RQLE5IZWCAFOVBFVPEK3J","json":"https://pith.science/pith/XXL72RQLE5IZWCAFOVBFVPEK3J.json","graph_json":"https://pith.science/api/pith-number/XXL72RQLE5IZWCAFOVBFVPEK3J/graph.json","events_json":"https://pith.science/api/pith-number/XXL72RQLE5IZWCAFOVBFVPEK3J/events.json","paper":"https://pith.science/paper/XXL72RQL"},"agent_actions":{"view_html":"https://pith.science/pith/XXL72RQLE5IZWCAFOVBFVPEK3J","download_json":"https://pith.science/pith/XXL72RQLE5IZWCAFOVBFVPEK3J.json","view_paper":"https://pith.science/paper/XXL72RQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.05302&json=true","fetch_graph":"https://pith.science/api/pith-number/XXL72RQLE5IZWCAFOVBFVPEK3J/graph.json","fetch_events":"https://pith.science/api/pith-number/XXL72RQLE5IZWCAFOVBFVPEK3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XXL72RQLE5IZWCAFOVBFVPEK3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XXL72RQLE5IZWCAFOVBFVPEK3J/action/storage_attestation","attest_author":"https://pith.science/pith/XXL72RQLE5IZWCAFOVBFVPEK3J/action/author_attestation","sign_citation":"https://pith.science/pith/XXL72RQLE5IZWCAFOVBFVPEK3J/action/citation_signature","submit_replication":"https://pith.science/pith/XXL72RQLE5IZWCAFOVBFVPEK3J/action/replication_record"}},"created_at":"2026-07-05T03:48:22.084555+00:00","updated_at":"2026-07-05T03:48:22.084555+00:00"}