{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZBIFRP42LHXDZF3ZRBMGZ6ODMZ","short_pith_number":"pith:ZBIFRP42","canonical_record":{"source":{"id":"1207.1377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"896dabc3aaebfbef5bf6e90bfcd1cd2007a5924797a67eaaf021d6f152f71cbf","abstract_canon_sha256":"204b828d7a9e1f5df8073eb92c595c03c28f537a1ee145a95d2b43a606e1981a"},"schema_version":"1.0"},"canonical_sha256":"c85058bf9a59ee3c977988586cf9c36644dc97c249e099f3c356c53406431ce3","source":{"kind":"arxiv","id":"1207.1377","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1377","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1377v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1377","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"ZBIFRP42LHXD","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZBIFRP42LHXDZF3Z","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZBIFRP42","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZBIFRP42LHXDZF3ZRBMGZ6ODMZ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"896dabc3aaebfbef5bf6e90bfcd1cd2007a5924797a67eaaf021d6f152f71cbf","abstract_canon_sha256":"204b828d7a9e1f5df8073eb92c595c03c28f537a1ee145a95d2b43a606e1981a"},"schema_version":"1.0"},"canonical_sha256":"c85058bf9a59ee3c977988586cf9c36644dc97c249e099f3c356c53406431ce3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.542990Z","signature_b64":"+J7QShSRq6DKPDgZ91D4i1MnBpoD9sOXLLjYDJsIzI9FRaXCpQ5jicx7Rtpnp8bzfUN/VviUB5NY5FW9syNEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c85058bf9a59ee3c977988586cf9c36644dc97c249e099f3c356c53406431ce3","last_reissued_at":"2026-05-18T03:51:37.542259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.542259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1377","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-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zvJm1TvM3TnIa8YMPMgiKRE7ZvagdmWOmaf7o4vGqJQvupUzmPQF7joY04J8lFcjuHfaRN29bCdehvXsileBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:37:51.829125Z"},"content_sha256":"61e5d6a446893e42f5baa10bfa3fa88be319a5de79879b9a87c86ca4c6f02b43","schema_version":"1.0","event_id":"sha256:61e5d6a446893e42f5baa10bfa3fa88be319a5de79879b9a87c86ca4c6f02b43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZBIFRP42LHXDZF3ZRBMGZ6ODMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient algorithm for estimation of qualitative expected utility in possibilistic case-based reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jakub Brzostowski, Ryszard Kowalczyk","submitted_at":"2012-07-04T16:08:46Z","abstract_excerpt":"We propose an efficient algorithm for estimation of possibility based qualitative expected utility. It is useful for decision making mechanisms where each possible decision is assigned a multi-attribute possibility distribution. The computational complexity of ordinary methods calculating the expected utility based on discretization is growing exponentially with the number of attributes, and may become infeasible with a high number of these attributes. We present series of theorems and lemmas proving the correctness of our algorithm that exibits a linear computational complexity. Our algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1377","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-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/2MNWLXQf7Ffn6V91u6c0xrIiijfaNIAucsXCCNf09fFzzLjpUV0Kl24NvAx3Y4Fitb/uYBv8GL8HP5+I3+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:37:51.829487Z"},"content_sha256":"ca666907117a83cd77a2adb1d19f1b6976989d51191ed02bdf66df05147498ad","schema_version":"1.0","event_id":"sha256:ca666907117a83cd77a2adb1d19f1b6976989d51191ed02bdf66df05147498ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBIFRP42LHXDZF3ZRBMGZ6ODMZ/bundle.json","state_url":"https://pith.science/pith/ZBIFRP42LHXDZF3ZRBMGZ6ODMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBIFRP42LHXDZF3ZRBMGZ6ODMZ/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-03T00:37:51Z","links":{"resolver":"https://pith.science/pith/ZBIFRP42LHXDZF3ZRBMGZ6ODMZ","bundle":"https://pith.science/pith/ZBIFRP42LHXDZF3ZRBMGZ6ODMZ/bundle.json","state":"https://pith.science/pith/ZBIFRP42LHXDZF3ZRBMGZ6ODMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBIFRP42LHXDZF3ZRBMGZ6ODMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZBIFRP42LHXDZF3ZRBMGZ6ODMZ","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":"204b828d7a9e1f5df8073eb92c595c03c28f537a1ee145a95d2b43a606e1981a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:08:46Z","title_canon_sha256":"896dabc3aaebfbef5bf6e90bfcd1cd2007a5924797a67eaaf021d6f152f71cbf"},"schema_version":"1.0","source":{"id":"1207.1377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1377","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1377v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1377","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"ZBIFRP42LHXD","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZBIFRP42LHXDZF3Z","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZBIFRP42","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:ca666907117a83cd77a2adb1d19f1b6976989d51191ed02bdf66df05147498ad","target":"graph","created_at":"2026-05-18T03:51:37Z","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":"We propose an efficient algorithm for estimation of possibility based qualitative expected utility. It is useful for decision making mechanisms where each possible decision is assigned a multi-attribute possibility distribution. The computational complexity of ordinary methods calculating the expected utility based on discretization is growing exponentially with the number of attributes, and may become infeasible with a high number of these attributes. We present series of theorems and lemmas proving the correctness of our algorithm that exibits a linear computational complexity. Our algorithm","authors_text":"Jakub Brzostowski, Ryszard Kowalczyk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:08:46Z","title":"Efficient algorithm for estimation of qualitative expected utility in possibilistic case-based reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1377","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:61e5d6a446893e42f5baa10bfa3fa88be319a5de79879b9a87c86ca4c6f02b43","target":"record","created_at":"2026-05-18T03:51:37Z","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":"204b828d7a9e1f5df8073eb92c595c03c28f537a1ee145a95d2b43a606e1981a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:08:46Z","title_canon_sha256":"896dabc3aaebfbef5bf6e90bfcd1cd2007a5924797a67eaaf021d6f152f71cbf"},"schema_version":"1.0","source":{"id":"1207.1377","kind":"arxiv","version":1}},"canonical_sha256":"c85058bf9a59ee3c977988586cf9c36644dc97c249e099f3c356c53406431ce3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c85058bf9a59ee3c977988586cf9c36644dc97c249e099f3c356c53406431ce3","first_computed_at":"2026-05-18T03:51:37.542259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:37.542259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+J7QShSRq6DKPDgZ91D4i1MnBpoD9sOXLLjYDJsIzI9FRaXCpQ5jicx7Rtpnp8bzfUN/VviUB5NY5FW9syNEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:37.542990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61e5d6a446893e42f5baa10bfa3fa88be319a5de79879b9a87c86ca4c6f02b43","sha256:ca666907117a83cd77a2adb1d19f1b6976989d51191ed02bdf66df05147498ad"],"state_sha256":"e75a9c14991e3b7fa8cd21a8323aabeefc403fc8a7a908efd0424d1db80315ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ajCNgJKrfN4PJ0xvtx2aEpo1Zq7PDOJzuRoaZ2DRKJI8IbIpE2ANOl9RJnYzqc3zuLnH2cAh6rEret1rPs1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:37:51.831457Z","bundle_sha256":"1bb99ca95445506caab7c188a1b63a0b93c6f5542de158db769195e22884831e"}}