{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZUS3FBL4D34HQ4M34QPZAAMSQW","short_pith_number":"pith:ZUS3FBL4","canonical_record":{"source":{"id":"1905.03308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-08T19:29:43Z","cross_cats_sorted":[],"title_canon_sha256":"1ceeb71ec49ad20728d3563faa179e0df3c4ba0a847504d2073263b3d18a8ed5","abstract_canon_sha256":"c6a5e82970d8cfdeb3788307d2c6372e9989151569d6a35172b34eaecbbe4293"},"schema_version":"1.0"},"canonical_sha256":"cd25b2857c1ef878719be41f90019285a5b31f35d0d6a44ed15d12814907ce68","source":{"kind":"arxiv","id":"1905.03308","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03308","created_at":"2026-05-17T23:46:40Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03308v1","created_at":"2026-05-17T23:46:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03308","created_at":"2026-05-17T23:46:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZUS3FBL4D34H","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZUS3FBL4D34HQ4M3","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZUS3FBL4","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZUS3FBL4D34HQ4M34QPZAAMSQW","target":"record","payload":{"canonical_record":{"source":{"id":"1905.03308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-08T19:29:43Z","cross_cats_sorted":[],"title_canon_sha256":"1ceeb71ec49ad20728d3563faa179e0df3c4ba0a847504d2073263b3d18a8ed5","abstract_canon_sha256":"c6a5e82970d8cfdeb3788307d2c6372e9989151569d6a35172b34eaecbbe4293"},"schema_version":"1.0"},"canonical_sha256":"cd25b2857c1ef878719be41f90019285a5b31f35d0d6a44ed15d12814907ce68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:40.436561Z","signature_b64":"lc7uTpStAa1KlR+uRQQx15JX3T1sDDd1AjlaAaEXCOd/NcD+V7mNWrehT6P6DUSS79VUUie7wrc3cNSeUGyTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd25b2857c1ef878719be41f90019285a5b31f35d0d6a44ed15d12814907ce68","last_reissued_at":"2026-05-17T23:46:40.435915Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:40.435915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.03308","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-05-17T23:46:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yg4686f68MO3WUTeGIe/VtqG5lW7K0cJjdfmGXUmGFVzubv/7C1iIWbE+h0TqdLCFJEjQ4wn0ToDRO6/PYnJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:48:42.027335Z"},"content_sha256":"cb686d7f6ae191b14952600ba7b5e2a2f369bd5a855d6e71d7d2b11020d0afa1","schema_version":"1.0","event_id":"sha256:cb686d7f6ae191b14952600ba7b5e2a2f369bd5a855d6e71d7d2b11020d0afa1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZUS3FBL4D34HQ4M34QPZAAMSQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Submodular Optimization Problems and Greedy Strategies: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Pezeshki, Edwin K. P. Chong, Yajing Liu, Zhenliang Zhang","submitted_at":"2019-05-08T19:29:43Z","abstract_excerpt":"The greedy strategy is an approximation algorithm to solve optimization problems arising in decision making with multiple actions. How good is the greedy strategy compared to the optimal solution? In this survey, we mainly consider two classes of optimization problems where the objective function is submodular. The first is set submodular optimization, which is to choose a set of actions to optimize a set submodular objective function, and the second is string submodular optimization, which is to choose an ordered set of actions to optimize a string submodular function. Our emphasis here is on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03308","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"},"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-05-17T23:46:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8On4Tsn5X31YeWAcSB8dn4BqfsiN5hugpzGW0oi2GfYnNDvDed4aMsE3WeLfhlpwmrnVuPZz+1Cu+tv9l4ZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:48:42.027740Z"},"content_sha256":"d5058b7ec17e461914fd10f782575da6d314e71cdc236da5851d6861eb734912","schema_version":"1.0","event_id":"sha256:d5058b7ec17e461914fd10f782575da6d314e71cdc236da5851d6861eb734912"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUS3FBL4D34HQ4M34QPZAAMSQW/bundle.json","state_url":"https://pith.science/pith/ZUS3FBL4D34HQ4M34QPZAAMSQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUS3FBL4D34HQ4M34QPZAAMSQW/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-05-26T15:48:42Z","links":{"resolver":"https://pith.science/pith/ZUS3FBL4D34HQ4M34QPZAAMSQW","bundle":"https://pith.science/pith/ZUS3FBL4D34HQ4M34QPZAAMSQW/bundle.json","state":"https://pith.science/pith/ZUS3FBL4D34HQ4M34QPZAAMSQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUS3FBL4D34HQ4M34QPZAAMSQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZUS3FBL4D34HQ4M34QPZAAMSQW","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":"c6a5e82970d8cfdeb3788307d2c6372e9989151569d6a35172b34eaecbbe4293","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-08T19:29:43Z","title_canon_sha256":"1ceeb71ec49ad20728d3563faa179e0df3c4ba0a847504d2073263b3d18a8ed5"},"schema_version":"1.0","source":{"id":"1905.03308","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03308","created_at":"2026-05-17T23:46:40Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03308v1","created_at":"2026-05-17T23:46:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03308","created_at":"2026-05-17T23:46:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZUS3FBL4D34H","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZUS3FBL4D34HQ4M3","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZUS3FBL4","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:d5058b7ec17e461914fd10f782575da6d314e71cdc236da5851d6861eb734912","target":"graph","created_at":"2026-05-17T23:46:40Z","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"},"paper":{"abstract_excerpt":"The greedy strategy is an approximation algorithm to solve optimization problems arising in decision making with multiple actions. How good is the greedy strategy compared to the optimal solution? In this survey, we mainly consider two classes of optimization problems where the objective function is submodular. The first is set submodular optimization, which is to choose a set of actions to optimize a set submodular objective function, and the second is string submodular optimization, which is to choose an ordered set of actions to optimize a string submodular function. Our emphasis here is on","authors_text":"Ali Pezeshki, Edwin K. P. Chong, Yajing Liu, Zhenliang Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-08T19:29:43Z","title":"Submodular Optimization Problems and Greedy Strategies: A Survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03308","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:cb686d7f6ae191b14952600ba7b5e2a2f369bd5a855d6e71d7d2b11020d0afa1","target":"record","created_at":"2026-05-17T23:46:40Z","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":"c6a5e82970d8cfdeb3788307d2c6372e9989151569d6a35172b34eaecbbe4293","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-08T19:29:43Z","title_canon_sha256":"1ceeb71ec49ad20728d3563faa179e0df3c4ba0a847504d2073263b3d18a8ed5"},"schema_version":"1.0","source":{"id":"1905.03308","kind":"arxiv","version":1}},"canonical_sha256":"cd25b2857c1ef878719be41f90019285a5b31f35d0d6a44ed15d12814907ce68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd25b2857c1ef878719be41f90019285a5b31f35d0d6a44ed15d12814907ce68","first_computed_at":"2026-05-17T23:46:40.435915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:40.435915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lc7uTpStAa1KlR+uRQQx15JX3T1sDDd1AjlaAaEXCOd/NcD+V7mNWrehT6P6DUSS79VUUie7wrc3cNSeUGyTDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:40.436561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03308","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb686d7f6ae191b14952600ba7b5e2a2f369bd5a855d6e71d7d2b11020d0afa1","sha256:d5058b7ec17e461914fd10f782575da6d314e71cdc236da5851d6861eb734912"],"state_sha256":"f757d2bdb80579fc6902c2147e377f858fe382cd8280d8c3186681de34603826"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OR1/MqJvEJQl8zLRymYreMPp98hZchOeH1z5JqvnTJhZYo5E42z+XnIZFCSqPpGMWVjfxNHEbzdVxRvROWzcAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:48:42.030785Z","bundle_sha256":"9f4deaf30f40a476247b44e7d4f600dd2514a96163f5ac23a3169d9c1b141daa"}}