{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:52HUWFWW6235FVZTODJKCBGIF5","short_pith_number":"pith:52HUWFWW","canonical_record":{"source":{"id":"1708.07336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-24T09:43:17Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"d59bae5dbd16a20c8bee55a4886f030b985ad3942d36875e2ff6da2a6ea13f42","abstract_canon_sha256":"580bda75ff7cdf61cc5f4fb7414f8e105ba4336ec32764380686a50607740afd"},"schema_version":"1.0"},"canonical_sha256":"ee8f4b16d6f6b7d2d73370d2a104c82f7910c090ac51429174e5bdb4c65e22db","source":{"kind":"arxiv","id":"1708.07336","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07336","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07336v1","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07336","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"52HUWFWW6235","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"52HUWFWW6235FVZT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"52HUWFWW","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:52HUWFWW6235FVZTODJKCBGIF5","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-24T09:43:17Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"d59bae5dbd16a20c8bee55a4886f030b985ad3942d36875e2ff6da2a6ea13f42","abstract_canon_sha256":"580bda75ff7cdf61cc5f4fb7414f8e105ba4336ec32764380686a50607740afd"},"schema_version":"1.0"},"canonical_sha256":"ee8f4b16d6f6b7d2d73370d2a104c82f7910c090ac51429174e5bdb4c65e22db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:46.520753Z","signature_b64":"0tqCUOWH5WBQpSZLdrINBoYhs1AGZ0R8QMYOMtMESAa36E+zrgoLOAnVSj4mMOpwE9T9w2hhU4v1SmdZkpdJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee8f4b16d6f6b7d2d73370d2a104c82f7910c090ac51429174e5bdb4c65e22db","last_reissued_at":"2026-05-18T00:36:46.520094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:46.520094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07336","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:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWJFHNBCOhhEKmcCs42f0x3rmSl23dJX4NGa2t+bp3lOw0khSygkNwZSygbWgPjY63T0HMGvJUuRrouy4zW+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:43:29.412480Z"},"content_sha256":"a0b540f7fc62f502cc8a186e6a00890626c79f6a16fd49dbbf92cc80a2abdfea","schema_version":"1.0","event_id":"sha256:a0b540f7fc62f502cc8a186e6a00890626c79f6a16fd49dbbf92cc80a2abdfea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:52HUWFWW6235FVZTODJKCBGIF5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Active Sampling of Pairs and Points for Large-scale Linear Bipartite Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Hsuan-Tien Lin, Wei-Yuan Shen","submitted_at":"2017-08-24T09:43:17Z","abstract_excerpt":"Bipartite ranking is a fundamental ranking problem that learns to order relevant instances ahead of irrelevant ones. The pair-wise approach for bi-partite ranking construct a quadratic number of pairs to solve the problem, which is infeasible for large-scale data sets. The point-wise approach, albeit more efficient, often results in inferior performance. That is, it is difficult to conduct bipartite ranking accurately and efficiently at the same time. In this paper, we develop a novel active sampling scheme within the pair-wise approach to conduct bipartite ranking efficiently. The scheme is i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07336","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:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"umY5UHwkQKQQlou4hpCmDWa2gGtKl8iCA6MR9O0o1q2R96YfWmcDED00a7xzldQl1DSowNcLNlddYem5nGKKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:43:29.413185Z"},"content_sha256":"77875c50ca3bb8063350338263ebee896691e4527ea5325e4185445a9c3d2eee","schema_version":"1.0","event_id":"sha256:77875c50ca3bb8063350338263ebee896691e4527ea5325e4185445a9c3d2eee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52HUWFWW6235FVZTODJKCBGIF5/bundle.json","state_url":"https://pith.science/pith/52HUWFWW6235FVZTODJKCBGIF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52HUWFWW6235FVZTODJKCBGIF5/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-05-25T18:43:29Z","links":{"resolver":"https://pith.science/pith/52HUWFWW6235FVZTODJKCBGIF5","bundle":"https://pith.science/pith/52HUWFWW6235FVZTODJKCBGIF5/bundle.json","state":"https://pith.science/pith/52HUWFWW6235FVZTODJKCBGIF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52HUWFWW6235FVZTODJKCBGIF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:52HUWFWW6235FVZTODJKCBGIF5","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":"580bda75ff7cdf61cc5f4fb7414f8e105ba4336ec32764380686a50607740afd","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-24T09:43:17Z","title_canon_sha256":"d59bae5dbd16a20c8bee55a4886f030b985ad3942d36875e2ff6da2a6ea13f42"},"schema_version":"1.0","source":{"id":"1708.07336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07336","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07336v1","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07336","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"52HUWFWW6235","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"52HUWFWW6235FVZT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"52HUWFWW","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:77875c50ca3bb8063350338263ebee896691e4527ea5325e4185445a9c3d2eee","target":"graph","created_at":"2026-05-18T00:36:46Z","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":"Bipartite ranking is a fundamental ranking problem that learns to order relevant instances ahead of irrelevant ones. The pair-wise approach for bi-partite ranking construct a quadratic number of pairs to solve the problem, which is infeasible for large-scale data sets. The point-wise approach, albeit more efficient, often results in inferior performance. That is, it is difficult to conduct bipartite ranking accurately and efficiently at the same time. In this paper, we develop a novel active sampling scheme within the pair-wise approach to conduct bipartite ranking efficiently. The scheme is i","authors_text":"Hsuan-Tien Lin, Wei-Yuan Shen","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-24T09:43:17Z","title":"Active Sampling of Pairs and Points for Large-scale Linear Bipartite Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07336","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:a0b540f7fc62f502cc8a186e6a00890626c79f6a16fd49dbbf92cc80a2abdfea","target":"record","created_at":"2026-05-18T00:36:46Z","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":"580bda75ff7cdf61cc5f4fb7414f8e105ba4336ec32764380686a50607740afd","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-24T09:43:17Z","title_canon_sha256":"d59bae5dbd16a20c8bee55a4886f030b985ad3942d36875e2ff6da2a6ea13f42"},"schema_version":"1.0","source":{"id":"1708.07336","kind":"arxiv","version":1}},"canonical_sha256":"ee8f4b16d6f6b7d2d73370d2a104c82f7910c090ac51429174e5bdb4c65e22db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee8f4b16d6f6b7d2d73370d2a104c82f7910c090ac51429174e5bdb4c65e22db","first_computed_at":"2026-05-18T00:36:46.520094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:46.520094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0tqCUOWH5WBQpSZLdrINBoYhs1AGZ0R8QMYOMtMESAa36E+zrgoLOAnVSj4mMOpwE9T9w2hhU4v1SmdZkpdJDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:46.520753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0b540f7fc62f502cc8a186e6a00890626c79f6a16fd49dbbf92cc80a2abdfea","sha256:77875c50ca3bb8063350338263ebee896691e4527ea5325e4185445a9c3d2eee"],"state_sha256":"42c021205efbead5546017c574a372a05f169cc96379ebd1f3c52bd1ff469185"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdkgJYEqaCd6GPu+D6LywtadgqGaSdDcHI0F0xpEm9fYMOZlJVj833BmKC3YlKKSFHux2KNFb+7O7tafjYjWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:43:29.417093Z","bundle_sha256":"370fdd256423d7779eca70ace0b19d4f8967dda2699d9c5b2ac172ff2f357807"}}