{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UOTDT2CZB4VLRVVXTOXFVSQDVP","short_pith_number":"pith:UOTDT2CZ","schema_version":"1.0","canonical_sha256":"a3a639e8590f2ab8d6b79bae5aca03abcf268d50f2f3b2fd2b4e8c92b816fb40","source":{"kind":"arxiv","id":"2112.07621","version":1},"attestation_state":"computed","paper":{"title":"Re-ranking With Constraints on Diversified Exposures for Homepage Recommender System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Guangda Huzhang, Qi Hao, Tianze Luo","submitted_at":"2021-12-12T09:34:50Z","abstract_excerpt":"The homepage recommendation on most E-commerce applications places items in a hierarchical manner, where different channels display items in different styles. Existing algorithms usually optimize the performance of a single channel. So designing the model to achieve the optimal recommendation list which maximize the Click-Through Rate (CTR) of whole homepage is a challenge problem. Other than the accuracy objective, display diversity on the homepage is also important since homogeneous display usually hurts user experience. In this paper, we propose a two-stage architecture of the homepage reco"},"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":"2112.07621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-12-12T09:34:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e4593c424d4f55a00ff36b8962da7e9e4d9396149384237459d70b4eb1733e2e","abstract_canon_sha256":"c48f585f5369e6226fa4befe5245c967ba9df8cfc385215e018b6f77f98ea49c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:00.103622Z","signature_b64":"NYHb8Q68CpWfvIjA6i96UbMTOFdg4swpDZSxVSmmJpF2UhKujZoFtgp3iR0b677EzthghIw64rQ91X+eyMrpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3a639e8590f2ab8d6b79bae5aca03abcf268d50f2f3b2fd2b4e8c92b816fb40","last_reissued_at":"2026-07-05T03:41:00.103241Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:00.103241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Re-ranking With Constraints on Diversified Exposures for Homepage Recommender System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Guangda Huzhang, Qi Hao, Tianze Luo","submitted_at":"2021-12-12T09:34:50Z","abstract_excerpt":"The homepage recommendation on most E-commerce applications places items in a hierarchical manner, where different channels display items in different styles. Existing algorithms usually optimize the performance of a single channel. So designing the model to achieve the optimal recommendation list which maximize the Click-Through Rate (CTR) of whole homepage is a challenge problem. Other than the accuracy objective, display diversity on the homepage is also important since homogeneous display usually hurts user experience. In this paper, we propose a two-stage architecture of the homepage reco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.07621","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/2112.07621/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":"2112.07621","created_at":"2026-07-05T03:41:00.103295+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.07621v1","created_at":"2026-07-05T03:41:00.103295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07621","created_at":"2026-07-05T03:41:00.103295+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOTDT2CZB4VL","created_at":"2026-07-05T03:41:00.103295+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOTDT2CZB4VLRVVX","created_at":"2026-07-05T03:41:00.103295+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOTDT2CZ","created_at":"2026-07-05T03:41:00.103295+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":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UOTDT2CZB4VLRVVXTOXFVSQDVP","json":"https://pith.science/pith/UOTDT2CZB4VLRVVXTOXFVSQDVP.json","graph_json":"https://pith.science/api/pith-number/UOTDT2CZB4VLRVVXTOXFVSQDVP/graph.json","events_json":"https://pith.science/api/pith-number/UOTDT2CZB4VLRVVXTOXFVSQDVP/events.json","paper":"https://pith.science/paper/UOTDT2CZ"},"agent_actions":{"view_html":"https://pith.science/pith/UOTDT2CZB4VLRVVXTOXFVSQDVP","download_json":"https://pith.science/pith/UOTDT2CZB4VLRVVXTOXFVSQDVP.json","view_paper":"https://pith.science/paper/UOTDT2CZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.07621&json=true","fetch_graph":"https://pith.science/api/pith-number/UOTDT2CZB4VLRVVXTOXFVSQDVP/graph.json","fetch_events":"https://pith.science/api/pith-number/UOTDT2CZB4VLRVVXTOXFVSQDVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOTDT2CZB4VLRVVXTOXFVSQDVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOTDT2CZB4VLRVVXTOXFVSQDVP/action/storage_attestation","attest_author":"https://pith.science/pith/UOTDT2CZB4VLRVVXTOXFVSQDVP/action/author_attestation","sign_citation":"https://pith.science/pith/UOTDT2CZB4VLRVVXTOXFVSQDVP/action/citation_signature","submit_replication":"https://pith.science/pith/UOTDT2CZB4VLRVVXTOXFVSQDVP/action/replication_record"}},"created_at":"2026-07-05T03:41:00.103295+00:00","updated_at":"2026-07-05T03:41:00.103295+00:00"}