{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZXSDASFZJ5IJVNXECHHPGQONU7","short_pith_number":"pith:ZXSDASFZ","schema_version":"1.0","canonical_sha256":"cde43048b94f509ab6e411cef341cda7e0432a164650241f9e01a221619676ae","source":{"kind":"arxiv","id":"2409.03140","version":4},"attestation_state":"computed","paper":{"title":"GraphEx: A Graph-based Extraction Method for Advertiser Keyphrase Recommendation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Ashirbad Mishra, Binbin Li, He Yu, Jinyu Zhao, Kaichen Ni, Kamesh Madduri, Marshall Wu, Soumik Dey","submitted_at":"2024-09-05T00:25:37Z","abstract_excerpt":"Online sellers and advertisers are recommended keyphrases for their listed products, which they bid on to enhance their sales. One popular paradigm that generates such recommendations is Extreme Multi-Label Classification (XMC), which involves tagging/mapping keyphrases to items. We outline the limitations of using traditional item-query based tagging or mapping techniques for keyphrase recommendations on E-Commerce platforms. We introduce GraphEx, an innovative graph-based approach that recommends keyphrases to sellers using extraction of token permutations from item titles. Additionally, we "},"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":"2409.03140","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2024-09-05T00:25:37Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"64a99a24297612700eba1734b105f94cd8add5229497c644c4279c9427335710","abstract_canon_sha256":"6560e524bdbb65325a883845a4bece68ea1c6f7c577d150f0321389e0d7779b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:32.050031Z","signature_b64":"DxiSxZ2MkXO6WKFSdICB+BfLLWy3PI6vaNXxpF2OYG5swMiNSIbjuEsILbeNhqlWXEdEj7ZTeyrTcwVfIobSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cde43048b94f509ab6e411cef341cda7e0432a164650241f9e01a221619676ae","last_reissued_at":"2026-07-05T11:10:32.049518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:32.049518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphEx: A Graph-based Extraction Method for Advertiser Keyphrase Recommendation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Ashirbad Mishra, Binbin Li, He Yu, Jinyu Zhao, Kaichen Ni, Kamesh Madduri, Marshall Wu, Soumik Dey","submitted_at":"2024-09-05T00:25:37Z","abstract_excerpt":"Online sellers and advertisers are recommended keyphrases for their listed products, which they bid on to enhance their sales. One popular paradigm that generates such recommendations is Extreme Multi-Label Classification (XMC), which involves tagging/mapping keyphrases to items. We outline the limitations of using traditional item-query based tagging or mapping techniques for keyphrase recommendations on E-Commerce platforms. We introduce GraphEx, an innovative graph-based approach that recommends keyphrases to sellers using extraction of token permutations from item titles. Additionally, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.03140","kind":"arxiv","version":4},"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/2409.03140/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":"2409.03140","created_at":"2026-07-05T11:10:32.049577+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.03140v4","created_at":"2026-07-05T11:10:32.049577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.03140","created_at":"2026-07-05T11:10:32.049577+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXSDASFZJ5IJ","created_at":"2026-07-05T11:10:32.049577+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXSDASFZJ5IJVNXE","created_at":"2026-07-05T11:10:32.049577+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXSDASFZ","created_at":"2026-07-05T11:10:32.049577+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00131","citing_title":"Middleman Bias in Advertising: Aligning Relevance of Keyphrase Recommendations with Search","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZXSDASFZJ5IJVNXECHHPGQONU7","json":"https://pith.science/pith/ZXSDASFZJ5IJVNXECHHPGQONU7.json","graph_json":"https://pith.science/api/pith-number/ZXSDASFZJ5IJVNXECHHPGQONU7/graph.json","events_json":"https://pith.science/api/pith-number/ZXSDASFZJ5IJVNXECHHPGQONU7/events.json","paper":"https://pith.science/paper/ZXSDASFZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZXSDASFZJ5IJVNXECHHPGQONU7","download_json":"https://pith.science/pith/ZXSDASFZJ5IJVNXECHHPGQONU7.json","view_paper":"https://pith.science/paper/ZXSDASFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.03140&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXSDASFZJ5IJVNXECHHPGQONU7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXSDASFZJ5IJVNXECHHPGQONU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXSDASFZJ5IJVNXECHHPGQONU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXSDASFZJ5IJVNXECHHPGQONU7/action/storage_attestation","attest_author":"https://pith.science/pith/ZXSDASFZJ5IJVNXECHHPGQONU7/action/author_attestation","sign_citation":"https://pith.science/pith/ZXSDASFZJ5IJVNXECHHPGQONU7/action/citation_signature","submit_replication":"https://pith.science/pith/ZXSDASFZJ5IJVNXECHHPGQONU7/action/replication_record"}},"created_at":"2026-07-05T11:10:32.049577+00:00","updated_at":"2026-07-05T11:10:32.049577+00:00"}