{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GVCWQXC5SQRC34M33JKXJHST64","short_pith_number":"pith:GVCWQXC5","canonical_record":{"source":{"id":"1503.03879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-03-12T20:15:35Z","cross_cats_sorted":["stat.AP","stat.CO","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"35868691898b702e83a742b0ed97c8818463ac49ea93645a9f2f743692a1f73e","abstract_canon_sha256":"7733f4d388201077bba3c7827bd6b71b7c7e65a8a0eccebf5330c706cfbd235c"},"schema_version":"1.0"},"canonical_sha256":"3545685c5d94222df19bda55749e53f731ed91bb3d2da14ca837389c25d5377d","source":{"kind":"arxiv","id":"1503.03879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03879","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03879v1","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03879","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"GVCWQXC5SQRC","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GVCWQXC5SQRC34M3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GVCWQXC5","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GVCWQXC5SQRC34M33JKXJHST64","target":"record","payload":{"canonical_record":{"source":{"id":"1503.03879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-03-12T20:15:35Z","cross_cats_sorted":["stat.AP","stat.CO","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"35868691898b702e83a742b0ed97c8818463ac49ea93645a9f2f743692a1f73e","abstract_canon_sha256":"7733f4d388201077bba3c7827bd6b71b7c7e65a8a0eccebf5330c706cfbd235c"},"schema_version":"1.0"},"canonical_sha256":"3545685c5d94222df19bda55749e53f731ed91bb3d2da14ca837389c25d5377d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:26.559965Z","signature_b64":"HdR5XcAxrem0FcSKP1VnRlD0WdI803lb7Kz8Hu4fo5vhwXFljmquLGug5oSvfSM62dk8cKD5ujvflIpg5xePDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3545685c5d94222df19bda55749e53f731ed91bb3d2da14ca837389c25d5377d","last_reissued_at":"2026-05-18T00:03:26.559507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:26.559507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.03879","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:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mgi2ExRBzJUbtJ3s030bZXKYHSmCgPJkLJXd213oKsnKsEYmEHM+fubf2k0qIxy0TeOQy5OahlcF8GypKqOqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:22:12.733225Z"},"content_sha256":"b01eee83e73bf1863c57e8ea49272ce87c178efe40d6672afb947c5f071e2f7d","schema_version":"1.0","event_id":"sha256:b01eee83e73bf1863c57e8ea49272ce87c178efe40d6672afb947c5f071e2f7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GVCWQXC5SQRC34M33JKXJHST64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Qualitative inequalities for squared partial correlations of a Gaussian random vector","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.CO","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Sanjay Chaudhuri","submitted_at":"2015-03-12T20:15:35Z","abstract_excerpt":"We describe various sets of conditional independence relationships, sufficient for qualitatively comparing non-vanishing squared partial correlations of a Gaussian random vector. These sufficient conditions are satisfied by several graphical Markov models. Rules for comparing degree of association among the vertices of such Gaussian graphical models are also developed. We apply these rules to compare conditional dependencies on Gaussian trees. In particular for trees, we show that such dependence can be completely characterized by the length of the paths joining the dependent vertices to each "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03879","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:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgM6lxmgv3JyjYFirr1uKGYl7Zi36iCnibbn2a8gI/S/Odi+2S/CG7csCVHwckvQq7BP26MzeZjmDoGz42VUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:22:12.733594Z"},"content_sha256":"48bca030b4efaee5abb5d6103fdbb9df6e88e03f8ad01e8f0fd711c98c3d81a4","schema_version":"1.0","event_id":"sha256:48bca030b4efaee5abb5d6103fdbb9df6e88e03f8ad01e8f0fd711c98c3d81a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVCWQXC5SQRC34M33JKXJHST64/bundle.json","state_url":"https://pith.science/pith/GVCWQXC5SQRC34M33JKXJHST64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVCWQXC5SQRC34M33JKXJHST64/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-06-24T21:22:12Z","links":{"resolver":"https://pith.science/pith/GVCWQXC5SQRC34M33JKXJHST64","bundle":"https://pith.science/pith/GVCWQXC5SQRC34M33JKXJHST64/bundle.json","state":"https://pith.science/pith/GVCWQXC5SQRC34M33JKXJHST64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVCWQXC5SQRC34M33JKXJHST64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GVCWQXC5SQRC34M33JKXJHST64","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":"7733f4d388201077bba3c7827bd6b71b7c7e65a8a0eccebf5330c706cfbd235c","cross_cats_sorted":["stat.AP","stat.CO","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-03-12T20:15:35Z","title_canon_sha256":"35868691898b702e83a742b0ed97c8818463ac49ea93645a9f2f743692a1f73e"},"schema_version":"1.0","source":{"id":"1503.03879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03879","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03879v1","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03879","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"GVCWQXC5SQRC","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GVCWQXC5SQRC34M3","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GVCWQXC5","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:48bca030b4efaee5abb5d6103fdbb9df6e88e03f8ad01e8f0fd711c98c3d81a4","target":"graph","created_at":"2026-05-18T00:03:26Z","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":"We describe various sets of conditional independence relationships, sufficient for qualitatively comparing non-vanishing squared partial correlations of a Gaussian random vector. These sufficient conditions are satisfied by several graphical Markov models. Rules for comparing degree of association among the vertices of such Gaussian graphical models are also developed. We apply these rules to compare conditional dependencies on Gaussian trees. In particular for trees, we show that such dependence can be completely characterized by the length of the paths joining the dependent vertices to each ","authors_text":"Sanjay Chaudhuri","cross_cats":["stat.AP","stat.CO","stat.ME","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-03-12T20:15:35Z","title":"Qualitative inequalities for squared partial correlations of a Gaussian random vector"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03879","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:b01eee83e73bf1863c57e8ea49272ce87c178efe40d6672afb947c5f071e2f7d","target":"record","created_at":"2026-05-18T00:03:26Z","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":"7733f4d388201077bba3c7827bd6b71b7c7e65a8a0eccebf5330c706cfbd235c","cross_cats_sorted":["stat.AP","stat.CO","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-03-12T20:15:35Z","title_canon_sha256":"35868691898b702e83a742b0ed97c8818463ac49ea93645a9f2f743692a1f73e"},"schema_version":"1.0","source":{"id":"1503.03879","kind":"arxiv","version":1}},"canonical_sha256":"3545685c5d94222df19bda55749e53f731ed91bb3d2da14ca837389c25d5377d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3545685c5d94222df19bda55749e53f731ed91bb3d2da14ca837389c25d5377d","first_computed_at":"2026-05-18T00:03:26.559507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:26.559507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HdR5XcAxrem0FcSKP1VnRlD0WdI803lb7Kz8Hu4fo5vhwXFljmquLGug5oSvfSM62dk8cKD5ujvflIpg5xePDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:26.559965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b01eee83e73bf1863c57e8ea49272ce87c178efe40d6672afb947c5f071e2f7d","sha256:48bca030b4efaee5abb5d6103fdbb9df6e88e03f8ad01e8f0fd711c98c3d81a4"],"state_sha256":"d4f47337f72da6fa7db042d6e63c7a988e0ba2c744ab3a92de8eeb683901bd2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TT7ICruHPx0Ept/lxi6UmBzVvPPeo+oYwlVkvPogradL9PEqy9BqP/7R0eBAdI/LhNa8FdMRgXZtBspAKqh/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:22:12.735638Z","bundle_sha256":"420c3f149a580f72a4ecbf6086172e972274467e1603bde4fc5f0d5a167b82d4"}}