{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KLJWPCM6QZCG7CJI36L6WX66KR","short_pith_number":"pith:KLJWPCM6","canonical_record":{"source":{"id":"1712.01231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-04T18:12:24Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"55007b881ff8aa671bd0b673926d23e446b9da2eab6ba43889ab3950ca6ac0ec","abstract_canon_sha256":"7e7972090f41dc60402a686e695c924f0bcdbd4d147dfce3d1aaafe6e07a215e"},"schema_version":"1.0"},"canonical_sha256":"52d367899e86446f8928df97eb5fde5473801146d634b3fa027e78473b88b58f","source":{"kind":"arxiv","id":"1712.01231","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01231","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01231v1","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01231","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"pith_short_12","alias_value":"KLJWPCM6QZCG","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KLJWPCM6QZCG7CJI","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KLJWPCM6","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KLJWPCM6QZCG7CJI36L6WX66KR","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-04T18:12:24Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"55007b881ff8aa671bd0b673926d23e446b9da2eab6ba43889ab3950ca6ac0ec","abstract_canon_sha256":"7e7972090f41dc60402a686e695c924f0bcdbd4d147dfce3d1aaafe6e07a215e"},"schema_version":"1.0"},"canonical_sha256":"52d367899e86446f8928df97eb5fde5473801146d634b3fa027e78473b88b58f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:57.613815Z","signature_b64":"9rOn8g56npPdR460L+JYn3Sm1iw/TYDBD2s1ee2Of/SLHUY2O5H5Acfa+mTVMIGPwkDhUBIZU1itsIFHHb8CBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52d367899e86446f8928df97eb5fde5473801146d634b3fa027e78473b88b58f","last_reissued_at":"2026-05-18T00:28:57.613369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:57.613369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01231","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJQeVMzGtrVdp/04UDQiMFdbjn9vRl8d/7d6aWNAKfOjJwWKmDdGs+tP/DXLKUi2ToyHdsuSDTwd2U9siTAGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:28:40.322183Z"},"content_sha256":"026bab3e624f750c6bf31722a05e07308f4588809cf51a189482ca29fbe8f37e","schema_version":"1.0","event_id":"sha256:026bab3e624f750c6bf31722a05e07308f4588809cf51a189482ca29fbe8f37e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KLJWPCM6QZCG7CJI36L6WX66KR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sub-clustering in decomposable graphs and size-varying junction trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.CO"],"primary_cat":"stat.ME","authors_text":"Mohamad Elmasri","submitted_at":"2017-12-04T18:12:24Z","abstract_excerpt":"This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the graph, adding informational richness to the general use of decomposable graphs that could be harnessed in applications with behavioural type of data. Second, it allows for a new node-driven Markov chain Monte Carlo sampler of decomposable graphs that can easily parallelize and scale. The proposed sampler also benefits from the computational efficiency of ju"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01231","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEZbLhARFwq8Dc1uIU+Vmuly6HnScGwxM+/Bmqs7iU9nxhwJ6388XVOFusQnNeSeVAmXQJ8e1YityqI99Y04BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:28:40.322535Z"},"content_sha256":"41d37bff5f8c5f704db1c873fd0e7e613b5464807e7d4e40bf40ca114a59cd39","schema_version":"1.0","event_id":"sha256:41d37bff5f8c5f704db1c873fd0e7e613b5464807e7d4e40bf40ca114a59cd39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLJWPCM6QZCG7CJI36L6WX66KR/bundle.json","state_url":"https://pith.science/pith/KLJWPCM6QZCG7CJI36L6WX66KR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLJWPCM6QZCG7CJI36L6WX66KR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T23:28:40Z","links":{"resolver":"https://pith.science/pith/KLJWPCM6QZCG7CJI36L6WX66KR","bundle":"https://pith.science/pith/KLJWPCM6QZCG7CJI36L6WX66KR/bundle.json","state":"https://pith.science/pith/KLJWPCM6QZCG7CJI36L6WX66KR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLJWPCM6QZCG7CJI36L6WX66KR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KLJWPCM6QZCG7CJI36L6WX66KR","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":"7e7972090f41dc60402a686e695c924f0bcdbd4d147dfce3d1aaafe6e07a215e","cross_cats_sorted":["cs.DS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-04T18:12:24Z","title_canon_sha256":"55007b881ff8aa671bd0b673926d23e446b9da2eab6ba43889ab3950ca6ac0ec"},"schema_version":"1.0","source":{"id":"1712.01231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01231","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01231v1","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01231","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"pith_short_12","alias_value":"KLJWPCM6QZCG","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KLJWPCM6QZCG7CJI","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KLJWPCM6","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:41d37bff5f8c5f704db1c873fd0e7e613b5464807e7d4e40bf40ca114a59cd39","target":"graph","created_at":"2026-05-18T00:28:57Z","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":"This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the graph, adding informational richness to the general use of decomposable graphs that could be harnessed in applications with behavioural type of data. Second, it allows for a new node-driven Markov chain Monte Carlo sampler of decomposable graphs that can easily parallelize and scale. The proposed sampler also benefits from the computational efficiency of ju","authors_text":"Mohamad Elmasri","cross_cats":["cs.DS","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-04T18:12:24Z","title":"Sub-clustering in decomposable graphs and size-varying junction trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01231","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:026bab3e624f750c6bf31722a05e07308f4588809cf51a189482ca29fbe8f37e","target":"record","created_at":"2026-05-18T00:28:57Z","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":"7e7972090f41dc60402a686e695c924f0bcdbd4d147dfce3d1aaafe6e07a215e","cross_cats_sorted":["cs.DS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-04T18:12:24Z","title_canon_sha256":"55007b881ff8aa671bd0b673926d23e446b9da2eab6ba43889ab3950ca6ac0ec"},"schema_version":"1.0","source":{"id":"1712.01231","kind":"arxiv","version":1}},"canonical_sha256":"52d367899e86446f8928df97eb5fde5473801146d634b3fa027e78473b88b58f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52d367899e86446f8928df97eb5fde5473801146d634b3fa027e78473b88b58f","first_computed_at":"2026-05-18T00:28:57.613369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:57.613369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9rOn8g56npPdR460L+JYn3Sm1iw/TYDBD2s1ee2Of/SLHUY2O5H5Acfa+mTVMIGPwkDhUBIZU1itsIFHHb8CBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:57.613815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:026bab3e624f750c6bf31722a05e07308f4588809cf51a189482ca29fbe8f37e","sha256:41d37bff5f8c5f704db1c873fd0e7e613b5464807e7d4e40bf40ca114a59cd39"],"state_sha256":"1a21614f9e2bb88fadcfb85d59a19d00d0b451309b1afe13af1ca5c9a4236611"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIx1qjW82/Etbt0FiA1Mx69vIl7w0j6a5btgOHRI0D/ke9c962KuFUQ03Y1+xEGCGIoGa1mkVmdZOxrrEltxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T23:28:40.324400Z","bundle_sha256":"b51cde88883c38fdd18786c54b8128ae8fe640497288f3192c573994d76fc54a"}}