{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G45AUKIEJ6E7PL4KL56L6CZP2B","short_pith_number":"pith:G45AUKIE","schema_version":"1.0","canonical_sha256":"373a0a29044f89f7af8a5f7cbf0b2fd06bec42787668362f2a6e56b39415551f","source":{"kind":"arxiv","id":"1908.01230","version":5},"attestation_state":"computed","paper":{"title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Victoria G. Crawford","submitted_at":"2019-08-03T20:28:16Z","abstract_excerpt":"In this paper, the monotone submodular maximization problem (SM) is studied. SM is to find a subset of size $\\kappa$ from a universe of size $n$ that maximizes a monotone submodular objective function $f$.\n  We show using a novel analysis that the Pareto optimization algorithm achieves a worst-case ratio of $(1-\\epsilon)(1-1/e)$ in expectation for every cardinality constraint $\\kappa < P$, where $P\\leq n+1$ is an input, in $O(nP\\ln(1/\\epsilon))$ queries of $f$.\n  In addition, a novel evolutionary algorithm called the biased Pareto optimization algorithm, is proposed that achieves a worst-case "},"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":"1908.01230","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-03T20:28:16Z","cross_cats_sorted":[],"title_canon_sha256":"668538b75a19fc9654c3f92acc13bb02483087c677b2773bc84dfddbba229228","abstract_canon_sha256":"529b20c32245fbe25354e15910106a702357bdc48e72ef2960702b0d03936171"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:55:04.966103Z","signature_b64":"Si+QI4HH8N2ym9G4BtGXYl1E2yJiIE4F3Bp4H7aIFRpFzESFv8Cb9zEcA9Tr9wgqu+P7BMkFactKNN1ZpATPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"373a0a29044f89f7af8a5f7cbf0b2fd06bec42787668362f2a6e56b39415551f","last_reissued_at":"2026-07-05T02:55:04.965683Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:55:04.965683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Victoria G. Crawford","submitted_at":"2019-08-03T20:28:16Z","abstract_excerpt":"In this paper, the monotone submodular maximization problem (SM) is studied. SM is to find a subset of size $\\kappa$ from a universe of size $n$ that maximizes a monotone submodular objective function $f$.\n  We show using a novel analysis that the Pareto optimization algorithm achieves a worst-case ratio of $(1-\\epsilon)(1-1/e)$ in expectation for every cardinality constraint $\\kappa < P$, where $P\\leq n+1$ is an input, in $O(nP\\ln(1/\\epsilon))$ queries of $f$.\n  In addition, a novel evolutionary algorithm called the biased Pareto optimization algorithm, is proposed that achieves a worst-case "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01230","kind":"arxiv","version":5},"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/1908.01230/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":"1908.01230","created_at":"2026-07-05T02:55:04.965742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01230v5","created_at":"2026-07-05T02:55:04.965742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01230","created_at":"2026-07-05T02:55:04.965742+00:00"},{"alias_kind":"pith_short_12","alias_value":"G45AUKIEJ6E7","created_at":"2026-07-05T02:55:04.965742+00:00"},{"alias_kind":"pith_short_16","alias_value":"G45AUKIEJ6E7PL4K","created_at":"2026-07-05T02:55:04.965742+00:00"},{"alias_kind":"pith_short_8","alias_value":"G45AUKIE","created_at":"2026-07-05T02:55:04.965742+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/G45AUKIEJ6E7PL4KL56L6CZP2B","json":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B.json","graph_json":"https://pith.science/api/pith-number/G45AUKIEJ6E7PL4KL56L6CZP2B/graph.json","events_json":"https://pith.science/api/pith-number/G45AUKIEJ6E7PL4KL56L6CZP2B/events.json","paper":"https://pith.science/paper/G45AUKIE"},"agent_actions":{"view_html":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B","download_json":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B.json","view_paper":"https://pith.science/paper/G45AUKIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01230&json=true","fetch_graph":"https://pith.science/api/pith-number/G45AUKIEJ6E7PL4KL56L6CZP2B/graph.json","fetch_events":"https://pith.science/api/pith-number/G45AUKIEJ6E7PL4KL56L6CZP2B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B/action/storage_attestation","attest_author":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B/action/author_attestation","sign_citation":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B/action/citation_signature","submit_replication":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B/action/replication_record"}},"created_at":"2026-07-05T02:55:04.965742+00:00","updated_at":"2026-07-05T02:55:04.965742+00:00"}