{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MQUAF5SCARFJHN6UGQDK2VSFKT","short_pith_number":"pith:MQUAF5SC","canonical_record":{"source":{"id":"1204.5540","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-04-25T02:39:40Z","cross_cats_sorted":[],"title_canon_sha256":"667f1b901edc5468ff51fed53db8475662c32dbba22bbfd74da5001eb329467e","abstract_canon_sha256":"fb6ced0e7d5d22e14450a23b9ec16b3f7e6d840d92e894d850de42d1e08febbf"},"schema_version":"1.0"},"canonical_sha256":"642802f642044a93b7d43406ad564554f9378e3af6a4ee051738f113950af836","source":{"kind":"arxiv","id":"1204.5540","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5540","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5540v3","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5540","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"MQUAF5SCARFJ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MQUAF5SCARFJHN6U","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MQUAF5SC","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MQUAF5SCARFJHN6UGQDK2VSFKT","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5540","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-04-25T02:39:40Z","cross_cats_sorted":[],"title_canon_sha256":"667f1b901edc5468ff51fed53db8475662c32dbba22bbfd74da5001eb329467e","abstract_canon_sha256":"fb6ced0e7d5d22e14450a23b9ec16b3f7e6d840d92e894d850de42d1e08febbf"},"schema_version":"1.0"},"canonical_sha256":"642802f642044a93b7d43406ad564554f9378e3af6a4ee051738f113950af836","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:13.021905Z","signature_b64":"fkvRtEQOgaQ85IZuKQHRzTxTSjuDEneuFOhFx7DG5zLJw9nozBnwwdKCnu5STqOScPCHdQCd40b3FgtWfVdACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"642802f642044a93b7d43406ad564554f9378e3af6a4ee051738f113950af836","last_reissued_at":"2026-05-18T03:00:13.021135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:13.021135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5540","source_version":3,"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:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwhg8Gey3Oldle2QnIyneXqgd7vnpGEvqsoHkKugrqqcTbc8uES4uy6GIGs9el56ahU0KDOKv8EcYiS7JLNQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:12:00.941806Z"},"content_sha256":"bade0caae6219c31c2f164c0ef8645ae70b7f18d5a1037dc2979f5ce20e58973","schema_version":"1.0","event_id":"sha256:bade0caae6219c31c2f164c0ef8645ae70b7f18d5a1037dc2979f5ce20e58973"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MQUAF5SCARFJHN6UGQDK2VSFKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Loosely Connected Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jian Ni, R. Srikant, Rui Wu","submitted_at":"2012-04-25T02:39:40Z","abstract_excerpt":"We consider the structure learning problem for graphical models that we call loosely connected Markov random fields, in which the number of short paths between any pair of nodes is small, and present a new conditional independence test based algorithm for learning the underlying graph structure. The novel maximization step in our algorithm ensures that the true edges are detected correctly even when there are short cycles in the graph. The number of samples required by our algorithm is C*log p, where p is the size of the graph and the constant C depends on the parameters of the model. We show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5540","kind":"arxiv","version":3},"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:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NpBvsSIwCT1xZYmzwTA9th8r3h0Wt03gIFPScCmumCiKVealIBn+fBIzXODm7W6wkIiJAFrOTE6K0D7XcfKkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:12:00.942498Z"},"content_sha256":"d5e07ff14d7c00c39a97a185e61643eb4946e944236db302711651281939a97c","schema_version":"1.0","event_id":"sha256:d5e07ff14d7c00c39a97a185e61643eb4946e944236db302711651281939a97c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQUAF5SCARFJHN6UGQDK2VSFKT/bundle.json","state_url":"https://pith.science/pith/MQUAF5SCARFJHN6UGQDK2VSFKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQUAF5SCARFJHN6UGQDK2VSFKT/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-07T06:12:00Z","links":{"resolver":"https://pith.science/pith/MQUAF5SCARFJHN6UGQDK2VSFKT","bundle":"https://pith.science/pith/MQUAF5SCARFJHN6UGQDK2VSFKT/bundle.json","state":"https://pith.science/pith/MQUAF5SCARFJHN6UGQDK2VSFKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQUAF5SCARFJHN6UGQDK2VSFKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MQUAF5SCARFJHN6UGQDK2VSFKT","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":"fb6ced0e7d5d22e14450a23b9ec16b3f7e6d840d92e894d850de42d1e08febbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-04-25T02:39:40Z","title_canon_sha256":"667f1b901edc5468ff51fed53db8475662c32dbba22bbfd74da5001eb329467e"},"schema_version":"1.0","source":{"id":"1204.5540","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5540","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5540v3","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5540","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"MQUAF5SCARFJ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MQUAF5SCARFJHN6U","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MQUAF5SC","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:d5e07ff14d7c00c39a97a185e61643eb4946e944236db302711651281939a97c","target":"graph","created_at":"2026-05-18T03:00:13Z","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":"We consider the structure learning problem for graphical models that we call loosely connected Markov random fields, in which the number of short paths between any pair of nodes is small, and present a new conditional independence test based algorithm for learning the underlying graph structure. The novel maximization step in our algorithm ensures that the true edges are detected correctly even when there are short cycles in the graph. The number of samples required by our algorithm is C*log p, where p is the size of the graph and the constant C depends on the parameters of the model. We show ","authors_text":"Jian Ni, R. Srikant, Rui Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-04-25T02:39:40Z","title":"Learning Loosely Connected Markov Random Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5540","kind":"arxiv","version":3},"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:bade0caae6219c31c2f164c0ef8645ae70b7f18d5a1037dc2979f5ce20e58973","target":"record","created_at":"2026-05-18T03:00:13Z","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":"fb6ced0e7d5d22e14450a23b9ec16b3f7e6d840d92e894d850de42d1e08febbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-04-25T02:39:40Z","title_canon_sha256":"667f1b901edc5468ff51fed53db8475662c32dbba22bbfd74da5001eb329467e"},"schema_version":"1.0","source":{"id":"1204.5540","kind":"arxiv","version":3}},"canonical_sha256":"642802f642044a93b7d43406ad564554f9378e3af6a4ee051738f113950af836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"642802f642044a93b7d43406ad564554f9378e3af6a4ee051738f113950af836","first_computed_at":"2026-05-18T03:00:13.021135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:13.021135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fkvRtEQOgaQ85IZuKQHRzTxTSjuDEneuFOhFx7DG5zLJw9nozBnwwdKCnu5STqOScPCHdQCd40b3FgtWfVdACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:13.021905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5540","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bade0caae6219c31c2f164c0ef8645ae70b7f18d5a1037dc2979f5ce20e58973","sha256:d5e07ff14d7c00c39a97a185e61643eb4946e944236db302711651281939a97c"],"state_sha256":"107dec9c16e76479265f81c2ce98dfc20b9f3722835dfc0819ed26cc80b716b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eBeWpSRvdmKAIy6E/Em/3nP+e/Cw1G5dMxmHQ//HHa+vQI99+8HMer2qOqf1GJVk6xLNKrbECpnuMdzmJ+u9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:12:00.946707Z","bundle_sha256":"b8df1c4dcfac78b96cc8f79bb5ef26d438af1ace40af5cb451d54f5a0f10fe1b"}}