{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DXRZRUYTWKBGLGVHGEDFUIXS3L","short_pith_number":"pith:DXRZRUYT","schema_version":"1.0","canonical_sha256":"1de398d313b282659aa731065a22f2dad0029ed1aebfc9c3a791184d5ea2f995","source":{"kind":"arxiv","id":"1702.04067","version":3},"attestation_state":"computed","paper":{"title":"Submodular Goal Value of Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Devorah Kletenik, Eric Bach, Jeremie Dusart, Lisa Hellerstein","submitted_at":"2017-02-14T03:48:32Z","abstract_excerpt":"Recently, Deshpande et al. introduced a new measure of the complexity of a Boolean function. We call this measure the \"goal value\" of the function. The goal value of $f$ is defined in terms of a monotone, submodular utility function associated with $f$. As shown by Deshpande et al., proving that a Boolean function $f$ has small goal value can lead to a good approximation algorithm for the Stochastic Boolean Function Evaluation problem for $f$. Also, if $f$ has small goal value, it indicates a close relationship between two other measures of the complexity of $f$, its average-case decision tree"},"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":"1702.04067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-14T03:48:32Z","cross_cats_sorted":[],"title_canon_sha256":"da7e45ea9e05c3c60746fec73aeb1831afec69cc8294522ec6bbe7049ab4458a","abstract_canon_sha256":"6dccf030eb4feaae7a27496103f0fd15f99e6186eb37ef79f6fa3a0d0fc3ea8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:15.438536Z","signature_b64":"09WuzELIlJSSVgyewimSYjHdFP2+C4N+HfJAxMAeIG1LNpDs17LFLjgmFYiaIJIO4o267MjipadT9VbC6vK3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de398d313b282659aa731065a22f2dad0029ed1aebfc9c3a791184d5ea2f995","last_reissued_at":"2026-05-18T00:34:15.437877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:15.437877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodular Goal Value of Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Devorah Kletenik, Eric Bach, Jeremie Dusart, Lisa Hellerstein","submitted_at":"2017-02-14T03:48:32Z","abstract_excerpt":"Recently, Deshpande et al. introduced a new measure of the complexity of a Boolean function. We call this measure the \"goal value\" of the function. The goal value of $f$ is defined in terms of a monotone, submodular utility function associated with $f$. As shown by Deshpande et al., proving that a Boolean function $f$ has small goal value can lead to a good approximation algorithm for the Stochastic Boolean Function Evaluation problem for $f$. Also, if $f$ has small goal value, it indicates a close relationship between two other measures of the complexity of $f$, its average-case decision tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04067","kind":"arxiv","version":3},"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":"1702.04067","created_at":"2026-05-18T00:34:15.437975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04067v3","created_at":"2026-05-18T00:34:15.437975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04067","created_at":"2026-05-18T00:34:15.437975+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXRZRUYTWKBG","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXRZRUYTWKBGLGVH","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXRZRUYT","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DXRZRUYTWKBGLGVHGEDFUIXS3L","json":"https://pith.science/pith/DXRZRUYTWKBGLGVHGEDFUIXS3L.json","graph_json":"https://pith.science/api/pith-number/DXRZRUYTWKBGLGVHGEDFUIXS3L/graph.json","events_json":"https://pith.science/api/pith-number/DXRZRUYTWKBGLGVHGEDFUIXS3L/events.json","paper":"https://pith.science/paper/DXRZRUYT"},"agent_actions":{"view_html":"https://pith.science/pith/DXRZRUYTWKBGLGVHGEDFUIXS3L","download_json":"https://pith.science/pith/DXRZRUYTWKBGLGVHGEDFUIXS3L.json","view_paper":"https://pith.science/paper/DXRZRUYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04067&json=true","fetch_graph":"https://pith.science/api/pith-number/DXRZRUYTWKBGLGVHGEDFUIXS3L/graph.json","fetch_events":"https://pith.science/api/pith-number/DXRZRUYTWKBGLGVHGEDFUIXS3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXRZRUYTWKBGLGVHGEDFUIXS3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXRZRUYTWKBGLGVHGEDFUIXS3L/action/storage_attestation","attest_author":"https://pith.science/pith/DXRZRUYTWKBGLGVHGEDFUIXS3L/action/author_attestation","sign_citation":"https://pith.science/pith/DXRZRUYTWKBGLGVHGEDFUIXS3L/action/citation_signature","submit_replication":"https://pith.science/pith/DXRZRUYTWKBGLGVHGEDFUIXS3L/action/replication_record"}},"created_at":"2026-05-18T00:34:15.437975+00:00","updated_at":"2026-05-18T00:34:15.437975+00:00"}