{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WB3MDQQH3UKYTCQZSKCGNZBPT4","short_pith_number":"pith:WB3MDQQH","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"},"canonical_sha256":"b076c1c207dd15898a19928466e42f9f3294cd2af60ec6aab6dde2312500690e","source":{"kind":"arxiv","id":"1107.4067","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4067","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4067v2","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4067","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"pith_short_12","alias_value":"WB3MDQQH3UKY","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WB3MDQQH3UKYTCQZ","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WB3MDQQH","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WB3MDQQH3UKYTCQZSKCGNZBPT4","target":"record","payload":{"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"},"canonical_sha256":"b076c1c207dd15898a19928466e42f9f3294cd2af60ec6aab6dde2312500690e","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"},"source_kind":"arxiv","source_id":"1107.4067","source_version":2,"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-18T03:29:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdtzPWPw+HHCHVmh0mDlSZ8C/Kn6EhAa5813g5EZsplSduKnQV7bNhfRY8X0nhHSNOY6ba4UKsCOzxTXNY9jAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:48:51.893820Z"},"content_sha256":"3735a1ea984f1913ccbc4039c5f5a1867b7fade028bc74b579c375cee2cfa807","schema_version":"1.0","event_id":"sha256:3735a1ea984f1913ccbc4039c5f5a1867b7fade028bc74b579c375cee2cfa807"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WB3MDQQH3UKYTCQZSKCGNZBPT4","target":"graph","payload":{"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"},"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-18T03:29:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+U8u6GoLWcfxaLpQSKxjvLK1T8xs9sPRZnxy5/jZyCxf8y9sk3SWp6eiw9WzEkdmwnX0QYE/mOsJVYphUVYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:48:51.894162Z"},"content_sha256":"4457f0278ee4288f62123b3e409744c3cd6c1d5804672d1834b1d6781cfd8013","schema_version":"1.0","event_id":"sha256:4457f0278ee4288f62123b3e409744c3cd6c1d5804672d1834b1d6781cfd8013"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4/bundle.json","state_url":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4/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-05T15:48:51Z","links":{"resolver":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4","bundle":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4/bundle.json","state":"https://pith.science/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WB3MDQQH3UKYTCQZSKCGNZBPT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WB3MDQQH3UKYTCQZSKCGNZBPT4","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":"613a7cd09b101844fa1b3a408f31482aa2dde0c2327971c0b81aad51686804fa","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-07-20T18:55:03Z","title_canon_sha256":"fe42ef058db2fb89cec07d050373627ede5b812f007b544e7c92f186640f5220"},"schema_version":"1.0","source":{"id":"1107.4067","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4067","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4067v2","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4067","created_at":"2026-05-18T03:29:27Z"},{"alias_kind":"pith_short_12","alias_value":"WB3MDQQH3UKY","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WB3MDQQH3UKYTCQZ","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WB3MDQQH","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:4457f0278ee4288f62123b3e409744c3cd6c1d5804672d1834b1d6781cfd8013","target":"graph","created_at":"2026-05-18T03:29:27Z","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":"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","authors_text":"Divyanshu Vats, Jos\\'e M. F. Moura","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-07-20T18:55:03Z","title":"Finding Non-overlapping Clusters for Generalized Inference Over Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4067","kind":"arxiv","version":2},"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:3735a1ea984f1913ccbc4039c5f5a1867b7fade028bc74b579c375cee2cfa807","target":"record","created_at":"2026-05-18T03:29:27Z","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":"613a7cd09b101844fa1b3a408f31482aa2dde0c2327971c0b81aad51686804fa","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-07-20T18:55:03Z","title_canon_sha256":"fe42ef058db2fb89cec07d050373627ede5b812f007b544e7c92f186640f5220"},"schema_version":"1.0","source":{"id":"1107.4067","kind":"arxiv","version":2}},"canonical_sha256":"b076c1c207dd15898a19928466e42f9f3294cd2af60ec6aab6dde2312500690e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b076c1c207dd15898a19928466e42f9f3294cd2af60ec6aab6dde2312500690e","first_computed_at":"2026-05-18T03:29:27.903579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:27.903579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QutUvBcvxD362ieDkPEiW8p+rd60jh7INWxB1PoN8dSQJgoZlPlotCsbE3+QWcUoUMXITGe4fS7W82JuU3+hDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:27.904220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4067","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3735a1ea984f1913ccbc4039c5f5a1867b7fade028bc74b579c375cee2cfa807","sha256:4457f0278ee4288f62123b3e409744c3cd6c1d5804672d1834b1d6781cfd8013"],"state_sha256":"c5f4848750af64afe90a1c78bfd8339dad5dc5f71a62518480118ba74514a0f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhbQH24jW1zDOs5X/66pyBNcg/e4Dd0kcLa0ri0SSsL6y2jlEYJaB41ldSJCyK3fyFKm5F4RVs/gEKZxaCy1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:48:51.896156Z","bundle_sha256":"0ee9279fb2ac6f9e2e7a743b536f46d0039d61d19e9be5e23bd31feb2d29af2c"}}