{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:L2BO34BQKA67GDSD7454TOKO4K","short_pith_number":"pith:L2BO34BQ","schema_version":"1.0","canonical_sha256":"5e82edf030503df30e43ff3bc9b94ee2a235b88bb6ac91d14f5e770d9e978ded","source":{"kind":"arxiv","id":"2410.20080","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Keyphrase Ranking for Relevance and Diversity Using Submodular Function Optimization (SFO)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Muhammad Umair, Syed Jalaluddin Hashmi, Young-Koo Lee","submitted_at":"2024-10-26T05:14:32Z","abstract_excerpt":"Keyphrase ranking plays a crucial role in information retrieval and summarization by indexing and retrieving relevant information efficiently. Advances in natural language processing, especially large language models (LLMs), have improved keyphrase extraction and ranking. However, traditional methods often overlook diversity, resulting in redundant keyphrases. We propose a novel approach using Submodular Function Optimization (SFO) to balance relevance and diversity in keyphrase ranking. By framing the task as submodular maximization, our method selects diverse and representative keyphrases. E"},"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":"2410.20080","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-10-26T05:14:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1abf91e9976aa7428724ac2a316d69b6200c6d66e7fe3135890b96704f6411ee","abstract_canon_sha256":"e8c54c3ded6ec1b631d8131d45d0ebb0ea79179875ee05f928f0cefe9035468d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:38.681326Z","signature_b64":"wosH1/LaITQTWr0HaYhIhbqGjfcvXA1X7He67HyvunA2F6Twuy0WO+k5cx4FMVG9aJ+Pm3/4EASK6YgUucepAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e82edf030503df30e43ff3bc9b94ee2a235b88bb6ac91d14f5e770d9e978ded","last_reissued_at":"2026-07-05T09:26:38.680818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:38.680818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Keyphrase Ranking for Relevance and Diversity Using Submodular Function Optimization (SFO)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Muhammad Umair, Syed Jalaluddin Hashmi, Young-Koo Lee","submitted_at":"2024-10-26T05:14:32Z","abstract_excerpt":"Keyphrase ranking plays a crucial role in information retrieval and summarization by indexing and retrieving relevant information efficiently. Advances in natural language processing, especially large language models (LLMs), have improved keyphrase extraction and ranking. However, traditional methods often overlook diversity, resulting in redundant keyphrases. We propose a novel approach using Submodular Function Optimization (SFO) to balance relevance and diversity in keyphrase ranking. By framing the task as submodular maximization, our method selects diverse and representative keyphrases. E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.20080","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/2410.20080/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":"2410.20080","created_at":"2026-07-05T09:26:38.680884+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.20080v1","created_at":"2026-07-05T09:26:38.680884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.20080","created_at":"2026-07-05T09:26:38.680884+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2BO34BQKA67","created_at":"2026-07-05T09:26:38.680884+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2BO34BQKA67GDSD","created_at":"2026-07-05T09:26:38.680884+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2BO34BQ","created_at":"2026-07-05T09:26:38.680884+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/L2BO34BQKA67GDSD7454TOKO4K","json":"https://pith.science/pith/L2BO34BQKA67GDSD7454TOKO4K.json","graph_json":"https://pith.science/api/pith-number/L2BO34BQKA67GDSD7454TOKO4K/graph.json","events_json":"https://pith.science/api/pith-number/L2BO34BQKA67GDSD7454TOKO4K/events.json","paper":"https://pith.science/paper/L2BO34BQ"},"agent_actions":{"view_html":"https://pith.science/pith/L2BO34BQKA67GDSD7454TOKO4K","download_json":"https://pith.science/pith/L2BO34BQKA67GDSD7454TOKO4K.json","view_paper":"https://pith.science/paper/L2BO34BQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.20080&json=true","fetch_graph":"https://pith.science/api/pith-number/L2BO34BQKA67GDSD7454TOKO4K/graph.json","fetch_events":"https://pith.science/api/pith-number/L2BO34BQKA67GDSD7454TOKO4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2BO34BQKA67GDSD7454TOKO4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2BO34BQKA67GDSD7454TOKO4K/action/storage_attestation","attest_author":"https://pith.science/pith/L2BO34BQKA67GDSD7454TOKO4K/action/author_attestation","sign_citation":"https://pith.science/pith/L2BO34BQKA67GDSD7454TOKO4K/action/citation_signature","submit_replication":"https://pith.science/pith/L2BO34BQKA67GDSD7454TOKO4K/action/replication_record"}},"created_at":"2026-07-05T09:26:38.680884+00:00","updated_at":"2026-07-05T09:26:38.680884+00:00"}