{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZXG3JZM7RH57BAFV64MCGWN2LB","short_pith_number":"pith:ZXG3JZM7","canonical_record":{"source":{"id":"1606.08531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2016-06-28T01:43:38Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"2f8615166fc625754d085466d83c431aa1bfecccdd6b959b95c54accb3f4c92f","abstract_canon_sha256":"f5a098e4c5716f2bd58ea0a36636b7c13a5936d3e65aecc7d75f546c05da5f3a"},"schema_version":"1.0"},"canonical_sha256":"cdcdb4e59f89fbf080b5f7182359ba586224c0c0ee28bda14af1a32fa95cd3f7","source":{"kind":"arxiv","id":"1606.08531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08531","created_at":"2026-05-18T01:11:47Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08531v1","created_at":"2026-05-18T01:11:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08531","created_at":"2026-05-18T01:11:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZXG3JZM7RH57","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZXG3JZM7RH57BAFV","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZXG3JZM7","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZXG3JZM7RH57BAFV64MCGWN2LB","target":"record","payload":{"canonical_record":{"source":{"id":"1606.08531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2016-06-28T01:43:38Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"2f8615166fc625754d085466d83c431aa1bfecccdd6b959b95c54accb3f4c92f","abstract_canon_sha256":"f5a098e4c5716f2bd58ea0a36636b7c13a5936d3e65aecc7d75f546c05da5f3a"},"schema_version":"1.0"},"canonical_sha256":"cdcdb4e59f89fbf080b5f7182359ba586224c0c0ee28bda14af1a32fa95cd3f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:47.511762Z","signature_b64":"iNcJOndAudGgIzppXWom0+gV6LIC31A4b/pUrykyGQ+bcPINSp2RNaf1+ca9ySXC7u0m6PGgWS4m2rvh2mywCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdcdb4e59f89fbf080b5f7182359ba586224c0c0ee28bda14af1a32fa95cd3f7","last_reissued_at":"2026-05-18T01:11:47.511413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:47.511413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.08531","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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZli1pKibfm3NWp1NdhrBdCrULoJxAV+bdvVLHZqNCFFUDOfIKJC3K/PEMSfea5Wf6Z8rj8NiZpAdwXYlDIwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:33:17.644604Z"},"content_sha256":"81b90009860de8edec5c03d1da2213dfd5798b63381f7df7ecd73fdb0aacdaee","schema_version":"1.0","event_id":"sha256:81b90009860de8edec5c03d1da2213dfd5798b63381f7df7ecd73fdb0aacdaee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZXG3JZM7RH57BAFV64MCGWN2LB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Learning Algorithm for Relational Logistic Regression: Preliminary Results","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Bahare Fatemi, David Poole, Seyed Mehran Kazemi","submitted_at":"2016-06-28T01:43:38Z","abstract_excerpt":"Relational logistic regression (RLR) is a representation of conditional probability in terms of weighted formulae for modelling multi-relational data. In this paper, we develop a learning algorithm for RLR models. Learning an RLR model from data consists of two steps: 1- learning the set of formulae to be used in the model (a.k.a. structure learning) and learning the weight of each formula (a.k.a. parameter learning). For structure learning, we deploy Schmidt and Murphy's hierarchical assumption: first we learn a model with simple formulae, then more complex formulae are added iteratively only"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08531","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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOOjCiUzwgXFtd/UGsnfi6IpnfwGUyMITvde5A0bc1wOu7SsOYi+tNylVvjCF8f5H3G0CPQi6ZJ5NJtezoYUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:33:17.644987Z"},"content_sha256":"25ec1cf7673dff5fc5a398b0060209a3b11716e222d9907d70a92d76d8da3dae","schema_version":"1.0","event_id":"sha256:25ec1cf7673dff5fc5a398b0060209a3b11716e222d9907d70a92d76d8da3dae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXG3JZM7RH57BAFV64MCGWN2LB/bundle.json","state_url":"https://pith.science/pith/ZXG3JZM7RH57BAFV64MCGWN2LB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXG3JZM7RH57BAFV64MCGWN2LB/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-06T15:33:17Z","links":{"resolver":"https://pith.science/pith/ZXG3JZM7RH57BAFV64MCGWN2LB","bundle":"https://pith.science/pith/ZXG3JZM7RH57BAFV64MCGWN2LB/bundle.json","state":"https://pith.science/pith/ZXG3JZM7RH57BAFV64MCGWN2LB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXG3JZM7RH57BAFV64MCGWN2LB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZXG3JZM7RH57BAFV64MCGWN2LB","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":"f5a098e4c5716f2bd58ea0a36636b7c13a5936d3e65aecc7d75f546c05da5f3a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2016-06-28T01:43:38Z","title_canon_sha256":"2f8615166fc625754d085466d83c431aa1bfecccdd6b959b95c54accb3f4c92f"},"schema_version":"1.0","source":{"id":"1606.08531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08531","created_at":"2026-05-18T01:11:47Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08531v1","created_at":"2026-05-18T01:11:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08531","created_at":"2026-05-18T01:11:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZXG3JZM7RH57","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZXG3JZM7RH57BAFV","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZXG3JZM7","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:25ec1cf7673dff5fc5a398b0060209a3b11716e222d9907d70a92d76d8da3dae","target":"graph","created_at":"2026-05-18T01:11:47Z","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":"Relational logistic regression (RLR) is a representation of conditional probability in terms of weighted formulae for modelling multi-relational data. In this paper, we develop a learning algorithm for RLR models. Learning an RLR model from data consists of two steps: 1- learning the set of formulae to be used in the model (a.k.a. structure learning) and learning the weight of each formula (a.k.a. parameter learning). For structure learning, we deploy Schmidt and Murphy's hierarchical assumption: first we learn a model with simple formulae, then more complex formulae are added iteratively only","authors_text":"Bahare Fatemi, David Poole, Seyed Mehran Kazemi","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2016-06-28T01:43:38Z","title":"A Learning Algorithm for Relational Logistic Regression: Preliminary Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08531","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:81b90009860de8edec5c03d1da2213dfd5798b63381f7df7ecd73fdb0aacdaee","target":"record","created_at":"2026-05-18T01:11:47Z","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":"f5a098e4c5716f2bd58ea0a36636b7c13a5936d3e65aecc7d75f546c05da5f3a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2016-06-28T01:43:38Z","title_canon_sha256":"2f8615166fc625754d085466d83c431aa1bfecccdd6b959b95c54accb3f4c92f"},"schema_version":"1.0","source":{"id":"1606.08531","kind":"arxiv","version":1}},"canonical_sha256":"cdcdb4e59f89fbf080b5f7182359ba586224c0c0ee28bda14af1a32fa95cd3f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdcdb4e59f89fbf080b5f7182359ba586224c0c0ee28bda14af1a32fa95cd3f7","first_computed_at":"2026-05-18T01:11:47.511413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:47.511413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iNcJOndAudGgIzppXWom0+gV6LIC31A4b/pUrykyGQ+bcPINSp2RNaf1+ca9ySXC7u0m6PGgWS4m2rvh2mywCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:47.511762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81b90009860de8edec5c03d1da2213dfd5798b63381f7df7ecd73fdb0aacdaee","sha256:25ec1cf7673dff5fc5a398b0060209a3b11716e222d9907d70a92d76d8da3dae"],"state_sha256":"addb6d5a9f492f5e2200937611651d98afcf1eef48eb38b83e19e17ef4db422a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMpdLQOuWYMbxxC8ayUOtrQuFmaoLqzH1gdDjyfifIog9bCQAYwUcZUAqAtrl+UKsNu0kaa4MXgVhaRJz9dqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:33:17.647271Z","bundle_sha256":"bcbc8b9a0929df7bd6bd59adb14197455f8737a3a07f104bf2e4b3d217b71913"}}