{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G7KKI7UPZMJOUKLFEKFX2Z3DFL","short_pith_number":"pith:G7KKI7UP","schema_version":"1.0","canonical_sha256":"37d4a47e8fcb12ea2965228b7d67632ac6e53a0264bb55ac20539a680fbc4eb6","source":{"kind":"arxiv","id":"1511.04383","version":2},"attestation_state":"computed","paper":{"title":"Handling Class Imbalance in Link Prediction using Learning to Rank Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Ambuj Tewari, Bopeng Li, Sougata Chaudhuri","submitted_at":"2015-11-13T18:06:15Z","abstract_excerpt":"We consider the link prediction problem in a partially observed network, where the objective is to make predictions in the unobserved portion of the network. Many existing methods reduce link prediction to binary classification problem. However, the dominance of absent links in real world networks makes misclassification error a poor performance metric. Instead, researchers have argued for using ranking performance measures, like AUC, AP and NDCG, for evaluation. Our main contribution is to recast the link prediction problem as a learning to rank problem and use effective learning to rank tech"},"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":"1511.04383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-13T18:06:15Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"944b0ddd49c3acbe7bdf32dd7d633ec331880d6ceec68688f14a713eaa8d7563","abstract_canon_sha256":"bcdf9dfa8016b0e672826e7e0ed825a8e4bd623de9491eed96c9f1afe52a6d0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:16.545047Z","signature_b64":"gy2+9Teso5CLmGscsjXLCG7c1/0vi+x9RnVzgFAq/nXwDIv6g+NxXQ3hzJMa8dzlBe/2NFoaS31T4/PIzmimAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37d4a47e8fcb12ea2965228b7d67632ac6e53a0264bb55ac20539a680fbc4eb6","last_reissued_at":"2026-05-18T01:20:16.544415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:16.544415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Handling Class Imbalance in Link Prediction using Learning to Rank Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Ambuj Tewari, Bopeng Li, Sougata Chaudhuri","submitted_at":"2015-11-13T18:06:15Z","abstract_excerpt":"We consider the link prediction problem in a partially observed network, where the objective is to make predictions in the unobserved portion of the network. Many existing methods reduce link prediction to binary classification problem. However, the dominance of absent links in real world networks makes misclassification error a poor performance metric. Instead, researchers have argued for using ranking performance measures, like AUC, AP and NDCG, for evaluation. Our main contribution is to recast the link prediction problem as a learning to rank problem and use effective learning to rank tech"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04383","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":""},"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":"1511.04383","created_at":"2026-05-18T01:20:16.544514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04383v2","created_at":"2026-05-18T01:20:16.544514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04383","created_at":"2026-05-18T01:20:16.544514+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7KKI7UPZMJO","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7KKI7UPZMJOUKLF","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7KKI7UP","created_at":"2026-05-18T12:29:22.688609+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/G7KKI7UPZMJOUKLFEKFX2Z3DFL","json":"https://pith.science/pith/G7KKI7UPZMJOUKLFEKFX2Z3DFL.json","graph_json":"https://pith.science/api/pith-number/G7KKI7UPZMJOUKLFEKFX2Z3DFL/graph.json","events_json":"https://pith.science/api/pith-number/G7KKI7UPZMJOUKLFEKFX2Z3DFL/events.json","paper":"https://pith.science/paper/G7KKI7UP"},"agent_actions":{"view_html":"https://pith.science/pith/G7KKI7UPZMJOUKLFEKFX2Z3DFL","download_json":"https://pith.science/pith/G7KKI7UPZMJOUKLFEKFX2Z3DFL.json","view_paper":"https://pith.science/paper/G7KKI7UP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04383&json=true","fetch_graph":"https://pith.science/api/pith-number/G7KKI7UPZMJOUKLFEKFX2Z3DFL/graph.json","fetch_events":"https://pith.science/api/pith-number/G7KKI7UPZMJOUKLFEKFX2Z3DFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7KKI7UPZMJOUKLFEKFX2Z3DFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7KKI7UPZMJOUKLFEKFX2Z3DFL/action/storage_attestation","attest_author":"https://pith.science/pith/G7KKI7UPZMJOUKLFEKFX2Z3DFL/action/author_attestation","sign_citation":"https://pith.science/pith/G7KKI7UPZMJOUKLFEKFX2Z3DFL/action/citation_signature","submit_replication":"https://pith.science/pith/G7KKI7UPZMJOUKLFEKFX2Z3DFL/action/replication_record"}},"created_at":"2026-05-18T01:20:16.544514+00:00","updated_at":"2026-05-18T01:20:16.544514+00:00"}