{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6GQRXVQS7LNAIDAUDDGOMVKD2N","short_pith_number":"pith:6GQRXVQS","schema_version":"1.0","canonical_sha256":"f1a11bd612fada040c1418cce65543d35ecdd4c1eec27632dac9ee9101cddfc8","source":{"kind":"arxiv","id":"1803.08721","version":2},"attestation_state":"computed","paper":{"title":"Unsupervised Keyphrase Extraction with Multipartite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Florian Boudin","submitted_at":"2018-03-23T10:35:42Z","abstract_excerpt":"We propose an unsupervised keyphrase extraction model that encodes topical information within a multipartite graph structure. Our model represents keyphrase candidates and topics in a single graph and exploits their mutually reinforcing relationship to improve candidate ranking. We further introduce a novel mechanism to incorporate keyphrase selection preferences into the model. Experiments conducted on three widely used datasets show significant improvements over state-of-the-art graph-based models."},"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":"1803.08721","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2018-03-23T10:35:42Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"0ee0c7ce081716de46894434c95b692c9599800855ee58878973e13f33e88895","abstract_canon_sha256":"b222539526c27f03ac325ef056321d970429b0c7223fcf488c4bb7db7b781782"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:30.832114Z","signature_b64":"YnMS6yrU7T+jM/4xltPY9qcLk8//DeT/6557Y1cmSTzrkM/fcsrLrqP9y5+mSS/K1INs2MHqyGCi5IQ9H1LEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1a11bd612fada040c1418cce65543d35ecdd4c1eec27632dac9ee9101cddfc8","last_reissued_at":"2026-05-18T00:18:30.831535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:30.831535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsupervised Keyphrase Extraction with Multipartite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Florian Boudin","submitted_at":"2018-03-23T10:35:42Z","abstract_excerpt":"We propose an unsupervised keyphrase extraction model that encodes topical information within a multipartite graph structure. Our model represents keyphrase candidates and topics in a single graph and exploits their mutually reinforcing relationship to improve candidate ranking. We further introduce a novel mechanism to incorporate keyphrase selection preferences into the model. Experiments conducted on three widely used datasets show significant improvements over state-of-the-art graph-based models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08721","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.08721","created_at":"2026-05-18T00:18:30.831629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08721v2","created_at":"2026-05-18T00:18:30.831629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08721","created_at":"2026-05-18T00:18:30.831629+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GQRXVQS7LNA","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GQRXVQS7LNAIDAU","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GQRXVQS","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6GQRXVQS7LNAIDAUDDGOMVKD2N","json":"https://pith.science/pith/6GQRXVQS7LNAIDAUDDGOMVKD2N.json","graph_json":"https://pith.science/api/pith-number/6GQRXVQS7LNAIDAUDDGOMVKD2N/graph.json","events_json":"https://pith.science/api/pith-number/6GQRXVQS7LNAIDAUDDGOMVKD2N/events.json","paper":"https://pith.science/paper/6GQRXVQS"},"agent_actions":{"view_html":"https://pith.science/pith/6GQRXVQS7LNAIDAUDDGOMVKD2N","download_json":"https://pith.science/pith/6GQRXVQS7LNAIDAUDDGOMVKD2N.json","view_paper":"https://pith.science/paper/6GQRXVQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08721&json=true","fetch_graph":"https://pith.science/api/pith-number/6GQRXVQS7LNAIDAUDDGOMVKD2N/graph.json","fetch_events":"https://pith.science/api/pith-number/6GQRXVQS7LNAIDAUDDGOMVKD2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GQRXVQS7LNAIDAUDDGOMVKD2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GQRXVQS7LNAIDAUDDGOMVKD2N/action/storage_attestation","attest_author":"https://pith.science/pith/6GQRXVQS7LNAIDAUDDGOMVKD2N/action/author_attestation","sign_citation":"https://pith.science/pith/6GQRXVQS7LNAIDAUDDGOMVKD2N/action/citation_signature","submit_replication":"https://pith.science/pith/6GQRXVQS7LNAIDAUDDGOMVKD2N/action/replication_record"}},"created_at":"2026-05-18T00:18:30.831629+00:00","updated_at":"2026-05-18T00:18:30.831629+00:00"}