{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WB3MDQQH3UKYTCQZSKCGNZBPT4","short_pith_number":"pith:WB3MDQQH","schema_version":"1.0","canonical_sha256":"b076c1c207dd15898a19928466e42f9f3294cd2af60ec6aab6dde2312500690e","source":{"kind":"arxiv","id":"1107.4067","version":2},"attestation_state":"computed","paper":{"title":"Finding Non-overlapping Clusters for Generalized Inference Over Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Divyanshu Vats, Jos\\'e M. F. Moura","submitted_at":"2011-07-20T18:55:03Z","abstract_excerpt":"Graphical models use graphs to compactly capture stochastic dependencies amongst a collection of random variables. Inference over graphical models corresponds to finding marginal probability distributions given joint probability distributions. In general, this is computationally intractable, which has led to a quest for finding efficient approximate inference algorithms. We propose a framework for generalized inference over graphical models that can be used as a wrapper for improving the estimates of approximate inference algorithms. Instead of applying an inference algorithm to the original g"},"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":"1107.4067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-07-20T18:55:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fe42ef058db2fb89cec07d050373627ede5b812f007b544e7c92f186640f5220","abstract_canon_sha256":"613a7cd09b101844fa1b3a408f31482aa2dde0c2327971c0b81aad51686804fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:27.904220Z","signature_b64":"QutUvBcvxD362ieDkPEiW8p+rd60jh7INWxB1PoN8dSQJgoZlPlotCsbE3+QWcUoUMXITGe4fS7W82JuU3+hDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b076c1c207dd15898a19928466e42f9f3294cd2af60ec6aab6dde2312500690e","last_reissued_at":"2026-05-18T03:29:27.903579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:27.903579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Non-overlapping Clusters for Generalized Inference Over Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Divyanshu Vats, Jos\\'e M. F. Moura","submitted_at":"2011-07-20T18:55:03Z","abstract_excerpt":"Graphical models use graphs to compactly capture stochastic dependencies amongst a collection of random variables. Inference over graphical models corresponds to finding marginal probability distributions given joint probability distributions. In general, this is computationally intractable, which has led to a quest for finding efficient approximate inference algorithms. We propose a framework for generalized inference over graphical models that can be used as a wrapper for improving the estimates of approximate inference algorithms. Instead of applying an inference algorithm to the original g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4067","kind":"arxiv","version":2},"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":"1107.4067","created_at":"2026-05-18T03:29:27.903705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4067v2","created_at":"2026-05-18T03:29:27.903705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4067","created_at":"2026-05-18T03:29:27.903705+00:00"},{"alias_kind":"pith_short_12","alias_value":"WB3MDQQH3UKY","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WB3MDQQH3UKYTCQZ","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WB3MDQQH","created_at":"2026-05-18T12:26:44.992195+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/WB3MDQQH3UKYTCQZSKCGNZBPT4","json":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4.json","graph_json":"https://pith.science/api/pith-number/WB3MDQQH3UKYTCQZSKCGNZBPT4/graph.json","events_json":"https://pith.science/api/pith-number/WB3MDQQH3UKYTCQZSKCGNZBPT4/events.json","paper":"https://pith.science/paper/WB3MDQQH"},"agent_actions":{"view_html":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4","download_json":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4.json","view_paper":"https://pith.science/paper/WB3MDQQH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4067&json=true","fetch_graph":"https://pith.science/api/pith-number/WB3MDQQH3UKYTCQZSKCGNZBPT4/graph.json","fetch_events":"https://pith.science/api/pith-number/WB3MDQQH3UKYTCQZSKCGNZBPT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4/action/storage_attestation","attest_author":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4/action/author_attestation","sign_citation":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4/action/citation_signature","submit_replication":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4/action/replication_record"}},"created_at":"2026-05-18T03:29:27.903705+00:00","updated_at":"2026-05-18T03:29:27.903705+00:00"}