{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VYSY4OO7JRXIH3HT3SWUEIEYPM","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":"b0ca564f840950b6213cd75b0a56423b222544820ed8b214aa22096278684a4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-12T12:05:03Z","title_canon_sha256":"035ca5554c06f5a37db11d02e865d812b9e6963443bc39f5cbc72f27fd15681e"},"schema_version":"1.0","source":{"id":"2503.09315","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.09315","created_at":"2026-06-01T02:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"2503.09315v6","created_at":"2026-06-01T02:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.09315","created_at":"2026-06-01T02:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"VYSY4OO7JRXI","created_at":"2026-06-01T02:03:19Z"},{"alias_kind":"pith_short_16","alias_value":"VYSY4OO7JRXIH3HT","created_at":"2026-06-01T02:03:19Z"},{"alias_kind":"pith_short_8","alias_value":"VYSY4OO7","created_at":"2026-06-01T02:03:19Z"}],"graph_snapshots":[{"event_id":"sha256:8eb9876171e160ab15676e52baf320cc79e61c2d091e6de78a62d042fb767a35","target":"graph","created_at":"2026-06-01T02:03:19Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our gating module can be seamlessly applied at the feature field, dimension, or embedding-entry level, enabling a unified solution to feature selection, dimension selection, and embedding compression. Experiments on four public recommendation benchmarks show that ShuffleGate achieves state-of-the-art results on all three tasks."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That randomly shuffling a component across the batch produces an information-loss signal whose magnitude is a faithful and unbiased measure of that component's true importance to the downstream task, without the shuffling process itself introducing artifacts that the gate then learns to exploit."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ShuffleGate learns polarized importance gates by measuring model sensitivity to random component shuffling, unifying feature selection, dimension selection, and embedding compression with SOTA results on four recommendation benchmarks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"ShuffleGate estimates importance of feature components by training gates on sensitivity to their random shuffling across batches, unifying feature selection, dimension selection, and embedding compression."}],"snapshot_sha256":"2d79cc4f5e9cae95aae103ae4bb130b23accc46edb2628fca2a8a785163569b8"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.09315/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Feature optimization -- specifically Feature Selection (FS) and Dimension Selection (DS) -- is critical for the efficiency and generalization of large-scale recommender systems. While conceptually related, these tasks are typically tackled with isolated solutions that often suffer from ambiguous importance scores or prohibitive computational costs.\n  In this paper, we propose ShuffleGate, a unified and interpretable mechanism that estimates component importance by measuring the model's sensitivity to information loss. Unlike conventional gating that learns relative weights, ShuffleGate introdu","authors_text":"Chen Chu, Fan Zhang, Liping Wang Fei Chen, Ruiduan Li, Yihong Huang, Yu Lin, Zhihao Li","cross_cats":[],"headline":"ShuffleGate estimates importance of feature components by training gates on sensitivity to their random shuffling across batches, unifying feature selection, dimension selection, and embedding compression.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-12T12:05:03Z","title":"ShuffleGate: Scalable Feature Optimization for Recommender Systems via Batch-wise Sensitivity Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.09315","kind":"arxiv","version":6},"verdict":{"created_at":"2026-05-23T00:05:52.334767Z","id":"e2225a64-eeba-45bf-9e04-4e7523544613","model_set":{"reader":"grok-4.3"},"one_line_summary":"ShuffleGate learns polarized importance gates by measuring model sensitivity to random component shuffling, unifying feature selection, dimension selection, and embedding compression with SOTA results on four recommendation benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"ShuffleGate estimates importance of feature components by training gates on sensitivity to their random shuffling across batches, unifying feature selection, dimension selection, and embedding compression.","strongest_claim":"Our gating module can be seamlessly applied at the feature field, dimension, or embedding-entry level, enabling a unified solution to feature selection, dimension selection, and embedding compression. Experiments on four public recommendation benchmarks show that ShuffleGate achieves state-of-the-art results on all three tasks.","weakest_assumption":"That randomly shuffling a component across the batch produces an information-loss signal whose magnitude is a faithful and unbiased measure of that component's true importance to the downstream task, without the shuffling process itself introducing artifacts that the gate then learns to exploit."}},"verdict_id":"e2225a64-eeba-45bf-9e04-4e7523544613"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4ad75fc44a3ee78a54cf058aa9c1dda02727ee1ad2e68d643d4183c8ad335044","target":"record","created_at":"2026-06-01T02:03:19Z","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":"b0ca564f840950b6213cd75b0a56423b222544820ed8b214aa22096278684a4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-12T12:05:03Z","title_canon_sha256":"035ca5554c06f5a37db11d02e865d812b9e6963443bc39f5cbc72f27fd15681e"},"schema_version":"1.0","source":{"id":"2503.09315","kind":"arxiv","version":6}},"canonical_sha256":"ae258e39df4c6e83ecf3dcad4220987b14412ac216701443da361e69da2728e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae258e39df4c6e83ecf3dcad4220987b14412ac216701443da361e69da2728e3","first_computed_at":"2026-06-01T02:03:19.982440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T02:03:19.982440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y+81GXOC8IGa0BfwmEYlBOO4EzQueEG9euw6cr+oM9OVA97+fTlgUX9/4AEf+NAAiltD0y2l54WmXaMvEQkfBg==","signature_status":"signed_v1","signed_at":"2026-06-01T02:03:19.983610Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.09315","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ad75fc44a3ee78a54cf058aa9c1dda02727ee1ad2e68d643d4183c8ad335044","sha256:8eb9876171e160ab15676e52baf320cc79e61c2d091e6de78a62d042fb767a35"],"state_sha256":"f1fa8cd70f45ed238f068bb23d42992b110e3b3402396d96419dcb47b2fedace"}