{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:APSUV62QGYO67YMAQXXNSWJSWE","short_pith_number":"pith:APSUV62Q","schema_version":"1.0","canonical_sha256":"03e54afb50361defe18085eed95932b11fc2724c31bd5e3220a14663297f2f4e","source":{"kind":"arxiv","id":"1812.00158","version":1},"attestation_state":"computed","paper":{"title":"Approximating Categorical Similarity in Sponsored Search Relevance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hiba Ahsan, Rahul Agrawal","submitted_at":"2018-12-01T06:26:05Z","abstract_excerpt":"Sponsored Search is a major source of revenue for web search engines. Since sponsored search follows a pay-per-click model, showing relevant ads for receiving clicks is crucial. Matching categories of a query and its ad candidates have been explored in modeling relevance of query-ad pairs. The approach involves matching cached categories of queries seen in the past to categories of candidate ads. Since queries have a heavy tail distribution, the approach has limited coverage. In this work, we propose approximating categorical similarity of a query-ad pairs using neural networks, particularly C"},"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":"1812.00158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-12-01T06:26:05Z","cross_cats_sorted":[],"title_canon_sha256":"a677342a214c1e5db73d2d8e1e24136319695cdaf534e291283f711a61587e23","abstract_canon_sha256":"d41b8a4f5e5b0822601816bf32bf66112c517377c3bc72cb01b14f8d7f11f321"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:27.090068Z","signature_b64":"LuedsqdK2uG8Rj4RensWCtwmfQr7c/KElr7HPZzd+/awsDzBe26folPKPWIcBYQZI/4FkguzK+Ar5WnitYEUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03e54afb50361defe18085eed95932b11fc2724c31bd5e3220a14663297f2f4e","last_reissued_at":"2026-05-17T23:59:27.088709Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:27.088709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Categorical Similarity in Sponsored Search Relevance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hiba Ahsan, Rahul Agrawal","submitted_at":"2018-12-01T06:26:05Z","abstract_excerpt":"Sponsored Search is a major source of revenue for web search engines. Since sponsored search follows a pay-per-click model, showing relevant ads for receiving clicks is crucial. Matching categories of a query and its ad candidates have been explored in modeling relevance of query-ad pairs. The approach involves matching cached categories of queries seen in the past to categories of candidate ads. Since queries have a heavy tail distribution, the approach has limited coverage. In this work, we propose approximating categorical similarity of a query-ad pairs using neural networks, particularly C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00158","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.00158","created_at":"2026-05-17T23:59:27.088781+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00158v1","created_at":"2026-05-17T23:59:27.088781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00158","created_at":"2026-05-17T23:59:27.088781+00:00"},{"alias_kind":"pith_short_12","alias_value":"APSUV62QGYO6","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"APSUV62QGYO67YMA","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"APSUV62Q","created_at":"2026-05-18T12:32:13.499390+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/APSUV62QGYO67YMAQXXNSWJSWE","json":"https://pith.science/pith/APSUV62QGYO67YMAQXXNSWJSWE.json","graph_json":"https://pith.science/api/pith-number/APSUV62QGYO67YMAQXXNSWJSWE/graph.json","events_json":"https://pith.science/api/pith-number/APSUV62QGYO67YMAQXXNSWJSWE/events.json","paper":"https://pith.science/paper/APSUV62Q"},"agent_actions":{"view_html":"https://pith.science/pith/APSUV62QGYO67YMAQXXNSWJSWE","download_json":"https://pith.science/pith/APSUV62QGYO67YMAQXXNSWJSWE.json","view_paper":"https://pith.science/paper/APSUV62Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00158&json=true","fetch_graph":"https://pith.science/api/pith-number/APSUV62QGYO67YMAQXXNSWJSWE/graph.json","fetch_events":"https://pith.science/api/pith-number/APSUV62QGYO67YMAQXXNSWJSWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APSUV62QGYO67YMAQXXNSWJSWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APSUV62QGYO67YMAQXXNSWJSWE/action/storage_attestation","attest_author":"https://pith.science/pith/APSUV62QGYO67YMAQXXNSWJSWE/action/author_attestation","sign_citation":"https://pith.science/pith/APSUV62QGYO67YMAQXXNSWJSWE/action/citation_signature","submit_replication":"https://pith.science/pith/APSUV62QGYO67YMAQXXNSWJSWE/action/replication_record"}},"created_at":"2026-05-17T23:59:27.088781+00:00","updated_at":"2026-05-17T23:59:27.088781+00:00"}