{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RF7R54PTRNVRFVOIE5BQIS7VPQ","short_pith_number":"pith:RF7R54PT","canonical_record":{"source":{"id":"1606.09521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-30T14:49:01Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"debdceb52deeae51f7340f394221b8f5f6c3af6ebe3662f7ac652e65dd14d6cc","abstract_canon_sha256":"e0910f1f9edbcfb6fa81276d6880d88d7da490baeb9d22756b14c541e2a08345"},"schema_version":"1.0"},"canonical_sha256":"897f1ef1f38b6b12d5c82743044bf57c321b86871a9d4e3154abf71536d11164","source":{"kind":"arxiv","id":"1606.09521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09521","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09521v1","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09521","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"RF7R54PTRNVR","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RF7R54PTRNVRFVOI","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RF7R54PT","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RF7R54PTRNVRFVOIE5BQIS7VPQ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.09521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-30T14:49:01Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"debdceb52deeae51f7340f394221b8f5f6c3af6ebe3662f7ac652e65dd14d6cc","abstract_canon_sha256":"e0910f1f9edbcfb6fa81276d6880d88d7da490baeb9d22756b14c541e2a08345"},"schema_version":"1.0"},"canonical_sha256":"897f1ef1f38b6b12d5c82743044bf57c321b86871a9d4e3154abf71536d11164","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:40.345846Z","signature_b64":"9hVwX+qMOB2/2TG4kPoRvGvK4360U+C3iB5cSfOF/mylGkUL9tVNetpnDTa3/aofHuwg4DQogaDGqQi1ByFcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"897f1ef1f38b6b12d5c82743044bf57c321b86871a9d4e3154abf71536d11164","last_reissued_at":"2026-05-18T01:11:40.345274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:40.345274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.09521","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-18T01:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DhFPeGc0BXiBQv6lsxx6iWXKUaKJPJhZ/V9RQc/b9jZE5mJDwecHC1npB6sM5NLcf9wppE8gQzTVt24AYS2GDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:19:15.327364Z"},"content_sha256":"179b6317eb43cb751deb848326961e48069ce2e663491b365c518987fdfec1f4","schema_version":"1.0","event_id":"sha256:179b6317eb43cb751deb848326961e48069ce2e663491b365c518987fdfec1f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RF7R54PTRNVRFVOIE5BQIS7VPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Reasoning in the Description Logic ALCP with the Principle of Maximum Entropy (Full Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Nico Potyka, Rafael Pe\\~naloza","submitted_at":"2016-06-30T14:49:01Z","abstract_excerpt":"A central question for knowledge representation is how to encode and handle uncertain knowledge adequately. We introduce the probabilistic description logic ALCP that is designed for representing context-dependent knowledge, where the actual context taking place is uncertain. ALCP allows the expression of logical dependencies on the domain and probabilistic dependencies on the possible contexts. In order to draw probabilistic conclusions, we employ the principle of maximum entropy. We provide reasoning algorithms for this logic, and show that it satisfies several desirable properties of probab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09521","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-18T01:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08DHJO7IChn5M6Y7frqzGP0/BTAx1sXnY6xuwZQn8REq/bEbflIX0JFoPYL2yg5oKSsO1H2T8msymHk4f++aAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:19:15.327713Z"},"content_sha256":"45e801bf7f34d14662c461a8b7268eccb410094d93471c89dacdebfc349b1452","schema_version":"1.0","event_id":"sha256:45e801bf7f34d14662c461a8b7268eccb410094d93471c89dacdebfc349b1452"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RF7R54PTRNVRFVOIE5BQIS7VPQ/bundle.json","state_url":"https://pith.science/pith/RF7R54PTRNVRFVOIE5BQIS7VPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RF7R54PTRNVRFVOIE5BQIS7VPQ/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-08T10:19:15Z","links":{"resolver":"https://pith.science/pith/RF7R54PTRNVRFVOIE5BQIS7VPQ","bundle":"https://pith.science/pith/RF7R54PTRNVRFVOIE5BQIS7VPQ/bundle.json","state":"https://pith.science/pith/RF7R54PTRNVRFVOIE5BQIS7VPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RF7R54PTRNVRFVOIE5BQIS7VPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RF7R54PTRNVRFVOIE5BQIS7VPQ","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":"e0910f1f9edbcfb6fa81276d6880d88d7da490baeb9d22756b14c541e2a08345","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-30T14:49:01Z","title_canon_sha256":"debdceb52deeae51f7340f394221b8f5f6c3af6ebe3662f7ac652e65dd14d6cc"},"schema_version":"1.0","source":{"id":"1606.09521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09521","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09521v1","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09521","created_at":"2026-05-18T01:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"RF7R54PTRNVR","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RF7R54PTRNVRFVOI","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RF7R54PT","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:45e801bf7f34d14662c461a8b7268eccb410094d93471c89dacdebfc349b1452","target":"graph","created_at":"2026-05-18T01:11:40Z","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":"A central question for knowledge representation is how to encode and handle uncertain knowledge adequately. We introduce the probabilistic description logic ALCP that is designed for representing context-dependent knowledge, where the actual context taking place is uncertain. ALCP allows the expression of logical dependencies on the domain and probabilistic dependencies on the possible contexts. In order to draw probabilistic conclusions, we employ the principle of maximum entropy. We provide reasoning algorithms for this logic, and show that it satisfies several desirable properties of probab","authors_text":"Nico Potyka, Rafael Pe\\~naloza","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-30T14:49:01Z","title":"Probabilistic Reasoning in the Description Logic ALCP with the Principle of Maximum Entropy (Full Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09521","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:179b6317eb43cb751deb848326961e48069ce2e663491b365c518987fdfec1f4","target":"record","created_at":"2026-05-18T01:11:40Z","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":"e0910f1f9edbcfb6fa81276d6880d88d7da490baeb9d22756b14c541e2a08345","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-30T14:49:01Z","title_canon_sha256":"debdceb52deeae51f7340f394221b8f5f6c3af6ebe3662f7ac652e65dd14d6cc"},"schema_version":"1.0","source":{"id":"1606.09521","kind":"arxiv","version":1}},"canonical_sha256":"897f1ef1f38b6b12d5c82743044bf57c321b86871a9d4e3154abf71536d11164","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"897f1ef1f38b6b12d5c82743044bf57c321b86871a9d4e3154abf71536d11164","first_computed_at":"2026-05-18T01:11:40.345274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:40.345274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9hVwX+qMOB2/2TG4kPoRvGvK4360U+C3iB5cSfOF/mylGkUL9tVNetpnDTa3/aofHuwg4DQogaDGqQi1ByFcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:40.345846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.09521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:179b6317eb43cb751deb848326961e48069ce2e663491b365c518987fdfec1f4","sha256:45e801bf7f34d14662c461a8b7268eccb410094d93471c89dacdebfc349b1452"],"state_sha256":"e16e09d5143f1f979bb34bb5417fdbbbb9f3095baa655627f5445aaa2b2126db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c72piDSTskaKsSe8kPtaF0+w2BOHASsPkzIbdkhc6CsLm3Vst/Km9xELqsPOf1X9LBdh107p59eZ7LDDe0qPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:19:15.329496Z","bundle_sha256":"af283429670e7ab33fee428b60fa9f99dd353fb1fe74778357c94a89490b249a"}}