{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PY2Q3G26HW2ZN2ZUKE52DM4C6W","short_pith_number":"pith:PY2Q3G26","schema_version":"1.0","canonical_sha256":"7e350d9b5e3db596eb34513ba1b382f5b0624e7df0d89fc560417b5459468c3c","source":{"kind":"arxiv","id":"1302.4928","version":1},"attestation_state":"computed","paper":{"title":"Graphical Models for Preference and Utility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Adam J. Grove, Fahiem Bacchus","submitted_at":"2013-02-20T15:18:51Z","abstract_excerpt":"Probabilistic independence can dramatically simplify the task of eliciting, representing, and computing with probabilities in large domains.  A key technique in achieving these benefits is the idea of graphical modeling.  We survey existing notions of independence for utility functions in a multi-attribute space, and suggest that these can be used to achieve similar advantages.  Our new results concern conditional additive independence, which we show always has a perfect representation as separation in an undirected graph (a Markov network).  Conditional additive independencies entail a partic"},"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":"1302.4928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:18:51Z","cross_cats_sorted":[],"title_canon_sha256":"c17089ae655473b70c7b2c8f3005d01568d8f20c8468acc1a1a86fb1f04dc7b5","abstract_canon_sha256":"49a61953b2f16784899dfba4360b0b85f446f85382dbc60ced9d221823dc2c06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:01.147399Z","signature_b64":"Qw+AeQHMOMBHkJGMXjrRcV+VSpYkSf/EGCyMpIpKm2w2zDBQu214VmjQ61+5DeIOLyZ/EBHXy4caiqQoteD6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e350d9b5e3db596eb34513ba1b382f5b0624e7df0d89fc560417b5459468c3c","last_reissued_at":"2026-05-18T03:33:01.146637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:01.146637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphical Models for Preference and Utility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Adam J. Grove, Fahiem Bacchus","submitted_at":"2013-02-20T15:18:51Z","abstract_excerpt":"Probabilistic independence can dramatically simplify the task of eliciting, representing, and computing with probabilities in large domains.  A key technique in achieving these benefits is the idea of graphical modeling.  We survey existing notions of independence for utility functions in a multi-attribute space, and suggest that these can be used to achieve similar advantages.  Our new results concern conditional additive independence, which we show always has a perfect representation as separation in an undirected graph (a Markov network).  Conditional additive independencies entail a partic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4928","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.4928","created_at":"2026-05-18T03:33:01.146761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4928v1","created_at":"2026-05-18T03:33:01.146761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4928","created_at":"2026-05-18T03:33:01.146761+00:00"},{"alias_kind":"pith_short_12","alias_value":"PY2Q3G26HW2Z","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PY2Q3G26HW2ZN2ZU","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PY2Q3G26","created_at":"2026-05-18T12:27:57.521954+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/PY2Q3G26HW2ZN2ZUKE52DM4C6W","json":"https://pith.science/pith/PY2Q3G26HW2ZN2ZUKE52DM4C6W.json","graph_json":"https://pith.science/api/pith-number/PY2Q3G26HW2ZN2ZUKE52DM4C6W/graph.json","events_json":"https://pith.science/api/pith-number/PY2Q3G26HW2ZN2ZUKE52DM4C6W/events.json","paper":"https://pith.science/paper/PY2Q3G26"},"agent_actions":{"view_html":"https://pith.science/pith/PY2Q3G26HW2ZN2ZUKE52DM4C6W","download_json":"https://pith.science/pith/PY2Q3G26HW2ZN2ZUKE52DM4C6W.json","view_paper":"https://pith.science/paper/PY2Q3G26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4928&json=true","fetch_graph":"https://pith.science/api/pith-number/PY2Q3G26HW2ZN2ZUKE52DM4C6W/graph.json","fetch_events":"https://pith.science/api/pith-number/PY2Q3G26HW2ZN2ZUKE52DM4C6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PY2Q3G26HW2ZN2ZUKE52DM4C6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PY2Q3G26HW2ZN2ZUKE52DM4C6W/action/storage_attestation","attest_author":"https://pith.science/pith/PY2Q3G26HW2ZN2ZUKE52DM4C6W/action/author_attestation","sign_citation":"https://pith.science/pith/PY2Q3G26HW2ZN2ZUKE52DM4C6W/action/citation_signature","submit_replication":"https://pith.science/pith/PY2Q3G26HW2ZN2ZUKE52DM4C6W/action/replication_record"}},"created_at":"2026-05-18T03:33:01.146761+00:00","updated_at":"2026-05-18T03:33:01.146761+00:00"}