{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QBL4Y2W6M7RBHCGN4HSC7GVW3V","short_pith_number":"pith:QBL4Y2W6","schema_version":"1.0","canonical_sha256":"8057cc6ade67e21388cde1e42f9ab6dd7296a230e7dc387fe1659148479ee42a","source":{"kind":"arxiv","id":"1206.6825","version":1},"attestation_state":"computed","paper":{"title":"Non-Minimal Triangulations for Mixed Stochastic/Deterministic Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Chris Bartels, Jeff A. Bilmes","submitted_at":"2012-06-27T15:41:21Z","abstract_excerpt":"We observe that certain large-clique graph triangulations can be useful to reduce both computational and space requirements when making queries on mixed stochastic/deterministic graphical models. We demonstrate that many of these large-clique triangulations are non-minimal and are thus unattainable via the variable elimination algorithm. We introduce ancestral pairs as the basis for novel triangulation heuristics and prove that no more than the addition of edges between ancestral pairs need be considered when searching for state space optimal triangulations in such graphs. Empirical results on"},"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.6825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T15:41:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4939d8b8b3ad674f7e9336e7226ae1a40a07b6a2a61202c021c2d2d4d0c40712","abstract_canon_sha256":"088fdfde7a31bb6e84a98bee069075fd681f3f6c0e934273fa4bc5880df69634"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.785459Z","signature_b64":"KuhLXlH/CwBDKZDVJxrHcelSM4CEyzyEZSXs4bmvt486lhZNCR9qBv/jwvvjYMzyiPNBRYofPnkMoQp6zc4oAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8057cc6ade67e21388cde1e42f9ab6dd7296a230e7dc387fe1659148479ee42a","last_reissued_at":"2026-05-18T03:52:15.784882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.784882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Minimal Triangulations for Mixed Stochastic/Deterministic Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Chris Bartels, Jeff A. Bilmes","submitted_at":"2012-06-27T15:41:21Z","abstract_excerpt":"We observe that certain large-clique graph triangulations can be useful to reduce both computational and space requirements when making queries on mixed stochastic/deterministic graphical models. We demonstrate that many of these large-clique triangulations are non-minimal and are thus unattainable via the variable elimination algorithm. We introduce ancestral pairs as the basis for novel triangulation heuristics and prove that no more than the addition of edges between ancestral pairs need be considered when searching for state space optimal triangulations in such graphs. Empirical results on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6825","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.6825","created_at":"2026-05-18T03:52:15.784962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6825v1","created_at":"2026-05-18T03:52:15.784962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6825","created_at":"2026-05-18T03:52:15.784962+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBL4Y2W6M7RB","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBL4Y2W6M7RBHCGN","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBL4Y2W6","created_at":"2026-05-18T12:27:18.751474+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/QBL4Y2W6M7RBHCGN4HSC7GVW3V","json":"https://pith.science/pith/QBL4Y2W6M7RBHCGN4HSC7GVW3V.json","graph_json":"https://pith.science/api/pith-number/QBL4Y2W6M7RBHCGN4HSC7GVW3V/graph.json","events_json":"https://pith.science/api/pith-number/QBL4Y2W6M7RBHCGN4HSC7GVW3V/events.json","paper":"https://pith.science/paper/QBL4Y2W6"},"agent_actions":{"view_html":"https://pith.science/pith/QBL4Y2W6M7RBHCGN4HSC7GVW3V","download_json":"https://pith.science/pith/QBL4Y2W6M7RBHCGN4HSC7GVW3V.json","view_paper":"https://pith.science/paper/QBL4Y2W6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6825&json=true","fetch_graph":"https://pith.science/api/pith-number/QBL4Y2W6M7RBHCGN4HSC7GVW3V/graph.json","fetch_events":"https://pith.science/api/pith-number/QBL4Y2W6M7RBHCGN4HSC7GVW3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBL4Y2W6M7RBHCGN4HSC7GVW3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBL4Y2W6M7RBHCGN4HSC7GVW3V/action/storage_attestation","attest_author":"https://pith.science/pith/QBL4Y2W6M7RBHCGN4HSC7GVW3V/action/author_attestation","sign_citation":"https://pith.science/pith/QBL4Y2W6M7RBHCGN4HSC7GVW3V/action/citation_signature","submit_replication":"https://pith.science/pith/QBL4Y2W6M7RBHCGN4HSC7GVW3V/action/replication_record"}},"created_at":"2026-05-18T03:52:15.784962+00:00","updated_at":"2026-05-18T03:52:15.784962+00:00"}