{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:736CZZOFBYHQTU3XKIFWRVQM6F","short_pith_number":"pith:736CZZOF","schema_version":"1.0","canonical_sha256":"fefc2ce5c50e0f09d377520b68d60cf1476001c34d44deb5bee2261a120a7e10","source":{"kind":"arxiv","id":"1602.04391","version":2},"attestation_state":"computed","paper":{"title":"Constrained Multi-Slot Optimization for Ranking Recommendations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.AP"],"primary_cat":"stat.ML","authors_text":"Ankan Saha, Kinjal Basu, Shaunak Chatterjee","submitted_at":"2016-02-13T22:22:54Z","abstract_excerpt":"Ranking items to be recommended to users is one of the main problems in large scale social media applications. This problem can be set up as a multi-objective optimization problem to allow for trading off multiple, potentially conflicting objectives (that are driven by those items) against each other. Most previous approaches to this problem optimize for a single slot without considering the interaction effect of these items on one another.\n  In this paper, we develop a constrained multi-slot optimization formulation, which allows for modeling interactions among the items on the different slot"},"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":"1602.04391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-13T22:22:54Z","cross_cats_sorted":["math.OC","stat.AP"],"title_canon_sha256":"03b3adbf5be9b135743c68c3a100f4c18fbb96c92f7dd4a3cd5fa7dc3d6c36d3","abstract_canon_sha256":"41778f3c73dcd2501e20c4e03404f5b86e50ad2891bb3ec1f05c899567d97c64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:24.894431Z","signature_b64":"0s5kMi3cMF9wiq9r118GaTlIzLmifSTdtYXSuauy9P//Ga5tttaBfVv7fiDyf0DbewB9CEEetWxiwQ/lFKthBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fefc2ce5c50e0f09d377520b68d60cf1476001c34d44deb5bee2261a120a7e10","last_reissued_at":"2026-05-18T00:44:24.893850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:24.893850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Multi-Slot Optimization for Ranking Recommendations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.AP"],"primary_cat":"stat.ML","authors_text":"Ankan Saha, Kinjal Basu, Shaunak Chatterjee","submitted_at":"2016-02-13T22:22:54Z","abstract_excerpt":"Ranking items to be recommended to users is one of the main problems in large scale social media applications. This problem can be set up as a multi-objective optimization problem to allow for trading off multiple, potentially conflicting objectives (that are driven by those items) against each other. Most previous approaches to this problem optimize for a single slot without considering the interaction effect of these items on one another.\n  In this paper, we develop a constrained multi-slot optimization formulation, which allows for modeling interactions among the items on the different slot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04391","kind":"arxiv","version":2},"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":"1602.04391","created_at":"2026-05-18T00:44:24.893950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04391v2","created_at":"2026-05-18T00:44:24.893950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04391","created_at":"2026-05-18T00:44:24.893950+00:00"},{"alias_kind":"pith_short_12","alias_value":"736CZZOFBYHQ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"736CZZOFBYHQTU3X","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"736CZZOF","created_at":"2026-05-18T12:30:04.600751+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/736CZZOFBYHQTU3XKIFWRVQM6F","json":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F.json","graph_json":"https://pith.science/api/pith-number/736CZZOFBYHQTU3XKIFWRVQM6F/graph.json","events_json":"https://pith.science/api/pith-number/736CZZOFBYHQTU3XKIFWRVQM6F/events.json","paper":"https://pith.science/paper/736CZZOF"},"agent_actions":{"view_html":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F","download_json":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F.json","view_paper":"https://pith.science/paper/736CZZOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04391&json=true","fetch_graph":"https://pith.science/api/pith-number/736CZZOFBYHQTU3XKIFWRVQM6F/graph.json","fetch_events":"https://pith.science/api/pith-number/736CZZOFBYHQTU3XKIFWRVQM6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F/action/storage_attestation","attest_author":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F/action/author_attestation","sign_citation":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F/action/citation_signature","submit_replication":"https://pith.science/pith/736CZZOFBYHQTU3XKIFWRVQM6F/action/replication_record"}},"created_at":"2026-05-18T00:44:24.893950+00:00","updated_at":"2026-05-18T00:44:24.893950+00:00"}