{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WSCRPLLT5O3AMA7LI4PRUVOGF3","short_pith_number":"pith:WSCRPLLT","canonical_record":{"source":{"id":"1807.09358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-24T21:10:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"26bc6b9f2d3d7fc8f70c988c4866a90dc513b06663fe4fc1caa6ef3cf81b776b","abstract_canon_sha256":"4c6e98ca29b43dfcb4c9ef6779950335745d658972abb05e34660732000d191b"},"schema_version":"1.0"},"canonical_sha256":"b48517ad73ebb60603eb471f1a55c62ef2d6c0a7b18f464025d98470ccf7846b","source":{"kind":"arxiv","id":"1807.09358","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09358","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09358v2","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09358","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"WSCRPLLT5O3A","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WSCRPLLT5O3AMA7L","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WSCRPLLT","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WSCRPLLT5O3AMA7LI4PRUVOGF3","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-24T21:10:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"26bc6b9f2d3d7fc8f70c988c4866a90dc513b06663fe4fc1caa6ef3cf81b776b","abstract_canon_sha256":"4c6e98ca29b43dfcb4c9ef6779950335745d658972abb05e34660732000d191b"},"schema_version":"1.0"},"canonical_sha256":"b48517ad73ebb60603eb471f1a55c62ef2d6c0a7b18f464025d98470ccf7846b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:09.394092Z","signature_b64":"BOrB6g8W4Q7/4zv2ktt5snVbObAyesgVMlZ4te4vBL+lGedrhtk8drNPQ0jkknbO4YbIH5S1rtp277HTq1lkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b48517ad73ebb60603eb471f1a55c62ef2d6c0a7b18f464025d98470ccf7846b","last_reissued_at":"2026-05-18T00:02:09.393443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:09.393443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09358","source_version":2,"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-18T00:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6KYGCUYUEugztxmSxMUw3aDLgN4ESSvWn7/AVDUtNbNjhb1xA9b1cEFnw0LuTE9WBIZwVYkjD0eov6D489hAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:11:14.072276Z"},"content_sha256":"ed90f0050b31f82bf00439a56dbd6c3195efe97a459386cac09c42725f72aa59","schema_version":"1.0","event_id":"sha256:ed90f0050b31f82bf00439a56dbd6c3195efe97a459386cac09c42725f72aa59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WSCRPLLT5O3AMA7LI4PRUVOGF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approximation Algorithm for Risk-averse Submodular Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Lifeng Zhou, Pratap Tokekar","submitted_at":"2018-07-24T21:10:50Z","abstract_excerpt":"We study the problem of incorporating risk while making combinatorial decisions under uncertainty. We formulate a discrete submodular maximization problem for selecting a set using Conditional-Value-at-Risk (CVaR), a risk metric commonly used in financial analysis. While CVaR has recently been used in optimization of linear cost functions in robotics, we take the first stages towards extending this to discrete submodular optimization and provide several positive results. Specifically, we propose the Sequential Greedy Algorithm that provides an approximation guarantee on finding the maxima of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09358","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":""},"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-18T00:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXPxSFU3066ZpDsu/afxcKlpYVp7UfyEjz5jT2g92hx7JhSVdqoVU9WHV8Q6REUUDIBoc/5ihN9hlHTyswPbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:11:14.072623Z"},"content_sha256":"a08a5861f21568aa837198aaa20c8428f028100680ab2d530e567f04cd6d5373","schema_version":"1.0","event_id":"sha256:a08a5861f21568aa837198aaa20c8428f028100680ab2d530e567f04cd6d5373"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSCRPLLT5O3AMA7LI4PRUVOGF3/bundle.json","state_url":"https://pith.science/pith/WSCRPLLT5O3AMA7LI4PRUVOGF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSCRPLLT5O3AMA7LI4PRUVOGF3/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-06-02T07:11:14Z","links":{"resolver":"https://pith.science/pith/WSCRPLLT5O3AMA7LI4PRUVOGF3","bundle":"https://pith.science/pith/WSCRPLLT5O3AMA7LI4PRUVOGF3/bundle.json","state":"https://pith.science/pith/WSCRPLLT5O3AMA7LI4PRUVOGF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSCRPLLT5O3AMA7LI4PRUVOGF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WSCRPLLT5O3AMA7LI4PRUVOGF3","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":"4c6e98ca29b43dfcb4c9ef6779950335745d658972abb05e34660732000d191b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-24T21:10:50Z","title_canon_sha256":"26bc6b9f2d3d7fc8f70c988c4866a90dc513b06663fe4fc1caa6ef3cf81b776b"},"schema_version":"1.0","source":{"id":"1807.09358","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09358","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09358v2","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09358","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"WSCRPLLT5O3A","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WSCRPLLT5O3AMA7L","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WSCRPLLT","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:a08a5861f21568aa837198aaa20c8428f028100680ab2d530e567f04cd6d5373","target":"graph","created_at":"2026-05-18T00:02:09Z","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":"We study the problem of incorporating risk while making combinatorial decisions under uncertainty. We formulate a discrete submodular maximization problem for selecting a set using Conditional-Value-at-Risk (CVaR), a risk metric commonly used in financial analysis. While CVaR has recently been used in optimization of linear cost functions in robotics, we take the first stages towards extending this to discrete submodular optimization and provide several positive results. Specifically, we propose the Sequential Greedy Algorithm that provides an approximation guarantee on finding the maxima of t","authors_text":"Lifeng Zhou, Pratap Tokekar","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-24T21:10:50Z","title":"An Approximation Algorithm for Risk-averse Submodular Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09358","kind":"arxiv","version":2},"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:ed90f0050b31f82bf00439a56dbd6c3195efe97a459386cac09c42725f72aa59","target":"record","created_at":"2026-05-18T00:02:09Z","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":"4c6e98ca29b43dfcb4c9ef6779950335745d658972abb05e34660732000d191b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-24T21:10:50Z","title_canon_sha256":"26bc6b9f2d3d7fc8f70c988c4866a90dc513b06663fe4fc1caa6ef3cf81b776b"},"schema_version":"1.0","source":{"id":"1807.09358","kind":"arxiv","version":2}},"canonical_sha256":"b48517ad73ebb60603eb471f1a55c62ef2d6c0a7b18f464025d98470ccf7846b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b48517ad73ebb60603eb471f1a55c62ef2d6c0a7b18f464025d98470ccf7846b","first_computed_at":"2026-05-18T00:02:09.393443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:09.393443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BOrB6g8W4Q7/4zv2ktt5snVbObAyesgVMlZ4te4vBL+lGedrhtk8drNPQ0jkknbO4YbIH5S1rtp277HTq1lkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:09.394092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09358","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed90f0050b31f82bf00439a56dbd6c3195efe97a459386cac09c42725f72aa59","sha256:a08a5861f21568aa837198aaa20c8428f028100680ab2d530e567f04cd6d5373"],"state_sha256":"6cd24fb66add573dfc535cace6c7f153e430788326020417c961cd01d996cdc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQKgZ78lPFG9Z7IOK7Nv9NfWGE1Y2o3sAzCqs5lgpxolR/fm4zhqAkc5d/L4YZHhJJQN2IP1SgN7zNlK6yNuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:11:14.074460Z","bundle_sha256":"7fe540dc974eac61fb81b1481bfad1810fda205e0e7ed6218380d69b294ebe2f"}}