{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:646W3CPUPAZ4CVQKTA7ILOUHLT","short_pith_number":"pith:646W3CPU","canonical_record":{"source":{"id":"2410.07007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-10-09T15:52:11Z","cross_cats_sorted":["math.AG","stat.TH"],"title_canon_sha256":"9312eb2ecb14dbd00b4c6b9faa77469628ef8982e98100f4c5c08a71e27c44b5","abstract_canon_sha256":"3e95615f46067a7e6f1a55622f57615694b5b46a234399872f3c23ca1206fb51"},"schema_version":"1.0"},"canonical_sha256":"f73d6d89f47833c1560a983e85ba875cfd81ea7e71dcc1f479cb3b043fcd2c3d","source":{"kind":"arxiv","id":"2410.07007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.07007","created_at":"2026-07-05T09:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"2410.07007v1","created_at":"2026-07-05T09:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07007","created_at":"2026-07-05T09:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"646W3CPUPAZ4","created_at":"2026-07-05T09:18:09Z"},{"alias_kind":"pith_short_16","alias_value":"646W3CPUPAZ4CVQK","created_at":"2026-07-05T09:18:09Z"},{"alias_kind":"pith_short_8","alias_value":"646W3CPU","created_at":"2026-07-05T09:18:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:646W3CPUPAZ4CVQKTA7ILOUHLT","target":"record","payload":{"canonical_record":{"source":{"id":"2410.07007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-10-09T15:52:11Z","cross_cats_sorted":["math.AG","stat.TH"],"title_canon_sha256":"9312eb2ecb14dbd00b4c6b9faa77469628ef8982e98100f4c5c08a71e27c44b5","abstract_canon_sha256":"3e95615f46067a7e6f1a55622f57615694b5b46a234399872f3c23ca1206fb51"},"schema_version":"1.0"},"canonical_sha256":"f73d6d89f47833c1560a983e85ba875cfd81ea7e71dcc1f479cb3b043fcd2c3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:09.599752Z","signature_b64":"lHaJB/18LAvEWLtEdIcX4HcZ9CQiOpdB3ZWzbGpm7ZWN2f41HGftLSkPeAJkMyOIzDsP5UGxMdxgoYRoMDf+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f73d6d89f47833c1560a983e85ba875cfd81ea7e71dcc1f479cb3b043fcd2c3d","last_reissued_at":"2026-07-05T09:18:09.599290Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:09.599290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.07007","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-07-05T09:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1VWu7G8aoRptG1Po3q/bdsHB13COuAHXLGqCv7bxXauyNjlEeIc+tP7dUq+3vmY72UzL4qBwBwbzKEBK8HUjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:50:25.052875Z"},"content_sha256":"ca81f3fa217cdd7a304bbe0b36c902a94f3138a16ad4d6fcc3c2ea8ebb39e444","schema_version":"1.0","event_id":"sha256:ca81f3fa217cdd7a304bbe0b36c902a94f3138a16ad4d6fcc3c2ea8ebb39e444"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:646W3CPUPAZ4CVQKTA7ILOUHLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the maximum likelihood degree for Gaussian graphical models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","stat.TH"],"primary_cat":"math.ST","authors_text":"Carlos Am\\'endola, Martin Vodi\\v{c}ka, Mateusz Micha{\\l}ek, Rodica Andreea Dinu","submitted_at":"2024-10-09T15:52:11Z","abstract_excerpt":"In this paper we revisit the likelihood geometry of Gaussian graphical models. We give a detailed proof that the ML-degree behaves monotonically on induced subgraphs. Furthermore, we complete a missing argument that the ML-degree of the $n$-th cycle is larger than one for any $n\\geq 4$, therefore completing the characterization that the only Gaussian graphical models with rational maximum likelihood estimator are the ones corresponding to chordal (decomposable) graphs. Finally, we prove that the formula for the ML-degree of a cycle conjectured by Drton, Sturmfels and Sullivant provides a corre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07007","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.07007/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hAUyA8LDG1AWpwkCE9+Do476iG4AVe98S4Kip92pV2yteCDlBQ6pe60F0nxZpsu/RhUFzC+B0EY2lb3RIh8ADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:50:25.053378Z"},"content_sha256":"218196b3d4afccf6c4c62fa620e530693b52fed7e9b3a3a6e86e23a7e260f360","schema_version":"1.0","event_id":"sha256:218196b3d4afccf6c4c62fa620e530693b52fed7e9b3a3a6e86e23a7e260f360"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/646W3CPUPAZ4CVQKTA7ILOUHLT/bundle.json","state_url":"https://pith.science/pith/646W3CPUPAZ4CVQKTA7ILOUHLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/646W3CPUPAZ4CVQKTA7ILOUHLT/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-08-09T01:50:25Z","links":{"resolver":"https://pith.science/pith/646W3CPUPAZ4CVQKTA7ILOUHLT","bundle":"https://pith.science/pith/646W3CPUPAZ4CVQKTA7ILOUHLT/bundle.json","state":"https://pith.science/pith/646W3CPUPAZ4CVQKTA7ILOUHLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/646W3CPUPAZ4CVQKTA7ILOUHLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:646W3CPUPAZ4CVQKTA7ILOUHLT","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":"3e95615f46067a7e6f1a55622f57615694b5b46a234399872f3c23ca1206fb51","cross_cats_sorted":["math.AG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-10-09T15:52:11Z","title_canon_sha256":"9312eb2ecb14dbd00b4c6b9faa77469628ef8982e98100f4c5c08a71e27c44b5"},"schema_version":"1.0","source":{"id":"2410.07007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.07007","created_at":"2026-07-05T09:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"2410.07007v1","created_at":"2026-07-05T09:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07007","created_at":"2026-07-05T09:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"646W3CPUPAZ4","created_at":"2026-07-05T09:18:09Z"},{"alias_kind":"pith_short_16","alias_value":"646W3CPUPAZ4CVQK","created_at":"2026-07-05T09:18:09Z"},{"alias_kind":"pith_short_8","alias_value":"646W3CPU","created_at":"2026-07-05T09:18:09Z"}],"graph_snapshots":[{"event_id":"sha256:218196b3d4afccf6c4c62fa620e530693b52fed7e9b3a3a6e86e23a7e260f360","target":"graph","created_at":"2026-07-05T09:18:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.07007/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we revisit the likelihood geometry of Gaussian graphical models. We give a detailed proof that the ML-degree behaves monotonically on induced subgraphs. Furthermore, we complete a missing argument that the ML-degree of the $n$-th cycle is larger than one for any $n\\geq 4$, therefore completing the characterization that the only Gaussian graphical models with rational maximum likelihood estimator are the ones corresponding to chordal (decomposable) graphs. Finally, we prove that the formula for the ML-degree of a cycle conjectured by Drton, Sturmfels and Sullivant provides a corre","authors_text":"Carlos Am\\'endola, Martin Vodi\\v{c}ka, Mateusz Micha{\\l}ek, Rodica Andreea Dinu","cross_cats":["math.AG","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-10-09T15:52:11Z","title":"On the maximum likelihood degree for Gaussian graphical models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07007","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:ca81f3fa217cdd7a304bbe0b36c902a94f3138a16ad4d6fcc3c2ea8ebb39e444","target":"record","created_at":"2026-07-05T09:18:09Z","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":"3e95615f46067a7e6f1a55622f57615694b5b46a234399872f3c23ca1206fb51","cross_cats_sorted":["math.AG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-10-09T15:52:11Z","title_canon_sha256":"9312eb2ecb14dbd00b4c6b9faa77469628ef8982e98100f4c5c08a71e27c44b5"},"schema_version":"1.0","source":{"id":"2410.07007","kind":"arxiv","version":1}},"canonical_sha256":"f73d6d89f47833c1560a983e85ba875cfd81ea7e71dcc1f479cb3b043fcd2c3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f73d6d89f47833c1560a983e85ba875cfd81ea7e71dcc1f479cb3b043fcd2c3d","first_computed_at":"2026-07-05T09:18:09.599290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:18:09.599290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lHaJB/18LAvEWLtEdIcX4HcZ9CQiOpdB3ZWzbGpm7ZWN2f41HGftLSkPeAJkMyOIzDsP5UGxMdxgoYRoMDf+CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:18:09.599752Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.07007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca81f3fa217cdd7a304bbe0b36c902a94f3138a16ad4d6fcc3c2ea8ebb39e444","sha256:218196b3d4afccf6c4c62fa620e530693b52fed7e9b3a3a6e86e23a7e260f360"],"state_sha256":"545590af681cbe3384351840b871fa9862b5ab79562d4db45eee574ccf08f545"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nje1OSRgyp/UpqkyPg0yN1QpRENUr6anRW+ctQkixPAkELyuyygIAjaoN1Ai/9l9Mv6ta7W21G3AP2hyazrCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T01:50:25.057720Z","bundle_sha256":"ed5b42fc172944c73eeecff17cb4414a6fc75bb10ccbf24d65a39cd60ff3bb1d"}}