{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KLABTKCCEI76T47HRVMB3Q4AGF","short_pith_number":"pith:KLABTKCC","schema_version":"1.0","canonical_sha256":"52c019a842223fe9f3e78d581dc380317f159dda7d80fd357eafb674ecad7111","source":{"kind":"arxiv","id":"2004.13972","version":3},"attestation_state":"computed","paper":{"title":"Valid Explanations for Learning to Rank Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Avishek Anand, Jaspreet Singh, Megha Khosla, Zhenye Wang","submitted_at":"2020-04-29T06:21:56Z","abstract_excerpt":"Learning-to-rank (LTR) is a class of supervised learning techniques that apply to ranking problems dealing with a large number of features.\n  The popularity and widespread application of LTR models in prioritizing information in a variety of domains makes their scrutability vital in today's landscape of fair and transparent learning systems. However, limited work exists that deals with interpreting the decisions of learning systems that output rankings. In this paper we propose a model agnostic local explanation method that seeks to identify a small subset of input features as explanation to a"},"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":"2004.13972","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-29T06:21:56Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"fd2a209b58ec33744c7360293707a8ba149e0f20e8f512b447320f8cc1a749c5","abstract_canon_sha256":"46d6ea9fd7f6441743150a7d18332332f28db1d4088d659ca2149188e9189d21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:25.121664Z","signature_b64":"/0MRi1eTn9qmO5YW2yL4umWEUrFn6pTVvW8MYxZWCdYkwKRPpjg91krTVoRN5lwc2VRH7PBjxe8RcLSgPBWNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52c019a842223fe9f3e78d581dc380317f159dda7d80fd357eafb674ecad7111","last_reissued_at":"2026-07-05T01:03:25.121186Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:25.121186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Valid Explanations for Learning to Rank Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Avishek Anand, Jaspreet Singh, Megha Khosla, Zhenye Wang","submitted_at":"2020-04-29T06:21:56Z","abstract_excerpt":"Learning-to-rank (LTR) is a class of supervised learning techniques that apply to ranking problems dealing with a large number of features.\n  The popularity and widespread application of LTR models in prioritizing information in a variety of domains makes their scrutability vital in today's landscape of fair and transparent learning systems. However, limited work exists that deals with interpreting the decisions of learning systems that output rankings. In this paper we propose a model agnostic local explanation method that seeks to identify a small subset of input features as explanation to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.13972","kind":"arxiv","version":3},"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/2004.13972/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":"2004.13972","created_at":"2026-07-05T01:03:25.121243+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.13972v3","created_at":"2026-07-05T01:03:25.121243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.13972","created_at":"2026-07-05T01:03:25.121243+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLABTKCCEI76","created_at":"2026-07-05T01:03:25.121243+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLABTKCCEI76T47H","created_at":"2026-07-05T01:03:25.121243+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLABTKCC","created_at":"2026-07-05T01:03:25.121243+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09779","citing_title":"Convolution based hybrid image processing technique for microscopic images of etch-pits in Nuclear Track Detectors","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KLABTKCCEI76T47HRVMB3Q4AGF","json":"https://pith.science/pith/KLABTKCCEI76T47HRVMB3Q4AGF.json","graph_json":"https://pith.science/api/pith-number/KLABTKCCEI76T47HRVMB3Q4AGF/graph.json","events_json":"https://pith.science/api/pith-number/KLABTKCCEI76T47HRVMB3Q4AGF/events.json","paper":"https://pith.science/paper/KLABTKCC"},"agent_actions":{"view_html":"https://pith.science/pith/KLABTKCCEI76T47HRVMB3Q4AGF","download_json":"https://pith.science/pith/KLABTKCCEI76T47HRVMB3Q4AGF.json","view_paper":"https://pith.science/paper/KLABTKCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.13972&json=true","fetch_graph":"https://pith.science/api/pith-number/KLABTKCCEI76T47HRVMB3Q4AGF/graph.json","fetch_events":"https://pith.science/api/pith-number/KLABTKCCEI76T47HRVMB3Q4AGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLABTKCCEI76T47HRVMB3Q4AGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLABTKCCEI76T47HRVMB3Q4AGF/action/storage_attestation","attest_author":"https://pith.science/pith/KLABTKCCEI76T47HRVMB3Q4AGF/action/author_attestation","sign_citation":"https://pith.science/pith/KLABTKCCEI76T47HRVMB3Q4AGF/action/citation_signature","submit_replication":"https://pith.science/pith/KLABTKCCEI76T47HRVMB3Q4AGF/action/replication_record"}},"created_at":"2026-07-05T01:03:25.121243+00:00","updated_at":"2026-07-05T01:03:25.121243+00:00"}