{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CBHMO33QYU5QD4PIN3TXD5RO4K","short_pith_number":"pith:CBHMO33Q","schema_version":"1.0","canonical_sha256":"104ec76f70c53b01f1e86ee771f62ee2a0b81c25ab5302ed675a494ed961c4ce","source":{"kind":"arxiv","id":"2606.01111","version":1},"attestation_state":"computed","paper":{"title":"LeAP: Learnable Adaptive Permutation for Feature Selection in Heterogeneous and Sparse Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chen Chu, Fei Chen, Ruiduan Li, Yihong Huang, Yu Lin, Zhihao Li","submitted_at":"2026-05-31T09:12:55Z","abstract_excerpt":"Modern industrial recommender systems rely on thousands of heterogeneous features -- ranging from low-dimensional scalars (e.g., statistical value) to high-dimensional embeddings (e.g., user-id embeddings, MLP representations) -- to achieve high-precision predictions. Given the immense computational costs associated with training, efficient feature selection is critical. However, existing methods encounter three primary bottlenecks: (1) they typically assume uniform feature dimensions or require costly mapping to a fixed size; (2) they struggle with extreme sparsity, where the majority of feat"},"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":"2606.01111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-31T09:12:55Z","cross_cats_sorted":[],"title_canon_sha256":"4a33e3721dd9dc51a51bf41c0916979286c5441d94fcfec95f394b0d4b878dc9","abstract_canon_sha256":"8652e1fb42ff04aefc2b47bfd521826788b0e4b598fc5eba71412cf0aaa82a2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:23.780829Z","signature_b64":"cfnfnzfPc1+M7kObQlttiw1Bz6695QQT3R+Vc1wWu/5s7q0j/K/j75yXYQ6OTo2nUabgcqC7n/DHQ3ukK6j3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"104ec76f70c53b01f1e86ee771f62ee2a0b81c25ab5302ed675a494ed961c4ce","last_reissued_at":"2026-06-02T02:04:23.780299Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:23.780299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LeAP: Learnable Adaptive Permutation for Feature Selection in Heterogeneous and Sparse Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chen Chu, Fei Chen, Ruiduan Li, Yihong Huang, Yu Lin, Zhihao Li","submitted_at":"2026-05-31T09:12:55Z","abstract_excerpt":"Modern industrial recommender systems rely on thousands of heterogeneous features -- ranging from low-dimensional scalars (e.g., statistical value) to high-dimensional embeddings (e.g., user-id embeddings, MLP representations) -- to achieve high-precision predictions. Given the immense computational costs associated with training, efficient feature selection is critical. However, existing methods encounter three primary bottlenecks: (1) they typically assume uniform feature dimensions or require costly mapping to a fixed size; (2) they struggle with extreme sparsity, where the majority of feat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01111","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/2606.01111/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":"2606.01111","created_at":"2026-06-02T02:04:23.780381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01111v1","created_at":"2026-06-02T02:04:23.780381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01111","created_at":"2026-06-02T02:04:23.780381+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBHMO33QYU5Q","created_at":"2026-06-02T02:04:23.780381+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBHMO33QYU5QD4PI","created_at":"2026-06-02T02:04:23.780381+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBHMO33Q","created_at":"2026-06-02T02:04:23.780381+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/CBHMO33QYU5QD4PIN3TXD5RO4K","json":"https://pith.science/pith/CBHMO33QYU5QD4PIN3TXD5RO4K.json","graph_json":"https://pith.science/api/pith-number/CBHMO33QYU5QD4PIN3TXD5RO4K/graph.json","events_json":"https://pith.science/api/pith-number/CBHMO33QYU5QD4PIN3TXD5RO4K/events.json","paper":"https://pith.science/paper/CBHMO33Q"},"agent_actions":{"view_html":"https://pith.science/pith/CBHMO33QYU5QD4PIN3TXD5RO4K","download_json":"https://pith.science/pith/CBHMO33QYU5QD4PIN3TXD5RO4K.json","view_paper":"https://pith.science/paper/CBHMO33Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01111&json=true","fetch_graph":"https://pith.science/api/pith-number/CBHMO33QYU5QD4PIN3TXD5RO4K/graph.json","fetch_events":"https://pith.science/api/pith-number/CBHMO33QYU5QD4PIN3TXD5RO4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBHMO33QYU5QD4PIN3TXD5RO4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBHMO33QYU5QD4PIN3TXD5RO4K/action/storage_attestation","attest_author":"https://pith.science/pith/CBHMO33QYU5QD4PIN3TXD5RO4K/action/author_attestation","sign_citation":"https://pith.science/pith/CBHMO33QYU5QD4PIN3TXD5RO4K/action/citation_signature","submit_replication":"https://pith.science/pith/CBHMO33QYU5QD4PIN3TXD5RO4K/action/replication_record"}},"created_at":"2026-06-02T02:04:23.780381+00:00","updated_at":"2026-06-02T02:04:23.780381+00:00"}