{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IOTFEJCMULPLNIHBTQXX4GAYC3","short_pith_number":"pith:IOTFEJCM","schema_version":"1.0","canonical_sha256":"43a652244ca2deb6a0e19c2f7e181816f129a9ce2f153466132b73f1d2361703","source":{"kind":"arxiv","id":"2606.28059","version":1},"attestation_state":"computed","paper":{"title":"Fast and Feasible: Permutation-based Constrained Reranking for Revenue Maximization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.IR","authors_text":"Aleksandr Katrutsa, Anastasiia Soboleva, Egor Samosvat, Ekaterina Solodneva, Roman Loginov, Svetlana Shirokovskikh","submitted_at":"2026-06-26T13:04:00Z","abstract_excerpt":"Search and recommender systems have produced highly relevant search results. A natural next step in the development of such systems in e-commerce is to rerank these results to increase the platform's revenue from paid promotion products. However, maximizing revenue alone may degrade the user experience by reducing relevance or increasing fraud risk. To avoid this, we state the reranking problem as an integer linear program ($ILP$) that maximizes revenue subject to per-query constraints on other metrics, e.g., relevance. Since solving $ILP$ exactly for every query is slow for deployment to the "},"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":"2606.28059","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-26T13:04:00Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e6adc7624625543ac6236524a0f382618cbb7f11a46ff2243cf36b4d80093b2d","abstract_canon_sha256":"8c0d5ebd551c286cd219eab66d89203df1d1ccf3b79213a9f5875bc8f2d1d119"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:56.556417Z","signature_b64":"NnmxbIRZvoR6HmxMZxP7J6hOx0PKci94pJUWPX7svOfDCreTRfy//F5swpJUQ8k8F8QQVwCfjDDq7PS2rILdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43a652244ca2deb6a0e19c2f7e181816f129a9ce2f153466132b73f1d2361703","last_reissued_at":"2026-06-29T01:14:56.555943Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:56.555943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Feasible: Permutation-based Constrained Reranking for Revenue Maximization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.IR","authors_text":"Aleksandr Katrutsa, Anastasiia Soboleva, Egor Samosvat, Ekaterina Solodneva, Roman Loginov, Svetlana Shirokovskikh","submitted_at":"2026-06-26T13:04:00Z","abstract_excerpt":"Search and recommender systems have produced highly relevant search results. A natural next step in the development of such systems in e-commerce is to rerank these results to increase the platform's revenue from paid promotion products. However, maximizing revenue alone may degrade the user experience by reducing relevance or increasing fraud risk. To avoid this, we state the reranking problem as an integer linear program ($ILP$) that maximizes revenue subject to per-query constraints on other metrics, e.g., relevance. Since solving $ILP$ exactly for every query is slow for deployment to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28059","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/2606.28059/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":"2606.28059","created_at":"2026-06-29T01:14:56.556001+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.28059v1","created_at":"2026-06-29T01:14:56.556001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28059","created_at":"2026-06-29T01:14:56.556001+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOTFEJCMULPL","created_at":"2026-06-29T01:14:56.556001+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOTFEJCMULPLNIHB","created_at":"2026-06-29T01:14:56.556001+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOTFEJCM","created_at":"2026-06-29T01:14:56.556001+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/IOTFEJCMULPLNIHBTQXX4GAYC3","json":"https://pith.science/pith/IOTFEJCMULPLNIHBTQXX4GAYC3.json","graph_json":"https://pith.science/api/pith-number/IOTFEJCMULPLNIHBTQXX4GAYC3/graph.json","events_json":"https://pith.science/api/pith-number/IOTFEJCMULPLNIHBTQXX4GAYC3/events.json","paper":"https://pith.science/paper/IOTFEJCM"},"agent_actions":{"view_html":"https://pith.science/pith/IOTFEJCMULPLNIHBTQXX4GAYC3","download_json":"https://pith.science/pith/IOTFEJCMULPLNIHBTQXX4GAYC3.json","view_paper":"https://pith.science/paper/IOTFEJCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.28059&json=true","fetch_graph":"https://pith.science/api/pith-number/IOTFEJCMULPLNIHBTQXX4GAYC3/graph.json","fetch_events":"https://pith.science/api/pith-number/IOTFEJCMULPLNIHBTQXX4GAYC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOTFEJCMULPLNIHBTQXX4GAYC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOTFEJCMULPLNIHBTQXX4GAYC3/action/storage_attestation","attest_author":"https://pith.science/pith/IOTFEJCMULPLNIHBTQXX4GAYC3/action/author_attestation","sign_citation":"https://pith.science/pith/IOTFEJCMULPLNIHBTQXX4GAYC3/action/citation_signature","submit_replication":"https://pith.science/pith/IOTFEJCMULPLNIHBTQXX4GAYC3/action/replication_record"}},"created_at":"2026-06-29T01:14:56.556001+00:00","updated_at":"2026-06-29T01:14:56.556001+00:00"}