{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WQEI2CZY54TTTFAFULTUIL5AGK","short_pith_number":"pith:WQEI2CZY","canonical_record":{"source":{"id":"2404.13737","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-21T18:24:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"53d9320a68fe2a99948f1799e95f8934dad7cc6778ab42d95dc953651bcb232f","abstract_canon_sha256":"2ac38b32ed4b92d104ffb37dfba60101f7df7ee940b6f5cd0841303420d0aa4e"},"schema_version":"1.0"},"canonical_sha256":"b4088d0b38ef27399405a2e7442fa0328c44f9938921a74d6440bbca7bc8e24d","source":{"kind":"arxiv","id":"2404.13737","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.13737","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2404.13737v4","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.13737","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"WQEI2CZY54TT","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"WQEI2CZY54TTTFAF","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"WQEI2CZY","created_at":"2026-07-05T09:11:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WQEI2CZY54TTTFAFULTUIL5AGK","target":"record","payload":{"canonical_record":{"source":{"id":"2404.13737","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-21T18:24:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"53d9320a68fe2a99948f1799e95f8934dad7cc6778ab42d95dc953651bcb232f","abstract_canon_sha256":"2ac38b32ed4b92d104ffb37dfba60101f7df7ee940b6f5cd0841303420d0aa4e"},"schema_version":"1.0"},"canonical_sha256":"b4088d0b38ef27399405a2e7442fa0328c44f9938921a74d6440bbca7bc8e24d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:25.632509Z","signature_b64":"KRicli/AWm/1q6EX4lUP8W/VjxJ1K1i2D9PcbCwsO5VQ9gHYxZATbpe/TBh2cKzsDlgVZ+Ph/VXsgDX23nS0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4088d0b38ef27399405a2e7442fa0328c44f9938921a74d6440bbca7bc8e24d","last_reissued_at":"2026-07-05T09:11:25.632107Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:25.632107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.13737","source_version":4,"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-07-05T09:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+z+zN/nG70L7DZxqzsIv33Lu6qZdJkl0rdlnnRAno997TQV57SjZV/Js702AWw40ULgbnF3YSm/zuHw96H5EDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T15:45:21.270763Z"},"content_sha256":"8679d345e6f3150a654dc7a04d3a41347f7b0f31384078674fa841dd7f12fa03","schema_version":"1.0","event_id":"sha256:8679d345e6f3150a654dc7a04d3a41347f7b0f31384078674fa841dd7f12fa03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WQEI2CZY54TTTFAFULTUIL5AGK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Multi-round Submodular Optimization with Budget","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Cosimo Vinci, Diodato Ferraioli, Vincenzo Auletta","submitted_at":"2024-04-21T18:24:43Z","abstract_excerpt":"In this work, we study the Stochastic Budgeted Multi-round Submodular Maximization (SBMSm) problem, where we aim to adaptively maximize the sum, over multiple rounds, of a monotone and submodular objective function defined on subsets of items. The objective function also depends on the realization of stochastic events, and the total number of items we can select over all rounds is bounded by a limited budget. This problem extends, and generalizes to multiple round settings, well-studied problems such as (adaptive) influence maximization and stochastic probing.\n  We show that, if the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.13737","kind":"arxiv","version":4},"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/2404.13737/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-07-05T09:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++Q7J5nB83UkNsg0xnjZEfPLpOcesoBynha5yltervMPGTgoZzRXEhrXX2U/A+m5f4+mUVv2Z8S4+WTaGl/1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T15:45:21.271255Z"},"content_sha256":"c5b615de88423d624fd213495cecab1d6902da644d54a2f82869046f96903114","schema_version":"1.0","event_id":"sha256:c5b615de88423d624fd213495cecab1d6902da644d54a2f82869046f96903114"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQEI2CZY54TTTFAFULTUIL5AGK/bundle.json","state_url":"https://pith.science/pith/WQEI2CZY54TTTFAFULTUIL5AGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQEI2CZY54TTTFAFULTUIL5AGK/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-08-21T15:45:21Z","links":{"resolver":"https://pith.science/pith/WQEI2CZY54TTTFAFULTUIL5AGK","bundle":"https://pith.science/pith/WQEI2CZY54TTTFAFULTUIL5AGK/bundle.json","state":"https://pith.science/pith/WQEI2CZY54TTTFAFULTUIL5AGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQEI2CZY54TTTFAFULTUIL5AGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WQEI2CZY54TTTFAFULTUIL5AGK","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":"2ac38b32ed4b92d104ffb37dfba60101f7df7ee940b6f5cd0841303420d0aa4e","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-21T18:24:43Z","title_canon_sha256":"53d9320a68fe2a99948f1799e95f8934dad7cc6778ab42d95dc953651bcb232f"},"schema_version":"1.0","source":{"id":"2404.13737","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.13737","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2404.13737v4","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.13737","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"WQEI2CZY54TT","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"WQEI2CZY54TTTFAF","created_at":"2026-07-05T09:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"WQEI2CZY","created_at":"2026-07-05T09:11:25Z"}],"graph_snapshots":[{"event_id":"sha256:c5b615de88423d624fd213495cecab1d6902da644d54a2f82869046f96903114","target":"graph","created_at":"2026-07-05T09:11:25Z","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/2404.13737/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we study the Stochastic Budgeted Multi-round Submodular Maximization (SBMSm) problem, where we aim to adaptively maximize the sum, over multiple rounds, of a monotone and submodular objective function defined on subsets of items. The objective function also depends on the realization of stochastic events, and the total number of items we can select over all rounds is bounded by a limited budget. This problem extends, and generalizes to multiple round settings, well-studied problems such as (adaptive) influence maximization and stochastic probing.\n  We show that, if the number of ","authors_text":"Cosimo Vinci, Diodato Ferraioli, Vincenzo Auletta","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-21T18:24:43Z","title":"Stochastic Multi-round Submodular Optimization with Budget"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.13737","kind":"arxiv","version":4},"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:8679d345e6f3150a654dc7a04d3a41347f7b0f31384078674fa841dd7f12fa03","target":"record","created_at":"2026-07-05T09:11:25Z","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":"2ac38b32ed4b92d104ffb37dfba60101f7df7ee940b6f5cd0841303420d0aa4e","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-21T18:24:43Z","title_canon_sha256":"53d9320a68fe2a99948f1799e95f8934dad7cc6778ab42d95dc953651bcb232f"},"schema_version":"1.0","source":{"id":"2404.13737","kind":"arxiv","version":4}},"canonical_sha256":"b4088d0b38ef27399405a2e7442fa0328c44f9938921a74d6440bbca7bc8e24d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4088d0b38ef27399405a2e7442fa0328c44f9938921a74d6440bbca7bc8e24d","first_computed_at":"2026-07-05T09:11:25.632107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:11:25.632107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KRicli/AWm/1q6EX4lUP8W/VjxJ1K1i2D9PcbCwsO5VQ9gHYxZATbpe/TBh2cKzsDlgVZ+Ph/VXsgDX23nS0CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:11:25.632509Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.13737","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8679d345e6f3150a654dc7a04d3a41347f7b0f31384078674fa841dd7f12fa03","sha256:c5b615de88423d624fd213495cecab1d6902da644d54a2f82869046f96903114"],"state_sha256":"002eca650db594238de37f3fc46c8db6f3054051bbf0d67b174e386cda7b70ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HPLOXRmgi/uo/RxBMGXWTRyC+BHkf33ok5NaTGSZy7DMJbM49Y5Cb0ePV/uOXDBihNPeL9/9YcKkXhU0OzXxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T15:45:21.275210Z","bundle_sha256":"148fe66387b3a3e9a533c62f8db74c3fb23d882c399e07f2c1be558c95e2d1ba"}}