{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DTR4BBKSRW7TOYELPPGCRGESNL","short_pith_number":"pith:DTR4BBKS","canonical_record":{"source":{"id":"2506.09451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-11T06:56:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b477804dc46c731ec6a4ce0da2ca4eb5842f9526d205f9c1ed5fd008f9e7d772","abstract_canon_sha256":"86586f8851253c826e97f0e03cbdf9eb9afc49917c448447137d204078120a6f"},"schema_version":"1.0"},"canonical_sha256":"1ce3c085528dbf37608b7bcc2898926ad8eb28f7acc31c7cf6490f03269f54ff","source":{"kind":"arxiv","id":"2506.09451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.09451","created_at":"2026-07-05T11:19:37Z"},{"alias_kind":"arxiv_version","alias_value":"2506.09451v1","created_at":"2026-07-05T11:19:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09451","created_at":"2026-07-05T11:19:37Z"},{"alias_kind":"pith_short_12","alias_value":"DTR4BBKSRW7T","created_at":"2026-07-05T11:19:37Z"},{"alias_kind":"pith_short_16","alias_value":"DTR4BBKSRW7TOYEL","created_at":"2026-07-05T11:19:37Z"},{"alias_kind":"pith_short_8","alias_value":"DTR4BBKS","created_at":"2026-07-05T11:19:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DTR4BBKSRW7TOYELPPGCRGESNL","target":"record","payload":{"canonical_record":{"source":{"id":"2506.09451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-11T06:56:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b477804dc46c731ec6a4ce0da2ca4eb5842f9526d205f9c1ed5fd008f9e7d772","abstract_canon_sha256":"86586f8851253c826e97f0e03cbdf9eb9afc49917c448447137d204078120a6f"},"schema_version":"1.0"},"canonical_sha256":"1ce3c085528dbf37608b7bcc2898926ad8eb28f7acc31c7cf6490f03269f54ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:37.680156Z","signature_b64":"ZlDUyW3PQjic8ZzkiY0fhGhrmzPzPXtke5GbNajqj/bVeZ2ZESg7lM4GmEmmBbpp2YACvTgQzzwiEC3IHc/oBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ce3c085528dbf37608b7bcc2898926ad8eb28f7acc31c7cf6490f03269f54ff","last_reissued_at":"2026-07-05T11:19:37.679697Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:37.679697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.09451","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-05T11:19:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhkY9alewGrQMntnuDAsYlry5TI0XOrTCrqM57Eq1oyalWWkICpamqNscDRa4jwT/RkHxLq+IK1xym/tBplxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:14:31.462696Z"},"content_sha256":"fc8f31f366b562a719c6b4438208ab8223f54ceb7ac857aa7a9b9540b039a43c","schema_version":"1.0","event_id":"sha256:fc8f31f366b562a719c6b4438208ab8223f54ceb7ac857aa7a9b9540b039a43c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DTR4BBKSRW7TOYELPPGCRGESNL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe Screening Rules for Group SLOPE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Quanchao Lu, Runxue Bao, Yanfu Zhang","submitted_at":"2025-06-11T06:56:08Z","abstract_excerpt":"Variable selection is a challenging problem in high-dimensional sparse learning, especially when group structures exist. Group SLOPE performs well for the adaptive selection of groups of predictors. However, the block non-separable group effects in Group SLOPE make existing methods either invalid or inefficient. Consequently, Group SLOPE tends to incur significant computational costs and memory usage in practical high-dimensional scenarios. To overcome this issue, we introduce a safe screening rule tailored for the Group SLOPE model, which efficiently identifies inactive groups with zero coeff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09451","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/2506.09451/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-05T11:19:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FGtAA8YLzcFZJa4HcG00X5Tf4gn4OjF1zETgxH9bnciFFJETmpptat1SHDUEb7AlGk21tQNTtFvSDkPDoHVKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:14:31.463199Z"},"content_sha256":"e48d65d790a88d2e1a1a9a33f340d163f5132d356c081ad10625c3a9c05b49e8","schema_version":"1.0","event_id":"sha256:e48d65d790a88d2e1a1a9a33f340d163f5132d356c081ad10625c3a9c05b49e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTR4BBKSRW7TOYELPPGCRGESNL/bundle.json","state_url":"https://pith.science/pith/DTR4BBKSRW7TOYELPPGCRGESNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTR4BBKSRW7TOYELPPGCRGESNL/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-11T21:14:31Z","links":{"resolver":"https://pith.science/pith/DTR4BBKSRW7TOYELPPGCRGESNL","bundle":"https://pith.science/pith/DTR4BBKSRW7TOYELPPGCRGESNL/bundle.json","state":"https://pith.science/pith/DTR4BBKSRW7TOYELPPGCRGESNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTR4BBKSRW7TOYELPPGCRGESNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DTR4BBKSRW7TOYELPPGCRGESNL","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":"86586f8851253c826e97f0e03cbdf9eb9afc49917c448447137d204078120a6f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-11T06:56:08Z","title_canon_sha256":"b477804dc46c731ec6a4ce0da2ca4eb5842f9526d205f9c1ed5fd008f9e7d772"},"schema_version":"1.0","source":{"id":"2506.09451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.09451","created_at":"2026-07-05T11:19:37Z"},{"alias_kind":"arxiv_version","alias_value":"2506.09451v1","created_at":"2026-07-05T11:19:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09451","created_at":"2026-07-05T11:19:37Z"},{"alias_kind":"pith_short_12","alias_value":"DTR4BBKSRW7T","created_at":"2026-07-05T11:19:37Z"},{"alias_kind":"pith_short_16","alias_value":"DTR4BBKSRW7TOYEL","created_at":"2026-07-05T11:19:37Z"},{"alias_kind":"pith_short_8","alias_value":"DTR4BBKS","created_at":"2026-07-05T11:19:37Z"}],"graph_snapshots":[{"event_id":"sha256:e48d65d790a88d2e1a1a9a33f340d163f5132d356c081ad10625c3a9c05b49e8","target":"graph","created_at":"2026-07-05T11:19:37Z","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/2506.09451/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Variable selection is a challenging problem in high-dimensional sparse learning, especially when group structures exist. Group SLOPE performs well for the adaptive selection of groups of predictors. However, the block non-separable group effects in Group SLOPE make existing methods either invalid or inefficient. Consequently, Group SLOPE tends to incur significant computational costs and memory usage in practical high-dimensional scenarios. To overcome this issue, we introduce a safe screening rule tailored for the Group SLOPE model, which efficiently identifies inactive groups with zero coeff","authors_text":"Quanchao Lu, Runxue Bao, Yanfu Zhang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-11T06:56:08Z","title":"Safe Screening Rules for Group SLOPE"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09451","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:fc8f31f366b562a719c6b4438208ab8223f54ceb7ac857aa7a9b9540b039a43c","target":"record","created_at":"2026-07-05T11:19:37Z","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":"86586f8851253c826e97f0e03cbdf9eb9afc49917c448447137d204078120a6f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-11T06:56:08Z","title_canon_sha256":"b477804dc46c731ec6a4ce0da2ca4eb5842f9526d205f9c1ed5fd008f9e7d772"},"schema_version":"1.0","source":{"id":"2506.09451","kind":"arxiv","version":1}},"canonical_sha256":"1ce3c085528dbf37608b7bcc2898926ad8eb28f7acc31c7cf6490f03269f54ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ce3c085528dbf37608b7bcc2898926ad8eb28f7acc31c7cf6490f03269f54ff","first_computed_at":"2026-07-05T11:19:37.679697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:37.679697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZlDUyW3PQjic8ZzkiY0fhGhrmzPzPXtke5GbNajqj/bVeZ2ZESg7lM4GmEmmBbpp2YACvTgQzzwiEC3IHc/oBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:37.680156Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.09451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc8f31f366b562a719c6b4438208ab8223f54ceb7ac857aa7a9b9540b039a43c","sha256:e48d65d790a88d2e1a1a9a33f340d163f5132d356c081ad10625c3a9c05b49e8"],"state_sha256":"c109ea2eaf4c4bb7bd88628e89a6f0293254e944d2715752fdfcb159ffabbfbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TClt38cyWJCttuvjdKXP0SBbysN32K0iy/svaMj1GSnupoB7UV8ASJNfFMEwgLVN2L050FC+Yf2ZqrSXd+VeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T21:14:31.467002Z","bundle_sha256":"8fa27a29a141bfe7cbbddaf8eb0cbf2e3dd3689b598714eb25c69c8dd9198704"}}