{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HFGR7UIEXX4WU6LHPGPHVPVKVL","short_pith_number":"pith:HFGR7UIE","canonical_record":{"source":{"id":"1108.5794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T01:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"49e8cf41513bdd3ee5783b2376e9e3beebc4c240743824b28b925455d989e7b5","abstract_canon_sha256":"e08192646991d3e2e58fa287147183467b5c85843fb09b3c6b937e76bd4436d5"},"schema_version":"1.0"},"canonical_sha256":"394d1fd104bdf96a7967799e7abeaaaaf7dbc220739b9e4f3ec332326e49a27c","source":{"kind":"arxiv","id":"1108.5794","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5794","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5794v1","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5794","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"HFGR7UIEXX4W","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HFGR7UIEXX4WU6LH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HFGR7UIE","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HFGR7UIEXX4WU6LHPGPHVPVKVL","target":"record","payload":{"canonical_record":{"source":{"id":"1108.5794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T01:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"49e8cf41513bdd3ee5783b2376e9e3beebc4c240743824b28b925455d989e7b5","abstract_canon_sha256":"e08192646991d3e2e58fa287147183467b5c85843fb09b3c6b937e76bd4436d5"},"schema_version":"1.0"},"canonical_sha256":"394d1fd104bdf96a7967799e7abeaaaaf7dbc220739b9e4f3ec332326e49a27c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:28.596378Z","signature_b64":"HKKf6aCov43wMuXmVjKppmKdbUTk+PPeBwklTDs3eeOsBXIWhf/V2dtlsfmhAoR7WGJukPC2PgiZ9MM191QaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"394d1fd104bdf96a7967799e7abeaaaaf7dbc220739b9e4f3ec332326e49a27c","last_reissued_at":"2026-05-18T04:14:28.595817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:28.595817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.5794","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-18T04:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9v5lhPs4X8aRHYJHOE/DpyemYFtx6DKkl5RCYxAV2jLQC17kDuZlqBO4QXDRizhIpfuUz+VMGHnkTU44U22QCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:08:35.859772Z"},"content_sha256":"cf73b7c16a045d191fa080e8c5449a71d432fc52e1ef1ba8e1072181a9fcd40a","schema_version":"1.0","event_id":"sha256:cf73b7c16a045d191fa080e8c5449a71d432fc52e1ef1ba8e1072181a9fcd40a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HFGR7UIEXX4WU6LHPGPHVPVKVL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christoph Beierle, Gabriele Kern-Isberner, Karl S\\\"odler","submitted_at":"2011-08-30T01:41:34Z","abstract_excerpt":"In order to give appropriate semantics to qualitative conditionals of the form \"if A then normally B\", ordinal conditional functions (OCFs) ranking the possible worlds according to their degree of plausibility can be used. An OCF accepting all conditionals of a knowledge base R can be characterized as the solution of a constraint satisfaction problem. We present a high-level, declarative approach using constraint logic programming techniques for solving this constraint satisfaction problem. In particular, the approach developed here supports the generation of all minimal solutions; these minim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5794","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-18T04:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SfmivkHV47nr+MV74y41k6Ew+4Hq/ewVxulXeF1jqcYswDfyFa38XP8gV1mqZ/GQXpAe3c2c15oYqE4sk4vGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:08:35.860455Z"},"content_sha256":"40a784c5dfed0926e443c9bddc60b460932850cd23af85853f1a7c89970306cd","schema_version":"1.0","event_id":"sha256:40a784c5dfed0926e443c9bddc60b460932850cd23af85853f1a7c89970306cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL/bundle.json","state_url":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL/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-06T13:08:35Z","links":{"resolver":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL","bundle":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL/bundle.json","state":"https://pith.science/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFGR7UIEXX4WU6LHPGPHVPVKVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HFGR7UIEXX4WU6LHPGPHVPVKVL","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":"e08192646991d3e2e58fa287147183467b5c85843fb09b3c6b937e76bd4436d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T01:41:34Z","title_canon_sha256":"49e8cf41513bdd3ee5783b2376e9e3beebc4c240743824b28b925455d989e7b5"},"schema_version":"1.0","source":{"id":"1108.5794","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5794","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5794v1","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5794","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"HFGR7UIEXX4W","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HFGR7UIEXX4WU6LH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HFGR7UIE","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:40a784c5dfed0926e443c9bddc60b460932850cd23af85853f1a7c89970306cd","target":"graph","created_at":"2026-05-18T04:14:28Z","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":"In order to give appropriate semantics to qualitative conditionals of the form \"if A then normally B\", ordinal conditional functions (OCFs) ranking the possible worlds according to their degree of plausibility can be used. An OCF accepting all conditionals of a knowledge base R can be characterized as the solution of a constraint satisfaction problem. We present a high-level, declarative approach using constraint logic programming techniques for solving this constraint satisfaction problem. In particular, the approach developed here supports the generation of all minimal solutions; these minim","authors_text":"Christoph Beierle, Gabriele Kern-Isberner, Karl S\\\"odler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T01:41:34Z","title":"A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5794","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:cf73b7c16a045d191fa080e8c5449a71d432fc52e1ef1ba8e1072181a9fcd40a","target":"record","created_at":"2026-05-18T04:14:28Z","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":"e08192646991d3e2e58fa287147183467b5c85843fb09b3c6b937e76bd4436d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-08-30T01:41:34Z","title_canon_sha256":"49e8cf41513bdd3ee5783b2376e9e3beebc4c240743824b28b925455d989e7b5"},"schema_version":"1.0","source":{"id":"1108.5794","kind":"arxiv","version":1}},"canonical_sha256":"394d1fd104bdf96a7967799e7abeaaaaf7dbc220739b9e4f3ec332326e49a27c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"394d1fd104bdf96a7967799e7abeaaaaf7dbc220739b9e4f3ec332326e49a27c","first_computed_at":"2026-05-18T04:14:28.595817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:28.595817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HKKf6aCov43wMuXmVjKppmKdbUTk+PPeBwklTDs3eeOsBXIWhf/V2dtlsfmhAoR7WGJukPC2PgiZ9MM191QaCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:28.596378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.5794","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf73b7c16a045d191fa080e8c5449a71d432fc52e1ef1ba8e1072181a9fcd40a","sha256:40a784c5dfed0926e443c9bddc60b460932850cd23af85853f1a7c89970306cd"],"state_sha256":"bbc4192fa4e34de0aed2b13d009a84a70eaa64dc546d3707415dcaa168382068"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4URuPXKd5n9BTWlVHdnMH5EHWkkaP9VEo2w9TB2QKJ8yBej+57OObbB/F6LR24pXPA0gc0AQE4K7iMe0UAIqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:08:35.864007Z","bundle_sha256":"d9932f6950f4785240cdfc7dbb330d2b3150f0a70c1a22bd12c4132cef531979"}}