{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LLSGADAJONHB4HM3T46DXRHVSN","short_pith_number":"pith:LLSGADAJ","schema_version":"1.0","canonical_sha256":"5ae4600c09734e1e1d9b9f3c3bc4f5934953befb152c5575af55496274057fd9","source":{"kind":"arxiv","id":"2504.05308","version":1},"attestation_state":"computed","paper":{"title":"RARe: Raising Ad Revenue Framework with Context-Aware Reranking","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Aleksandr Katrutsa, Alexandra Khirianova, Andrey Tikhanov, Egor Samosvat, Ekaterina Solodneva, Roman Loginov, Yuriy Dorn","submitted_at":"2025-02-15T20:55:54Z","abstract_excerpt":"Modern recommender systems excel at optimizing search result relevance for e-commerce platforms. While maintaining this relevance, platforms seek opportunities to maximize revenue through search result adjustments. To address the trade-off between relevance and revenue, we propose the $\\mathsf{RARe}$ ($\\textbf{R}$aising $\\textbf{A}$dvertisement $\\textbf{Re}$venue) framework. $\\mathsf{RARe}$ stacks a click model and a reranking model. We train the $\\mathsf{RARe}$ framework with a loss function to find revenue and relevance trade-offs. According to our experience, the click model is crucial in t"},"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":"2504.05308","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2025-02-15T20:55:54Z","cross_cats_sorted":[],"title_canon_sha256":"55ffe24794136934c2599c534e9345883f384ed1e8be866780f950d496f45f92","abstract_canon_sha256":"6acf3c58ade55604d2616b4e93d8714a626c8d2eb0b712c5344e90ca08649932"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:39.469529Z","signature_b64":"Gi+QnN8C42zob7hlWf/u5/vMRog/t3QoSNAdSGeg9+IRt+aXsASANmJGQEVmCIpH7/TROqfQK8WHidYeU4kUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ae4600c09734e1e1d9b9f3c3bc4f5934953befb152c5575af55496274057fd9","last_reissued_at":"2026-07-05T10:45:39.469041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:39.469041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RARe: Raising Ad Revenue Framework with Context-Aware Reranking","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Aleksandr Katrutsa, Alexandra Khirianova, Andrey Tikhanov, Egor Samosvat, Ekaterina Solodneva, Roman Loginov, Yuriy Dorn","submitted_at":"2025-02-15T20:55:54Z","abstract_excerpt":"Modern recommender systems excel at optimizing search result relevance for e-commerce platforms. While maintaining this relevance, platforms seek opportunities to maximize revenue through search result adjustments. To address the trade-off between relevance and revenue, we propose the $\\mathsf{RARe}$ ($\\textbf{R}$aising $\\textbf{A}$dvertisement $\\textbf{Re}$venue) framework. $\\mathsf{RARe}$ stacks a click model and a reranking model. We train the $\\mathsf{RARe}$ framework with a loss function to find revenue and relevance trade-offs. According to our experience, the click model is crucial in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05308","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/2504.05308/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":"2504.05308","created_at":"2026-07-05T10:45:39.469101+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.05308v1","created_at":"2026-07-05T10:45:39.469101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05308","created_at":"2026-07-05T10:45:39.469101+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLSGADAJONHB","created_at":"2026-07-05T10:45:39.469101+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLSGADAJONHB4HM3","created_at":"2026-07-05T10:45:39.469101+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLSGADAJ","created_at":"2026-07-05T10:45:39.469101+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28059","citing_title":"Fast and Feasible: Permutation-based Constrained Reranking for Revenue Maximization","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLSGADAJONHB4HM3T46DXRHVSN","json":"https://pith.science/pith/LLSGADAJONHB4HM3T46DXRHVSN.json","graph_json":"https://pith.science/api/pith-number/LLSGADAJONHB4HM3T46DXRHVSN/graph.json","events_json":"https://pith.science/api/pith-number/LLSGADAJONHB4HM3T46DXRHVSN/events.json","paper":"https://pith.science/paper/LLSGADAJ"},"agent_actions":{"view_html":"https://pith.science/pith/LLSGADAJONHB4HM3T46DXRHVSN","download_json":"https://pith.science/pith/LLSGADAJONHB4HM3T46DXRHVSN.json","view_paper":"https://pith.science/paper/LLSGADAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.05308&json=true","fetch_graph":"https://pith.science/api/pith-number/LLSGADAJONHB4HM3T46DXRHVSN/graph.json","fetch_events":"https://pith.science/api/pith-number/LLSGADAJONHB4HM3T46DXRHVSN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLSGADAJONHB4HM3T46DXRHVSN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLSGADAJONHB4HM3T46DXRHVSN/action/storage_attestation","attest_author":"https://pith.science/pith/LLSGADAJONHB4HM3T46DXRHVSN/action/author_attestation","sign_citation":"https://pith.science/pith/LLSGADAJONHB4HM3T46DXRHVSN/action/citation_signature","submit_replication":"https://pith.science/pith/LLSGADAJONHB4HM3T46DXRHVSN/action/replication_record"}},"created_at":"2026-07-05T10:45:39.469101+00:00","updated_at":"2026-07-05T10:45:39.469101+00:00"}