{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MVLV7TGYEJITXE54IOD5QYODT4","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":"7b81afb8e5e703b392c1ff9f12c0302d96f4368ff1df3de03f1e87e781cc6e8c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:22:36Z","title_canon_sha256":"8fd97bc13eb9bb02f155bad9821089c862e54d950c393a14eab807c1423d477c"},"schema_version":"1.0","source":{"id":"1301.2256","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2256","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2256v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2256","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"MVLV7TGYEJIT","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MVLV7TGYEJITXE54","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MVLV7TGY","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:56ff1a01e7fb3b99e017c94284de216defbf5dcbc2b15b876fa2d836413d42e5","target":"graph","created_at":"2026-05-18T03:36: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":"The currently most efficient algorithm for inference with a probabilistic network builds upon a triangulation of a network's graph.  In this paper, we show that pre-processing can help in finding good triangulations forprobabilistic networks, that is, triangulations with a minimal maximum clique size.  We provide a set of rules for stepwise reducing a graph, without losing optimality.  This reduction allows us to solve the triangulation problem on a smaller graph. From the smaller graph's triangulation, a triangulation of the original graph is obtained by reversing the reduction steps.  Our ex","authors_text":"Arie M.C.A. Koster, Frank van den Eijkhof, Hans L. Bodlaender, Linda C. van der Gaag","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:22:36Z","title":"Pre-processing for Triangulation of Probabilistic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2256","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:54d89e02d5072b76d9feda8d689ad16412f839e1e286b2dadf414a2646c32866","target":"record","created_at":"2026-05-18T03:36: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":"7b81afb8e5e703b392c1ff9f12c0302d96f4368ff1df3de03f1e87e781cc6e8c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:22:36Z","title_canon_sha256":"8fd97bc13eb9bb02f155bad9821089c862e54d950c393a14eab807c1423d477c"},"schema_version":"1.0","source":{"id":"1301.2256","kind":"arxiv","version":1}},"canonical_sha256":"65575fccd822513b93bc4387d861c39f0a037f6c9be7485075b9f7972a4dc76d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65575fccd822513b93bc4387d861c39f0a037f6c9be7485075b9f7972a4dc76d","first_computed_at":"2026-05-18T03:36:45.844156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:45.844156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/TkHoNbharNs1CMD1i6a0Xl8R3oa33qsW83I+hAYL7eDYWzuZ0ga9KYHzG9oMnd0tCDfqEl5W3dKHQAZklygDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:45.844861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2256","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54d89e02d5072b76d9feda8d689ad16412f839e1e286b2dadf414a2646c32866","sha256:56ff1a01e7fb3b99e017c94284de216defbf5dcbc2b15b876fa2d836413d42e5"],"state_sha256":"e677e4f26340ebae6583475dff0905fe5c472418a965dc0286b378b70aa3b4e9"}