{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:46QW2OV67P673QRYF7VQDBWRR3","short_pith_number":"pith:46QW2OV6","schema_version":"1.0","canonical_sha256":"e7a16d3abefbfdfdc2382feb0186d18ecba5016a9b2bed63237d37f3d0ea37f8","source":{"kind":"arxiv","id":"1610.01525","version":1},"attestation_state":"computed","paper":{"title":"Lifted Message Passing for the Generalized Belief Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Udi Apsel","submitted_at":"2016-10-05T16:56:02Z","abstract_excerpt":"We introduce the lifted Generalized Belief Propagation (GBP) message passing algorithm, for the computation of sum-product queries in Probabilistic Relational Models (e.g. Markov logic network). The algorithm forms a compact region graph and establishes a modified version of message passing, which mimics the GBP behavior in a corresponding ground model. The compact graph is obtained by exploiting a graphical representation of clusters, which reduces cluster symmetry detection to isomorphism tests on small local graphs. The framework is thus capable of handling complex models, while remaining d"},"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":"1610.01525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-10-05T16:56:02Z","cross_cats_sorted":[],"title_canon_sha256":"5578eef28b077336348f4edf3b57720cfd5df7f62d1ee7083a819a507d008737","abstract_canon_sha256":"1d18bc411abe90884b72d66045953f8f6feb3a2fab92ecf586677a417272bb3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:06.952385Z","signature_b64":"ZP1kpzB6081Ecix2DE9P8iwmBQ3Pa+0HS5G/pSQWMqsNeSbk1kJ0UP3P7TpUg3pTwm2iBTn3yt0cwOGagvmLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7a16d3abefbfdfdc2382feb0186d18ecba5016a9b2bed63237d37f3d0ea37f8","last_reissued_at":"2026-05-18T01:03:06.951826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:06.951826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lifted Message Passing for the Generalized Belief Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Udi Apsel","submitted_at":"2016-10-05T16:56:02Z","abstract_excerpt":"We introduce the lifted Generalized Belief Propagation (GBP) message passing algorithm, for the computation of sum-product queries in Probabilistic Relational Models (e.g. Markov logic network). The algorithm forms a compact region graph and establishes a modified version of message passing, which mimics the GBP behavior in a corresponding ground model. The compact graph is obtained by exploiting a graphical representation of clusters, which reduces cluster symmetry detection to isomorphism tests on small local graphs. The framework is thus capable of handling complex models, while remaining d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01525","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":"1610.01525","created_at":"2026-05-18T01:03:06.951897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01525v1","created_at":"2026-05-18T01:03:06.951897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01525","created_at":"2026-05-18T01:03:06.951897+00:00"},{"alias_kind":"pith_short_12","alias_value":"46QW2OV67P67","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"46QW2OV67P673QRY","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"46QW2OV6","created_at":"2026-05-18T12:29:58.707656+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/46QW2OV67P673QRYF7VQDBWRR3","json":"https://pith.science/pith/46QW2OV67P673QRYF7VQDBWRR3.json","graph_json":"https://pith.science/api/pith-number/46QW2OV67P673QRYF7VQDBWRR3/graph.json","events_json":"https://pith.science/api/pith-number/46QW2OV67P673QRYF7VQDBWRR3/events.json","paper":"https://pith.science/paper/46QW2OV6"},"agent_actions":{"view_html":"https://pith.science/pith/46QW2OV67P673QRYF7VQDBWRR3","download_json":"https://pith.science/pith/46QW2OV67P673QRYF7VQDBWRR3.json","view_paper":"https://pith.science/paper/46QW2OV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01525&json=true","fetch_graph":"https://pith.science/api/pith-number/46QW2OV67P673QRYF7VQDBWRR3/graph.json","fetch_events":"https://pith.science/api/pith-number/46QW2OV67P673QRYF7VQDBWRR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46QW2OV67P673QRYF7VQDBWRR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46QW2OV67P673QRYF7VQDBWRR3/action/storage_attestation","attest_author":"https://pith.science/pith/46QW2OV67P673QRYF7VQDBWRR3/action/author_attestation","sign_citation":"https://pith.science/pith/46QW2OV67P673QRYF7VQDBWRR3/action/citation_signature","submit_replication":"https://pith.science/pith/46QW2OV67P673QRYF7VQDBWRR3/action/replication_record"}},"created_at":"2026-05-18T01:03:06.951897+00:00","updated_at":"2026-05-18T01:03:06.951897+00:00"}