{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UKFPKMUMLGIMRFVGXYHS3NZKHQ","short_pith_number":"pith:UKFPKMUM","canonical_record":{"source":{"id":"1401.3478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T05:33:29Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"9c75f19bf04a1a8138cd8f2375efe719115c54aec0801345c10fa8f04676fdda","abstract_canon_sha256":"b357ca166856b8083e151deac59619bc5e87591a6ad2fe6edaadeb577d7c8065"},"schema_version":"1.0"},"canonical_sha256":"a28af5328c5990c896a6be0f2db72a3c248e6c4f30f39374ba95f4e340cd0dc2","source":{"kind":"arxiv","id":"1401.3478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3478","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3478v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3478","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"UKFPKMUMLGIM","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UKFPKMUMLGIMRFVG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UKFPKMUM","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UKFPKMUMLGIMRFVGXYHS3NZKHQ","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T05:33:29Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"9c75f19bf04a1a8138cd8f2375efe719115c54aec0801345c10fa8f04676fdda","abstract_canon_sha256":"b357ca166856b8083e151deac59619bc5e87591a6ad2fe6edaadeb577d7c8065"},"schema_version":"1.0"},"canonical_sha256":"a28af5328c5990c896a6be0f2db72a3c248e6c4f30f39374ba95f4e340cd0dc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:08.787301Z","signature_b64":"gUdExhIkYrnpm/YychWLr31jwWIIvth7AMZrdQhE5kRBvh2KstX/h8N3y4I5UbO+E4nd+RjcddC7Qx//qSL9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a28af5328c5990c896a6be0f2db72a3c248e6c4f30f39374ba95f4e340cd0dc2","last_reissued_at":"2026-05-18T03:02:08.786662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:08.786662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3478","source_version":1,"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:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/3TP+xHesG41oqX3dKoM4ie3NXPH6pj+ArPJhHZxlR5zGmlwo/+FaxMEWcr1dGZlA4+YOLvn36oMDpmpGJvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:45:45.536745Z"},"content_sha256":"2668140a1efc4c398552ee90e7df8177b6f5eb0ff11e8e28ab14c9d7b87bd75f","schema_version":"1.0","event_id":"sha256:2668140a1efc4c398552ee90e7df8177b6f5eb0ff11e8e28ab14c9d7b87bd75f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UKFPKMUMLGIMRFVGXYHS3NZKHQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Markov Network Structure Discovery Using Independence Tests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dimitris Margaritis, Facundo Bromberg, Vasant Honavar","submitted_at":"2014-01-15T05:33:29Z","abstract_excerpt":"We present two algorithms for learning the structure of a Markov network from data:  GSMN* and GSIMN.  Both algorithms use statistical independence tests to infer the structure by successively constraining the set of structures consistent with the results of these tests.  Until very recently, algorithms for structure learning were based on maximum likelihood estimation, which has been proved to be NP-hard for Markov networks due to the difficulty of estimating the parameters of the network, needed for the computation of the data likelihood.  The independence-based approach does not require the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3478","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"},"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:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEg9rJ/QnPRhwFbmaPG+N437vVftVyyS+D7Wi03dR524dPKDi/CnHbKCZPeo1uRfk+3Gzz93kks5fCqUj3clDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:45:45.537084Z"},"content_sha256":"0b6cb9b023f2a04ca0327da9fdd8fbaf1df582755932b1249bd7d5e6535c26d3","schema_version":"1.0","event_id":"sha256:0b6cb9b023f2a04ca0327da9fdd8fbaf1df582755932b1249bd7d5e6535c26d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKFPKMUMLGIMRFVGXYHS3NZKHQ/bundle.json","state_url":"https://pith.science/pith/UKFPKMUMLGIMRFVGXYHS3NZKHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKFPKMUMLGIMRFVGXYHS3NZKHQ/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-05-28T10:45:45Z","links":{"resolver":"https://pith.science/pith/UKFPKMUMLGIMRFVGXYHS3NZKHQ","bundle":"https://pith.science/pith/UKFPKMUMLGIMRFVGXYHS3NZKHQ/bundle.json","state":"https://pith.science/pith/UKFPKMUMLGIMRFVGXYHS3NZKHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKFPKMUMLGIMRFVGXYHS3NZKHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UKFPKMUMLGIMRFVGXYHS3NZKHQ","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":"b357ca166856b8083e151deac59619bc5e87591a6ad2fe6edaadeb577d7c8065","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T05:33:29Z","title_canon_sha256":"9c75f19bf04a1a8138cd8f2375efe719115c54aec0801345c10fa8f04676fdda"},"schema_version":"1.0","source":{"id":"1401.3478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3478","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3478v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3478","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"UKFPKMUMLGIM","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UKFPKMUMLGIMRFVG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UKFPKMUM","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:0b6cb9b023f2a04ca0327da9fdd8fbaf1df582755932b1249bd7d5e6535c26d3","target":"graph","created_at":"2026-05-18T03:02:08Z","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 present two algorithms for learning the structure of a Markov network from data:  GSMN* and GSIMN.  Both algorithms use statistical independence tests to infer the structure by successively constraining the set of structures consistent with the results of these tests.  Until very recently, algorithms for structure learning were based on maximum likelihood estimation, which has been proved to be NP-hard for Markov networks due to the difficulty of estimating the parameters of the network, needed for the computation of the data likelihood.  The independence-based approach does not require the","authors_text":"Dimitris Margaritis, Facundo Bromberg, Vasant Honavar","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T05:33:29Z","title":"Efficient Markov Network Structure Discovery Using Independence Tests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3478","kind":"arxiv","version":1},"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:2668140a1efc4c398552ee90e7df8177b6f5eb0ff11e8e28ab14c9d7b87bd75f","target":"record","created_at":"2026-05-18T03:02:08Z","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":"b357ca166856b8083e151deac59619bc5e87591a6ad2fe6edaadeb577d7c8065","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T05:33:29Z","title_canon_sha256":"9c75f19bf04a1a8138cd8f2375efe719115c54aec0801345c10fa8f04676fdda"},"schema_version":"1.0","source":{"id":"1401.3478","kind":"arxiv","version":1}},"canonical_sha256":"a28af5328c5990c896a6be0f2db72a3c248e6c4f30f39374ba95f4e340cd0dc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a28af5328c5990c896a6be0f2db72a3c248e6c4f30f39374ba95f4e340cd0dc2","first_computed_at":"2026-05-18T03:02:08.786662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:08.786662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gUdExhIkYrnpm/YychWLr31jwWIIvth7AMZrdQhE5kRBvh2KstX/h8N3y4I5UbO+E4nd+RjcddC7Qx//qSL9BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:08.787301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2668140a1efc4c398552ee90e7df8177b6f5eb0ff11e8e28ab14c9d7b87bd75f","sha256:0b6cb9b023f2a04ca0327da9fdd8fbaf1df582755932b1249bd7d5e6535c26d3"],"state_sha256":"c34c22e482124636f81e494b6213ebf2ffdcf9b2073e0428078cc71092403789"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UKt5ko+ks5q4bVVDVRaDf7xEXm0jGccB7M87XvhXcejHgerRhT4yaOO26zyOGRsAjNjTa4kWBxLkP982jvE3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:45:45.539003Z","bundle_sha256":"f5be77023290ac7f9e5ef101f320666b9f20141e197f7437165400328291c643"}}