{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NMEXEQ73Z5IF3562ATOBFQQPJY","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":"df94e0f497a78efed864fb48266e17b9edc05c35f8b5ef8421dc0c9ee0362024","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-02T19:32:55Z","title_canon_sha256":"32a076ee748083fa4a4a942db928dd666c24a03ef11dcc81fc5aafcdc0488ce3"},"schema_version":"1.0","source":{"id":"1612.00804","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00804","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00804v2","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00804","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"pith_short_12","alias_value":"NMEXEQ73Z5IF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NMEXEQ73Z5IF3562","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NMEXEQ73","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:100eb3c1378f1fd74e7b20459aa9ebc6d4fbbc3c8cbffc69cc1ddc4757792421","target":"graph","created_at":"2026-05-18T00:33:02Z","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 connect high-dimensional subset selection and submodular maximization. Our results extend the work of Das and Kempe (2011) from the setting of linear regression to arbitrary objective functions. For greedy feature selection, this connection allows us to obtain strong multiplicative performance bounds on several methods without statistical modeling assumptions. We also derive recovery guarantees of this form under standard assumptions. Our work shows that greedy algorithms perform within a constant factor from the best possible subset-selection solution for a broad class of general objective","authors_text":"Alexandros G. Dimakis, Ethan R. Elenberg, Rajiv Khanna, Sahand Negahban","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-02T19:32:55Z","title":"Restricted Strong Convexity Implies Weak Submodularity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00804","kind":"arxiv","version":2},"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:7d84960f14f957fb0933514ad0a627a4ed4b1ada682266cdf1be99984f7348d6","target":"record","created_at":"2026-05-18T00:33:02Z","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":"df94e0f497a78efed864fb48266e17b9edc05c35f8b5ef8421dc0c9ee0362024","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-02T19:32:55Z","title_canon_sha256":"32a076ee748083fa4a4a942db928dd666c24a03ef11dcc81fc5aafcdc0488ce3"},"schema_version":"1.0","source":{"id":"1612.00804","kind":"arxiv","version":2}},"canonical_sha256":"6b097243fbcf505df7da04dc12c20f4e11beb6efe6668b02b8cdeb150a5bf1d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b097243fbcf505df7da04dc12c20f4e11beb6efe6668b02b8cdeb150a5bf1d4","first_computed_at":"2026-05-18T00:33:02.301727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:02.301727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"34MSsHwfcYh6bxzwbQWPddJujaYEnQucBud5RGYt6gabgxRWItYDt5meNQLRUHZ0jf5EaF9eEWYA77NbH9zwDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:02.302206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00804","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d84960f14f957fb0933514ad0a627a4ed4b1ada682266cdf1be99984f7348d6","sha256:100eb3c1378f1fd74e7b20459aa9ebc6d4fbbc3c8cbffc69cc1ddc4757792421"],"state_sha256":"51e19bb19b896b5a0bf8267f7afc821485addbd286c81154f8a4e7bcd1e61378"}