{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TAHL4WIIHB73FBYDMFNJJ6AW5R","short_pith_number":"pith:TAHL4WII","canonical_record":{"source":{"id":"2605.15531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T02:02:36Z","cross_cats_sorted":["math.CO","stat.TH"],"title_canon_sha256":"d84c2848a73d8cfd66c1a6b9dc5249c9d1964bf7bbc5e217f37f93f69b68e362","abstract_canon_sha256":"04cda0b859209116bf667dc4c05f72f30dc4eecc8e5058e89f1f0ddc84480ced"},"schema_version":"1.0"},"canonical_sha256":"980ebe5908387fb28703615a94f816ec4809a42ac93454b5d985e2073d297d00","source":{"kind":"arxiv","id":"2605.15531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15531","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15531v1","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15531","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_12","alias_value":"TAHL4WIIHB73","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_16","alias_value":"TAHL4WIIHB73FBYD","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_8","alias_value":"TAHL4WII","created_at":"2026-05-20T00:01:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TAHL4WIIHB73FBYDMFNJJ6AW5R","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T02:02:36Z","cross_cats_sorted":["math.CO","stat.TH"],"title_canon_sha256":"d84c2848a73d8cfd66c1a6b9dc5249c9d1964bf7bbc5e217f37f93f69b68e362","abstract_canon_sha256":"04cda0b859209116bf667dc4c05f72f30dc4eecc8e5058e89f1f0ddc84480ced"},"schema_version":"1.0"},"canonical_sha256":"980ebe5908387fb28703615a94f816ec4809a42ac93454b5d985e2073d297d00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:03.688019Z","signature_b64":"dajvw72yHvlgsXs08opo3uTki+0GACfV4QhHEiuPvctw9xucNkZl+kxTws7Wm3PKCDnRYP/0NMF4ea9lS1rxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"980ebe5908387fb28703615a94f816ec4809a42ac93454b5d985e2073d297d00","last_reissued_at":"2026-05-20T00:01:03.687197Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:03.687197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15531","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-20T00:01:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LpCdh472+rJtZBtE8SL7sWEoCQo0VR7VoPVEC+vz7pNCLeZaD0xHBPJj8AuTk4Eosgf6ffivSxjdKuiqbrlVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:14:45.950152Z"},"content_sha256":"272002c0c0fc04da0e427281b5f521010003b0fc26616c110fbae266e4408ef1","schema_version":"1.0","event_id":"sha256:272002c0c0fc04da0e427281b5f521010003b0fc26616c110fbae266e4408ef1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TAHL4WIIHB73FBYDMFNJJ6AW5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the Number of Modes of a Gaussian Mixture Density","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Gaussian mixture densities with k components have at most floor of (min of two algebraic bounds plus one) divided by two modes when the modal set is finite.","cross_cats":["math.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Hien Duy Nguyen","submitted_at":"2026-05-15T02:02:36Z","abstract_excerpt":"We derive explicit upper bounds for the number of nondegenerate critical points of a $k$-component Gaussian mixture density in $\\mathbb{R}^d$, and the number of modes when the modal set is finite, together with lower bounds. By normalizing the critical-point equations by a reference component, for $k\\ge2$ we get the direct Pfaffian bound \\[ U_{\\mathrm{het}}(d,k)=2^{\\,d+\\binom{k-1}{2}}\\left(d+2\\min(d,k-1)+1\\right)^{k-1}. \\] For the same parameter range, an exact elimination augmented by an algebraic reciprocal variable gives the alternative bound \\[ U_{\\mathrm{aug}}(d,k)= 2^{\\binom{k-1}{2}}(d+1"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For k≥2, the direct Pfaffian bound is U_het(d,k)=2^{d+binom(k-1,2)}(d+2 min(d,k-1)+1)^{k-1}, with the best critical-point bound being the minimum of this and the augmented bound, and the finite-mode bound improved by Morse theory to floor((min{U_het,U_aug}+1)/2).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The critical-point equations can be normalized by a reference component without loss of generality for k≥2, and the Morse-theoretic argument applies directly to improve the finite-mode upper bound when the modal set is finite.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Explicit upper bounds on nondegenerate critical points of k-component Gaussian mixture densities are given via Pfaffian and algebraic elimination methods, with homoscedastic simplifications and combinatorial lower bounds.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Gaussian mixture densities with k components have at most floor of (min of two algebraic bounds plus one) divided by two modes when the modal set is finite.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1409fc5e8807f531f6214cd1e37d0dbdcb22f813852cddf7a2e417149c3caa71"},"source":{"id":"2605.15531","kind":"arxiv","version":1},"verdict":{"id":"06f58249-98d3-4191-b4e7-04975a0fac47","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T14:31:00.102044Z","strongest_claim":"For k≥2, the direct Pfaffian bound is U_het(d,k)=2^{d+binom(k-1,2)}(d+2 min(d,k-1)+1)^{k-1}, with the best critical-point bound being the minimum of this and the augmented bound, and the finite-mode bound improved by Morse theory to floor((min{U_het,U_aug}+1)/2).","one_line_summary":"Explicit upper bounds on nondegenerate critical points of k-component Gaussian mixture densities are given via Pfaffian and algebraic elimination methods, with homoscedastic simplifications and combinatorial lower bounds.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The critical-point equations can be normalized by a reference component without loss of generality for k≥2, and the Morse-theoretic argument applies directly to improve the finite-mode upper bound when the modal set is finite.","pith_extraction_headline":"Gaussian mixture densities with k components have at most floor of (min of two algebraic bounds plus one) divided by two modes when the modal set is finite."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15531/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.515281Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:37:38.259771Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T14:22:02.108831Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.036918Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.834966Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.372461Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.620502Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"940780743753b995de266d386cd58cfd1a5238aa8d0325c4825607549af19d57"},"references":{"count":17,"sample":[{"doi":"10.1093/imaiai/iaz013","year":2013,"title":"Alexandrovich, G., Holzmann, H., and Ray, S. (2013). On the number of modes of finite mixtures of elliptical distributions. In B. Lausen, D. van den Poel, and A. Ultsch (Eds.),Algorithms from and for ","work_id":"ad6717be-0795-437b-a810-cc76802101d2","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1995,"title":"Cheng, Y.(1995).Meanshift, modeseeking, andclustering.IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(8), 790–799. 34","work_id":"8b2c711e-5cf4-475e-babd-f0b045b9f3d8","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1996,"title":"Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. (1996). A density-based algorithm for discov- ering clusters in large spatial databases with noise. InProceedings of the Second International Conferen","work_id":"8d5425b3-ccc2-4d21-81c6-010572a6b2c6","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"Gabrielov, A., and Vorobjov, N. (2004). Complexity of computations with Pfaffian and Noetherian functions. InNormal Forms, Bifurcations and Finiteness Problems in Differential Equations (pp. 211–250).","work_id":"e9263ee7-2412-4d7a-8268-9487722393e9","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Kabata, Y., Matsumoto, H., Uchida, S., and Ueki, M. (2025). Singularities in bivariate normal mixtures.Information Geometry, 8, 343–357","work_id":"cc2fa01a-b997-4c1b-8ac6-f4030b4096f9","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"b0bfa2899e3d9c9e0d8379c55651382760fdf4e6883de3d2c651c7e78e66996a","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":"06f58249-98d3-4191-b4e7-04975a0fac47"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63f+LjW7F3IHJhWl/mbqCRpr5sreWw6uBZZEG6L7P7Zp+jkbDbOehdQbTw8ypO1agbsQluilVx6Oxo+QblztBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:14:45.951410Z"},"content_sha256":"075d94d84737f552957f53d08dd6e8d1f3178f581f4a005aa8a5fbcaa30ab1ad","schema_version":"1.0","event_id":"sha256:075d94d84737f552957f53d08dd6e8d1f3178f581f4a005aa8a5fbcaa30ab1ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAHL4WIIHB73FBYDMFNJJ6AW5R/bundle.json","state_url":"https://pith.science/pith/TAHL4WIIHB73FBYDMFNJJ6AW5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAHL4WIIHB73FBYDMFNJJ6AW5R/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-20T11:14:45Z","links":{"resolver":"https://pith.science/pith/TAHL4WIIHB73FBYDMFNJJ6AW5R","bundle":"https://pith.science/pith/TAHL4WIIHB73FBYDMFNJJ6AW5R/bundle.json","state":"https://pith.science/pith/TAHL4WIIHB73FBYDMFNJJ6AW5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAHL4WIIHB73FBYDMFNJJ6AW5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TAHL4WIIHB73FBYDMFNJJ6AW5R","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":"04cda0b859209116bf667dc4c05f72f30dc4eecc8e5058e89f1f0ddc84480ced","cross_cats_sorted":["math.CO","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T02:02:36Z","title_canon_sha256":"d84c2848a73d8cfd66c1a6b9dc5249c9d1964bf7bbc5e217f37f93f69b68e362"},"schema_version":"1.0","source":{"id":"2605.15531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15531","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15531v1","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15531","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_12","alias_value":"TAHL4WIIHB73","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_16","alias_value":"TAHL4WIIHB73FBYD","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_8","alias_value":"TAHL4WII","created_at":"2026-05-20T00:01:03Z"}],"graph_snapshots":[{"event_id":"sha256:075d94d84737f552957f53d08dd6e8d1f3178f581f4a005aa8a5fbcaa30ab1ad","target":"graph","created_at":"2026-05-20T00:01:03Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For k≥2, the direct Pfaffian bound is U_het(d,k)=2^{d+binom(k-1,2)}(d+2 min(d,k-1)+1)^{k-1}, with the best critical-point bound being the minimum of this and the augmented bound, and the finite-mode bound improved by Morse theory to floor((min{U_het,U_aug}+1)/2)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The critical-point equations can be normalized by a reference component without loss of generality for k≥2, and the Morse-theoretic argument applies directly to improve the finite-mode upper bound when the modal set is finite."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Explicit upper bounds on nondegenerate critical points of k-component Gaussian mixture densities are given via Pfaffian and algebraic elimination methods, with homoscedastic simplifications and combinatorial lower bounds."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Gaussian mixture densities with k components have at most floor of (min of two algebraic bounds plus one) divided by two modes when the modal set is finite."}],"snapshot_sha256":"1409fc5e8807f531f6214cd1e37d0dbdcb22f813852cddf7a2e417149c3caa71"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.515281Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T14:37:38.259771Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T14:22:02.108831Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.036918Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.834966Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.372461Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.620502Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15531/integrity.json","findings":[],"snapshot_sha256":"940780743753b995de266d386cd58cfd1a5238aa8d0325c4825607549af19d57","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We derive explicit upper bounds for the number of nondegenerate critical points of a $k$-component Gaussian mixture density in $\\mathbb{R}^d$, and the number of modes when the modal set is finite, together with lower bounds. By normalizing the critical-point equations by a reference component, for $k\\ge2$ we get the direct Pfaffian bound \\[ U_{\\mathrm{het}}(d,k)=2^{\\,d+\\binom{k-1}{2}}\\left(d+2\\min(d,k-1)+1\\right)^{k-1}. \\] For the same parameter range, an exact elimination augmented by an algebraic reciprocal variable gives the alternative bound \\[ U_{\\mathrm{aug}}(d,k)= 2^{\\binom{k-1}{2}}(d+1","authors_text":"Hien Duy Nguyen","cross_cats":["math.CO","stat.TH"],"headline":"Gaussian mixture densities with k components have at most floor of (min of two algebraic bounds plus one) divided by two modes when the modal set is finite.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T02:02:36Z","title":"Bounds on the Number of Modes of a Gaussian Mixture Density"},"references":{"count":17,"internal_anchors":0,"resolved_work":17,"sample":[{"cited_arxiv_id":"","doi":"10.1093/imaiai/iaz013","is_internal_anchor":false,"ref_index":1,"title":"Alexandrovich, G., Holzmann, H., and Ray, S. (2013). On the number of modes of finite mixtures of elliptical distributions. In B. Lausen, D. van den Poel, and A. Ultsch (Eds.),Algorithms from and for ","work_id":"ad6717be-0795-437b-a810-cc76802101d2","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Cheng, Y.(1995).Meanshift, modeseeking, andclustering.IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(8), 790–799. 34","work_id":"8b2c711e-5cf4-475e-babd-f0b045b9f3d8","year":1995},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. (1996). A density-based algorithm for discov- ering clusters in large spatial databases with noise. InProceedings of the Second International Conferen","work_id":"8d5425b3-ccc2-4d21-81c6-010572a6b2c6","year":1996},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Gabrielov, A., and Vorobjov, N. (2004). Complexity of computations with Pfaffian and Noetherian functions. InNormal Forms, Bifurcations and Finiteness Problems in Differential Equations (pp. 211–250).","work_id":"e9263ee7-2412-4d7a-8268-9487722393e9","year":2004},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Kabata, Y., Matsumoto, H., Uchida, S., and Ueki, M. (2025). Singularities in bivariate normal mixtures.Information Geometry, 8, 343–357","work_id":"cc2fa01a-b997-4c1b-8ac6-f4030b4096f9","year":2025}],"snapshot_sha256":"b0bfa2899e3d9c9e0d8379c55651382760fdf4e6883de3d2c651c7e78e66996a"},"source":{"id":"2605.15531","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T14:31:00.102044Z","id":"06f58249-98d3-4191-b4e7-04975a0fac47","model_set":{"reader":"grok-4.3"},"one_line_summary":"Explicit upper bounds on nondegenerate critical points of k-component Gaussian mixture densities are given via Pfaffian and algebraic elimination methods, with homoscedastic simplifications and combinatorial lower bounds.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Gaussian mixture densities with k components have at most floor of (min of two algebraic bounds plus one) divided by two modes when the modal set is finite.","strongest_claim":"For k≥2, the direct Pfaffian bound is U_het(d,k)=2^{d+binom(k-1,2)}(d+2 min(d,k-1)+1)^{k-1}, with the best critical-point bound being the minimum of this and the augmented bound, and the finite-mode bound improved by Morse theory to floor((min{U_het,U_aug}+1)/2).","weakest_assumption":"The critical-point equations can be normalized by a reference component without loss of generality for k≥2, and the Morse-theoretic argument applies directly to improve the finite-mode upper bound when the modal set is finite."}},"verdict_id":"06f58249-98d3-4191-b4e7-04975a0fac47"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:272002c0c0fc04da0e427281b5f521010003b0fc26616c110fbae266e4408ef1","target":"record","created_at":"2026-05-20T00:01:03Z","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":"04cda0b859209116bf667dc4c05f72f30dc4eecc8e5058e89f1f0ddc84480ced","cross_cats_sorted":["math.CO","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T02:02:36Z","title_canon_sha256":"d84c2848a73d8cfd66c1a6b9dc5249c9d1964bf7bbc5e217f37f93f69b68e362"},"schema_version":"1.0","source":{"id":"2605.15531","kind":"arxiv","version":1}},"canonical_sha256":"980ebe5908387fb28703615a94f816ec4809a42ac93454b5d985e2073d297d00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"980ebe5908387fb28703615a94f816ec4809a42ac93454b5d985e2073d297d00","first_computed_at":"2026-05-20T00:01:03.687197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:03.687197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dajvw72yHvlgsXs08opo3uTki+0GACfV4QhHEiuPvctw9xucNkZl+kxTws7Wm3PKCDnRYP/0NMF4ea9lS1rxDg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:03.688019Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:272002c0c0fc04da0e427281b5f521010003b0fc26616c110fbae266e4408ef1","sha256:075d94d84737f552957f53d08dd6e8d1f3178f581f4a005aa8a5fbcaa30ab1ad"],"state_sha256":"73f47de8594a35e031c638f2bed3595a90bfa0cf5ac80cc9f335ccb583df5c16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZpH0G7KrsVtdJBaop2HO/Ey7t8Y/Dl7jIgfrEOE+ulYGLE28XHaFTIejfvJ0awEOee0OLvu0vLkpoG7HCovDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T11:14:45.954218Z","bundle_sha256":"4c2d178878ac9b9332ef6fefa042ee1d6ac13815282261ea89ec1df5aeccf7cd"}}