{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:IHR4ZU7EOBFQSZTM7A7DVAYA32","short_pith_number":"pith:IHR4ZU7E","canonical_record":{"source":{"id":"2405.07782","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-05-13T14:26:29Z","cross_cats_sorted":[],"title_canon_sha256":"1c4f9e1174c2b639c04af0445d94ec34fdfccfbe6e4502f0936debbeeb177fba","abstract_canon_sha256":"e235771b2cb7943d18d424394dd2ea7b952e6e18046afdc701bc49a0f59ee0e8"},"schema_version":"1.0"},"canonical_sha256":"41e3ccd3e4704b09666cf83e3a8300de9459a716f6f592349c819846d8f03499","source":{"kind":"arxiv","id":"2405.07782","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.07782","created_at":"2026-07-05T08:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"2405.07782v1","created_at":"2026-07-05T08:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07782","created_at":"2026-07-05T08:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"IHR4ZU7EOBFQ","created_at":"2026-07-05T08:18:34Z"},{"alias_kind":"pith_short_16","alias_value":"IHR4ZU7EOBFQSZTM","created_at":"2026-07-05T08:18:34Z"},{"alias_kind":"pith_short_8","alias_value":"IHR4ZU7E","created_at":"2026-07-05T08:18:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:IHR4ZU7EOBFQSZTM7A7DVAYA32","target":"record","payload":{"canonical_record":{"source":{"id":"2405.07782","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-05-13T14:26:29Z","cross_cats_sorted":[],"title_canon_sha256":"1c4f9e1174c2b639c04af0445d94ec34fdfccfbe6e4502f0936debbeeb177fba","abstract_canon_sha256":"e235771b2cb7943d18d424394dd2ea7b952e6e18046afdc701bc49a0f59ee0e8"},"schema_version":"1.0"},"canonical_sha256":"41e3ccd3e4704b09666cf83e3a8300de9459a716f6f592349c819846d8f03499","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:34.560859Z","signature_b64":"5iBo7AkAY6rl78Tf8GbUBcPmfuFE4nqX3HRxKSrkv3CLwKOploEagmMjOCL3ifKK+mLxkcPi4NfufdNZfPThBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41e3ccd3e4704b09666cf83e3a8300de9459a716f6f592349c819846d8f03499","last_reissued_at":"2026-07-05T08:18:34.560395Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:34.560395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.07782","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Ud44TbX9vkrw78a8+nLVa42/+AmYpWIpRkdlhN45YJeZ0FrpaeXN74/YdCWkT2YTfttfhsvtR2GrZfz+eXIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:43:08.882178Z"},"content_sha256":"ae417d3c9252d5593a4e62bd1f7c6e6ead2d4c8326ff4a3a53cbf08f64ff629f","schema_version":"1.0","event_id":"sha256:ae417d3c9252d5593a4e62bd1f7c6e6ead2d4c8326ff4a3a53cbf08f64ff629f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:IHR4ZU7EOBFQSZTM7A7DVAYA32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Is Interpretable Machine Learning Effective at Feature Selection for Neural Learning-to-Rank?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Avishek Anand, Harrie Oosterhuis, Lijun Lyu, Nirmal Roy","submitted_at":"2024-05-13T14:26:29Z","abstract_excerpt":"Neural ranking models have become increasingly popular for real-world search and recommendation systems in recent years. Unlike their tree-based counterparts, neural models are much less interpretable. That is, it is very difficult to understand their inner workings and answer questions like how do they make their ranking decisions? or what document features do they find important? This is particularly disadvantageous since interpretability is highly important for real-world systems. In this work, we explore feature selection for neural learning-to-rank (LTR). In particular, we investigate six"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07782","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/2405.07782/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j4srLxL0Ae9JPVrjmYxxGEN0RGbj/yIJvc+m+mKGzuAgXX8nOGvkRY1nqBA6jdW44uLstWejzpKl70PSs7o+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:43:08.882706Z"},"content_sha256":"f876476ba70ad4d4b9bd99af9f9b74968958bd53a32eff2d4230ce2a364ecd9e","schema_version":"1.0","event_id":"sha256:f876476ba70ad4d4b9bd99af9f9b74968958bd53a32eff2d4230ce2a364ecd9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHR4ZU7EOBFQSZTM7A7DVAYA32/bundle.json","state_url":"https://pith.science/pith/IHR4ZU7EOBFQSZTM7A7DVAYA32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHR4ZU7EOBFQSZTM7A7DVAYA32/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T21:43:08Z","links":{"resolver":"https://pith.science/pith/IHR4ZU7EOBFQSZTM7A7DVAYA32","bundle":"https://pith.science/pith/IHR4ZU7EOBFQSZTM7A7DVAYA32/bundle.json","state":"https://pith.science/pith/IHR4ZU7EOBFQSZTM7A7DVAYA32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHR4ZU7EOBFQSZTM7A7DVAYA32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IHR4ZU7EOBFQSZTM7A7DVAYA32","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e235771b2cb7943d18d424394dd2ea7b952e6e18046afdc701bc49a0f59ee0e8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-05-13T14:26:29Z","title_canon_sha256":"1c4f9e1174c2b639c04af0445d94ec34fdfccfbe6e4502f0936debbeeb177fba"},"schema_version":"1.0","source":{"id":"2405.07782","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.07782","created_at":"2026-07-05T08:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"2405.07782v1","created_at":"2026-07-05T08:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07782","created_at":"2026-07-05T08:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"IHR4ZU7EOBFQ","created_at":"2026-07-05T08:18:34Z"},{"alias_kind":"pith_short_16","alias_value":"IHR4ZU7EOBFQSZTM","created_at":"2026-07-05T08:18:34Z"},{"alias_kind":"pith_short_8","alias_value":"IHR4ZU7E","created_at":"2026-07-05T08:18:34Z"}],"graph_snapshots":[{"event_id":"sha256:f876476ba70ad4d4b9bd99af9f9b74968958bd53a32eff2d4230ce2a364ecd9e","target":"graph","created_at":"2026-07-05T08:18:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.07782/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural ranking models have become increasingly popular for real-world search and recommendation systems in recent years. Unlike their tree-based counterparts, neural models are much less interpretable. That is, it is very difficult to understand their inner workings and answer questions like how do they make their ranking decisions? or what document features do they find important? This is particularly disadvantageous since interpretability is highly important for real-world systems. In this work, we explore feature selection for neural learning-to-rank (LTR). In particular, we investigate six","authors_text":"Avishek Anand, Harrie Oosterhuis, Lijun Lyu, Nirmal Roy","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-05-13T14:26:29Z","title":"Is Interpretable Machine Learning Effective at Feature Selection for Neural Learning-to-Rank?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07782","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ae417d3c9252d5593a4e62bd1f7c6e6ead2d4c8326ff4a3a53cbf08f64ff629f","target":"record","created_at":"2026-07-05T08:18:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e235771b2cb7943d18d424394dd2ea7b952e6e18046afdc701bc49a0f59ee0e8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-05-13T14:26:29Z","title_canon_sha256":"1c4f9e1174c2b639c04af0445d94ec34fdfccfbe6e4502f0936debbeeb177fba"},"schema_version":"1.0","source":{"id":"2405.07782","kind":"arxiv","version":1}},"canonical_sha256":"41e3ccd3e4704b09666cf83e3a8300de9459a716f6f592349c819846d8f03499","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41e3ccd3e4704b09666cf83e3a8300de9459a716f6f592349c819846d8f03499","first_computed_at":"2026-07-05T08:18:34.560395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:18:34.560395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5iBo7AkAY6rl78Tf8GbUBcPmfuFE4nqX3HRxKSrkv3CLwKOploEagmMjOCL3ifKK+mLxkcPi4NfufdNZfPThBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:18:34.560859Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.07782","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae417d3c9252d5593a4e62bd1f7c6e6ead2d4c8326ff4a3a53cbf08f64ff629f","sha256:f876476ba70ad4d4b9bd99af9f9b74968958bd53a32eff2d4230ce2a364ecd9e"],"state_sha256":"ecd6209ff1040fbab54e6e0057ee6683ffd4812fe7a2965aca619d7bab5fece8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pVeEfMjvKwqPXJdYhK2tfZveHWte/k33tKNTVyyPA57onjQPkehFCNMeOyQ4QfBQxuzL+YZv761y8gVZ0iptBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T21:43:08.889354Z","bundle_sha256":"86d5b434ddc6bfe6da51ecadb907052ab38dbcd10196a9c039f1de589d4b4a2b"}}