{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CZRANUHXRK74WWAWJC6N7YJCOZ","short_pith_number":"pith:CZRANUHX","schema_version":"1.0","canonical_sha256":"166206d0f78abfcb581648bcdfe1227669545166ec43091187e9a1455eb8656a","source":{"kind":"arxiv","id":"2606.23715","version":1},"attestation_state":"computed","paper":{"title":"Random coloured digraphs defined by a Markov logic network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.LO","authors_text":"Vera Koponen, Yasmin Tousinejad","submitted_at":"2026-06-16T11:49:14Z","abstract_excerpt":"A Markov Logic Network (MLN) is a probabilistic relational model used in Statistical Relational Artificial Intelligence for defining a probability distribution on the set of possible worlds with domain $D$ for an arbitrary finite domain $D$. An MLN consists of soft constraints with associated weights which are nonnegative real numbers. In this study we consider a language speaking about a property $P(x)$ and a relation $R(x, y)$. We consider an MLN for which every Boolean combination of $P(x)$ and $R(x, y)$ is a soft constraint (with associated weight). Let $n$ denote the size (cardinality) of"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.23715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-06-16T11:49:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5afad8e20e4bdc94f307c141da3a87bca3c481d31fe99935df437cc13511bb75","abstract_canon_sha256":"ab47442583102dd3ef672a2db4abb7aca2091dd9a1096f43f7bdb37b92abf934"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:24.128181Z","signature_b64":"iKLfIDkzR4n97pyeAi6gW+6ObVylPxnubvYW5NNjSiDmMOoAaWE0eRSOXCK8AiEmQIR1PMJyTPWjjDeThSZHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"166206d0f78abfcb581648bcdfe1227669545166ec43091187e9a1455eb8656a","last_reissued_at":"2026-06-24T00:14:24.127772Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:24.127772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random coloured digraphs defined by a Markov logic network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.LO","authors_text":"Vera Koponen, Yasmin Tousinejad","submitted_at":"2026-06-16T11:49:14Z","abstract_excerpt":"A Markov Logic Network (MLN) is a probabilistic relational model used in Statistical Relational Artificial Intelligence for defining a probability distribution on the set of possible worlds with domain $D$ for an arbitrary finite domain $D$. An MLN consists of soft constraints with associated weights which are nonnegative real numbers. In this study we consider a language speaking about a property $P(x)$ and a relation $R(x, y)$. We consider an MLN for which every Boolean combination of $P(x)$ and $R(x, y)$ is a soft constraint (with associated weight). Let $n$ denote the size (cardinality) of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23715","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.23715/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.23715","created_at":"2026-06-24T00:14:24.127843+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23715v1","created_at":"2026-06-24T00:14:24.127843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23715","created_at":"2026-06-24T00:14:24.127843+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZRANUHXRK74","created_at":"2026-06-24T00:14:24.127843+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZRANUHXRK74WWAW","created_at":"2026-06-24T00:14:24.127843+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZRANUHX","created_at":"2026-06-24T00:14:24.127843+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CZRANUHXRK74WWAWJC6N7YJCOZ","json":"https://pith.science/pith/CZRANUHXRK74WWAWJC6N7YJCOZ.json","graph_json":"https://pith.science/api/pith-number/CZRANUHXRK74WWAWJC6N7YJCOZ/graph.json","events_json":"https://pith.science/api/pith-number/CZRANUHXRK74WWAWJC6N7YJCOZ/events.json","paper":"https://pith.science/paper/CZRANUHX"},"agent_actions":{"view_html":"https://pith.science/pith/CZRANUHXRK74WWAWJC6N7YJCOZ","download_json":"https://pith.science/pith/CZRANUHXRK74WWAWJC6N7YJCOZ.json","view_paper":"https://pith.science/paper/CZRANUHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23715&json=true","fetch_graph":"https://pith.science/api/pith-number/CZRANUHXRK74WWAWJC6N7YJCOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CZRANUHXRK74WWAWJC6N7YJCOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZRANUHXRK74WWAWJC6N7YJCOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZRANUHXRK74WWAWJC6N7YJCOZ/action/storage_attestation","attest_author":"https://pith.science/pith/CZRANUHXRK74WWAWJC6N7YJCOZ/action/author_attestation","sign_citation":"https://pith.science/pith/CZRANUHXRK74WWAWJC6N7YJCOZ/action/citation_signature","submit_replication":"https://pith.science/pith/CZRANUHXRK74WWAWJC6N7YJCOZ/action/replication_record"}},"created_at":"2026-06-24T00:14:24.127843+00:00","updated_at":"2026-06-24T00:14:24.127843+00:00"}