{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VP5ZJRVHJYHAF5TDSN7KYQA5DW","short_pith_number":"pith:VP5ZJRVH","schema_version":"1.0","canonical_sha256":"abfb94c6a74e0e02f663937eac401d1da0901adfd25c3c957f6690f2d9de63a6","source":{"kind":"arxiv","id":"1003.3967","version":5},"attestation_state":"computed","paper":{"title":"Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Daniel Golovin","submitted_at":"2010-03-21T04:06:22Z","abstract_excerpt":"Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously difficult challenge. In this paper, we introduce the concept of adaptive submodularity, generalizing submodular set functions to adaptive policies. We prove that if a problem satisfies this property, a simple adaptive greedy algorithm is guaranteed to be competitive with the optimal policy. In addition to providing performance guarantees for both stochastic maximization and coverage, adaptive submodularity can be exploited "},"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":"1003.3967","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-03-21T04:06:22Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"26bc11a2e497b4583730f78eab44c6ec1a4900410ec61b09f26b3f5b8d8af93f","abstract_canon_sha256":"d6b0fa1fad5f7f2a63dea0e18894c75e0ba846340a5f4abf6aa483c49f08ba74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:41.635017Z","signature_b64":"ZfliKUnxbXY03Rb+h/j4Y9mTaVZP+ODty/oi24JBCtatHkMzceqQNPpTY7/baoO7YEL3E/frxNFpADJ+dfI/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abfb94c6a74e0e02f663937eac401d1da0901adfd25c3c957f6690f2d9de63a6","last_reissued_at":"2026-05-18T00:28:41.634385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:41.634385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Daniel Golovin","submitted_at":"2010-03-21T04:06:22Z","abstract_excerpt":"Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously difficult challenge. In this paper, we introduce the concept of adaptive submodularity, generalizing submodular set functions to adaptive policies. We prove that if a problem satisfies this property, a simple adaptive greedy algorithm is guaranteed to be competitive with the optimal policy. In addition to providing performance guarantees for both stochastic maximization and coverage, adaptive submodularity can be exploited "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3967","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1003.3967","created_at":"2026-05-18T00:28:41.634505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.3967v5","created_at":"2026-05-18T00:28:41.634505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3967","created_at":"2026-05-18T00:28:41.634505+00:00"},{"alias_kind":"pith_short_12","alias_value":"VP5ZJRVHJYHA","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VP5ZJRVHJYHAF5TD","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VP5ZJRVH","created_at":"2026-05-18T12:26:15.391820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.01707","citing_title":"On Adaptivity Gaps of Influence Maximization under the Independent Cascade Model with Full Adoption Feedback","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02611","citing_title":"Stochastic Function Certification with Correlations","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW","json":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW.json","graph_json":"https://pith.science/api/pith-number/VP5ZJRVHJYHAF5TDSN7KYQA5DW/graph.json","events_json":"https://pith.science/api/pith-number/VP5ZJRVHJYHAF5TDSN7KYQA5DW/events.json","paper":"https://pith.science/paper/VP5ZJRVH"},"agent_actions":{"view_html":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW","download_json":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW.json","view_paper":"https://pith.science/paper/VP5ZJRVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.3967&json=true","fetch_graph":"https://pith.science/api/pith-number/VP5ZJRVHJYHAF5TDSN7KYQA5DW/graph.json","fetch_events":"https://pith.science/api/pith-number/VP5ZJRVHJYHAF5TDSN7KYQA5DW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW/action/storage_attestation","attest_author":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW/action/author_attestation","sign_citation":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW/action/citation_signature","submit_replication":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW/action/replication_record"}},"created_at":"2026-05-18T00:28:41.634505+00:00","updated_at":"2026-05-18T00:28:41.634505+00:00"}