{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4ON7VT2Z2ICF6ZPXB6VIUD6X5C","short_pith_number":"pith:4ON7VT2Z","canonical_record":{"source":{"id":"1710.03283","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2017-10-09T19:42:09Z","cross_cats_sorted":[],"title_canon_sha256":"5c0f4d3bf851acbf24cae190b487499dd5db5fb202d36141e2758aee8f1d598d","abstract_canon_sha256":"8fb17361ac0f20e0dcf664d23711cb092ac5d6f30b1a4e8a4f07b12dfe94bec9"},"schema_version":"1.0"},"canonical_sha256":"e39bfacf59d2045f65f70faa8a0fd7e8a32e55376291b433c4bed7078888a516","source":{"kind":"arxiv","id":"1710.03283","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03283","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03283v1","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03283","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"4ON7VT2Z2ICF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4ON7VT2Z2ICF6ZPX","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4ON7VT2Z","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4ON7VT2Z2ICF6ZPXB6VIUD6X5C","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03283","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2017-10-09T19:42:09Z","cross_cats_sorted":[],"title_canon_sha256":"5c0f4d3bf851acbf24cae190b487499dd5db5fb202d36141e2758aee8f1d598d","abstract_canon_sha256":"8fb17361ac0f20e0dcf664d23711cb092ac5d6f30b1a4e8a4f07b12dfe94bec9"},"schema_version":"1.0"},"canonical_sha256":"e39bfacf59d2045f65f70faa8a0fd7e8a32e55376291b433c4bed7078888a516","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:12.480445Z","signature_b64":"Z9tBDb4SBTOoDJnWpxfikKFEBVj5p+cLRv2IgIocyutwlQxdQ9Nlc74c5KBKG6h+RJeIlT7Huidx9GnioC/pAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e39bfacf59d2045f65f70faa8a0fd7e8a32e55376291b433c4bed7078888a516","last_reissued_at":"2026-05-18T00:33:12.479941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:12.479941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03283","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:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDw4gV24uHE+LzEmANUIAX9G+Fj/2KQw+TQzhwgbrEML0B/Qx02D2F7uOK8Y7E+s3swI0MEVKMn63FIGnCTHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T06:51:21.699006Z"},"content_sha256":"dbfa3b90e3fa88daf18895956d4b1215d49f0e99d2b086d2a8375e8145dd639f","schema_version":"1.0","event_id":"sha256:dbfa3b90e3fa88daf18895956d4b1215d49f0e99d2b086d2a8375e8145dd639f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4ON7VT2Z2ICF6ZPXB6VIUD6X5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On decomposable random graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Mohamad Elmasri","submitted_at":"2017-10-09T19:42:09Z","abstract_excerpt":"Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs. This is achieved through dimensionality expansion that causes the graph nodes to be conditionally independent given a latent tree. The Markov update steps are thus remarkably simplified. Structural modelling with tree-dependent bipartite graphs has additional benefits. For example, certain properties that are hardly attainable in the decomposable form are no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03283","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:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ct6AYz76QftTbQ6jXOmElvgrqRvY0R968MgJ5vuXexC39ZZtxDQ6ihkPsmiZ19HIQWqxJjOxquaqRTYZA7fPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T06:51:21.699347Z"},"content_sha256":"a6d6c406f93d297986e5f37ca4690bc555880aea2902d0c6bf22dd7aec66e6af","schema_version":"1.0","event_id":"sha256:a6d6c406f93d297986e5f37ca4690bc555880aea2902d0c6bf22dd7aec66e6af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ON7VT2Z2ICF6ZPXB6VIUD6X5C/bundle.json","state_url":"https://pith.science/pith/4ON7VT2Z2ICF6ZPXB6VIUD6X5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ON7VT2Z2ICF6ZPXB6VIUD6X5C/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-05T06:51:21Z","links":{"resolver":"https://pith.science/pith/4ON7VT2Z2ICF6ZPXB6VIUD6X5C","bundle":"https://pith.science/pith/4ON7VT2Z2ICF6ZPXB6VIUD6X5C/bundle.json","state":"https://pith.science/pith/4ON7VT2Z2ICF6ZPXB6VIUD6X5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ON7VT2Z2ICF6ZPXB6VIUD6X5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4ON7VT2Z2ICF6ZPXB6VIUD6X5C","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":"8fb17361ac0f20e0dcf664d23711cb092ac5d6f30b1a4e8a4f07b12dfe94bec9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2017-10-09T19:42:09Z","title_canon_sha256":"5c0f4d3bf851acbf24cae190b487499dd5db5fb202d36141e2758aee8f1d598d"},"schema_version":"1.0","source":{"id":"1710.03283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03283","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03283v1","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03283","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"4ON7VT2Z2ICF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4ON7VT2Z2ICF6ZPX","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4ON7VT2Z","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:a6d6c406f93d297986e5f37ca4690bc555880aea2902d0c6bf22dd7aec66e6af","target":"graph","created_at":"2026-05-18T00:33:12Z","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":"Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs. This is achieved through dimensionality expansion that causes the graph nodes to be conditionally independent given a latent tree. The Markov update steps are thus remarkably simplified. Structural modelling with tree-dependent bipartite graphs has additional benefits. For example, certain properties that are hardly attainable in the decomposable form are no","authors_text":"Mohamad Elmasri","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2017-10-09T19:42:09Z","title":"On decomposable random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03283","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:dbfa3b90e3fa88daf18895956d4b1215d49f0e99d2b086d2a8375e8145dd639f","target":"record","created_at":"2026-05-18T00:33:12Z","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":"8fb17361ac0f20e0dcf664d23711cb092ac5d6f30b1a4e8a4f07b12dfe94bec9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2017-10-09T19:42:09Z","title_canon_sha256":"5c0f4d3bf851acbf24cae190b487499dd5db5fb202d36141e2758aee8f1d598d"},"schema_version":"1.0","source":{"id":"1710.03283","kind":"arxiv","version":1}},"canonical_sha256":"e39bfacf59d2045f65f70faa8a0fd7e8a32e55376291b433c4bed7078888a516","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e39bfacf59d2045f65f70faa8a0fd7e8a32e55376291b433c4bed7078888a516","first_computed_at":"2026-05-18T00:33:12.479941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:12.479941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z9tBDb4SBTOoDJnWpxfikKFEBVj5p+cLRv2IgIocyutwlQxdQ9Nlc74c5KBKG6h+RJeIlT7Huidx9GnioC/pAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:12.480445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbfa3b90e3fa88daf18895956d4b1215d49f0e99d2b086d2a8375e8145dd639f","sha256:a6d6c406f93d297986e5f37ca4690bc555880aea2902d0c6bf22dd7aec66e6af"],"state_sha256":"98f480624f97ea6c18fae0ec4c3c97b9680932a3a939a7126d515623c17b9f3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4VSROJg4NkATMf/W0gyd3TfjJCmeqBkszWduRKUgI35hK1n4WrRWib/+xOAni8UWZ9NgJjYC14+8vJRbmuDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T06:51:21.701157Z","bundle_sha256":"1dbe2f0c954f98d663c2558ce97225c83ad8269568312f10238d6ac942e6b74a"}}