{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:U4RMLSL36DFPETEGMSV5FFS4H3","short_pith_number":"pith:U4RMLSL3","schema_version":"1.0","canonical_sha256":"a722c5c97bf0caf24c8664abd2965c3edfeb0034a533b24a93622041bbdf1e73","source":{"kind":"arxiv","id":"2403.18059","version":6},"attestation_state":"computed","paper":{"title":"Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rajan Udwani","submitted_at":"2024-03-26T19:24:40Z","abstract_excerpt":"We generalize the problem of online submodular welfare maximization to incorporate various stochastic elements that have gained significant attention in recent years. We show that a non-adaptive Greedy algorithm, which is oblivious to the realization of these stochastic elements, achieves the best possible competitive ratio among all polynomial-time algorithms, including adaptive ones, unless NP$=$RP. This result holds even when the objective function is not submodular but instead satisfies the weaker submodular order property. Our results unify and strengthen existing competitive ratio bounds"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.18059","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-26T19:24:40Z","cross_cats_sorted":[],"title_canon_sha256":"60a6298a6ca1c76bab726692615f1b4408ea71ff699d5cdf335682b4f1d82251","abstract_canon_sha256":"2c7f2c77ebcf27c6f2f7c74e1097b5414e83dd3073bcfd52cb77a669979c53fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:28.462774Z","signature_b64":"mtFI5/w+7A5HqxTrV2nODMfHyLi10ciTofnIKq9JykcH9RDRusAldtKx1X5qY/Z/qhEvOSXLtvKYAGIFksQSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a722c5c97bf0caf24c8664abd2965c3edfeb0034a533b24a93622041bbdf1e73","last_reissued_at":"2026-06-02T01:03:28.462395Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:28.462395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rajan Udwani","submitted_at":"2024-03-26T19:24:40Z","abstract_excerpt":"We generalize the problem of online submodular welfare maximization to incorporate various stochastic elements that have gained significant attention in recent years. We show that a non-adaptive Greedy algorithm, which is oblivious to the realization of these stochastic elements, achieves the best possible competitive ratio among all polynomial-time algorithms, including adaptive ones, unless NP$=$RP. This result holds even when the objective function is not submodular but instead satisfies the weaker submodular order property. Our results unify and strengthen existing competitive ratio bounds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18059","kind":"arxiv","version":6},"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/2403.18059/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.18059","created_at":"2026-06-02T01:03:28.462447+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.18059v6","created_at":"2026-06-02T01:03:28.462447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18059","created_at":"2026-06-02T01:03:28.462447+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4RMLSL36DFP","created_at":"2026-06-02T01:03:28.462447+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4RMLSL36DFPETEG","created_at":"2026-06-02T01:03:28.462447+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4RMLSL3","created_at":"2026-06-02T01:03:28.462447+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3","json":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3.json","graph_json":"https://pith.science/api/pith-number/U4RMLSL36DFPETEGMSV5FFS4H3/graph.json","events_json":"https://pith.science/api/pith-number/U4RMLSL36DFPETEGMSV5FFS4H3/events.json","paper":"https://pith.science/paper/U4RMLSL3"},"agent_actions":{"view_html":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3","download_json":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3.json","view_paper":"https://pith.science/paper/U4RMLSL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.18059&json=true","fetch_graph":"https://pith.science/api/pith-number/U4RMLSL36DFPETEGMSV5FFS4H3/graph.json","fetch_events":"https://pith.science/api/pith-number/U4RMLSL36DFPETEGMSV5FFS4H3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3/action/storage_attestation","attest_author":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3/action/author_attestation","sign_citation":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3/action/citation_signature","submit_replication":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3/action/replication_record"}},"created_at":"2026-06-02T01:03:28.462447+00:00","updated_at":"2026-06-02T01:03:28.462447+00:00"}