{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IGO4VGXPDCFFAY55EPC42J2K7V","short_pith_number":"pith:IGO4VGXP","schema_version":"1.0","canonical_sha256":"419dca9aef188a5063bd23c5cd274afd6fb333077b3d1c367e611cab32c6b11b","source":{"kind":"arxiv","id":"1706.02093","version":1},"attestation_state":"computed","paper":{"title":"Cascade Ranking for Operational E-commerce Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"stat.ML","authors_text":"Fei Xiao, Luo Si, Shichen Liu, Wenwu Ou","submitted_at":"2017-06-07T09:03:13Z","abstract_excerpt":"In the 'Big Data' era, many real-world applications like search involve the ranking problem for a large number of items. It is important to obtain effective ranking results and at the same time obtain the results efficiently in a timely manner for providing good user experience and saving computational costs. Valuable prior research has been conducted for learning to efficiently rank like the cascade ranking (learning) model, which uses a sequence of ranking functions to progressively filter some items and rank the remaining items. However, most existing research of learning to efficiently ran"},"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":"1706.02093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-07T09:03:13Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"7136a0a162a207009b206eeafb5e446d1f1a90cf80cd23ca387e453545797dd7","abstract_canon_sha256":"c643003b54b14e58caef1eb652089f1ed47b564f41f121901b38c1f85f1a79fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:50.096746Z","signature_b64":"ksUnH9aA/opw78lv5y1u8Xjkww/oB77PFmh8z6L6NvJsyn3StrMuj0re9foJUrdsaoiupbv+vltcU/95PVqnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"419dca9aef188a5063bd23c5cd274afd6fb333077b3d1c367e611cab32c6b11b","last_reissued_at":"2026-05-18T00:42:50.096055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:50.096055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cascade Ranking for Operational E-commerce Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"stat.ML","authors_text":"Fei Xiao, Luo Si, Shichen Liu, Wenwu Ou","submitted_at":"2017-06-07T09:03:13Z","abstract_excerpt":"In the 'Big Data' era, many real-world applications like search involve the ranking problem for a large number of items. It is important to obtain effective ranking results and at the same time obtain the results efficiently in a timely manner for providing good user experience and saving computational costs. Valuable prior research has been conducted for learning to efficiently rank like the cascade ranking (learning) model, which uses a sequence of ranking functions to progressively filter some items and rank the remaining items. However, most existing research of learning to efficiently ran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02093","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":""},"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":"1706.02093","created_at":"2026-05-18T00:42:50.096187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02093v1","created_at":"2026-05-18T00:42:50.096187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02093","created_at":"2026-05-18T00:42:50.096187+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGO4VGXPDCFF","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGO4VGXPDCFFAY55","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGO4VGXP","created_at":"2026-05-18T12:31:21.493067+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/IGO4VGXPDCFFAY55EPC42J2K7V","json":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V.json","graph_json":"https://pith.science/api/pith-number/IGO4VGXPDCFFAY55EPC42J2K7V/graph.json","events_json":"https://pith.science/api/pith-number/IGO4VGXPDCFFAY55EPC42J2K7V/events.json","paper":"https://pith.science/paper/IGO4VGXP"},"agent_actions":{"view_html":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V","download_json":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V.json","view_paper":"https://pith.science/paper/IGO4VGXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02093&json=true","fetch_graph":"https://pith.science/api/pith-number/IGO4VGXPDCFFAY55EPC42J2K7V/graph.json","fetch_events":"https://pith.science/api/pith-number/IGO4VGXPDCFFAY55EPC42J2K7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V/action/storage_attestation","attest_author":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V/action/author_attestation","sign_citation":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V/action/citation_signature","submit_replication":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V/action/replication_record"}},"created_at":"2026-05-18T00:42:50.096187+00:00","updated_at":"2026-05-18T00:42:50.096187+00:00"}