{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:U4RMLSL36DFPETEGMSV5FFS4H3","short_pith_number":"pith:U4RMLSL3","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"},"canonical_sha256":"a722c5c97bf0caf24c8664abd2965c3edfeb0034a533b24a93622041bbdf1e73","source":{"kind":"arxiv","id":"2403.18059","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.18059","created_at":"2026-06-02T01:03:28Z"},{"alias_kind":"arxiv_version","alias_value":"2403.18059v6","created_at":"2026-06-02T01:03:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18059","created_at":"2026-06-02T01:03:28Z"},{"alias_kind":"pith_short_12","alias_value":"U4RMLSL36DFP","created_at":"2026-06-02T01:03:28Z"},{"alias_kind":"pith_short_16","alias_value":"U4RMLSL36DFPETEG","created_at":"2026-06-02T01:03:28Z"},{"alias_kind":"pith_short_8","alias_value":"U4RMLSL3","created_at":"2026-06-02T01:03:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:U4RMLSL36DFPETEGMSV5FFS4H3","target":"record","payload":{"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"},"canonical_sha256":"a722c5c97bf0caf24c8664abd2965c3edfeb0034a533b24a93622041bbdf1e73","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"},"source_kind":"arxiv","source_id":"2403.18059","source_version":6,"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-06-02T01:03:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eX1AZ84PplvGUr4foovReYInk8CL/uNpxVoQrxv/9b9YLWwEYfpy4ivh+fIVpid9IO6tHMXmmIGg5kPbBrM0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:02:00.624643Z"},"content_sha256":"8a32033e39810efd1d8548cee239d07d03f308f0d6f597235982dfa74c14793b","schema_version":"1.0","event_id":"sha256:8a32033e39810efd1d8548cee239d07d03f308f0d6f597235982dfa74c14793b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:U4RMLSL36DFPETEGMSV5FFS4H3","target":"graph","payload":{"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"},"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-06-02T01:03:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4KGnN/wRNqUXWBoL92DR6FHzc0O4N03IvpzxYfPm+oDT5NN5iWMqlPDxjsTB36yE/VQTMC7+DepXjCcmralAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:02:00.625021Z"},"content_sha256":"87b77bd4f3c27e8bcbc57baed214a066cd8649acdf28f6150669fd0de39c49df","schema_version":"1.0","event_id":"sha256:87b77bd4f3c27e8bcbc57baed214a066cd8649acdf28f6150669fd0de39c49df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3/bundle.json","state_url":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U4RMLSL36DFPETEGMSV5FFS4H3/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-22T09:02:00Z","links":{"resolver":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3","bundle":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3/bundle.json","state":"https://pith.science/pith/U4RMLSL36DFPETEGMSV5FFS4H3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U4RMLSL36DFPETEGMSV5FFS4H3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:U4RMLSL36DFPETEGMSV5FFS4H3","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":"2c7f2c77ebcf27c6f2f7c74e1097b5414e83dd3073bcfd52cb77a669979c53fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-26T19:24:40Z","title_canon_sha256":"60a6298a6ca1c76bab726692615f1b4408ea71ff699d5cdf335682b4f1d82251"},"schema_version":"1.0","source":{"id":"2403.18059","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.18059","created_at":"2026-06-02T01:03:28Z"},{"alias_kind":"arxiv_version","alias_value":"2403.18059v6","created_at":"2026-06-02T01:03:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18059","created_at":"2026-06-02T01:03:28Z"},{"alias_kind":"pith_short_12","alias_value":"U4RMLSL36DFP","created_at":"2026-06-02T01:03:28Z"},{"alias_kind":"pith_short_16","alias_value":"U4RMLSL36DFPETEG","created_at":"2026-06-02T01:03:28Z"},{"alias_kind":"pith_short_8","alias_value":"U4RMLSL3","created_at":"2026-06-02T01:03:28Z"}],"graph_snapshots":[{"event_id":"sha256:87b77bd4f3c27e8bcbc57baed214a066cd8649acdf28f6150669fd0de39c49df","target":"graph","created_at":"2026-06-02T01:03:28Z","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/2403.18059/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Rajan Udwani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-26T19:24:40Z","title":"Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18059","kind":"arxiv","version":6},"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:8a32033e39810efd1d8548cee239d07d03f308f0d6f597235982dfa74c14793b","target":"record","created_at":"2026-06-02T01:03:28Z","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":"2c7f2c77ebcf27c6f2f7c74e1097b5414e83dd3073bcfd52cb77a669979c53fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-26T19:24:40Z","title_canon_sha256":"60a6298a6ca1c76bab726692615f1b4408ea71ff699d5cdf335682b4f1d82251"},"schema_version":"1.0","source":{"id":"2403.18059","kind":"arxiv","version":6}},"canonical_sha256":"a722c5c97bf0caf24c8664abd2965c3edfeb0034a533b24a93622041bbdf1e73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a722c5c97bf0caf24c8664abd2965c3edfeb0034a533b24a93622041bbdf1e73","first_computed_at":"2026-06-02T01:03:28.462395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:28.462395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mtFI5/w+7A5HqxTrV2nODMfHyLi10ciTofnIKq9JykcH9RDRusAldtKx1X5qY/Z/qhEvOSXLtvKYAGIFksQSAQ==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:28.462774Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.18059","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a32033e39810efd1d8548cee239d07d03f308f0d6f597235982dfa74c14793b","sha256:87b77bd4f3c27e8bcbc57baed214a066cd8649acdf28f6150669fd0de39c49df"],"state_sha256":"89c2f2c3b35b17bb0ffc3e86061bb9e5fcbc8e8f618ef2a52ad06f66ae2bb041"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgWLLAaPGKg5s+KeW5GBjpztTsykUZ3TVDMGPHX1LqxZo+8sAY00nUfBWWvKZeZTs4rgw6bgKloAiBwXhhyfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:02:00.627263Z","bundle_sha256":"608f76f1fa96f39680143f345982c576c64fa59649aa9ecfc35549522a8a29e8"}}