{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YA7DRQA2CL7BF62TP362NHINM5","short_pith_number":"pith:YA7DRQA2","schema_version":"1.0","canonical_sha256":"c03e38c01a12fe12fb537efda69d0d6766da2a073759c036b9efd4cd207a662d","source":{"kind":"arxiv","id":"2310.10462","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Neural Ranking Framework: Toward Maximized Business Goal for Cascade Ranking Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dongying Kong, Han Li, Jian Yang, Kun Gai, Shiyang Wen, Yunli Wang, Zhiqiang Wang","submitted_at":"2023-10-16T14:43:02Z","abstract_excerpt":"Cascade ranking is widely used for large-scale top-k selection problems in online advertising and recommendation systems, and learning-to-rank is an important way to optimize the models in cascade ranking. Previous works on learning-to-rank usually focus on letting the model learn the complete order or top-k order, and adopt the corresponding rank metrics (e.g. OPA and NDCG@k) as optimization targets. However, these targets can not adapt to various cascade ranking scenarios with varying data complexities and model capabilities; and the existing metric-driven methods such as the Lambda framewor"},"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":"2310.10462","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-16T14:43:02Z","cross_cats_sorted":[],"title_canon_sha256":"dedf3056b5656123ea3b542c2f9552dbe25c472193a9b13c75e221d407084fb3","abstract_canon_sha256":"cdaf4a0fcb1c36e31f463ecb70bf5a4439313bbef1bf20e4533edcc76cf7a6ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:45.440893Z","signature_b64":"dF+dT4oL0D7Yc5gldL+U5d1WPSvZgtWNi0c7/ABPp10JjMeuS5uwQLZ0ddZ4/Llcn18NFBuUup1yY1FNdUlVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c03e38c01a12fe12fb537efda69d0d6766da2a073759c036b9efd4cd207a662d","last_reissued_at":"2026-07-05T07:47:45.440354Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:45.440354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Neural Ranking Framework: Toward Maximized Business Goal for Cascade Ranking Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dongying Kong, Han Li, Jian Yang, Kun Gai, Shiyang Wen, Yunli Wang, Zhiqiang Wang","submitted_at":"2023-10-16T14:43:02Z","abstract_excerpt":"Cascade ranking is widely used for large-scale top-k selection problems in online advertising and recommendation systems, and learning-to-rank is an important way to optimize the models in cascade ranking. Previous works on learning-to-rank usually focus on letting the model learn the complete order or top-k order, and adopt the corresponding rank metrics (e.g. OPA and NDCG@k) as optimization targets. However, these targets can not adapt to various cascade ranking scenarios with varying data complexities and model capabilities; and the existing metric-driven methods such as the Lambda framewor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.10462","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.10462/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":"2310.10462","created_at":"2026-07-05T07:47:45.440427+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.10462v2","created_at":"2026-07-05T07:47:45.440427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.10462","created_at":"2026-07-05T07:47:45.440427+00:00"},{"alias_kind":"pith_short_12","alias_value":"YA7DRQA2CL7B","created_at":"2026-07-05T07:47:45.440427+00:00"},{"alias_kind":"pith_short_16","alias_value":"YA7DRQA2CL7BF62T","created_at":"2026-07-05T07:47:45.440427+00:00"},{"alias_kind":"pith_short_8","alias_value":"YA7DRQA2","created_at":"2026-07-05T07:47:45.440427+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/YA7DRQA2CL7BF62TP362NHINM5","json":"https://pith.science/pith/YA7DRQA2CL7BF62TP362NHINM5.json","graph_json":"https://pith.science/api/pith-number/YA7DRQA2CL7BF62TP362NHINM5/graph.json","events_json":"https://pith.science/api/pith-number/YA7DRQA2CL7BF62TP362NHINM5/events.json","paper":"https://pith.science/paper/YA7DRQA2"},"agent_actions":{"view_html":"https://pith.science/pith/YA7DRQA2CL7BF62TP362NHINM5","download_json":"https://pith.science/pith/YA7DRQA2CL7BF62TP362NHINM5.json","view_paper":"https://pith.science/paper/YA7DRQA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.10462&json=true","fetch_graph":"https://pith.science/api/pith-number/YA7DRQA2CL7BF62TP362NHINM5/graph.json","fetch_events":"https://pith.science/api/pith-number/YA7DRQA2CL7BF62TP362NHINM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YA7DRQA2CL7BF62TP362NHINM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YA7DRQA2CL7BF62TP362NHINM5/action/storage_attestation","attest_author":"https://pith.science/pith/YA7DRQA2CL7BF62TP362NHINM5/action/author_attestation","sign_citation":"https://pith.science/pith/YA7DRQA2CL7BF62TP362NHINM5/action/citation_signature","submit_replication":"https://pith.science/pith/YA7DRQA2CL7BF62TP362NHINM5/action/replication_record"}},"created_at":"2026-07-05T07:47:45.440427+00:00","updated_at":"2026-07-05T07:47:45.440427+00:00"}