{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XLYI2WXGJ5ENYNWABEC6F4EJ3G","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":"bedf4c0e32cd7d45bd6105fbffd5474fbdfe23f3cbb34fe3ba45cfc2f1bec235","cross_cats_sorted":["cs.DM","math.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-06-02T05:43:03Z","title_canon_sha256":"f0c195b9e1b39497598db0a2ea1da34b43ea0e21c654f1d91ee62e014c9e16e6"},"schema_version":"1.0","source":{"id":"1806.00584","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00584","created_at":"2026-07-05T02:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00584v4","created_at":"2026-07-05T02:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00584","created_at":"2026-07-05T02:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"XLYI2WXGJ5EN","created_at":"2026-07-05T02:15:07Z"},{"alias_kind":"pith_short_16","alias_value":"XLYI2WXGJ5ENYNWA","created_at":"2026-07-05T02:15:07Z"},{"alias_kind":"pith_short_8","alias_value":"XLYI2WXG","created_at":"2026-07-05T02:15:07Z"}],"graph_snapshots":[{"event_id":"sha256:7f25e884dbf6086d652713693b8be105d3629d3db6ba156201740523a8c732e6","target":"graph","created_at":"2026-07-05T02:15:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1806.00584/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The junction-tree representation provides an attractive structural property for organizing a decomposable graph. In this study, we present two novel stochastic algorithms, which we call the junction-tree expander and junction-tree collapser for sequential sampling of junction trees for decomposable graphs. We show that recursive application of the junction-tree expander, expanding incrementally the underlying graph with one vertex at a time, has full support on the space of junction trees with any given number of underlying vertices. On the other hand, the junction-tree collapser provides a co","authors_text":"Felix L. Rios, Jimmy Olsson, Tetyana Pavlenko","cross_cats":["cs.DM","math.CO","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-06-02T05:43:03Z","title":"Sequential sampling of junction trees for decomposable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00584","kind":"arxiv","version":4},"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:abe946f74192a3ef0729d407479f5ac7a63bf6dbbaeaa07cbe786e49c5bfdaf7","target":"record","created_at":"2026-07-05T02:15:07Z","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":"bedf4c0e32cd7d45bd6105fbffd5474fbdfe23f3cbb34fe3ba45cfc2f1bec235","cross_cats_sorted":["cs.DM","math.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-06-02T05:43:03Z","title_canon_sha256":"f0c195b9e1b39497598db0a2ea1da34b43ea0e21c654f1d91ee62e014c9e16e6"},"schema_version":"1.0","source":{"id":"1806.00584","kind":"arxiv","version":4}},"canonical_sha256":"baf08d5ae64f48dc36c00905e2f089d9986415e1b76d961c3d88efb867a033ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baf08d5ae64f48dc36c00905e2f089d9986415e1b76d961c3d88efb867a033ff","first_computed_at":"2026-07-05T02:15:07.883047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:15:07.883047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+QixJqGn0YIB9mjt7XtdSsovVSZZGhdZXP+L6MZODQbHeh1uW9sg9xcfRGrLvUtz/VGZf2xEWJLbGjeB2FAUDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:15:07.883479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00584","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abe946f74192a3ef0729d407479f5ac7a63bf6dbbaeaa07cbe786e49c5bfdaf7","sha256:7f25e884dbf6086d652713693b8be105d3629d3db6ba156201740523a8c732e6"],"state_sha256":"4c24ccc90fda6b46a0e0b38ae2a8b008bfd4c1e036eaa02a3f9393dafa9c3ffc"}