{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CW2SSQ2VIHLFJPRYAWKOG64ATU","short_pith_number":"pith:CW2SSQ2V","canonical_record":{"source":{"id":"1209.5991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-26T16:31:32Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c89ab75b5315e4bebdb23cafb67f1d48c216b75832987c2d3239ea653f6960cc","abstract_canon_sha256":"40ffe714cbac2b7f51a8a12c47427ba4c704c3b62f91764b8ec5d2db010f6982"},"schema_version":"1.0"},"canonical_sha256":"15b529435541d654be380594e37b809d03dd0a2ba0e042e7357e6c4ba129c6db","source":{"kind":"arxiv","id":"1209.5991","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5991","created_at":"2026-05-18T03:44:45Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5991v1","created_at":"2026-05-18T03:44:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5991","created_at":"2026-05-18T03:44:45Z"},{"alias_kind":"pith_short_12","alias_value":"CW2SSQ2VIHLF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CW2SSQ2VIHLFJPRY","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CW2SSQ2V","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CW2SSQ2VIHLFJPRYAWKOG64ATU","target":"record","payload":{"canonical_record":{"source":{"id":"1209.5991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-26T16:31:32Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c89ab75b5315e4bebdb23cafb67f1d48c216b75832987c2d3239ea653f6960cc","abstract_canon_sha256":"40ffe714cbac2b7f51a8a12c47427ba4c704c3b62f91764b8ec5d2db010f6982"},"schema_version":"1.0"},"canonical_sha256":"15b529435541d654be380594e37b809d03dd0a2ba0e042e7357e6c4ba129c6db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:45.724355Z","signature_b64":"xanQhPdlutGYtRUNwmd5HJNtIpk298MNF+Yn0MEnsO+FU2bSGM7j5RNw8/USO92IThd1kLpe8K6JHo+hbow7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15b529435541d654be380594e37b809d03dd0a2ba0e042e7357e6c4ba129c6db","last_reissued_at":"2026-05-18T03:44:45.723622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:45.723622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.5991","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:44:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qp+cSuH3fKiiI0rJpI/MD1hxtNjmyb604r0rbF4uaxaDee2/F9hY1Q2u2RzEKYEuMr7v8M/JcJHSdlr9rE0hAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:14:02.029556Z"},"content_sha256":"2fc218c5c8f89824e3efdfe119318a5a6d7d53f5679fd577db12b098bd726bc5","schema_version":"1.0","event_id":"sha256:2fc218c5c8f89824e3efdfe119318a5a6d7d53f5679fd577db12b098bd726bc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CW2SSQ2VIHLFJPRYAWKOG64ATU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subset Selection for Gaussian Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Stefankovic, Satyaki Mahalanabis","submitted_at":"2012-09-26T16:31:32Z","abstract_excerpt":"Given a Gaussian Markov random field, we consider the problem of selecting a subset of variables to observe which minimizes the total expected squared prediction error of the unobserved variables. We first show that finding an exact solution is NP-hard even for a restricted class of Gaussian Markov random fields, called Gaussian free fields, which arise in semi-supervised learning and computer vision. We then give a simple greedy approximation algorithm for Gaussian free fields on arbitrary graphs. Finally, we give a message passing algorithm for general Gaussian Markov random fields on bounde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5991","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:44:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axC0CHUfGn7OnyBBJnkrpO6GQxpo54jo14+2Ggc3RDdSDxTwzz2QSDvO2hgVcYEU/m0rAD/tjdu8KreJ4v2tBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:14:02.029969Z"},"content_sha256":"58dffbac5ffed691f578f2c59f6f32b94a8e143fd43a276cef496da561777ee4","schema_version":"1.0","event_id":"sha256:58dffbac5ffed691f578f2c59f6f32b94a8e143fd43a276cef496da561777ee4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CW2SSQ2VIHLFJPRYAWKOG64ATU/bundle.json","state_url":"https://pith.science/pith/CW2SSQ2VIHLFJPRYAWKOG64ATU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CW2SSQ2VIHLFJPRYAWKOG64ATU/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-22T18:14:02Z","links":{"resolver":"https://pith.science/pith/CW2SSQ2VIHLFJPRYAWKOG64ATU","bundle":"https://pith.science/pith/CW2SSQ2VIHLFJPRYAWKOG64ATU/bundle.json","state":"https://pith.science/pith/CW2SSQ2VIHLFJPRYAWKOG64ATU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CW2SSQ2VIHLFJPRYAWKOG64ATU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CW2SSQ2VIHLFJPRYAWKOG64ATU","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":"40ffe714cbac2b7f51a8a12c47427ba4c704c3b62f91764b8ec5d2db010f6982","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-26T16:31:32Z","title_canon_sha256":"c89ab75b5315e4bebdb23cafb67f1d48c216b75832987c2d3239ea653f6960cc"},"schema_version":"1.0","source":{"id":"1209.5991","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5991","created_at":"2026-05-18T03:44:45Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5991v1","created_at":"2026-05-18T03:44:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5991","created_at":"2026-05-18T03:44:45Z"},{"alias_kind":"pith_short_12","alias_value":"CW2SSQ2VIHLF","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CW2SSQ2VIHLFJPRY","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CW2SSQ2V","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:58dffbac5ffed691f578f2c59f6f32b94a8e143fd43a276cef496da561777ee4","target":"graph","created_at":"2026-05-18T03:44:45Z","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":"Given a Gaussian Markov random field, we consider the problem of selecting a subset of variables to observe which minimizes the total expected squared prediction error of the unobserved variables. We first show that finding an exact solution is NP-hard even for a restricted class of Gaussian Markov random fields, called Gaussian free fields, which arise in semi-supervised learning and computer vision. We then give a simple greedy approximation algorithm for Gaussian free fields on arbitrary graphs. Finally, we give a message passing algorithm for general Gaussian Markov random fields on bounde","authors_text":"Daniel Stefankovic, Satyaki Mahalanabis","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-26T16:31:32Z","title":"Subset Selection for Gaussian Markov Random Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5991","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:2fc218c5c8f89824e3efdfe119318a5a6d7d53f5679fd577db12b098bd726bc5","target":"record","created_at":"2026-05-18T03:44:45Z","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":"40ffe714cbac2b7f51a8a12c47427ba4c704c3b62f91764b8ec5d2db010f6982","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-26T16:31:32Z","title_canon_sha256":"c89ab75b5315e4bebdb23cafb67f1d48c216b75832987c2d3239ea653f6960cc"},"schema_version":"1.0","source":{"id":"1209.5991","kind":"arxiv","version":1}},"canonical_sha256":"15b529435541d654be380594e37b809d03dd0a2ba0e042e7357e6c4ba129c6db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15b529435541d654be380594e37b809d03dd0a2ba0e042e7357e6c4ba129c6db","first_computed_at":"2026-05-18T03:44:45.723622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:45.723622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xanQhPdlutGYtRUNwmd5HJNtIpk298MNF+Yn0MEnsO+FU2bSGM7j5RNw8/USO92IThd1kLpe8K6JHo+hbow7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:45.724355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5991","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fc218c5c8f89824e3efdfe119318a5a6d7d53f5679fd577db12b098bd726bc5","sha256:58dffbac5ffed691f578f2c59f6f32b94a8e143fd43a276cef496da561777ee4"],"state_sha256":"c9946dd7b40d882dc02a12f50bc95e3945f8c0ae762c89dfdb54ba4f314a3f79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+45FQWhj01NOSUKiAx3Gwt4uGhFh5KO6PK6MSJayq01yaXW1hSRvt8UVRfQhExuUkcBq/C440epq0Npn9md4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T18:14:02.032497Z","bundle_sha256":"c4507133386cd1f0502924cf5d43de16afd621533d7f2e936b8cfd28cf0f2401"}}