{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:C4XUKVG26XQCOLCPPCQPSJNSBK","short_pith_number":"pith:C4XUKVG2","canonical_record":{"source":{"id":"1908.01029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-02T19:46:33Z","cross_cats_sorted":[],"title_canon_sha256":"5d287acf6eaf3e246d4920038b2bdbf52f235437e90324a0dfd0ad24701db6b9","abstract_canon_sha256":"8e8688ea527535d0c0061e4a0581b5b8ddd6964a14953228583e1647c19fae8a"},"schema_version":"1.0"},"canonical_sha256":"172f4554daf5e0272c4f78a0f925b20abb58b003a539b9086f10bc8f8a5c89f0","source":{"kind":"arxiv","id":"1908.01029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01029","created_at":"2026-07-04T23:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01029v1","created_at":"2026-07-04T23:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01029","created_at":"2026-07-04T23:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"C4XUKVG26XQC","created_at":"2026-07-04T23:51:25Z"},{"alias_kind":"pith_short_16","alias_value":"C4XUKVG26XQCOLCP","created_at":"2026-07-04T23:51:25Z"},{"alias_kind":"pith_short_8","alias_value":"C4XUKVG2","created_at":"2026-07-04T23:51:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:C4XUKVG26XQCOLCPPCQPSJNSBK","target":"record","payload":{"canonical_record":{"source":{"id":"1908.01029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-02T19:46:33Z","cross_cats_sorted":[],"title_canon_sha256":"5d287acf6eaf3e246d4920038b2bdbf52f235437e90324a0dfd0ad24701db6b9","abstract_canon_sha256":"8e8688ea527535d0c0061e4a0581b5b8ddd6964a14953228583e1647c19fae8a"},"schema_version":"1.0"},"canonical_sha256":"172f4554daf5e0272c4f78a0f925b20abb58b003a539b9086f10bc8f8a5c89f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:25.729132Z","signature_b64":"VNtw2mz23RJYw9+hp/0pfpPPstpGByEgcTc4Ww+rZGR8WHDNrVbK5jxaP7seXM8PKB5YBbmUcvIKIMb1AN6SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"172f4554daf5e0272c4f78a0f925b20abb58b003a539b9086f10bc8f8a5c89f0","last_reissued_at":"2026-07-04T23:51:25.728782Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:25.728782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.01029","source_version":1,"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-04T23:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tPo3TAhoXy06t+dmUZXvIBintnQXj7ae21UFw1bgPkqbgsLjUjWz+ansBvS56/ac1lGKsltAOs80CYAy0wEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:41:49.395931Z"},"content_sha256":"53c1526a90891ae994d9a4ef2b0fd14ea8a40536bf75d429af1f191f2e02be8c","schema_version":"1.0","event_id":"sha256:53c1526a90891ae994d9a4ef2b0fd14ea8a40536bf75d429af1f191f2e02be8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:C4XUKVG26XQCOLCPPCQPSJNSBK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","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-02T19:46:33Z","abstract_excerpt":"In this paper, the Minimum Cost Submodular Cover problem is studied, which is to minimize a modular cost function such that the monotone submodular benefit function is above a threshold. For this problem, an evolutionary algorithm EASC is introduced that achieves a constant, bicriteria approximation in expected polynomial time; this is the first polynomial-time evolutionary approximation algorithm for Minimum Cost Submodular Cover. To achieve this running time, ideas motivated by submodularity and monotonicity are incorporated into the evolutionary process, which likely will extend to other su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01029","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01029/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-04T23:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fy6fFjX2ggkyIlLh3b4OyUf87H1MuLfnLIuR6Y3L/L0aZF5ypjpy2Q3lxssLqzWX14W25NgRKRCy3KNCxLHRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:41:49.396433Z"},"content_sha256":"10eb712430d1d52236497628ccbe6576b0d2d525a893c51b8697582a00ba8998","schema_version":"1.0","event_id":"sha256:10eb712430d1d52236497628ccbe6576b0d2d525a893c51b8697582a00ba8998"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4XUKVG26XQCOLCPPCQPSJNSBK/bundle.json","state_url":"https://pith.science/pith/C4XUKVG26XQCOLCPPCQPSJNSBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4XUKVG26XQCOLCPPCQPSJNSBK/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-16T14:41:49Z","links":{"resolver":"https://pith.science/pith/C4XUKVG26XQCOLCPPCQPSJNSBK","bundle":"https://pith.science/pith/C4XUKVG26XQCOLCPPCQPSJNSBK/bundle.json","state":"https://pith.science/pith/C4XUKVG26XQCOLCPPCQPSJNSBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4XUKVG26XQCOLCPPCQPSJNSBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:C4XUKVG26XQCOLCPPCQPSJNSBK","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":"8e8688ea527535d0c0061e4a0581b5b8ddd6964a14953228583e1647c19fae8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-02T19:46:33Z","title_canon_sha256":"5d287acf6eaf3e246d4920038b2bdbf52f235437e90324a0dfd0ad24701db6b9"},"schema_version":"1.0","source":{"id":"1908.01029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01029","created_at":"2026-07-04T23:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01029v1","created_at":"2026-07-04T23:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01029","created_at":"2026-07-04T23:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"C4XUKVG26XQC","created_at":"2026-07-04T23:51:25Z"},{"alias_kind":"pith_short_16","alias_value":"C4XUKVG26XQCOLCP","created_at":"2026-07-04T23:51:25Z"},{"alias_kind":"pith_short_8","alias_value":"C4XUKVG2","created_at":"2026-07-04T23:51:25Z"}],"graph_snapshots":[{"event_id":"sha256:10eb712430d1d52236497628ccbe6576b0d2d525a893c51b8697582a00ba8998","target":"graph","created_at":"2026-07-04T23:51:25Z","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.01029/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, the Minimum Cost Submodular Cover problem is studied, which is to minimize a modular cost function such that the monotone submodular benefit function is above a threshold. For this problem, an evolutionary algorithm EASC is introduced that achieves a constant, bicriteria approximation in expected polynomial time; this is the first polynomial-time evolutionary approximation algorithm for Minimum Cost Submodular Cover. To achieve this running time, ideas motivated by submodularity and monotonicity are incorporated into the evolutionary process, which likely will extend to other su","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-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01029","kind":"arxiv","version":1},"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:53c1526a90891ae994d9a4ef2b0fd14ea8a40536bf75d429af1f191f2e02be8c","target":"record","created_at":"2026-07-04T23:51:25Z","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":"8e8688ea527535d0c0061e4a0581b5b8ddd6964a14953228583e1647c19fae8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-02T19:46:33Z","title_canon_sha256":"5d287acf6eaf3e246d4920038b2bdbf52f235437e90324a0dfd0ad24701db6b9"},"schema_version":"1.0","source":{"id":"1908.01029","kind":"arxiv","version":1}},"canonical_sha256":"172f4554daf5e0272c4f78a0f925b20abb58b003a539b9086f10bc8f8a5c89f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"172f4554daf5e0272c4f78a0f925b20abb58b003a539b9086f10bc8f8a5c89f0","first_computed_at":"2026-07-04T23:51:25.728782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:25.728782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VNtw2mz23RJYw9+hp/0pfpPPstpGByEgcTc4Ww+rZGR8WHDNrVbK5jxaP7seXM8PKB5YBbmUcvIKIMb1AN6SAA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:25.729132Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53c1526a90891ae994d9a4ef2b0fd14ea8a40536bf75d429af1f191f2e02be8c","sha256:10eb712430d1d52236497628ccbe6576b0d2d525a893c51b8697582a00ba8998"],"state_sha256":"af1e63d29fb6d72d682ddb42c2881ba9b16e1836165a70d7a2b6830ed3c398c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCnCHFecj3d4a2jRmkdVXMk7Eq/CHYxV9Koqj4cxQVf6NY4glaT2Kzbsggn3VRhnTMsZ158CECcd/0JR8P9KAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T14:41:49.402867Z","bundle_sha256":"748315b13b403cbd2895823ed9630e5d4d51fff649a0511180ddac50a621511b"}}