{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2WGMQVYUGRMUXNW34JU3NX4A5W","short_pith_number":"pith:2WGMQVYU","schema_version":"1.0","canonical_sha256":"d58cc8571434594bb6dbe269b6df80ed9065f6f55f10ef1762f526c8f2654e23","source":{"kind":"arxiv","id":"2405.05942","version":2},"attestation_state":"computed","paper":{"title":"Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"A Pavan, Samik Basu, Yanhui Zhu","submitted_at":"2024-05-09T17:32:39Z","abstract_excerpt":"We present an evolutionary algorithm evo-SMC for the problem of Submodular Maximization under Cost constraints (SMC). Our algorithm achieves $1/2$-approximation with a high probability $1-1/n$ within $\\mathcal{O}(n^2K_{\\beta})$ iterations, where $K_{\\beta}$ denotes the maximum size of a feasible solution set with cost constraint $\\beta$. To the best of our knowledge, this is the best approximation guarantee offered by evolutionary algorithms for this problem. We further refine evo-SMC, and develop st-evo-SMC. This stochastic version yields a significantly faster algorithm while maintaining the"},"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":"2405.05942","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-05-09T17:32:39Z","cross_cats_sorted":[],"title_canon_sha256":"24aaa6d5d09f8760ec4b282d76dc539c853bcf364419f8d646176529b2cc48ef","abstract_canon_sha256":"0d391815cca53b72a63dc4d875ca72fd6f95e491f60d545cb44d9ec17191f6b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:56:19.661568Z","signature_b64":"foI9/nwkUPMlRFrFRglqjzZUSnpdC/phQqaCYY1Hc8NE01f2nxh+m0YWYUbB8FNhrenb+n4ghaW3Lw5lUW+WAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d58cc8571434594bb6dbe269b6df80ed9065f6f55f10ef1762f526c8f2654e23","last_reissued_at":"2026-07-05T08:56:19.661129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:56:19.661129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"A Pavan, Samik Basu, Yanhui Zhu","submitted_at":"2024-05-09T17:32:39Z","abstract_excerpt":"We present an evolutionary algorithm evo-SMC for the problem of Submodular Maximization under Cost constraints (SMC). Our algorithm achieves $1/2$-approximation with a high probability $1-1/n$ within $\\mathcal{O}(n^2K_{\\beta})$ iterations, where $K_{\\beta}$ denotes the maximum size of a feasible solution set with cost constraint $\\beta$. To the best of our knowledge, this is the best approximation guarantee offered by evolutionary algorithms for this problem. We further refine evo-SMC, and develop st-evo-SMC. This stochastic version yields a significantly faster algorithm while maintaining the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.05942","kind":"arxiv","version":2},"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/2405.05942/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":"2405.05942","created_at":"2026-07-05T08:56:19.661189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.05942v2","created_at":"2026-07-05T08:56:19.661189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.05942","created_at":"2026-07-05T08:56:19.661189+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WGMQVYUGRMU","created_at":"2026-07-05T08:56:19.661189+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WGMQVYUGRMUXNW3","created_at":"2026-07-05T08:56:19.661189+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WGMQVYU","created_at":"2026-07-05T08:56:19.661189+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/2WGMQVYUGRMUXNW34JU3NX4A5W","json":"https://pith.science/pith/2WGMQVYUGRMUXNW34JU3NX4A5W.json","graph_json":"https://pith.science/api/pith-number/2WGMQVYUGRMUXNW34JU3NX4A5W/graph.json","events_json":"https://pith.science/api/pith-number/2WGMQVYUGRMUXNW34JU3NX4A5W/events.json","paper":"https://pith.science/paper/2WGMQVYU"},"agent_actions":{"view_html":"https://pith.science/pith/2WGMQVYUGRMUXNW34JU3NX4A5W","download_json":"https://pith.science/pith/2WGMQVYUGRMUXNW34JU3NX4A5W.json","view_paper":"https://pith.science/paper/2WGMQVYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.05942&json=true","fetch_graph":"https://pith.science/api/pith-number/2WGMQVYUGRMUXNW34JU3NX4A5W/graph.json","fetch_events":"https://pith.science/api/pith-number/2WGMQVYUGRMUXNW34JU3NX4A5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WGMQVYUGRMUXNW34JU3NX4A5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WGMQVYUGRMUXNW34JU3NX4A5W/action/storage_attestation","attest_author":"https://pith.science/pith/2WGMQVYUGRMUXNW34JU3NX4A5W/action/author_attestation","sign_citation":"https://pith.science/pith/2WGMQVYUGRMUXNW34JU3NX4A5W/action/citation_signature","submit_replication":"https://pith.science/pith/2WGMQVYUGRMUXNW34JU3NX4A5W/action/replication_record"}},"created_at":"2026-07-05T08:56:19.661189+00:00","updated_at":"2026-07-05T08:56:19.661189+00:00"}