{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IGO4VGXPDCFFAY55EPC42J2K7V","short_pith_number":"pith:IGO4VGXP","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"},"canonical_sha256":"419dca9aef188a5063bd23c5cd274afd6fb333077b3d1c367e611cab32c6b11b","source":{"kind":"arxiv","id":"1706.02093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02093","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02093v1","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02093","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"pith_short_12","alias_value":"IGO4VGXPDCFF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IGO4VGXPDCFFAY55","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IGO4VGXP","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IGO4VGXPDCFFAY55EPC42J2K7V","target":"record","payload":{"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"},"canonical_sha256":"419dca9aef188a5063bd23c5cd274afd6fb333077b3d1c367e611cab32c6b11b","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"},"source_kind":"arxiv","source_id":"1706.02093","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smD73By1wksTgmJvoe+avArF8TsE8PzO/RBEb0S/H12BG39chISK+4lAZAmX3ZEAnHYvl9NMkc1qiRKBiUvIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:04:04.691229Z"},"content_sha256":"07e784a2ae604e1b75dfa8bef2fdb93c6b01c1008bd9e0c70f0cbe8e543f540e","schema_version":"1.0","event_id":"sha256:07e784a2ae604e1b75dfa8bef2fdb93c6b01c1008bd9e0c70f0cbe8e543f540e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IGO4VGXPDCFFAY55EPC42J2K7V","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heA03WjEPBOpdJEPV/5RgJ7/fUJCWZnZdgB06qHj79uxM4QKk3xlope6Qn8Qi7TxfqEb3BJl0Jo6LVK4y61PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:04:04.691770Z"},"content_sha256":"5c4f33b752d4a47a48ba18d581cd86366e1533b1fb2bbeb588099ec1fd776839","schema_version":"1.0","event_id":"sha256:5c4f33b752d4a47a48ba18d581cd86366e1533b1fb2bbeb588099ec1fd776839"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V/bundle.json","state_url":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGO4VGXPDCFFAY55EPC42J2K7V/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T15:04:04Z","links":{"resolver":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V","bundle":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V/bundle.json","state":"https://pith.science/pith/IGO4VGXPDCFFAY55EPC42J2K7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGO4VGXPDCFFAY55EPC42J2K7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IGO4VGXPDCFFAY55EPC42J2K7V","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c643003b54b14e58caef1eb652089f1ed47b564f41f121901b38c1f85f1a79fa","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-07T09:03:13Z","title_canon_sha256":"7136a0a162a207009b206eeafb5e446d1f1a90cf80cd23ca387e453545797dd7"},"schema_version":"1.0","source":{"id":"1706.02093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02093","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02093v1","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02093","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"pith_short_12","alias_value":"IGO4VGXPDCFF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IGO4VGXPDCFFAY55","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IGO4VGXP","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:5c4f33b752d4a47a48ba18d581cd86366e1533b1fb2bbeb588099ec1fd776839","target":"graph","created_at":"2026-05-18T00:42:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Fei Xiao, Luo Si, Shichen Liu, Wenwu Ou","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-07T09:03:13Z","title":"Cascade Ranking for Operational E-commerce Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02093","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:07e784a2ae604e1b75dfa8bef2fdb93c6b01c1008bd9e0c70f0cbe8e543f540e","target":"record","created_at":"2026-05-18T00:42:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c643003b54b14e58caef1eb652089f1ed47b564f41f121901b38c1f85f1a79fa","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-07T09:03:13Z","title_canon_sha256":"7136a0a162a207009b206eeafb5e446d1f1a90cf80cd23ca387e453545797dd7"},"schema_version":"1.0","source":{"id":"1706.02093","kind":"arxiv","version":1}},"canonical_sha256":"419dca9aef188a5063bd23c5cd274afd6fb333077b3d1c367e611cab32c6b11b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"419dca9aef188a5063bd23c5cd274afd6fb333077b3d1c367e611cab32c6b11b","first_computed_at":"2026-05-18T00:42:50.096055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:50.096055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ksUnH9aA/opw78lv5y1u8Xjkww/oB77PFmh8z6L6NvJsyn3StrMuj0re9foJUrdsaoiupbv+vltcU/95PVqnAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:50.096746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07e784a2ae604e1b75dfa8bef2fdb93c6b01c1008bd9e0c70f0cbe8e543f540e","sha256:5c4f33b752d4a47a48ba18d581cd86366e1533b1fb2bbeb588099ec1fd776839"],"state_sha256":"6541deb74d5507083d39cc15e2f26de0116600c5b096f91c80240441129e9355"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9IxQUdbDci3wEIeYfIYQtpBR7O68KVz20mCvQdAbPkcR7jJCSi+3okrDbyJCVpckUadxWZRQ5ZWSoyAwRYoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:04:04.695113Z","bundle_sha256":"13e6516ee9c3e74ec604b0e40c4bc31431cd11fb6526b07496336d2f69bcd99a"}}