{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KUNXIVQKAG6HMSQ7XK5HJ74YAT","short_pith_number":"pith:KUNXIVQK","schema_version":"1.0","canonical_sha256":"551b74560a01bc764a1fbaba74ff9804fce947ae3b39aef6b16c5904607c372c","source":{"kind":"arxiv","id":"1511.00271","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Top-k ListNet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Dong Wang, Rong Liu, Tianyi Luo, Yiqiao Pan","submitted_at":"2015-11-01T16:34:52Z","abstract_excerpt":"ListNet is a well-known listwise learning to rank model and has gained much attention in recent years. A particular problem of ListNet, however, is the high computation complexity in model training, mainly due to the large number of object permutations involved in computing the gradients. This paper proposes a stochastic ListNet approach which computes the gradient within a bounded permutation subset. It significantly reduces the computation complexity of model training and allows extension to Top-k models, which is impossible with the conventional implementation based on full-set permutations"},"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.00271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-11-01T16:34:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"953b690037d092ccba3a8d6ada41dd93bd77e2008f889db33b120968f458ffd4","abstract_canon_sha256":"452a924ce38ee2adecd09b193746a9b8d97fbeb31df7c8f6078ca76e0752a215"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:12.786540Z","signature_b64":"vaZt9R1I0lffoWDRR5o6nZXVjTKxGc5cP0M0iN+PQ914qjVELpiAU1Blz1j1uz3X5nNUcx540YeSvMqxq9HYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"551b74560a01bc764a1fbaba74ff9804fce947ae3b39aef6b16c5904607c372c","last_reissued_at":"2026-05-18T01:28:12.785701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:12.785701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Top-k ListNet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Dong Wang, Rong Liu, Tianyi Luo, Yiqiao Pan","submitted_at":"2015-11-01T16:34:52Z","abstract_excerpt":"ListNet is a well-known listwise learning to rank model and has gained much attention in recent years. A particular problem of ListNet, however, is the high computation complexity in model training, mainly due to the large number of object permutations involved in computing the gradients. This paper proposes a stochastic ListNet approach which computes the gradient within a bounded permutation subset. It significantly reduces the computation complexity of model training and allows extension to Top-k models, which is impossible with the conventional implementation based on full-set permutations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00271","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":"1511.00271","created_at":"2026-05-18T01:28:12.785795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00271v1","created_at":"2026-05-18T01:28:12.785795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00271","created_at":"2026-05-18T01:28:12.785795+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUNXIVQKAG6H","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUNXIVQKAG6HMSQ7","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUNXIVQK","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12542","citing_title":"PLD: A Choice-Theoretic List-Wise Knowledge Distillation","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KUNXIVQKAG6HMSQ7XK5HJ74YAT","json":"https://pith.science/pith/KUNXIVQKAG6HMSQ7XK5HJ74YAT.json","graph_json":"https://pith.science/api/pith-number/KUNXIVQKAG6HMSQ7XK5HJ74YAT/graph.json","events_json":"https://pith.science/api/pith-number/KUNXIVQKAG6HMSQ7XK5HJ74YAT/events.json","paper":"https://pith.science/paper/KUNXIVQK"},"agent_actions":{"view_html":"https://pith.science/pith/KUNXIVQKAG6HMSQ7XK5HJ74YAT","download_json":"https://pith.science/pith/KUNXIVQKAG6HMSQ7XK5HJ74YAT.json","view_paper":"https://pith.science/paper/KUNXIVQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00271&json=true","fetch_graph":"https://pith.science/api/pith-number/KUNXIVQKAG6HMSQ7XK5HJ74YAT/graph.json","fetch_events":"https://pith.science/api/pith-number/KUNXIVQKAG6HMSQ7XK5HJ74YAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUNXIVQKAG6HMSQ7XK5HJ74YAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUNXIVQKAG6HMSQ7XK5HJ74YAT/action/storage_attestation","attest_author":"https://pith.science/pith/KUNXIVQKAG6HMSQ7XK5HJ74YAT/action/author_attestation","sign_citation":"https://pith.science/pith/KUNXIVQKAG6HMSQ7XK5HJ74YAT/action/citation_signature","submit_replication":"https://pith.science/pith/KUNXIVQKAG6HMSQ7XK5HJ74YAT/action/replication_record"}},"created_at":"2026-05-18T01:28:12.785795+00:00","updated_at":"2026-05-18T01:28:12.785795+00:00"}