{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HZN2TR43OGHAYD5BBVUA5F3YHB","short_pith_number":"pith:HZN2TR43","canonical_record":{"source":{"id":"1602.07860","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-25T09:34:38Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a4809cad1b99378bf590a8f312a179af1748f21440bde19ef90a25a047f3946f","abstract_canon_sha256":"ecba6fb097bafd87d6ce82ae5083143500d0d051bb2bc35e6172721d00909337"},"schema_version":"1.0"},"canonical_sha256":"3e5ba9c79b718e0c0fa10d680e97783841a665ed867b86363e6baf8e3e1ddace","source":{"kind":"arxiv","id":"1602.07860","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07860","created_at":"2026-07-05T01:25:50Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07860v2","created_at":"2026-07-05T01:25:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07860","created_at":"2026-07-05T01:25:50Z"},{"alias_kind":"pith_short_12","alias_value":"HZN2TR43OGHA","created_at":"2026-07-05T01:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"HZN2TR43OGHAYD5B","created_at":"2026-07-05T01:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"HZN2TR43","created_at":"2026-07-05T01:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HZN2TR43OGHAYD5BBVUA5F3YHB","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07860","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-25T09:34:38Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a4809cad1b99378bf590a8f312a179af1748f21440bde19ef90a25a047f3946f","abstract_canon_sha256":"ecba6fb097bafd87d6ce82ae5083143500d0d051bb2bc35e6172721d00909337"},"schema_version":"1.0"},"canonical_sha256":"3e5ba9c79b718e0c0fa10d680e97783841a665ed867b86363e6baf8e3e1ddace","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:50.656478Z","signature_b64":"EDKunt0OCz9CYcqTT5Gy35B0PMLmg21fsbkN3IjKmvuDv6YMBMaat+03wW0InajgIC/gUWhgrVfVR8k1blsOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e5ba9c79b718e0c0fa10d680e97783841a665ed867b86363e6baf8e3e1ddace","last_reissued_at":"2026-07-05T01:25:50.656035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:50.656035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07860","source_version":2,"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-05T01:25:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hF5x0UWmI54jUO0/3jWqpIK3tLyJWW9fcIzEeVFsmcgrouB0W78kbtu9v9X10UIWywg3An7gssizLhFQP5z3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:25:36.367456Z"},"content_sha256":"5dcd5cfd290d91ae2541823cbca96e4e9adb915a1967c5f787e6dc0e16b821ee","schema_version":"1.0","event_id":"sha256:5dcd5cfd290d91ae2541823cbca96e4e9adb915a1967c5f787e6dc0e16b821ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HZN2TR43OGHAYD5BBVUA5F3YHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probably Approximately Correct Greedy Maximization with Efficient Bounds on Information Gain for Sensor Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Frans A. Oliehoek, Shimon Whiteson, Yash Satsangi","submitted_at":"2016-02-25T09:34:38Z","abstract_excerpt":"Submodular function maximization finds application in a variety of real-world decision-making problems. However, most existing methods, based on greedy maximization, assume it is computationally feasible to evaluate F, the function being maximized. Unfortunately, in many realistic settings F is too expensive to evaluate exactly even once. We present probably approximately correct greedy maximization, which requires access only to cheap anytime confidence bounds on F and uses them to prune elements. We show that, with high probability, our method returns an approximately optimal set. We propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07860","kind":"arxiv","version":2},"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/1602.07860/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-05T01:25:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnD8sFjemw9K+x7aK81mti6flmd+bp8xc7s1NXO/MMV9j4ZWnBIpjDUf3u+0jZfWrq8zf6v1fjtA6JAUbcqwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:25:36.367868Z"},"content_sha256":"d483c2a09cf57504e4b8a7eb8c3db3193d436004f0c81b8b07e12bf8c5c803e8","schema_version":"1.0","event_id":"sha256:d483c2a09cf57504e4b8a7eb8c3db3193d436004f0c81b8b07e12bf8c5c803e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZN2TR43OGHAYD5BBVUA5F3YHB/bundle.json","state_url":"https://pith.science/pith/HZN2TR43OGHAYD5BBVUA5F3YHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZN2TR43OGHAYD5BBVUA5F3YHB/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-07-05T09:25:36Z","links":{"resolver":"https://pith.science/pith/HZN2TR43OGHAYD5BBVUA5F3YHB","bundle":"https://pith.science/pith/HZN2TR43OGHAYD5BBVUA5F3YHB/bundle.json","state":"https://pith.science/pith/HZN2TR43OGHAYD5BBVUA5F3YHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZN2TR43OGHAYD5BBVUA5F3YHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HZN2TR43OGHAYD5BBVUA5F3YHB","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":"ecba6fb097bafd87d6ce82ae5083143500d0d051bb2bc35e6172721d00909337","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-25T09:34:38Z","title_canon_sha256":"a4809cad1b99378bf590a8f312a179af1748f21440bde19ef90a25a047f3946f"},"schema_version":"1.0","source":{"id":"1602.07860","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07860","created_at":"2026-07-05T01:25:50Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07860v2","created_at":"2026-07-05T01:25:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07860","created_at":"2026-07-05T01:25:50Z"},{"alias_kind":"pith_short_12","alias_value":"HZN2TR43OGHA","created_at":"2026-07-05T01:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"HZN2TR43OGHAYD5B","created_at":"2026-07-05T01:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"HZN2TR43","created_at":"2026-07-05T01:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:d483c2a09cf57504e4b8a7eb8c3db3193d436004f0c81b8b07e12bf8c5c803e8","target":"graph","created_at":"2026-07-05T01:25: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1602.07860/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Submodular function maximization finds application in a variety of real-world decision-making problems. However, most existing methods, based on greedy maximization, assume it is computationally feasible to evaluate F, the function being maximized. Unfortunately, in many realistic settings F is too expensive to evaluate exactly even once. We present probably approximately correct greedy maximization, which requires access only to cheap anytime confidence bounds on F and uses them to prune elements. We show that, with high probability, our method returns an approximately optimal set. We propose","authors_text":"Frans A. Oliehoek, Shimon Whiteson, Yash Satsangi","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-25T09:34:38Z","title":"Probably Approximately Correct Greedy Maximization with Efficient Bounds on Information Gain for Sensor Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07860","kind":"arxiv","version":2},"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:5dcd5cfd290d91ae2541823cbca96e4e9adb915a1967c5f787e6dc0e16b821ee","target":"record","created_at":"2026-07-05T01:25: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":"ecba6fb097bafd87d6ce82ae5083143500d0d051bb2bc35e6172721d00909337","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-25T09:34:38Z","title_canon_sha256":"a4809cad1b99378bf590a8f312a179af1748f21440bde19ef90a25a047f3946f"},"schema_version":"1.0","source":{"id":"1602.07860","kind":"arxiv","version":2}},"canonical_sha256":"3e5ba9c79b718e0c0fa10d680e97783841a665ed867b86363e6baf8e3e1ddace","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e5ba9c79b718e0c0fa10d680e97783841a665ed867b86363e6baf8e3e1ddace","first_computed_at":"2026-07-05T01:25:50.656035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:25:50.656035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EDKunt0OCz9CYcqTT5Gy35B0PMLmg21fsbkN3IjKmvuDv6YMBMaat+03wW0InajgIC/gUWhgrVfVR8k1blsOBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:25:50.656478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07860","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dcd5cfd290d91ae2541823cbca96e4e9adb915a1967c5f787e6dc0e16b821ee","sha256:d483c2a09cf57504e4b8a7eb8c3db3193d436004f0c81b8b07e12bf8c5c803e8"],"state_sha256":"1c2b6acdd2a277778815f542fed8b9724c204df433f77b07d74a66449c145be3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLDMB6peDhsSkFq17sJHL8SDdQk4QXjLt+Sl/gJ46Cx/90CXeIq5V2V7ph7K1C4O1v8GpuoMfIfcZ/9N53TlAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:25:36.369948Z","bundle_sha256":"163e8f1f684a5e44cde07c4ff778bd98b9a84a77192dac842952643e9022af3a"}}