{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:R7I6I23CIJM7VNA5BZGX2R6OEA","short_pith_number":"pith:R7I6I23C","schema_version":"1.0","canonical_sha256":"8fd1e46b624259fab41d0e4d7d47ce201626c25218fd48d9b56c711888ad79a5","source":{"kind":"arxiv","id":"2511.02430","version":3},"attestation_state":"computed","paper":{"title":"Efficient Solvers for SLOPE in R, Python, Julia, and C++","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.SE","stat.ML"],"primary_cat":"stat.CO","authors_text":"Johan Larsson, Jonas Wallin, Krystyna Grzesiak, Malgorzata Bogdan, Mathurin Massias","submitted_at":"2025-11-04T10:03:15Z","abstract_excerpt":"We present a suite of packages in R, Python, Julia, and C++ that efficiently solve the Sorted L-One Penalized Estimation (SLOPE) problem. The packages feature a highly efficient hybrid coordinate descent algorithm that fits generalized linear models (GLMs) and supports a variety of loss functions, including Gaussian, binomial, Poisson, and multinomial logistic regression. Our implementation is designed to be fast, memory-efficient, and flexible. The packages support a variety of data structures (dense, sparse, and out-of-memory matrices) and are designed to efficiently fit the full SLOPE path "},"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":"2511.02430","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-11-04T10:03:15Z","cross_cats_sorted":["cs.MS","cs.SE","stat.ML"],"title_canon_sha256":"fa47ff625547cc28c0ea4b9939a782a3b388bafd4c3987cd83b7ad871e3183d2","abstract_canon_sha256":"8857756c545a48a1ab9f17b80bd461fd116aa1c79cee5d6a0303a0116051387d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:15.621580Z","signature_b64":"pOhQHxDKxTiljfglkNl2vykD5nEe7YZ7+VfZmYz6R5t2PjKJRgL6RSmtkJLVRRgztbJHlAljEIvMiN3tBAjlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fd1e46b624259fab41d0e4d7d47ce201626c25218fd48d9b56c711888ad79a5","last_reissued_at":"2026-06-12T01:09:15.620651Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:15.620651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Solvers for SLOPE in R, Python, Julia, and C++","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.SE","stat.ML"],"primary_cat":"stat.CO","authors_text":"Johan Larsson, Jonas Wallin, Krystyna Grzesiak, Malgorzata Bogdan, Mathurin Massias","submitted_at":"2025-11-04T10:03:15Z","abstract_excerpt":"We present a suite of packages in R, Python, Julia, and C++ that efficiently solve the Sorted L-One Penalized Estimation (SLOPE) problem. The packages feature a highly efficient hybrid coordinate descent algorithm that fits generalized linear models (GLMs) and supports a variety of loss functions, including Gaussian, binomial, Poisson, and multinomial logistic regression. Our implementation is designed to be fast, memory-efficient, and flexible. The packages support a variety of data structures (dense, sparse, and out-of-memory matrices) and are designed to efficiently fit the full SLOPE path "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.02430","kind":"arxiv","version":3},"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/2511.02430/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":"2511.02430","created_at":"2026-06-12T01:09:15.620767+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.02430v3","created_at":"2026-06-12T01:09:15.620767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.02430","created_at":"2026-06-12T01:09:15.620767+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7I6I23CIJM7","created_at":"2026-06-12T01:09:15.620767+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7I6I23CIJM7VNA5","created_at":"2026-06-12T01:09:15.620767+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7I6I23C","created_at":"2026-06-12T01:09:15.620767+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/R7I6I23CIJM7VNA5BZGX2R6OEA","json":"https://pith.science/pith/R7I6I23CIJM7VNA5BZGX2R6OEA.json","graph_json":"https://pith.science/api/pith-number/R7I6I23CIJM7VNA5BZGX2R6OEA/graph.json","events_json":"https://pith.science/api/pith-number/R7I6I23CIJM7VNA5BZGX2R6OEA/events.json","paper":"https://pith.science/paper/R7I6I23C"},"agent_actions":{"view_html":"https://pith.science/pith/R7I6I23CIJM7VNA5BZGX2R6OEA","download_json":"https://pith.science/pith/R7I6I23CIJM7VNA5BZGX2R6OEA.json","view_paper":"https://pith.science/paper/R7I6I23C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.02430&json=true","fetch_graph":"https://pith.science/api/pith-number/R7I6I23CIJM7VNA5BZGX2R6OEA/graph.json","fetch_events":"https://pith.science/api/pith-number/R7I6I23CIJM7VNA5BZGX2R6OEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7I6I23CIJM7VNA5BZGX2R6OEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7I6I23CIJM7VNA5BZGX2R6OEA/action/storage_attestation","attest_author":"https://pith.science/pith/R7I6I23CIJM7VNA5BZGX2R6OEA/action/author_attestation","sign_citation":"https://pith.science/pith/R7I6I23CIJM7VNA5BZGX2R6OEA/action/citation_signature","submit_replication":"https://pith.science/pith/R7I6I23CIJM7VNA5BZGX2R6OEA/action/replication_record"}},"created_at":"2026-06-12T01:09:15.620767+00:00","updated_at":"2026-06-12T01:09:15.620767+00:00"}