{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DAP6YHW4QYZ6VBM6BLISL5PBZ7","short_pith_number":"pith:DAP6YHW4","canonical_record":{"source":{"id":"1204.1025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T18:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"4ab3c6ae04e8bb2294ea8e321d1cb81162799874693960929ff9da9ffa663410","abstract_canon_sha256":"c0327ec0f831eb8d94ee71289c04b21e29af1c50e7527c88f18622dd909d9110"},"schema_version":"1.0"},"canonical_sha256":"181fec1edc8633ea859e0ad125f5e1cffeb6fa18e4ba2c740b873d5021dbea15","source":{"kind":"arxiv","id":"1204.1025","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1025","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1025v2","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1025","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"pith_short_12","alias_value":"DAP6YHW4QYZ6","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DAP6YHW4QYZ6VBM6","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DAP6YHW4","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DAP6YHW4QYZ6VBM6BLISL5PBZ7","target":"record","payload":{"canonical_record":{"source":{"id":"1204.1025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T18:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"4ab3c6ae04e8bb2294ea8e321d1cb81162799874693960929ff9da9ffa663410","abstract_canon_sha256":"c0327ec0f831eb8d94ee71289c04b21e29af1c50e7527c88f18622dd909d9110"},"schema_version":"1.0"},"canonical_sha256":"181fec1edc8633ea859e0ad125f5e1cffeb6fa18e4ba2c740b873d5021dbea15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:02.143092Z","signature_b64":"1+2ifKgqhHwRWvB4FvaS+mBuoLUjL4NDtEvirWpYrK8hTw46ize/FBQVCW7rCFAXufcRqr42YhmzPrdn0X7XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"181fec1edc8633ea859e0ad125f5e1cffeb6fa18e4ba2c740b873d5021dbea15","last_reissued_at":"2026-05-18T03:35:02.142453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:02.142453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.1025","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-18T03:35:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3LPISjZCWkDb+RQvgHp3PNbNNSpksPDHfx8puEC1mP14OVgqGLSJEjPPZ3qeOzogWeakPPPnwJPhi4mKrnaGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:37:31.180606Z"},"content_sha256":"e525c63f60a7b569bd809142f6a26d46892577a5ca2adef602844c81e80672f1","schema_version":"1.0","event_id":"sha256:e525c63f60a7b569bd809142f6a26d46892577a5ca2adef602844c81e80672f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DAP6YHW4QYZ6VBM6BLISL5PBZ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online submodular welfare maximization: Greedy is optimal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ian Post, Jan Vondrak, Michael Kapralov","submitted_at":"2012-04-04T18:43:31Z","abstract_excerpt":"We prove that no online algorithm (even randomized, against an oblivious adversary) is better than 1/2-competitive for welfare maximization with coverage valuations, unless $NP = RP$. Since the Greedy algorithm is known to be 1/2-competitive for monotone submodular valuations, of which coverage is a special case, this proves that Greedy provides the optimal competitive ratio. On the other hand, we prove that Greedy in a stochastic setting with i.i.d.items and valuations satisfying diminishing returns is $(1-1/e)$-competitive, which is optimal even for coverage valuations, unless $NP=RP$. For o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1025","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-18T03:35:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GgzwBSdgvsAgVsUy+ut4UJcCwHORiwJs25AL/wqM4iCWa3O5DeXT8Xjll6Z8kszne+oH3AVkCPIZlLuMzBCBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:37:31.181022Z"},"content_sha256":"a1b08ae83def2fabb2b2e1d373f78a8ec68722e7261cb1585c01a64c98439ae7","schema_version":"1.0","event_id":"sha256:a1b08ae83def2fabb2b2e1d373f78a8ec68722e7261cb1585c01a64c98439ae7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAP6YHW4QYZ6VBM6BLISL5PBZ7/bundle.json","state_url":"https://pith.science/pith/DAP6YHW4QYZ6VBM6BLISL5PBZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAP6YHW4QYZ6VBM6BLISL5PBZ7/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-30T22:37:31Z","links":{"resolver":"https://pith.science/pith/DAP6YHW4QYZ6VBM6BLISL5PBZ7","bundle":"https://pith.science/pith/DAP6YHW4QYZ6VBM6BLISL5PBZ7/bundle.json","state":"https://pith.science/pith/DAP6YHW4QYZ6VBM6BLISL5PBZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAP6YHW4QYZ6VBM6BLISL5PBZ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DAP6YHW4QYZ6VBM6BLISL5PBZ7","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":"c0327ec0f831eb8d94ee71289c04b21e29af1c50e7527c88f18622dd909d9110","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T18:43:31Z","title_canon_sha256":"4ab3c6ae04e8bb2294ea8e321d1cb81162799874693960929ff9da9ffa663410"},"schema_version":"1.0","source":{"id":"1204.1025","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1025","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1025v2","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1025","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"pith_short_12","alias_value":"DAP6YHW4QYZ6","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DAP6YHW4QYZ6VBM6","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DAP6YHW4","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:a1b08ae83def2fabb2b2e1d373f78a8ec68722e7261cb1585c01a64c98439ae7","target":"graph","created_at":"2026-05-18T03:35:02Z","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 prove that no online algorithm (even randomized, against an oblivious adversary) is better than 1/2-competitive for welfare maximization with coverage valuations, unless $NP = RP$. Since the Greedy algorithm is known to be 1/2-competitive for monotone submodular valuations, of which coverage is a special case, this proves that Greedy provides the optimal competitive ratio. On the other hand, we prove that Greedy in a stochastic setting with i.i.d.items and valuations satisfying diminishing returns is $(1-1/e)$-competitive, which is optimal even for coverage valuations, unless $NP=RP$. For o","authors_text":"Ian Post, Jan Vondrak, Michael Kapralov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T18:43:31Z","title":"Online submodular welfare maximization: Greedy is optimal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1025","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:e525c63f60a7b569bd809142f6a26d46892577a5ca2adef602844c81e80672f1","target":"record","created_at":"2026-05-18T03:35:02Z","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":"c0327ec0f831eb8d94ee71289c04b21e29af1c50e7527c88f18622dd909d9110","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T18:43:31Z","title_canon_sha256":"4ab3c6ae04e8bb2294ea8e321d1cb81162799874693960929ff9da9ffa663410"},"schema_version":"1.0","source":{"id":"1204.1025","kind":"arxiv","version":2}},"canonical_sha256":"181fec1edc8633ea859e0ad125f5e1cffeb6fa18e4ba2c740b873d5021dbea15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"181fec1edc8633ea859e0ad125f5e1cffeb6fa18e4ba2c740b873d5021dbea15","first_computed_at":"2026-05-18T03:35:02.142453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:02.142453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1+2ifKgqhHwRWvB4FvaS+mBuoLUjL4NDtEvirWpYrK8hTw46ize/FBQVCW7rCFAXufcRqr42YhmzPrdn0X7XBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:02.143092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1025","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e525c63f60a7b569bd809142f6a26d46892577a5ca2adef602844c81e80672f1","sha256:a1b08ae83def2fabb2b2e1d373f78a8ec68722e7261cb1585c01a64c98439ae7"],"state_sha256":"25e745bfe49ea351d09781f2840b955537cf1aa12c2279e246277e6b52005364"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvx+UkWSqiVitoamebaU+IawK9uJDYjsC91cGELShp51xfnZ9ZErWhoXome5K8N0tsvTmmAj2UGNafI+Xw7vAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:37:31.187750Z","bundle_sha256":"0cf7bef67f4868dcb7bf9be90172bc5ecac56f465b9418d58fc5d9df08172796"}}