{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ORL2KSHZ34BDGUHICDY47BX5IZ","short_pith_number":"pith:ORL2KSHZ","canonical_record":{"source":{"id":"1609.07478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T19:59:50Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"06078264855d9988ea6fb84e505d4e141dab8d911ce4a15b4195f0f441553c26","abstract_canon_sha256":"06bcabb620c638d758025d9ad8c8b91dd7b38cd74474c097333868498ba65072"},"schema_version":"1.0"},"canonical_sha256":"7457a548f9df023350e810f1cf86fd467740a3b9f4e3f8fad90bcd346c56b7f3","source":{"kind":"arxiv","id":"1609.07478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07478","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07478v1","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07478","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"ORL2KSHZ34BD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ORL2KSHZ34BDGUHI","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ORL2KSHZ","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ORL2KSHZ34BDGUHICDY47BX5IZ","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T19:59:50Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"06078264855d9988ea6fb84e505d4e141dab8d911ce4a15b4195f0f441553c26","abstract_canon_sha256":"06bcabb620c638d758025d9ad8c8b91dd7b38cd74474c097333868498ba65072"},"schema_version":"1.0"},"canonical_sha256":"7457a548f9df023350e810f1cf86fd467740a3b9f4e3f8fad90bcd346c56b7f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:00.754325Z","signature_b64":"8Gq3HA4v1v2zeOKGOO91yBviym1DLjQVl63uqOsKvv+HqAfdpwzldflgd7Ry3w9n7izUs/5RAyM1tQ9yStc9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7457a548f9df023350e810f1cf86fd467740a3b9f4e3f8fad90bcd346c56b7f3","last_reissued_at":"2026-05-18T01:04:00.753591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:00.753591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07478","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-05-18T01:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARcUOsDvkq/J55m6osUbS5x6y/3pNVJdMioASVZQ7QdpyRKDVYXuYJ9izZ9udEQni5d/LBQwoq8p+uOiZpYxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:25:30.022479Z"},"content_sha256":"c663aa740170f7f80fcbdc74b6f8594798c9bae6295b7e1ea0055d34a1768d72","schema_version":"1.0","event_id":"sha256:c663aa740170f7f80fcbdc74b6f8594798c9bae6295b7e1ea0055d34a1768d72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ORL2KSHZ34BDGUHICDY47BX5IZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Screening Rules for Convex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Anant Raj, Bernd G\\\"artner, Bernhard Sch\\\"olkopf, Jakob Olbrich, Martin Jaggi","submitted_at":"2016-09-23T19:59:50Z","abstract_excerpt":"We propose a new framework for deriving screening rules for convex optimization problems. Our approach covers a large class of constrained and penalized optimization formulations, and works in two steps. First, given any approximate point, the structure of the objective function and the duality gap is used to gather information on the optimal solution. In the second step, this information is used to produce screening rules, i.e. safely identifying unimportant weight variables of the optimal solution. Our general framework leads to a large variety of useful existing as well as new screening rul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07478","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":""},"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-05-18T01:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AWqSrUQaoG04IpDO3fPaSsd0uXuyAQ+VlwbqfU/6NU2EdQHCMDKxAJCtmVvIhjnCxgCAKGweIJGlOxa21BRLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:25:30.023129Z"},"content_sha256":"2257934cebbfad02979c47e27fe3604c76e114af699f610ab6ccf039c91801d1","schema_version":"1.0","event_id":"sha256:2257934cebbfad02979c47e27fe3604c76e114af699f610ab6ccf039c91801d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORL2KSHZ34BDGUHICDY47BX5IZ/bundle.json","state_url":"https://pith.science/pith/ORL2KSHZ34BDGUHICDY47BX5IZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORL2KSHZ34BDGUHICDY47BX5IZ/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-06-04T15:25:30Z","links":{"resolver":"https://pith.science/pith/ORL2KSHZ34BDGUHICDY47BX5IZ","bundle":"https://pith.science/pith/ORL2KSHZ34BDGUHICDY47BX5IZ/bundle.json","state":"https://pith.science/pith/ORL2KSHZ34BDGUHICDY47BX5IZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORL2KSHZ34BDGUHICDY47BX5IZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ORL2KSHZ34BDGUHICDY47BX5IZ","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":"06bcabb620c638d758025d9ad8c8b91dd7b38cd74474c097333868498ba65072","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T19:59:50Z","title_canon_sha256":"06078264855d9988ea6fb84e505d4e141dab8d911ce4a15b4195f0f441553c26"},"schema_version":"1.0","source":{"id":"1609.07478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07478","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07478v1","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07478","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"ORL2KSHZ34BD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ORL2KSHZ34BDGUHI","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ORL2KSHZ","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:2257934cebbfad02979c47e27fe3604c76e114af699f610ab6ccf039c91801d1","target":"graph","created_at":"2026-05-18T01:04:00Z","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"},"paper":{"abstract_excerpt":"We propose a new framework for deriving screening rules for convex optimization problems. Our approach covers a large class of constrained and penalized optimization formulations, and works in two steps. First, given any approximate point, the structure of the objective function and the duality gap is used to gather information on the optimal solution. In the second step, this information is used to produce screening rules, i.e. safely identifying unimportant weight variables of the optimal solution. Our general framework leads to a large variety of useful existing as well as new screening rul","authors_text":"Anant Raj, Bernd G\\\"artner, Bernhard Sch\\\"olkopf, Jakob Olbrich, Martin Jaggi","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T19:59:50Z","title":"Screening Rules for Convex Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07478","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:c663aa740170f7f80fcbdc74b6f8594798c9bae6295b7e1ea0055d34a1768d72","target":"record","created_at":"2026-05-18T01:04:00Z","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":"06bcabb620c638d758025d9ad8c8b91dd7b38cd74474c097333868498ba65072","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T19:59:50Z","title_canon_sha256":"06078264855d9988ea6fb84e505d4e141dab8d911ce4a15b4195f0f441553c26"},"schema_version":"1.0","source":{"id":"1609.07478","kind":"arxiv","version":1}},"canonical_sha256":"7457a548f9df023350e810f1cf86fd467740a3b9f4e3f8fad90bcd346c56b7f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7457a548f9df023350e810f1cf86fd467740a3b9f4e3f8fad90bcd346c56b7f3","first_computed_at":"2026-05-18T01:04:00.753591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:00.753591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Gq3HA4v1v2zeOKGOO91yBviym1DLjQVl63uqOsKvv+HqAfdpwzldflgd7Ry3w9n7izUs/5RAyM1tQ9yStc9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:00.754325Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c663aa740170f7f80fcbdc74b6f8594798c9bae6295b7e1ea0055d34a1768d72","sha256:2257934cebbfad02979c47e27fe3604c76e114af699f610ab6ccf039c91801d1"],"state_sha256":"7049c7ecbdd57e7e1eb14aaae0bca8dfb08cb3bfc36dae89e56660d800447291"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"paovmtOuRKon+KjzrBbHH4ZSP/vFFzMWadvCxL07sUqd06xKm6TW2rsoVF4CdQ2YlTy/lHJECJg14ZuFCBhnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:25:30.026786Z","bundle_sha256":"95c5030ae0758a301e40036bf9fdd16369a9cb4b939a9185f75997b6a2e71947"}}