{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NEI45SQTFNKSTN3GKL2QAR4LGT","short_pith_number":"pith:NEI45SQT","schema_version":"1.0","canonical_sha256":"6911ceca132b5529b76652f500478b34f8e67560415cc968818e6ce0fde7ae7f","source":{"kind":"arxiv","id":"1502.06528","version":1},"attestation_state":"computed","paper":{"title":"Greedy Minimization of Weakly Supermodular Set Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christos Boutsidis, Edo Liberty, Maxim Sviridenko","submitted_at":"2015-02-23T17:48:35Z","abstract_excerpt":"This paper defines weak-$\\alpha$-supermodularity for set functions. Many optimization objectives in machine learning and data mining seek to minimize such functions under cardinality constrains. We prove that such problems benefit from a greedy extension phase. Explicitly, let $S^*$ be the optimal set of cardinality $k$ that minimizes $f$ and let $S_0$ be an initial solution such that $f(S_0)/f(S^*) \\le \\rho$. Then, a greedy extension $S \\supset S_0$ of size $|S| \\le |S_0| + \\lceil \\alpha k \\ln(\\rho/\\varepsilon) \\rceil$ yields $f(S)/f(S^*) \\le 1+\\varepsilon$. As example usages of this framewor"},"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":"1502.06528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-23T17:48:35Z","cross_cats_sorted":[],"title_canon_sha256":"7c9d0af76a5c584a99f1ec498f2b3ced909e70e3a060f911954428c35b110b51","abstract_canon_sha256":"48a0a835f50d18f4558ed1eedf41a2779f5d5221aad01c3f2dd696e7042558ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:32.330747Z","signature_b64":"s+V1Alk91Qn9RET7dTbQqWO7CYuSsOocZQH3wgwYF8gVxM5XOw/7m4wutAfHGcuIUPxAUX58BtI7kSWXno0+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6911ceca132b5529b76652f500478b34f8e67560415cc968818e6ce0fde7ae7f","last_reissued_at":"2026-05-18T02:26:32.330300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:32.330300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Minimization of Weakly Supermodular Set Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christos Boutsidis, Edo Liberty, Maxim Sviridenko","submitted_at":"2015-02-23T17:48:35Z","abstract_excerpt":"This paper defines weak-$\\alpha$-supermodularity for set functions. Many optimization objectives in machine learning and data mining seek to minimize such functions under cardinality constrains. We prove that such problems benefit from a greedy extension phase. Explicitly, let $S^*$ be the optimal set of cardinality $k$ that minimizes $f$ and let $S_0$ be an initial solution such that $f(S_0)/f(S^*) \\le \\rho$. Then, a greedy extension $S \\supset S_0$ of size $|S| \\le |S_0| + \\lceil \\alpha k \\ln(\\rho/\\varepsilon) \\rceil$ yields $f(S)/f(S^*) \\le 1+\\varepsilon$. As example usages of this framewor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06528","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.06528","created_at":"2026-05-18T02:26:32.330374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06528v1","created_at":"2026-05-18T02:26:32.330374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06528","created_at":"2026-05-18T02:26:32.330374+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEI45SQTFNKS","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEI45SQTFNKSTN3G","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEI45SQT","created_at":"2026-05-18T12:29:32.376354+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/NEI45SQTFNKSTN3GKL2QAR4LGT","json":"https://pith.science/pith/NEI45SQTFNKSTN3GKL2QAR4LGT.json","graph_json":"https://pith.science/api/pith-number/NEI45SQTFNKSTN3GKL2QAR4LGT/graph.json","events_json":"https://pith.science/api/pith-number/NEI45SQTFNKSTN3GKL2QAR4LGT/events.json","paper":"https://pith.science/paper/NEI45SQT"},"agent_actions":{"view_html":"https://pith.science/pith/NEI45SQTFNKSTN3GKL2QAR4LGT","download_json":"https://pith.science/pith/NEI45SQTFNKSTN3GKL2QAR4LGT.json","view_paper":"https://pith.science/paper/NEI45SQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06528&json=true","fetch_graph":"https://pith.science/api/pith-number/NEI45SQTFNKSTN3GKL2QAR4LGT/graph.json","fetch_events":"https://pith.science/api/pith-number/NEI45SQTFNKSTN3GKL2QAR4LGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEI45SQTFNKSTN3GKL2QAR4LGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEI45SQTFNKSTN3GKL2QAR4LGT/action/storage_attestation","attest_author":"https://pith.science/pith/NEI45SQTFNKSTN3GKL2QAR4LGT/action/author_attestation","sign_citation":"https://pith.science/pith/NEI45SQTFNKSTN3GKL2QAR4LGT/action/citation_signature","submit_replication":"https://pith.science/pith/NEI45SQTFNKSTN3GKL2QAR4LGT/action/replication_record"}},"created_at":"2026-05-18T02:26:32.330374+00:00","updated_at":"2026-05-18T02:26:32.330374+00:00"}