{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DK6AVH6BMCXCPKHB23AIWLYGS4","short_pith_number":"pith:DK6AVH6B","schema_version":"1.0","canonical_sha256":"1abc0a9fc160ae27a8e1d6c08b2f06970b936f2f119452465f6f714aa653e3ac","source":{"kind":"arxiv","id":"1206.5292","version":1},"attestation_state":"computed","paper":{"title":"Markov Logic in Infinite Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Parag Singla, Pedro Domingos","submitted_at":"2012-06-20T15:18:47Z","abstract_excerpt":"Combining first-order logic and probability has long been a goal of AI. Markov logic (Richardson & Domingos, 2006) accomplishes this by attaching weights to first-order formulas and viewing them as templates for features of Markov networks. Unfortunately, it does not have the full power of first-order logic, because it is only defined for finite domains. This paper extends Markov logic to infinite domains, by casting it in the framework of Gibbs measures (Georgii, 1988). We show that a Markov logic network (MLN) admits a Gibbs measure as long as each ground atom has a finite number of neighbor"},"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":"1206.5292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:18:47Z","cross_cats_sorted":[],"title_canon_sha256":"a2cc4a84e8dbf417ba43f250827169a8cd48b49b20e6c65dfd70ede105c6aafc","abstract_canon_sha256":"dd6ad602a8590a9ab35f4a6e3704e1f0b1f78d1a279171676989a2306d8e72c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:40.497666Z","signature_b64":"ZNaghxYKxOc0/lUf9sv0O72vx2A9RbzKQWPMsFadzFF/AJgRNQg46iDZhccfGbKJQsOJ3hsZ3p0NMhzM/5DrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1abc0a9fc160ae27a8e1d6c08b2f06970b936f2f119452465f6f714aa653e3ac","last_reissued_at":"2026-05-18T03:52:40.497071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:40.497071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov Logic in Infinite Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Parag Singla, Pedro Domingos","submitted_at":"2012-06-20T15:18:47Z","abstract_excerpt":"Combining first-order logic and probability has long been a goal of AI. Markov logic (Richardson & Domingos, 2006) accomplishes this by attaching weights to first-order formulas and viewing them as templates for features of Markov networks. Unfortunately, it does not have the full power of first-order logic, because it is only defined for finite domains. This paper extends Markov logic to infinite domains, by casting it in the framework of Gibbs measures (Georgii, 1988). We show that a Markov logic network (MLN) admits a Gibbs measure as long as each ground atom has a finite number of neighbor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5292","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.5292","created_at":"2026-05-18T03:52:40.497168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5292v1","created_at":"2026-05-18T03:52:40.497168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5292","created_at":"2026-05-18T03:52:40.497168+00:00"},{"alias_kind":"pith_short_12","alias_value":"DK6AVH6BMCXC","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DK6AVH6BMCXCPKHB","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DK6AVH6B","created_at":"2026-05-18T12:27:04.183437+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/DK6AVH6BMCXCPKHB23AIWLYGS4","json":"https://pith.science/pith/DK6AVH6BMCXCPKHB23AIWLYGS4.json","graph_json":"https://pith.science/api/pith-number/DK6AVH6BMCXCPKHB23AIWLYGS4/graph.json","events_json":"https://pith.science/api/pith-number/DK6AVH6BMCXCPKHB23AIWLYGS4/events.json","paper":"https://pith.science/paper/DK6AVH6B"},"agent_actions":{"view_html":"https://pith.science/pith/DK6AVH6BMCXCPKHB23AIWLYGS4","download_json":"https://pith.science/pith/DK6AVH6BMCXCPKHB23AIWLYGS4.json","view_paper":"https://pith.science/paper/DK6AVH6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5292&json=true","fetch_graph":"https://pith.science/api/pith-number/DK6AVH6BMCXCPKHB23AIWLYGS4/graph.json","fetch_events":"https://pith.science/api/pith-number/DK6AVH6BMCXCPKHB23AIWLYGS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DK6AVH6BMCXCPKHB23AIWLYGS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DK6AVH6BMCXCPKHB23AIWLYGS4/action/storage_attestation","attest_author":"https://pith.science/pith/DK6AVH6BMCXCPKHB23AIWLYGS4/action/author_attestation","sign_citation":"https://pith.science/pith/DK6AVH6BMCXCPKHB23AIWLYGS4/action/citation_signature","submit_replication":"https://pith.science/pith/DK6AVH6BMCXCPKHB23AIWLYGS4/action/replication_record"}},"created_at":"2026-05-18T03:52:40.497168+00:00","updated_at":"2026-05-18T03:52:40.497168+00:00"}