{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:N24JD74ZVVCVRWNE5BJJBO6TYN","short_pith_number":"pith:N24JD74Z","canonical_record":{"source":{"id":"1101.4450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-24T05:59:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ba09826666b2580ca40823148aaf93bfd589360af7a8a2396e05d72bccac49e7","abstract_canon_sha256":"69a46fea5af98995cf0c847f3fbd2f4e031bd022dc2e78397c04031a1872aa15"},"schema_version":"1.0"},"canonical_sha256":"6eb891ff99ad4558d9a4e85290bbd3c34bf8df2561d251c9b96929af52168b72","source":{"kind":"arxiv","id":"1101.4450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4450","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4450v1","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4450","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"N24JD74ZVVCV","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N24JD74ZVVCVRWNE","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N24JD74Z","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:N24JD74ZVVCVRWNE5BJJBO6TYN","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-24T05:59:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ba09826666b2580ca40823148aaf93bfd589360af7a8a2396e05d72bccac49e7","abstract_canon_sha256":"69a46fea5af98995cf0c847f3fbd2f4e031bd022dc2e78397c04031a1872aa15"},"schema_version":"1.0"},"canonical_sha256":"6eb891ff99ad4558d9a4e85290bbd3c34bf8df2561d251c9b96929af52168b72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:50.250682Z","signature_b64":"nvTXogH2aqrLLrTAVXFlWjNnPXhSWLoXxAizJG2Z3Qq+FXlUjqL/8b+eAiYvy0Klj0VUJ12urk6X3a4QDzsxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eb891ff99ad4558d9a4e85290bbd3c34bf8df2561d251c9b96929af52168b72","last_reissued_at":"2026-05-18T02:22:50.250027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:50.250027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4450","source_version":1,"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-18T02:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbzL4GjOaGAKZbEtQBwgPaNX0Eo++1RVueWAresYhghb92GpTRaonF2pUA2pbjGcKrrZlEFm6PbouwL6JlrYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:32:32.482465Z"},"content_sha256":"9123866d4a152663b209a26794b027a98d83a95960aec115c91869cfc11785e5","schema_version":"1.0","event_id":"sha256:9123866d4a152663b209a26794b027a98d83a95960aec115c91869cfc11785e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:N24JD74ZVVCVRWNE5BJJBO6TYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Submodular Optimization under Matroid Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Andreas Krause, Daniel Golovin","submitted_at":"2011-01-24T05:59:06Z","abstract_excerpt":"Many important problems in discrete optimization require maximization of a monotonic submodular function subject to matroid constraints. For these problems, a simple greedy algorithm is guaranteed to obtain near-optimal solutions. In this article, we extend this classic result to a general class of adaptive optimization problems under partial observability, where each choice can depend on observations resulting from past choices. Specifically, we prove that a natural adaptive greedy algorithm provides a $1/(p+1)$ approximation for the problem of maximizing an adaptive monotone submodular funct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4450","kind":"arxiv","version":1},"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-18T02:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q0HGdpQwFHcpz9WDzNBrEQroGrJWXw5IuntqLj5s9e7xYvDbIbgIYu3a0TTPeXRBoiJqyCHwY++oMSmI9aAWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:32:32.482816Z"},"content_sha256":"b0168b46f53d4f865d6bcef8e36175a17ee4e5b278bf4670262b7c82fb66ca9f","schema_version":"1.0","event_id":"sha256:b0168b46f53d4f865d6bcef8e36175a17ee4e5b278bf4670262b7c82fb66ca9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N24JD74ZVVCVRWNE5BJJBO6TYN/bundle.json","state_url":"https://pith.science/pith/N24JD74ZVVCVRWNE5BJJBO6TYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N24JD74ZVVCVRWNE5BJJBO6TYN/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-03T15:32:32Z","links":{"resolver":"https://pith.science/pith/N24JD74ZVVCVRWNE5BJJBO6TYN","bundle":"https://pith.science/pith/N24JD74ZVVCVRWNE5BJJBO6TYN/bundle.json","state":"https://pith.science/pith/N24JD74ZVVCVRWNE5BJJBO6TYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N24JD74ZVVCVRWNE5BJJBO6TYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:N24JD74ZVVCVRWNE5BJJBO6TYN","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":"69a46fea5af98995cf0c847f3fbd2f4e031bd022dc2e78397c04031a1872aa15","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-24T05:59:06Z","title_canon_sha256":"ba09826666b2580ca40823148aaf93bfd589360af7a8a2396e05d72bccac49e7"},"schema_version":"1.0","source":{"id":"1101.4450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4450","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4450v1","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4450","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"N24JD74ZVVCV","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N24JD74ZVVCVRWNE","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N24JD74Z","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:b0168b46f53d4f865d6bcef8e36175a17ee4e5b278bf4670262b7c82fb66ca9f","target":"graph","created_at":"2026-05-18T02:22:50Z","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":"Many important problems in discrete optimization require maximization of a monotonic submodular function subject to matroid constraints. For these problems, a simple greedy algorithm is guaranteed to obtain near-optimal solutions. In this article, we extend this classic result to a general class of adaptive optimization problems under partial observability, where each choice can depend on observations resulting from past choices. Specifically, we prove that a natural adaptive greedy algorithm provides a $1/(p+1)$ approximation for the problem of maximizing an adaptive monotone submodular funct","authors_text":"Andreas Krause, Daniel Golovin","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-24T05:59:06Z","title":"Adaptive Submodular Optimization under Matroid Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4450","kind":"arxiv","version":1},"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:9123866d4a152663b209a26794b027a98d83a95960aec115c91869cfc11785e5","target":"record","created_at":"2026-05-18T02:22:50Z","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":"69a46fea5af98995cf0c847f3fbd2f4e031bd022dc2e78397c04031a1872aa15","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-24T05:59:06Z","title_canon_sha256":"ba09826666b2580ca40823148aaf93bfd589360af7a8a2396e05d72bccac49e7"},"schema_version":"1.0","source":{"id":"1101.4450","kind":"arxiv","version":1}},"canonical_sha256":"6eb891ff99ad4558d9a4e85290bbd3c34bf8df2561d251c9b96929af52168b72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eb891ff99ad4558d9a4e85290bbd3c34bf8df2561d251c9b96929af52168b72","first_computed_at":"2026-05-18T02:22:50.250027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:50.250027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nvTXogH2aqrLLrTAVXFlWjNnPXhSWLoXxAizJG2Z3Qq+FXlUjqL/8b+eAiYvy0Klj0VUJ12urk6X3a4QDzsxAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:50.250682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9123866d4a152663b209a26794b027a98d83a95960aec115c91869cfc11785e5","sha256:b0168b46f53d4f865d6bcef8e36175a17ee4e5b278bf4670262b7c82fb66ca9f"],"state_sha256":"47ac5d8c4bb69ed97eb835cdc2c408d6c6d2b3b86a352ee9cbfcfb0d3f613cb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JubQV9chHXFvfAfVqVhvA6qWUTO0YJEfuPHRj49U6GzpL4kkZ3wpm2/vDbXyK7RAqdg6iWsjD0sypABvDYyZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:32:32.484751Z","bundle_sha256":"16cade7c05487f3b4d2d83181bfc6ef20ea93b9e7f33a363bcb4e90767da1577"}}