{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:IIJRUUMV4QFEMALETE6AMAFGS2","short_pith_number":"pith:IIJRUUMV","schema_version":"1.0","canonical_sha256":"42131a5195e40a460164993c0600a696bd933d06600ca60e5f8d76957320f549","source":{"kind":"arxiv","id":"2102.11345","version":1},"attestation_state":"computed","paper":{"title":"Neural Feature Selection for Learning to Rank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Alberto Purpura, Gian Antonio Susto, Gianmaria Silvello, Karolina Buchner","submitted_at":"2021-02-22T20:38:41Z","abstract_excerpt":"LEarning TO Rank (LETOR) is a research area in the field of Information Retrieval (IR) where machine learning models are employed to rank a set of items. In the past few years, neural LETOR approaches have become a competitive alternative to traditional ones like LambdaMART. However, neural architectures performance grew proportionally to their complexity and size. This can be an obstacle for their adoption in large-scale search systems where a model size impacts latency and update time. For this reason, we propose an architecture-agnostic approach based on a neural LETOR model to reduce the s"},"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.11345","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2021-02-22T20:38:41Z","cross_cats_sorted":[],"title_canon_sha256":"0ff2d6cc8866341ba596ab640cf093140c672d0ffac4b59ddcff73efb5b780b4","abstract_canon_sha256":"80b492fe7635b2e306944e6d5a4911376d031aac7d9009404b326e9b8504c40a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:17:10.786339Z","signature_b64":"GlHnWxW18S40K2W+uUSzhyzOg6nPcBpCfolb3QNeizG0cE0Ye8TgLj2ZIlLj4RxrBrZXLf3dzKRc35ufgDR8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42131a5195e40a460164993c0600a696bd933d06600ca60e5f8d76957320f549","last_reissued_at":"2026-07-05T02:17:10.785853Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:17:10.785853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Feature Selection for Learning to Rank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Alberto Purpura, Gian Antonio Susto, Gianmaria Silvello, Karolina Buchner","submitted_at":"2021-02-22T20:38:41Z","abstract_excerpt":"LEarning TO Rank (LETOR) is a research area in the field of Information Retrieval (IR) where machine learning models are employed to rank a set of items. In the past few years, neural LETOR approaches have become a competitive alternative to traditional ones like LambdaMART. However, neural architectures performance grew proportionally to their complexity and size. This can be an obstacle for their adoption in large-scale search systems where a model size impacts latency and update time. For this reason, we propose an architecture-agnostic approach based on a neural LETOR model to reduce the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.11345","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.11345/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.11345","created_at":"2026-07-05T02:17:10.785913+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.11345v1","created_at":"2026-07-05T02:17:10.785913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.11345","created_at":"2026-07-05T02:17:10.785913+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIJRUUMV4QFE","created_at":"2026-07-05T02:17:10.785913+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIJRUUMV4QFEMALE","created_at":"2026-07-05T02:17:10.785913+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIJRUUMV","created_at":"2026-07-05T02:17:10.785913+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/IIJRUUMV4QFEMALETE6AMAFGS2","json":"https://pith.science/pith/IIJRUUMV4QFEMALETE6AMAFGS2.json","graph_json":"https://pith.science/api/pith-number/IIJRUUMV4QFEMALETE6AMAFGS2/graph.json","events_json":"https://pith.science/api/pith-number/IIJRUUMV4QFEMALETE6AMAFGS2/events.json","paper":"https://pith.science/paper/IIJRUUMV"},"agent_actions":{"view_html":"https://pith.science/pith/IIJRUUMV4QFEMALETE6AMAFGS2","download_json":"https://pith.science/pith/IIJRUUMV4QFEMALETE6AMAFGS2.json","view_paper":"https://pith.science/paper/IIJRUUMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.11345&json=true","fetch_graph":"https://pith.science/api/pith-number/IIJRUUMV4QFEMALETE6AMAFGS2/graph.json","fetch_events":"https://pith.science/api/pith-number/IIJRUUMV4QFEMALETE6AMAFGS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIJRUUMV4QFEMALETE6AMAFGS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIJRUUMV4QFEMALETE6AMAFGS2/action/storage_attestation","attest_author":"https://pith.science/pith/IIJRUUMV4QFEMALETE6AMAFGS2/action/author_attestation","sign_citation":"https://pith.science/pith/IIJRUUMV4QFEMALETE6AMAFGS2/action/citation_signature","submit_replication":"https://pith.science/pith/IIJRUUMV4QFEMALETE6AMAFGS2/action/replication_record"}},"created_at":"2026-07-05T02:17:10.785913+00:00","updated_at":"2026-07-05T02:17:10.785913+00:00"}