{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:24HARDZD4P35OS5G4DMJIJYL7Z","short_pith_number":"pith:24HARDZD","schema_version":"1.0","canonical_sha256":"d70e088f23e3f7d74ba6e0d894270bfe6af79792b6a5bd2dfd317b00714f4906","source":{"kind":"arxiv","id":"1605.05776","version":4},"attestation_state":"computed","paper":{"title":"The Quality of the Covariance Selection Through Detection Problem and AUC Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Anthony Kuh, Navid Tafaghodi Khajavi","submitted_at":"2016-05-18T22:22:57Z","abstract_excerpt":"We consider the problem of quantifying the quality of a model selection problem for a graphical model. We discuss this by formulating the problem as a detection problem. Model selection problems usually minimize a distance between the original distribution and the model distribution. For the special case of Gaussian distributions, the model selection problem simplifies to the covariance selection problem which is widely discussed in literature by Dempster [2] where the likelihood criterion is maximized or equivalently the Kullback-Leibler (KL) divergence is minimized to compute the model covar"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1605.05776","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-18T22:22:57Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"5a09631022d9071ccb266b2a4ac4b9634b77815d99da5b3b640be481009d6a60","abstract_canon_sha256":"2f87d37e1468fb13c55e72c1edc1a1cfad08654282e7aa0a995c0f31b670046b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:36.543830Z","signature_b64":"HzXKdgaTyZmBz4B7WWQdhXAVUM27Sg2bIksTtJdgV7qmML23YZP1NF+lUAM0ZFVIpobY/U4SnF6BePH0HtJmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d70e088f23e3f7d74ba6e0d894270bfe6af79792b6a5bd2dfd317b00714f4906","last_reissued_at":"2026-05-18T00:32:36.543068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:36.543068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Quality of the Covariance Selection Through Detection Problem and AUC Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Anthony Kuh, Navid Tafaghodi Khajavi","submitted_at":"2016-05-18T22:22:57Z","abstract_excerpt":"We consider the problem of quantifying the quality of a model selection problem for a graphical model. We discuss this by formulating the problem as a detection problem. Model selection problems usually minimize a distance between the original distribution and the model distribution. For the special case of Gaussian distributions, the model selection problem simplifies to the covariance selection problem which is widely discussed in literature by Dempster [2] where the likelihood criterion is maximized or equivalently the Kullback-Leibler (KL) divergence is minimized to compute the model covar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05776","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.05776","created_at":"2026-05-18T00:32:36.543159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05776v4","created_at":"2026-05-18T00:32:36.543159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05776","created_at":"2026-05-18T00:32:36.543159+00:00"},{"alias_kind":"pith_short_12","alias_value":"24HARDZD4P35","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"24HARDZD4P35OS5G","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"24HARDZD","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2303.11156","citing_title":"Can AI-Generated Text be Reliably Detected?","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/24HARDZD4P35OS5G4DMJIJYL7Z","json":"https://pith.science/pith/24HARDZD4P35OS5G4DMJIJYL7Z.json","graph_json":"https://pith.science/api/pith-number/24HARDZD4P35OS5G4DMJIJYL7Z/graph.json","events_json":"https://pith.science/api/pith-number/24HARDZD4P35OS5G4DMJIJYL7Z/events.json","paper":"https://pith.science/paper/24HARDZD"},"agent_actions":{"view_html":"https://pith.science/pith/24HARDZD4P35OS5G4DMJIJYL7Z","download_json":"https://pith.science/pith/24HARDZD4P35OS5G4DMJIJYL7Z.json","view_paper":"https://pith.science/paper/24HARDZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05776&json=true","fetch_graph":"https://pith.science/api/pith-number/24HARDZD4P35OS5G4DMJIJYL7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/24HARDZD4P35OS5G4DMJIJYL7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24HARDZD4P35OS5G4DMJIJYL7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24HARDZD4P35OS5G4DMJIJYL7Z/action/storage_attestation","attest_author":"https://pith.science/pith/24HARDZD4P35OS5G4DMJIJYL7Z/action/author_attestation","sign_citation":"https://pith.science/pith/24HARDZD4P35OS5G4DMJIJYL7Z/action/citation_signature","submit_replication":"https://pith.science/pith/24HARDZD4P35OS5G4DMJIJYL7Z/action/replication_record"}},"created_at":"2026-05-18T00:32:36.543159+00:00","updated_at":"2026-05-18T00:32:36.543159+00:00"}