{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4X3GZ3MOJC756TXAYTX2NDJ5NV","short_pith_number":"pith:4X3GZ3MO","canonical_record":{"source":{"id":"1501.03013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-13T14:14:49Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"0d5f6df0e1f403fc5c5a196df70a416030574bde742bf58317eb0156360d4231","abstract_canon_sha256":"6cd220cae3831fb4c3d0c0b72e10511bd4822ff3d1052fb1d43a5748b761922a"},"schema_version":"1.0"},"canonical_sha256":"e5f66ced8e48bfdf4ee0c4efa68d3d6d7846df7b2a8f999d2128b4e19f61c061","source":{"kind":"arxiv","id":"1501.03013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03013","created_at":"2026-05-18T02:29:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03013v1","created_at":"2026-05-18T02:29:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03013","created_at":"2026-05-18T02:29:30Z"},{"alias_kind":"pith_short_12","alias_value":"4X3GZ3MOJC75","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4X3GZ3MOJC756TXA","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4X3GZ3MO","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4X3GZ3MOJC756TXAYTX2NDJ5NV","target":"record","payload":{"canonical_record":{"source":{"id":"1501.03013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-13T14:14:49Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"0d5f6df0e1f403fc5c5a196df70a416030574bde742bf58317eb0156360d4231","abstract_canon_sha256":"6cd220cae3831fb4c3d0c0b72e10511bd4822ff3d1052fb1d43a5748b761922a"},"schema_version":"1.0"},"canonical_sha256":"e5f66ced8e48bfdf4ee0c4efa68d3d6d7846df7b2a8f999d2128b4e19f61c061","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:30.679970Z","signature_b64":"Z7zrRR/bW0m2y1r+Lzc510ug3nDXY2BpNmP22EVLN4kRpskmL6I/9H5IoYHVt69VoufSS+YRpuZeNpb62tkbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5f66ced8e48bfdf4ee0c4efa68d3d6d7846df7b2a8f999d2128b4e19f61c061","last_reissued_at":"2026-05-18T02:29:30.679567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:30.679567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.03013","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-18T02:29:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TncBzATCsDZwJiJHKMVSL0up/aHuMu/uVsdXKFVQ221Ho5RqxzLrX+R1uMG26wGuVsQef2UgFOUX2t1QRBtRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:38:54.813835Z"},"content_sha256":"9bd9e5818bc68de36d85ad294bd6b6c8773563c11685305581ddeeafe2b3fd77","schema_version":"1.0","event_id":"sha256:9bd9e5818bc68de36d85ad294bd6b6c8773563c11685305581ddeeafe2b3fd77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4X3GZ3MOJC756TXAYTX2NDJ5NV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automorphism groups of Gaussian chain graph models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Jan Draisma, Piotr Zwiernik","submitted_at":"2015-01-13T14:14:49Z","abstract_excerpt":"In this paper we extend earlier work on groups acting on Gaussian graphical models to Gaussian Bayesian networks and more general Gaussian models defined by chain graphs. We discuss the maximal group which leaves a given model invariant and provide basic statistical applications of this result. This includes equivariant estimation, maximal invariants and robustness. The computation of the group requires finding the essential graph. However, by applying Studeny's theory of imsets we show that computations for DAGs can be performed efficiently without building the essential graph. In our proof w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03013","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-18T02:29:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bzw+fbjqs4KHcpSeWWcvxzcyJdkv1nyYL07CZ6MQIuT7O4t7A+lHqdc0xiKW3hjupnrWdaN4Q2c88HL6llGBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:38:54.814192Z"},"content_sha256":"b6c8837959497b560a54cc8e959c2724511b232b3a6d0ce89b5cf58b6d288cd3","schema_version":"1.0","event_id":"sha256:b6c8837959497b560a54cc8e959c2724511b232b3a6d0ce89b5cf58b6d288cd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4X3GZ3MOJC756TXAYTX2NDJ5NV/bundle.json","state_url":"https://pith.science/pith/4X3GZ3MOJC756TXAYTX2NDJ5NV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4X3GZ3MOJC756TXAYTX2NDJ5NV/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-05-27T01:38:54Z","links":{"resolver":"https://pith.science/pith/4X3GZ3MOJC756TXAYTX2NDJ5NV","bundle":"https://pith.science/pith/4X3GZ3MOJC756TXAYTX2NDJ5NV/bundle.json","state":"https://pith.science/pith/4X3GZ3MOJC756TXAYTX2NDJ5NV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4X3GZ3MOJC756TXAYTX2NDJ5NV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4X3GZ3MOJC756TXAYTX2NDJ5NV","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":"6cd220cae3831fb4c3d0c0b72e10511bd4822ff3d1052fb1d43a5748b761922a","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-13T14:14:49Z","title_canon_sha256":"0d5f6df0e1f403fc5c5a196df70a416030574bde742bf58317eb0156360d4231"},"schema_version":"1.0","source":{"id":"1501.03013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03013","created_at":"2026-05-18T02:29:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03013v1","created_at":"2026-05-18T02:29:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03013","created_at":"2026-05-18T02:29:30Z"},{"alias_kind":"pith_short_12","alias_value":"4X3GZ3MOJC75","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4X3GZ3MOJC756TXA","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4X3GZ3MO","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:b6c8837959497b560a54cc8e959c2724511b232b3a6d0ce89b5cf58b6d288cd3","target":"graph","created_at":"2026-05-18T02:29:30Z","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":"In this paper we extend earlier work on groups acting on Gaussian graphical models to Gaussian Bayesian networks and more general Gaussian models defined by chain graphs. We discuss the maximal group which leaves a given model invariant and provide basic statistical applications of this result. This includes equivariant estimation, maximal invariants and robustness. The computation of the group requires finding the essential graph. However, by applying Studeny's theory of imsets we show that computations for DAGs can be performed efficiently without building the essential graph. In our proof w","authors_text":"Jan Draisma, Piotr Zwiernik","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-13T14:14:49Z","title":"Automorphism groups of Gaussian chain graph models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03013","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:9bd9e5818bc68de36d85ad294bd6b6c8773563c11685305581ddeeafe2b3fd77","target":"record","created_at":"2026-05-18T02:29:30Z","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":"6cd220cae3831fb4c3d0c0b72e10511bd4822ff3d1052fb1d43a5748b761922a","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-13T14:14:49Z","title_canon_sha256":"0d5f6df0e1f403fc5c5a196df70a416030574bde742bf58317eb0156360d4231"},"schema_version":"1.0","source":{"id":"1501.03013","kind":"arxiv","version":1}},"canonical_sha256":"e5f66ced8e48bfdf4ee0c4efa68d3d6d7846df7b2a8f999d2128b4e19f61c061","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5f66ced8e48bfdf4ee0c4efa68d3d6d7846df7b2a8f999d2128b4e19f61c061","first_computed_at":"2026-05-18T02:29:30.679567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:30.679567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z7zrRR/bW0m2y1r+Lzc510ug3nDXY2BpNmP22EVLN4kRpskmL6I/9H5IoYHVt69VoufSS+YRpuZeNpb62tkbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:30.679970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.03013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bd9e5818bc68de36d85ad294bd6b6c8773563c11685305581ddeeafe2b3fd77","sha256:b6c8837959497b560a54cc8e959c2724511b232b3a6d0ce89b5cf58b6d288cd3"],"state_sha256":"4227b910dcea470a487c8c3dcd2d4661d88543d858ea3474b0f64d7a22b2e8b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ch4+0s1rVPpcjJzEGP87iI/YzSd/cChOhQ2Y+YWqg+701JPy0C+vFUdE8/DPwRbK6OWW5CwHYaukEsiWDo8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:38:54.816725Z","bundle_sha256":"23233a160f1f1866872ea1011492d0cf0f1f9d2a0bcaac9350151bbaa2187a2c"}}