{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UV7UBR4ZZVLSZMSED3AKE2XUWS","short_pith_number":"pith:UV7UBR4Z","schema_version":"1.0","canonical_sha256":"a57f40c799cd572cb2441ec0a26af4b4ae1e3549e61de9c65dff96a446cd5627","source":{"kind":"arxiv","id":"1206.6847","version":1},"attestation_state":"computed","paper":{"title":"Identifying the Relevant Nodes Without Learning the Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jesper Tegn\\'er, Johan Bj\\\"orkegren, Jose M. Pena, Roland Nilsson","submitted_at":"2012-06-27T16:23:41Z","abstract_excerpt":"We propose a method to identify all the nodes that are relevant to compute all the conditional probability distributions for a given set of nodes. Our method is simple, effcient, consistent, and does not require learning a Bayesian network first. Therefore, our method can be applied to high-dimensional databases, e.g. gene expression databases."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1206.6847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T16:23:41Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"0386e8f101c0543c65ae5fb1219542a49bf892456e7313fd04ea06e4b8592ffe","abstract_canon_sha256":"11afe7ac4262842b9d9758cfcbd14826d77f23e1f345d587a4b211ba93105646"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.587847Z","signature_b64":"c5m7s+ZN1aJtX2XGj/STk5d6iQKc998meVReQhsrH8sWGsi9hAnnFaV8EUbp1HSHKUrzNecxda3V5HTfE7Y/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a57f40c799cd572cb2441ec0a26af4b4ae1e3549e61de9c65dff96a446cd5627","last_reissued_at":"2026-05-18T03:52:15.587198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.587198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying the Relevant Nodes Without Learning the Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jesper Tegn\\'er, Johan Bj\\\"orkegren, Jose M. Pena, Roland Nilsson","submitted_at":"2012-06-27T16:23:41Z","abstract_excerpt":"We propose a method to identify all the nodes that are relevant to compute all the conditional probability distributions for a given set of nodes. Our method is simple, effcient, consistent, and does not require learning a Bayesian network first. Therefore, our method can be applied to high-dimensional databases, e.g. gene expression databases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6847","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.6847","created_at":"2026-05-18T03:52:15.587294+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6847v1","created_at":"2026-05-18T03:52:15.587294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6847","created_at":"2026-05-18T03:52:15.587294+00:00"},{"alias_kind":"pith_short_12","alias_value":"UV7UBR4ZZVLS","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"UV7UBR4ZZVLSZMSE","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"UV7UBR4Z","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UV7UBR4ZZVLSZMSED3AKE2XUWS","json":"https://pith.science/pith/UV7UBR4ZZVLSZMSED3AKE2XUWS.json","graph_json":"https://pith.science/api/pith-number/UV7UBR4ZZVLSZMSED3AKE2XUWS/graph.json","events_json":"https://pith.science/api/pith-number/UV7UBR4ZZVLSZMSED3AKE2XUWS/events.json","paper":"https://pith.science/paper/UV7UBR4Z"},"agent_actions":{"view_html":"https://pith.science/pith/UV7UBR4ZZVLSZMSED3AKE2XUWS","download_json":"https://pith.science/pith/UV7UBR4ZZVLSZMSED3AKE2XUWS.json","view_paper":"https://pith.science/paper/UV7UBR4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6847&json=true","fetch_graph":"https://pith.science/api/pith-number/UV7UBR4ZZVLSZMSED3AKE2XUWS/graph.json","fetch_events":"https://pith.science/api/pith-number/UV7UBR4ZZVLSZMSED3AKE2XUWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UV7UBR4ZZVLSZMSED3AKE2XUWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UV7UBR4ZZVLSZMSED3AKE2XUWS/action/storage_attestation","attest_author":"https://pith.science/pith/UV7UBR4ZZVLSZMSED3AKE2XUWS/action/author_attestation","sign_citation":"https://pith.science/pith/UV7UBR4ZZVLSZMSED3AKE2XUWS/action/citation_signature","submit_replication":"https://pith.science/pith/UV7UBR4ZZVLSZMSED3AKE2XUWS/action/replication_record"}},"created_at":"2026-05-18T03:52:15.587294+00:00","updated_at":"2026-05-18T03:52:15.587294+00:00"}