{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4ZIMC4LQXDH4XOBQVBN4Q6HTUU","short_pith_number":"pith:4ZIMC4LQ","canonical_record":{"source":{"id":"1707.04306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-13T20:31:13Z","cross_cats_sorted":[],"title_canon_sha256":"ac57ec6feb2f0924c97c1b6944eff091e2ac3b7e570625e9dab077c5f54d62c1","abstract_canon_sha256":"380cc0ffe9d4f913ce856a7f85aa2dbe004bd1169da790ca59e5ca805a731057"},"schema_version":"1.0"},"canonical_sha256":"e650c17170b8cfcbb830a85bc878f3a501fd16ee1bfbee5d4e682e2c47d47d41","source":{"kind":"arxiv","id":"1707.04306","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04306","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04306v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04306","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"4ZIMC4LQXDH4","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4ZIMC4LQXDH4XOBQ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4ZIMC4LQ","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4ZIMC4LQXDH4XOBQVBN4Q6HTUU","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-13T20:31:13Z","cross_cats_sorted":[],"title_canon_sha256":"ac57ec6feb2f0924c97c1b6944eff091e2ac3b7e570625e9dab077c5f54d62c1","abstract_canon_sha256":"380cc0ffe9d4f913ce856a7f85aa2dbe004bd1169da790ca59e5ca805a731057"},"schema_version":"1.0"},"canonical_sha256":"e650c17170b8cfcbb830a85bc878f3a501fd16ee1bfbee5d4e682e2c47d47d41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.690844Z","signature_b64":"jC+6s9SjZ8BWhE9i57wH3fFcvXLu8+0y9d19GM+Pyzh2ZaXwpEKc2lNvqTXtEkFQAwZ5/iX/d67ys9nsxfcbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e650c17170b8cfcbb830a85bc878f3a501fd16ee1bfbee5d4e682e2c47d47d41","last_reissued_at":"2026-05-18T00:40:18.690184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.690184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04306","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:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4EfdMfWABGtqzJgEapnCAtJ50nEaJBFFdOJunSXrHLq/LAL+jp5vZ6iYbr7+BxzonvtaaqHC9RC6a5+tJBrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T06:35:10.071018Z"},"content_sha256":"37862cfedc846a2f0428270d89c2bd9eb057dbebbd49844553c2d0037bbd16b9","schema_version":"1.0","event_id":"sha256:37862cfedc846a2f0428270d89c2bd9eb057dbebbd49844553c2d0037bbd16b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4ZIMC4LQXDH4XOBQVBN4Q6HTUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Scalable Algorithm for Gaussian Graphical Models with Change-Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Leland Bybee, Yves Atchade","submitted_at":"2017-07-13T20:31:13Z","abstract_excerpt":"Graphical models with change-points are computationally challenging to fit, particularly in cases where the number of observation points and the number of nodes in the graph are large. Focusing on Gaussian graphical models, we introduce an approximate majorize-minimize (MM) algorithm that can be useful for computing change-points in large graphical models. The proposed algorithm is an order of magnitude faster than a brute force search. Under some regularity conditions on the data generating process, we show that with high probability, the algorithm converges to a value that is within statisti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04306","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:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9qSp8nHCaTwyGI1NuRfCuwiL4WtoD2BS7sh8kCkUe7r7RR4TJ2klVGbmavT9SCwofbw5PmE1iMKJDtPUNnVIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T06:35:10.071375Z"},"content_sha256":"752b0183b13ebb19708fb22f9b1c73c6168bc69646bff816650b94f8c057b3c4","schema_version":"1.0","event_id":"sha256:752b0183b13ebb19708fb22f9b1c73c6168bc69646bff816650b94f8c057b3c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZIMC4LQXDH4XOBQVBN4Q6HTUU/bundle.json","state_url":"https://pith.science/pith/4ZIMC4LQXDH4XOBQVBN4Q6HTUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZIMC4LQXDH4XOBQVBN4Q6HTUU/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-30T06:35:10Z","links":{"resolver":"https://pith.science/pith/4ZIMC4LQXDH4XOBQVBN4Q6HTUU","bundle":"https://pith.science/pith/4ZIMC4LQXDH4XOBQVBN4Q6HTUU/bundle.json","state":"https://pith.science/pith/4ZIMC4LQXDH4XOBQVBN4Q6HTUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZIMC4LQXDH4XOBQVBN4Q6HTUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4ZIMC4LQXDH4XOBQVBN4Q6HTUU","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":"380cc0ffe9d4f913ce856a7f85aa2dbe004bd1169da790ca59e5ca805a731057","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-13T20:31:13Z","title_canon_sha256":"ac57ec6feb2f0924c97c1b6944eff091e2ac3b7e570625e9dab077c5f54d62c1"},"schema_version":"1.0","source":{"id":"1707.04306","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04306","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04306v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04306","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"4ZIMC4LQXDH4","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4ZIMC4LQXDH4XOBQ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4ZIMC4LQ","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:752b0183b13ebb19708fb22f9b1c73c6168bc69646bff816650b94f8c057b3c4","target":"graph","created_at":"2026-05-18T00:40:18Z","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":"Graphical models with change-points are computationally challenging to fit, particularly in cases where the number of observation points and the number of nodes in the graph are large. Focusing on Gaussian graphical models, we introduce an approximate majorize-minimize (MM) algorithm that can be useful for computing change-points in large graphical models. The proposed algorithm is an order of magnitude faster than a brute force search. Under some regularity conditions on the data generating process, we show that with high probability, the algorithm converges to a value that is within statisti","authors_text":"Leland Bybee, Yves Atchade","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-13T20:31:13Z","title":"A Scalable Algorithm for Gaussian Graphical Models with Change-Points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04306","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:37862cfedc846a2f0428270d89c2bd9eb057dbebbd49844553c2d0037bbd16b9","target":"record","created_at":"2026-05-18T00:40:18Z","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":"380cc0ffe9d4f913ce856a7f85aa2dbe004bd1169da790ca59e5ca805a731057","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-13T20:31:13Z","title_canon_sha256":"ac57ec6feb2f0924c97c1b6944eff091e2ac3b7e570625e9dab077c5f54d62c1"},"schema_version":"1.0","source":{"id":"1707.04306","kind":"arxiv","version":1}},"canonical_sha256":"e650c17170b8cfcbb830a85bc878f3a501fd16ee1bfbee5d4e682e2c47d47d41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e650c17170b8cfcbb830a85bc878f3a501fd16ee1bfbee5d4e682e2c47d47d41","first_computed_at":"2026-05-18T00:40:18.690184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:18.690184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jC+6s9SjZ8BWhE9i57wH3fFcvXLu8+0y9d19GM+Pyzh2ZaXwpEKc2lNvqTXtEkFQAwZ5/iX/d67ys9nsxfcbAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:18.690844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04306","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37862cfedc846a2f0428270d89c2bd9eb057dbebbd49844553c2d0037bbd16b9","sha256:752b0183b13ebb19708fb22f9b1c73c6168bc69646bff816650b94f8c057b3c4"],"state_sha256":"34a2e420b25e5f6ab5f3768fd523c2c0d77672bd8f8b7d27f52dfa7a34a98ea6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygMBh0hCPubkgFU88LPBa1lx6tuQjMViRgFYPZzLm0bDJrEO0wlT8gvoCWPnJEm3NOKj/Zyr5UCgmZ5XK+ISCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T06:35:10.073255Z","bundle_sha256":"f4e6ff6e2b91d100e5cc807b52b3c82884f9966dc2173d31189ea9be7856fe2a"}}