{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VP5ZJRVHJYHAF5TDSN7KYQA5DW","short_pith_number":"pith:VP5ZJRVH","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"},"canonical_sha256":"abfb94c6a74e0e02f663937eac401d1da0901adfd25c3c957f6690f2d9de63a6","source":{"kind":"arxiv","id":"1003.3967","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.3967","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1003.3967v5","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3967","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"VP5ZJRVHJYHA","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VP5ZJRVHJYHAF5TD","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VP5ZJRVH","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VP5ZJRVHJYHAF5TDSN7KYQA5DW","target":"record","payload":{"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"},"canonical_sha256":"abfb94c6a74e0e02f663937eac401d1da0901adfd25c3c957f6690f2d9de63a6","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"},"source_kind":"arxiv","source_id":"1003.3967","source_version":5,"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-18T00:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8Z4wcTHXO4DHwWCzBkDwuKgIlQoXI4Ypf/+8UxZ8KC8DsHiZo2XGGB35VHEYpPl5ae8H+iIswHQi0DsvnURCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:37:11.118497Z"},"content_sha256":"8cfa87f8978d7e8dd608394eb13d7ad538067d1c36642037c08cb22a14cd41c2","schema_version":"1.0","event_id":"sha256:8cfa87f8978d7e8dd608394eb13d7ad538067d1c36642037c08cb22a14cd41c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VP5ZJRVHJYHAF5TDSN7KYQA5DW","target":"graph","payload":{"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"},"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-18T00:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JT0N1hm9kQmTfA3RH6AXGPVp6IAe4RU/fksUSJN9UW81e81IUcsdXxxaMb1+fSVULbBSy1RVLhVbDkK56sVBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:37:11.118872Z"},"content_sha256":"1edec9a83417ef7fbfb3b37e33fa44ca3cf4c2c24366b526d7554fb900216693","schema_version":"1.0","event_id":"sha256:1edec9a83417ef7fbfb3b37e33fa44ca3cf4c2c24366b526d7554fb900216693"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW/bundle.json","state_url":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW/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-29T18:37:11Z","links":{"resolver":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW","bundle":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW/bundle.json","state":"https://pith.science/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VP5ZJRVHJYHAF5TDSN7KYQA5DW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VP5ZJRVHJYHAF5TDSN7KYQA5DW","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":"d6b0fa1fad5f7f2a63dea0e18894c75e0ba846340a5f4abf6aa483c49f08ba74","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-03-21T04:06:22Z","title_canon_sha256":"26bc11a2e497b4583730f78eab44c6ec1a4900410ec61b09f26b3f5b8d8af93f"},"schema_version":"1.0","source":{"id":"1003.3967","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.3967","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1003.3967v5","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3967","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"VP5ZJRVHJYHA","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VP5ZJRVHJYHAF5TD","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VP5ZJRVH","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:1edec9a83417ef7fbfb3b37e33fa44ca3cf4c2c24366b526d7554fb900216693","target":"graph","created_at":"2026-05-18T00:28:41Z","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":"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 ","authors_text":"Andreas Krause, Daniel Golovin","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-03-21T04:06:22Z","title":"Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3967","kind":"arxiv","version":5},"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:8cfa87f8978d7e8dd608394eb13d7ad538067d1c36642037c08cb22a14cd41c2","target":"record","created_at":"2026-05-18T00:28:41Z","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":"d6b0fa1fad5f7f2a63dea0e18894c75e0ba846340a5f4abf6aa483c49f08ba74","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-03-21T04:06:22Z","title_canon_sha256":"26bc11a2e497b4583730f78eab44c6ec1a4900410ec61b09f26b3f5b8d8af93f"},"schema_version":"1.0","source":{"id":"1003.3967","kind":"arxiv","version":5}},"canonical_sha256":"abfb94c6a74e0e02f663937eac401d1da0901adfd25c3c957f6690f2d9de63a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abfb94c6a74e0e02f663937eac401d1da0901adfd25c3c957f6690f2d9de63a6","first_computed_at":"2026-05-18T00:28:41.634385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:41.634385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZfliKUnxbXY03Rb+h/j4Y9mTaVZP+ODty/oi24JBCtatHkMzceqQNPpTY7/baoO7YEL3E/frxNFpADJ+dfI/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:41.635017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.3967","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cfa87f8978d7e8dd608394eb13d7ad538067d1c36642037c08cb22a14cd41c2","sha256:1edec9a83417ef7fbfb3b37e33fa44ca3cf4c2c24366b526d7554fb900216693"],"state_sha256":"b0d58403d35c0b6443d860b1e25b34c9136e597172d281534b3316ff348850e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/au62n1yxg7umt9g7DmpB8vYW3gjyaCAoRvcHrROSPFgd6u+DA/q42ce/wI1MBFBMl8rPEdLXT6NUhYBNk4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:37:11.121417Z","bundle_sha256":"a75c37843bde4947e77c026f2cfe6f0f5ed748ae4b89b4f252ecf942f01c8c42"}}