{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:G45AUKIEJ6E7PL4KL56L6CZP2B","short_pith_number":"pith:G45AUKIE","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"},"canonical_sha256":"373a0a29044f89f7af8a5f7cbf0b2fd06bec42787668362f2a6e56b39415551f","source":{"kind":"arxiv","id":"1908.01230","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01230","created_at":"2026-07-05T02:55:04Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01230v5","created_at":"2026-07-05T02:55:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01230","created_at":"2026-07-05T02:55:04Z"},{"alias_kind":"pith_short_12","alias_value":"G45AUKIEJ6E7","created_at":"2026-07-05T02:55:04Z"},{"alias_kind":"pith_short_16","alias_value":"G45AUKIEJ6E7PL4K","created_at":"2026-07-05T02:55:04Z"},{"alias_kind":"pith_short_8","alias_value":"G45AUKIE","created_at":"2026-07-05T02:55:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:G45AUKIEJ6E7PL4KL56L6CZP2B","target":"record","payload":{"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"},"canonical_sha256":"373a0a29044f89f7af8a5f7cbf0b2fd06bec42787668362f2a6e56b39415551f","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"},"source_kind":"arxiv","source_id":"1908.01230","source_version":5,"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-07-05T02:55:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zy4gV46PR3qkCUtpOxr+y+4jRllN2YEB9O6ktVzhEdD7n+Bskgjt3zfT1wOM6UbfOw00P7Fm5Q+9WjzzHb54BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:45:02.784913Z"},"content_sha256":"5d2a30717fba5f42e01cb80a7b1b318215e01d343778590de2c9c7d0c749dd9a","schema_version":"1.0","event_id":"sha256:5d2a30717fba5f42e01cb80a7b1b318215e01d343778590de2c9c7d0c749dd9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:G45AUKIEJ6E7PL4KL56L6CZP2B","target":"graph","payload":{"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"},"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-07-05T02:55:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RePi/WC5cPx7tbJjxt/vpJ8hbtIBJpHinDu3m/pAaSKQ+Q82oB1XQLbJ/0Qp6UWQy+ylj/IT/xoQLK3DiqvXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:45:02.785690Z"},"content_sha256":"dd42b75d2d9adcf9df486f1aa4eaf35e8e6150a173816a41af0dc557e8f5ee1c","schema_version":"1.0","event_id":"sha256:dd42b75d2d9adcf9df486f1aa4eaf35e8e6150a173816a41af0dc557e8f5ee1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B/bundle.json","state_url":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G45AUKIEJ6E7PL4KL56L6CZP2B/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-08-16T08:45:02Z","links":{"resolver":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B","bundle":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B/bundle.json","state":"https://pith.science/pith/G45AUKIEJ6E7PL4KL56L6CZP2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G45AUKIEJ6E7PL4KL56L6CZP2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:G45AUKIEJ6E7PL4KL56L6CZP2B","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":"529b20c32245fbe25354e15910106a702357bdc48e72ef2960702b0d03936171","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-03T20:28:16Z","title_canon_sha256":"668538b75a19fc9654c3f92acc13bb02483087c677b2773bc84dfddbba229228"},"schema_version":"1.0","source":{"id":"1908.01230","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01230","created_at":"2026-07-05T02:55:04Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01230v5","created_at":"2026-07-05T02:55:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01230","created_at":"2026-07-05T02:55:04Z"},{"alias_kind":"pith_short_12","alias_value":"G45AUKIEJ6E7","created_at":"2026-07-05T02:55:04Z"},{"alias_kind":"pith_short_16","alias_value":"G45AUKIEJ6E7PL4K","created_at":"2026-07-05T02:55:04Z"},{"alias_kind":"pith_short_8","alias_value":"G45AUKIE","created_at":"2026-07-05T02:55:04Z"}],"graph_snapshots":[{"event_id":"sha256:dd42b75d2d9adcf9df486f1aa4eaf35e8e6150a173816a41af0dc557e8f5ee1c","target":"graph","created_at":"2026-07-05T02:55:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.01230/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Victoria G. Crawford","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01230","kind":"arxiv","version":5},"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:5d2a30717fba5f42e01cb80a7b1b318215e01d343778590de2c9c7d0c749dd9a","target":"record","created_at":"2026-07-05T02:55:04Z","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":"529b20c32245fbe25354e15910106a702357bdc48e72ef2960702b0d03936171","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-03T20:28:16Z","title_canon_sha256":"668538b75a19fc9654c3f92acc13bb02483087c677b2773bc84dfddbba229228"},"schema_version":"1.0","source":{"id":"1908.01230","kind":"arxiv","version":5}},"canonical_sha256":"373a0a29044f89f7af8a5f7cbf0b2fd06bec42787668362f2a6e56b39415551f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"373a0a29044f89f7af8a5f7cbf0b2fd06bec42787668362f2a6e56b39415551f","first_computed_at":"2026-07-05T02:55:04.965683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:55:04.965683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Si+QI4HH8N2ym9G4BtGXYl1E2yJiIE4F3Bp4H7aIFRpFzESFv8Cb9zEcA9Tr9wgqu+P7BMkFactKNN1ZpATPDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:55:04.966103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01230","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d2a30717fba5f42e01cb80a7b1b318215e01d343778590de2c9c7d0c749dd9a","sha256:dd42b75d2d9adcf9df486f1aa4eaf35e8e6150a173816a41af0dc557e8f5ee1c"],"state_sha256":"103f8b3f27202d5aef10821778bf17eccf9987d977665d99d83b4ed7553a3f0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VdbMiLIzzNv9CkDGMRJM2K5dTGUG6mUtqAkNHOyYQlK8VvMA+gaRu301aMHX0kXu6cDvRJgQZPCnEN35NBoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T08:45:02.791512Z","bundle_sha256":"4b9627641fc9d262608378bade4acdb5d6537283a31afee13864f56a7dd187ee"}}