{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QNKKVB3U5P6REXJAAGGGXRNQ4F","short_pith_number":"pith:QNKKVB3U","canonical_record":{"source":{"id":"1301.6687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:26Z","cross_cats_sorted":[],"title_canon_sha256":"4370211e7490548003ebff79e452e05254260de0b768f42dbbeead57f7254037","abstract_canon_sha256":"5a0080005e1b12d8293b97c356e89b7414bbdd945830ec90c9f8b3bccf95045d"},"schema_version":"1.0"},"canonical_sha256":"8354aa8774ebfd125d20018c6bc5b0e1601eed6d2f89204ca3d58f15aeb51ee8","source":{"kind":"arxiv","id":"1301.6687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6687","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6687v1","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6687","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"QNKKVB3U5P6R","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QNKKVB3U5P6REXJA","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QNKKVB3U","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QNKKVB3U5P6REXJAAGGGXRNQ4F","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:26Z","cross_cats_sorted":[],"title_canon_sha256":"4370211e7490548003ebff79e452e05254260de0b768f42dbbeead57f7254037","abstract_canon_sha256":"5a0080005e1b12d8293b97c356e89b7414bbdd945830ec90c9f8b3bccf95045d"},"schema_version":"1.0"},"canonical_sha256":"8354aa8774ebfd125d20018c6bc5b0e1601eed6d2f89204ca3d58f15aeb51ee8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:13.018649Z","signature_b64":"B0+wKJ/ihmpfxFPcIVbpMSKZr+cDLjQPqgYdhTpK2zmC12tk/pe86SV8fZ0SNob8Og7zhTeUiwy5yNmiV80bBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8354aa8774ebfd125d20018c6bc5b0e1601eed6d2f89204ca3d58f15aeb51ee8","last_reissued_at":"2026-05-18T03:35:13.018081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:13.018081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6687","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:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TFlC50MzJwOvsSCWHQp7YYU5O6Q2CKdZlMmHJnnt1pCLbiBd3AZWtjqC8Xw2nzNAK1P74ZhuHWWp837rbXkUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:42:17.539456Z"},"content_sha256":"fed6f76e53a5a3b72097f15198fd64b4ae713287f8a8822fc7542565e90a9804","schema_version":"1.0","event_id":"sha256:fed6f76e53a5a3b72097f15198fd64b4ae713287f8a8822fc7542565e90a9804"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QNKKVB3U5P6REXJAAGGGXRNQ4F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Loglinear models for first-order probabilistic reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"James Cussens","submitted_at":"2013-01-23T15:57:26Z","abstract_excerpt":"Recent work on loglinear models in probabilistic constraint logic programming is applied to first-order probabilistic reasoning. Probabilities are defined directly on the proofs of atomic formulae, and by marginalisation on the atomic formulae themselves. We use Stochastic Logic Programs (SLPs) composed of labelled and unlabelled definite clauses to define the proof probabilities. We have a conservative extension of first-order reasoning, so that, for example, there is a one-one mapping between logical and random variables. We show how, in this framework, Inductive Logic Programming (ILP) can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6687","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:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S4cNCWDovhhkv8TB2HshKoSx0+FTZYLMzlIahEIA8Z/kVeTUBXHsrMR+oTM63mFFQMdo+Uyd/qup/ccmZumcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:42:17.539988Z"},"content_sha256":"3050f08e30bfd3680f0ee9601cfbfcab147937d20773483ded1198200dfda464","schema_version":"1.0","event_id":"sha256:3050f08e30bfd3680f0ee9601cfbfcab147937d20773483ded1198200dfda464"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNKKVB3U5P6REXJAAGGGXRNQ4F/bundle.json","state_url":"https://pith.science/pith/QNKKVB3U5P6REXJAAGGGXRNQ4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNKKVB3U5P6REXJAAGGGXRNQ4F/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-01T18:42:17Z","links":{"resolver":"https://pith.science/pith/QNKKVB3U5P6REXJAAGGGXRNQ4F","bundle":"https://pith.science/pith/QNKKVB3U5P6REXJAAGGGXRNQ4F/bundle.json","state":"https://pith.science/pith/QNKKVB3U5P6REXJAAGGGXRNQ4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNKKVB3U5P6REXJAAGGGXRNQ4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QNKKVB3U5P6REXJAAGGGXRNQ4F","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":"5a0080005e1b12d8293b97c356e89b7414bbdd945830ec90c9f8b3bccf95045d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:26Z","title_canon_sha256":"4370211e7490548003ebff79e452e05254260de0b768f42dbbeead57f7254037"},"schema_version":"1.0","source":{"id":"1301.6687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6687","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6687v1","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6687","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"QNKKVB3U5P6R","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QNKKVB3U5P6REXJA","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QNKKVB3U","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:3050f08e30bfd3680f0ee9601cfbfcab147937d20773483ded1198200dfda464","target":"graph","created_at":"2026-05-18T03:35:13Z","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":"Recent work on loglinear models in probabilistic constraint logic programming is applied to first-order probabilistic reasoning. Probabilities are defined directly on the proofs of atomic formulae, and by marginalisation on the atomic formulae themselves. We use Stochastic Logic Programs (SLPs) composed of labelled and unlabelled definite clauses to define the proof probabilities. We have a conservative extension of first-order reasoning, so that, for example, there is a one-one mapping between logical and random variables. We show how, in this framework, Inductive Logic Programming (ILP) can ","authors_text":"James Cussens","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:26Z","title":"Loglinear models for first-order probabilistic reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6687","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:fed6f76e53a5a3b72097f15198fd64b4ae713287f8a8822fc7542565e90a9804","target":"record","created_at":"2026-05-18T03:35:13Z","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":"5a0080005e1b12d8293b97c356e89b7414bbdd945830ec90c9f8b3bccf95045d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:26Z","title_canon_sha256":"4370211e7490548003ebff79e452e05254260de0b768f42dbbeead57f7254037"},"schema_version":"1.0","source":{"id":"1301.6687","kind":"arxiv","version":1}},"canonical_sha256":"8354aa8774ebfd125d20018c6bc5b0e1601eed6d2f89204ca3d58f15aeb51ee8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8354aa8774ebfd125d20018c6bc5b0e1601eed6d2f89204ca3d58f15aeb51ee8","first_computed_at":"2026-05-18T03:35:13.018081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:13.018081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B0+wKJ/ihmpfxFPcIVbpMSKZr+cDLjQPqgYdhTpK2zmC12tk/pe86SV8fZ0SNob8Og7zhTeUiwy5yNmiV80bBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:13.018649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fed6f76e53a5a3b72097f15198fd64b4ae713287f8a8822fc7542565e90a9804","sha256:3050f08e30bfd3680f0ee9601cfbfcab147937d20773483ded1198200dfda464"],"state_sha256":"ef7cbab44449e6f56e3fa2ff809712d27239b51f11d4d7cf54a0bd061860b559"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQ8knVqSi1BA6JKunFbvlPOBcL6UgkhDnLVUdwfTKuJ54PpdAYTVBPosN88oLGDXv3ZBgCn0PDAENeLon+D/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:42:17.542444Z","bundle_sha256":"26f9de3fc33c55b580f362ad8be3fbe493277f07d961f12241035b0732ff488d"}}