{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ID6MNFFRH54MTEW7BO23O7CF3R","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":"ba12802b051664b87ac87e57c75d52f13a738e79f3e8c2dd805a413eaa2a7292","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-13T14:12:12Z","title_canon_sha256":"ec6b0bfca38da23137ca38db98be49290d65b1dbb861c5e424c4b93a1e569fa9"},"schema_version":"1.0","source":{"id":"1302.3558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3558","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3558v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3558","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"ID6MNFFRH54M","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"ID6MNFFRH54MTEW7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"ID6MNFFR","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:bb2a9bd6bee4795f17e4d49f9f7f926c2a8c0b9b0e5e3858a32b2a3ca9ea78b6","target":"graph","created_at":"2026-05-18T03:33:36Z","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":"An algorithm is developed for finding a close to optimal junction tree of a given graph G. The algorithm has a worst case complexity O(c^k n^a) where a and c are constants, n is the number of vertices, and k is the size of the largest clique in a junction tree of G in which this size is minimized.  The algorithm guarantees that the logarithm of the size of the state space of the heaviest clique in the junction tree produced is less than a constant factor off the optimal value.  When k = O(log n), our algorithm yields a polynomial inference algorithm for Bayesian networks.","authors_text":"Ann Becker, Dan Geiger","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-13T14:12:12Z","title":"A Sufficiently Fast Algorithm for Finding Close to Optimal Junction Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3558","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:84ec0019befa987a51e52f77cfdad37cd7997ab9543b0c5844b43fea80c867ec","target":"record","created_at":"2026-05-18T03:33:36Z","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":"ba12802b051664b87ac87e57c75d52f13a738e79f3e8c2dd805a413eaa2a7292","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-13T14:12:12Z","title_canon_sha256":"ec6b0bfca38da23137ca38db98be49290d65b1dbb861c5e424c4b93a1e569fa9"},"schema_version":"1.0","source":{"id":"1302.3558","kind":"arxiv","version":1}},"canonical_sha256":"40fcc694b13f78c992df0bb5b77c45dc477e3cb341438cd48abe7527d718013b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40fcc694b13f78c992df0bb5b77c45dc477e3cb341438cd48abe7527d718013b","first_computed_at":"2026-05-18T03:33:36.879636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:36.879636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6cO6ysDju50HbMhH9RUeb8VNtQHPkw7N2HFSbGuhWU9rZJdL1NArDvFi4PddMf0Nqu5bNxRunhZS/IU2OpRZCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:36.880761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84ec0019befa987a51e52f77cfdad37cd7997ab9543b0c5844b43fea80c867ec","sha256:bb2a9bd6bee4795f17e4d49f9f7f926c2a8c0b9b0e5e3858a32b2a3ca9ea78b6"],"state_sha256":"70a7ecf4629ca279e25ae8f2c7394160a0411e16cf54df53c5b9d56e66a8631b"}