{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZBODDEJFJTWMCBJDLGQID37CPC","short_pith_number":"pith:ZBODDEJF","canonical_record":{"source":{"id":"1404.6989","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-28T14:07:58Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"ebbbbfc25bfb81714268c7099be12011c557980c718243eca306cc87dc7dc6d7","abstract_canon_sha256":"b268431abf18b2a0d57f8e2f14434ef82cf2726c844780036c75b9ef0cef9ae5"},"schema_version":"1.0"},"canonical_sha256":"c85c3191254cecc1052359a081efe2788baadbad4ecd4d804553f3edd1ea6c09","source":{"kind":"arxiv","id":"1404.6989","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6989","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6989v3","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6989","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZBODDEJFJTWM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZBODDEJFJTWMCBJD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZBODDEJF","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZBODDEJFJTWMCBJDLGQID37CPC","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6989","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-28T14:07:58Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"ebbbbfc25bfb81714268c7099be12011c557980c718243eca306cc87dc7dc6d7","abstract_canon_sha256":"b268431abf18b2a0d57f8e2f14434ef82cf2726c844780036c75b9ef0cef9ae5"},"schema_version":"1.0"},"canonical_sha256":"c85c3191254cecc1052359a081efe2788baadbad4ecd4d804553f3edd1ea6c09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:57.865663Z","signature_b64":"kZsQ5Szlajxhq5EWYvFQm74m7z/utwf3Jh7EsJ2K3iU2cko4SELvnesGOUJV66N1EmaEqPxRucjlzy+lCYCpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c85c3191254cecc1052359a081efe2788baadbad4ecd4d804553f3edd1ea6c09","last_reissued_at":"2026-05-18T01:32:57.865044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:57.865044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6989","source_version":3,"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-18T01:32:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4sBMnWo3mTXT0VTsCw98l+RhvebVUOv3ZhbkRezAFBeagB+rnIzeNU1WCKzgGg5sFRgpQFvDpG4mH9/Gjn+FAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:41:52.621628Z"},"content_sha256":"feaf8498449140c3118e19503578ba5304cde5729290d5cdd75cece4524a6ae2","schema_version":"1.0","event_id":"sha256:feaf8498449140c3118e19503578ba5304cde5729290d5cdd75cece4524a6ae2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZBODDEJFJTWMCBJDLGQID37CPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Maximum Likelihood Threshold of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.CO","authors_text":"Elizabeth Gross, Seth Sullivant","submitted_at":"2014-04-28T14:07:58Z","abstract_excerpt":"The maximum likelihood threshold of a graph is the smallest number of data points that guarantees that maximum likelihood estimates exist almost surely in the Gaussian graphical model associated to the graph. We show that this graph parameter is connected to the theory of combinatorial rigidity. In particular, if the edge set of a graph $G$ is an independent set in the $n-1$-dimensional generic rigidity matroid, then the maximum likelihood threshold of $G$ is less than or equal to $n$. This connection allows us to prove many results about the maximum likelihood threshold."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6989","kind":"arxiv","version":3},"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-18T01:32:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"euScxtCZDyXlBD0vxefLvDpSk6VduFsBsnvRtNH1j/GnthoOz4+p1JKIIzqCNUnKhyyfj+0sMxupKPvy6HC/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:41:52.622280Z"},"content_sha256":"05a8a628de352e2c34c495420abfa73b56f2f5f040db99374f8f0b817b16f28f","schema_version":"1.0","event_id":"sha256:05a8a628de352e2c34c495420abfa73b56f2f5f040db99374f8f0b817b16f28f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBODDEJFJTWMCBJDLGQID37CPC/bundle.json","state_url":"https://pith.science/pith/ZBODDEJFJTWMCBJDLGQID37CPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBODDEJFJTWMCBJDLGQID37CPC/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-30T07:41:52Z","links":{"resolver":"https://pith.science/pith/ZBODDEJFJTWMCBJDLGQID37CPC","bundle":"https://pith.science/pith/ZBODDEJFJTWMCBJDLGQID37CPC/bundle.json","state":"https://pith.science/pith/ZBODDEJFJTWMCBJDLGQID37CPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBODDEJFJTWMCBJDLGQID37CPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZBODDEJFJTWMCBJDLGQID37CPC","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":"b268431abf18b2a0d57f8e2f14434ef82cf2726c844780036c75b9ef0cef9ae5","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-28T14:07:58Z","title_canon_sha256":"ebbbbfc25bfb81714268c7099be12011c557980c718243eca306cc87dc7dc6d7"},"schema_version":"1.0","source":{"id":"1404.6989","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6989","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6989v3","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6989","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZBODDEJFJTWM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZBODDEJFJTWMCBJD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZBODDEJF","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:05a8a628de352e2c34c495420abfa73b56f2f5f040db99374f8f0b817b16f28f","target":"graph","created_at":"2026-05-18T01:32:57Z","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":"The maximum likelihood threshold of a graph is the smallest number of data points that guarantees that maximum likelihood estimates exist almost surely in the Gaussian graphical model associated to the graph. We show that this graph parameter is connected to the theory of combinatorial rigidity. In particular, if the edge set of a graph $G$ is an independent set in the $n-1$-dimensional generic rigidity matroid, then the maximum likelihood threshold of $G$ is less than or equal to $n$. This connection allows us to prove many results about the maximum likelihood threshold.","authors_text":"Elizabeth Gross, Seth Sullivant","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-28T14:07:58Z","title":"The Maximum Likelihood Threshold of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6989","kind":"arxiv","version":3},"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:feaf8498449140c3118e19503578ba5304cde5729290d5cdd75cece4524a6ae2","target":"record","created_at":"2026-05-18T01:32:57Z","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":"b268431abf18b2a0d57f8e2f14434ef82cf2726c844780036c75b9ef0cef9ae5","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-28T14:07:58Z","title_canon_sha256":"ebbbbfc25bfb81714268c7099be12011c557980c718243eca306cc87dc7dc6d7"},"schema_version":"1.0","source":{"id":"1404.6989","kind":"arxiv","version":3}},"canonical_sha256":"c85c3191254cecc1052359a081efe2788baadbad4ecd4d804553f3edd1ea6c09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c85c3191254cecc1052359a081efe2788baadbad4ecd4d804553f3edd1ea6c09","first_computed_at":"2026-05-18T01:32:57.865044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:57.865044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kZsQ5Szlajxhq5EWYvFQm74m7z/utwf3Jh7EsJ2K3iU2cko4SELvnesGOUJV66N1EmaEqPxRucjlzy+lCYCpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:57.865663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6989","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:feaf8498449140c3118e19503578ba5304cde5729290d5cdd75cece4524a6ae2","sha256:05a8a628de352e2c34c495420abfa73b56f2f5f040db99374f8f0b817b16f28f"],"state_sha256":"a6d28b711498d21276164494166f11262bf1e039933cc7bc4ee72081fe4b31e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xqeDWjtkZbFyZXbnzVQnnPIvIAAHN60+ssM2R7q+R71ex5+zjO9rlq+Nb7CmogCCVCX37itvg2tJj7E3j5KWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:41:52.625658Z","bundle_sha256":"368768c4e4486375104937946db634d8d989303ec4027c8583de7420686ea0f8"}}