{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4HA7MDRV2PP3PJPMQVBZCNNC6L","short_pith_number":"pith:4HA7MDRV","schema_version":"1.0","canonical_sha256":"e1c1f60e35d3dfb7a5ec85439135a2f2de5f7f5862cea9b92cd5267a7a996301","source":{"kind":"arxiv","id":"2102.07831","version":2},"attestation_state":"computed","paper":{"title":"NeuralNDCG: Direct Optimisation of a Ranking Metric via Differentiable Relaxation of Sorting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Przemys{\\l}aw Pobrotyn, Rados{\\l}aw Bia{\\l}obrzeski","submitted_at":"2021-02-15T20:11:42Z","abstract_excerpt":"Learning to Rank (LTR) algorithms are usually evaluated using Information Retrieval metrics like Normalised Discounted Cumulative Gain (NDCG) or Mean Average Precision. As these metrics rely on sorting predicted items' scores (and thus, on items' ranks), their derivatives are either undefined or zero everywhere. This makes them unsuitable for gradient-based optimisation, which is the usual method of learning appropriate scoring functions. Commonly used LTR loss functions are only loosely related to the evaluation metrics, causing a mismatch between the optimisation objective and the evaluation"},"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":"2102.07831","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2021-02-15T20:11:42Z","cross_cats_sorted":[],"title_canon_sha256":"c2551d8b463b84a6fa58729a1058b6053187cdae5704cf139a525bd82c2a6f29","abstract_canon_sha256":"90cabb8b8bc4594a069975ac3fb531934a4a9fc07a4b471d8428e08293a21ebc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:14.362775Z","signature_b64":"MDQ65XTZVzoKeGmCB74ZTIDzWNxsgYMCJ673ekAIEc57/KZZ6w7xEhoh5EnGL58wsIV3qBc6UeyCKegCwQc6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1c1f60e35d3dfb7a5ec85439135a2f2de5f7f5862cea9b92cd5267a7a996301","last_reissued_at":"2026-07-05T02:42:14.362355Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:14.362355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NeuralNDCG: Direct Optimisation of a Ranking Metric via Differentiable Relaxation of Sorting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Przemys{\\l}aw Pobrotyn, Rados{\\l}aw Bia{\\l}obrzeski","submitted_at":"2021-02-15T20:11:42Z","abstract_excerpt":"Learning to Rank (LTR) algorithms are usually evaluated using Information Retrieval metrics like Normalised Discounted Cumulative Gain (NDCG) or Mean Average Precision. As these metrics rely on sorting predicted items' scores (and thus, on items' ranks), their derivatives are either undefined or zero everywhere. This makes them unsuitable for gradient-based optimisation, which is the usual method of learning appropriate scoring functions. Commonly used LTR loss functions are only loosely related to the evaluation metrics, causing a mismatch between the optimisation objective and the evaluation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07831","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.07831/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2102.07831","created_at":"2026-07-05T02:42:14.362412+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.07831v2","created_at":"2026-07-05T02:42:14.362412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07831","created_at":"2026-07-05T02:42:14.362412+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HA7MDRV2PP3","created_at":"2026-07-05T02:42:14.362412+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HA7MDRV2PP3PJPM","created_at":"2026-07-05T02:42:14.362412+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HA7MDRV","created_at":"2026-07-05T02:42:14.362412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2305.12678","citing_title":"Gradient-Boosted Decision Tree for Listwise Context Model in Multimodal Review Helpfulness Prediction","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4HA7MDRV2PP3PJPMQVBZCNNC6L","json":"https://pith.science/pith/4HA7MDRV2PP3PJPMQVBZCNNC6L.json","graph_json":"https://pith.science/api/pith-number/4HA7MDRV2PP3PJPMQVBZCNNC6L/graph.json","events_json":"https://pith.science/api/pith-number/4HA7MDRV2PP3PJPMQVBZCNNC6L/events.json","paper":"https://pith.science/paper/4HA7MDRV"},"agent_actions":{"view_html":"https://pith.science/pith/4HA7MDRV2PP3PJPMQVBZCNNC6L","download_json":"https://pith.science/pith/4HA7MDRV2PP3PJPMQVBZCNNC6L.json","view_paper":"https://pith.science/paper/4HA7MDRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.07831&json=true","fetch_graph":"https://pith.science/api/pith-number/4HA7MDRV2PP3PJPMQVBZCNNC6L/graph.json","fetch_events":"https://pith.science/api/pith-number/4HA7MDRV2PP3PJPMQVBZCNNC6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HA7MDRV2PP3PJPMQVBZCNNC6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HA7MDRV2PP3PJPMQVBZCNNC6L/action/storage_attestation","attest_author":"https://pith.science/pith/4HA7MDRV2PP3PJPMQVBZCNNC6L/action/author_attestation","sign_citation":"https://pith.science/pith/4HA7MDRV2PP3PJPMQVBZCNNC6L/action/citation_signature","submit_replication":"https://pith.science/pith/4HA7MDRV2PP3PJPMQVBZCNNC6L/action/replication_record"}},"created_at":"2026-07-05T02:42:14.362412+00:00","updated_at":"2026-07-05T02:42:14.362412+00:00"}