{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I7SI2F4RCPQS4Z633KKGCZAQJ6","short_pith_number":"pith:I7SI2F4R","canonical_record":{"source":{"id":"1407.8088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-30T15:24:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fea123e183791e4841d8c0b23610f4c982c815d36e0b259d9a9c4c7b4be0f35d","abstract_canon_sha256":"e2088c86a48711a22a6d1badf0f9a74ac724276d424a11ff447385caa6dc3b50"},"schema_version":"1.0"},"canonical_sha256":"47e48d179113e12e67dbda946164104f9c7bce62ebfe2998db0b0fefcaca02bf","source":{"kind":"arxiv","id":"1407.8088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.8088","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1407.8088v1","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8088","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"I7SI2F4RCPQS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I7SI2F4RCPQS4Z63","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I7SI2F4R","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I7SI2F4RCPQS4Z633KKGCZAQJ6","target":"record","payload":{"canonical_record":{"source":{"id":"1407.8088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-30T15:24:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fea123e183791e4841d8c0b23610f4c982c815d36e0b259d9a9c4c7b4be0f35d","abstract_canon_sha256":"e2088c86a48711a22a6d1badf0f9a74ac724276d424a11ff447385caa6dc3b50"},"schema_version":"1.0"},"canonical_sha256":"47e48d179113e12e67dbda946164104f9c7bce62ebfe2998db0b0fefcaca02bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:13.627862Z","signature_b64":"TYM3tK1K7T173QGi589VT4xgSCy0gghGGV6ctpzdwSLBJIL3xbwdBrczd1J7pHl9NzQFWI4EQnQ13TL4kGDkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47e48d179113e12e67dbda946164104f9c7bce62ebfe2998db0b0fefcaca02bf","last_reissued_at":"2026-05-18T02:46:13.627098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:13.627098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.8088","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-18T02:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bBH1UpfAj8WzgPLk9E4PrPRgWyQQz5MEBjTuk6gY464l/4xNGvcXzcYEPhJ7/qJAASF6fgfNCXq/CcjY3LjaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:02:25.301322Z"},"content_sha256":"1e29e0666d009a705877bc7da1beb65f48aadf195878b3f4440c79a0f2476a80","schema_version":"1.0","event_id":"sha256:1e29e0666d009a705877bc7da1beb65f48aadf195878b3f4440c79a0f2476a80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I7SI2F4RCPQS4Z633KKGCZAQJ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Grow-Shrink strategy for learning Markov network structures constrained by context-specific independences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Alejandro Edera, Facundo Bromberg, Yanela Strappa","submitted_at":"2014-07-30T15:24:46Z","abstract_excerpt":"Markov networks are models for compactly representing complex probability distributions. They are composed by a structure and a set of numerical weights. The structure qualitatively describes independences in the distribution, which can be exploited to factorize the distribution into a set of compact functions. A key application for learning structures from data is to automatically discover knowledge. In practice, structure learning algorithms focused on \"knowledge discovery\" present a limitation: they use a coarse-grained representation of the structure. As a result, this representation canno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8088","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-18T02:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cpqcbdCO647/9IX/ylQqDlt/6U2ib+82+jYc5P4DzdzS1Qq8/WI/lOr2NyLKmQ2+hrYM7yCwWoxh+Q5XPRLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:02:25.301672Z"},"content_sha256":"ec93f31ad47e95860afe71889628f04c71915b132ffbf07662bfc6b6afadc704","schema_version":"1.0","event_id":"sha256:ec93f31ad47e95860afe71889628f04c71915b132ffbf07662bfc6b6afadc704"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7SI2F4RCPQS4Z633KKGCZAQJ6/bundle.json","state_url":"https://pith.science/pith/I7SI2F4RCPQS4Z633KKGCZAQJ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7SI2F4RCPQS4Z633KKGCZAQJ6/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-02T23:02:25Z","links":{"resolver":"https://pith.science/pith/I7SI2F4RCPQS4Z633KKGCZAQJ6","bundle":"https://pith.science/pith/I7SI2F4RCPQS4Z633KKGCZAQJ6/bundle.json","state":"https://pith.science/pith/I7SI2F4RCPQS4Z633KKGCZAQJ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7SI2F4RCPQS4Z633KKGCZAQJ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I7SI2F4RCPQS4Z633KKGCZAQJ6","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":"e2088c86a48711a22a6d1badf0f9a74ac724276d424a11ff447385caa6dc3b50","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-30T15:24:46Z","title_canon_sha256":"fea123e183791e4841d8c0b23610f4c982c815d36e0b259d9a9c4c7b4be0f35d"},"schema_version":"1.0","source":{"id":"1407.8088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.8088","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1407.8088v1","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8088","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"I7SI2F4RCPQS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I7SI2F4RCPQS4Z63","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I7SI2F4R","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:ec93f31ad47e95860afe71889628f04c71915b132ffbf07662bfc6b6afadc704","target":"graph","created_at":"2026-05-18T02:46: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":"Markov networks are models for compactly representing complex probability distributions. They are composed by a structure and a set of numerical weights. The structure qualitatively describes independences in the distribution, which can be exploited to factorize the distribution into a set of compact functions. A key application for learning structures from data is to automatically discover knowledge. In practice, structure learning algorithms focused on \"knowledge discovery\" present a limitation: they use a coarse-grained representation of the structure. As a result, this representation canno","authors_text":"Alejandro Edera, Facundo Bromberg, Yanela Strappa","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-30T15:24:46Z","title":"The Grow-Shrink strategy for learning Markov network structures constrained by context-specific independences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8088","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:1e29e0666d009a705877bc7da1beb65f48aadf195878b3f4440c79a0f2476a80","target":"record","created_at":"2026-05-18T02:46: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":"e2088c86a48711a22a6d1badf0f9a74ac724276d424a11ff447385caa6dc3b50","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-30T15:24:46Z","title_canon_sha256":"fea123e183791e4841d8c0b23610f4c982c815d36e0b259d9a9c4c7b4be0f35d"},"schema_version":"1.0","source":{"id":"1407.8088","kind":"arxiv","version":1}},"canonical_sha256":"47e48d179113e12e67dbda946164104f9c7bce62ebfe2998db0b0fefcaca02bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47e48d179113e12e67dbda946164104f9c7bce62ebfe2998db0b0fefcaca02bf","first_computed_at":"2026-05-18T02:46:13.627098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:13.627098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TYM3tK1K7T173QGi589VT4xgSCy0gghGGV6ctpzdwSLBJIL3xbwdBrczd1J7pHl9NzQFWI4EQnQ13TL4kGDkAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:13.627862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.8088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e29e0666d009a705877bc7da1beb65f48aadf195878b3f4440c79a0f2476a80","sha256:ec93f31ad47e95860afe71889628f04c71915b132ffbf07662bfc6b6afadc704"],"state_sha256":"9e58f3966e40fdd3c8ca675cab3e1082babbc9e9495b8bc04c6a1d96c5d6d87f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r06CpC91Y7bOLW2UmVCN9bcgoUvf64mUIk8F9qkh5HxrEzBQfKquUtrtDFkenRe1KZrRKyiMdIJPO0ITx/FjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:02:25.303626Z","bundle_sha256":"fa6359d6dd4398306231fd3ecf09e70d64d16fd8c168c22a6b8675bab1c6e7fa"}}