{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HTEWDR7INXEVC23BAE6FMUZESU","short_pith_number":"pith:HTEWDR7I","canonical_record":{"source":{"id":"1303.0726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-04T15:15:36Z","cross_cats_sorted":[],"title_canon_sha256":"f5759b6aa5f0dec40dd4518b703db987412cf3f1a177827de01778295061e3a1","abstract_canon_sha256":"e860563a99db29a09386d098a2ecd65f7b72b5844dfe6f5a1f603aadd04ee73a"},"schema_version":"1.0"},"canonical_sha256":"3cc961c7e86dc9516b61013c565324950b2a20ada0b5f6b2d2a3080a6d51735d","source":{"kind":"arxiv","id":"1303.0726","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0726","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0726v2","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0726","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"HTEWDR7INXEV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HTEWDR7INXEVC23B","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HTEWDR7I","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HTEWDR7INXEVC23BAE6FMUZESU","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-04T15:15:36Z","cross_cats_sorted":[],"title_canon_sha256":"f5759b6aa5f0dec40dd4518b703db987412cf3f1a177827de01778295061e3a1","abstract_canon_sha256":"e860563a99db29a09386d098a2ecd65f7b72b5844dfe6f5a1f603aadd04ee73a"},"schema_version":"1.0"},"canonical_sha256":"3cc961c7e86dc9516b61013c565324950b2a20ada0b5f6b2d2a3080a6d51735d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:18.950487Z","signature_b64":"rQHO1rV2MZcBjzn76Flp5NpHdl3JNPK6UaXH3v8EPUuVEnsyEFoO7eKi9LNaAiTSZfIYhsnudqW7we6im0W1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cc961c7e86dc9516b61013c565324950b2a20ada0b5f6b2d2a3080a6d51735d","last_reissued_at":"2026-05-18T03:16:18.949917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:18.949917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0726","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-05-18T03:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zaxw+mgkUf/eHnS8lV2xbsVQfjE80e8fXssza8L2H4drAa5+AWGeK6M/xG66lg7HskAT3bEa/GizYFbZvOsDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:19:55.245110Z"},"content_sha256":"db10670c57863e58a438f1caf372cc325500d7ef8f1062b51ba868d347586519","schema_version":"1.0","event_id":"sha256:db10670c57863e58a438f1caf372cc325500d7ef8f1062b51ba868d347586519"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HTEWDR7INXEVC23BAE6FMUZESU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amol Deshpande, Devorah Kletenik, Lisa Hellerstein","submitted_at":"2013-03-04T15:15:36Z","abstract_excerpt":"Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined by paying an associated cost c_i. The assumption is that x is drawn from a given product distribution, and the goal is to minimize the expected cost. This problem has been studied in Operations Research, where it is known as \"sequential testing\" of Boolean functions. It has also been studied in learning theory in the context of learning with attribute costs. We consider the general problem of developing approximatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0726","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":""},"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-18T03:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOBxr0tSA4NcSgHU+GU7qa03ApBoBG84pYHhtFbQOMOx5rBu7lqaW8CnUMa1e6ZpN5FIGietj5bYk5P+pg+DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:19:55.245491Z"},"content_sha256":"a8412e3ab291630522490ef75aae12f15fbceabaf05e99ef3bb99b852737f047","schema_version":"1.0","event_id":"sha256:a8412e3ab291630522490ef75aae12f15fbceabaf05e99ef3bb99b852737f047"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTEWDR7INXEVC23BAE6FMUZESU/bundle.json","state_url":"https://pith.science/pith/HTEWDR7INXEVC23BAE6FMUZESU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTEWDR7INXEVC23BAE6FMUZESU/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-30T05:19:55Z","links":{"resolver":"https://pith.science/pith/HTEWDR7INXEVC23BAE6FMUZESU","bundle":"https://pith.science/pith/HTEWDR7INXEVC23BAE6FMUZESU/bundle.json","state":"https://pith.science/pith/HTEWDR7INXEVC23BAE6FMUZESU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTEWDR7INXEVC23BAE6FMUZESU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HTEWDR7INXEVC23BAE6FMUZESU","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":"e860563a99db29a09386d098a2ecd65f7b72b5844dfe6f5a1f603aadd04ee73a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-04T15:15:36Z","title_canon_sha256":"f5759b6aa5f0dec40dd4518b703db987412cf3f1a177827de01778295061e3a1"},"schema_version":"1.0","source":{"id":"1303.0726","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0726","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0726v2","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0726","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"HTEWDR7INXEV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HTEWDR7INXEVC23B","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HTEWDR7I","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:a8412e3ab291630522490ef75aae12f15fbceabaf05e99ef3bb99b852737f047","target":"graph","created_at":"2026-05-18T03:16:18Z","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":"Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined by paying an associated cost c_i. The assumption is that x is drawn from a given product distribution, and the goal is to minimize the expected cost. This problem has been studied in Operations Research, where it is known as \"sequential testing\" of Boolean functions. It has also been studied in learning theory in the context of learning with attribute costs. We consider the general problem of developing approximatio","authors_text":"Amol Deshpande, Devorah Kletenik, Lisa Hellerstein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-04T15:15:36Z","title":"Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0726","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:db10670c57863e58a438f1caf372cc325500d7ef8f1062b51ba868d347586519","target":"record","created_at":"2026-05-18T03:16:18Z","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":"e860563a99db29a09386d098a2ecd65f7b72b5844dfe6f5a1f603aadd04ee73a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-04T15:15:36Z","title_canon_sha256":"f5759b6aa5f0dec40dd4518b703db987412cf3f1a177827de01778295061e3a1"},"schema_version":"1.0","source":{"id":"1303.0726","kind":"arxiv","version":2}},"canonical_sha256":"3cc961c7e86dc9516b61013c565324950b2a20ada0b5f6b2d2a3080a6d51735d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cc961c7e86dc9516b61013c565324950b2a20ada0b5f6b2d2a3080a6d51735d","first_computed_at":"2026-05-18T03:16:18.949917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:18.949917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rQHO1rV2MZcBjzn76Flp5NpHdl3JNPK6UaXH3v8EPUuVEnsyEFoO7eKi9LNaAiTSZfIYhsnudqW7we6im0W1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:18.950487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0726","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db10670c57863e58a438f1caf372cc325500d7ef8f1062b51ba868d347586519","sha256:a8412e3ab291630522490ef75aae12f15fbceabaf05e99ef3bb99b852737f047"],"state_sha256":"82e9cf5df2485eb52bcd23f055ba54b7232b0a1db34d4ecfe71fcfc03c175726"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2hyYHU6atDaM/9eSIeCQGd1z8ex6E6WGGH+Vcrbv/fnTocWVqeNen2us4jXq7Zj4T75XchtKRa0BTURRxmdBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:19:55.247722Z","bundle_sha256":"1f505b6e6493d375ebcd184a9aaa88605299a4b0cdc9fbc7cb4151f233bbf5d9"}}