{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QCUKEABC6C7CVDBCIAITKISJDI","short_pith_number":"pith:QCUKEABC","canonical_record":{"source":{"id":"1212.5332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-21T04:25:12Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"8bb09fbb0e33e65cef9356f90946da2a1f9135c642666bd9cf4265f92a04da81","abstract_canon_sha256":"f1ea0b94627729d3ea21ebcc1be5a898c4d006ef060155ab10524a18c7a55d68"},"schema_version":"1.0"},"canonical_sha256":"80a8a20022f0be2a8c2240113522491a152781b2b561c8f016d5f0545a38327e","source":{"kind":"arxiv","id":"1212.5332","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5332","created_at":"2026-05-18T03:06:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5332v2","created_at":"2026-05-18T03:06:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5332","created_at":"2026-05-18T03:06:42Z"},{"alias_kind":"pith_short_12","alias_value":"QCUKEABC6C7C","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QCUKEABC6C7CVDBC","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QCUKEABC","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QCUKEABC6C7CVDBCIAITKISJDI","target":"record","payload":{"canonical_record":{"source":{"id":"1212.5332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-21T04:25:12Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"8bb09fbb0e33e65cef9356f90946da2a1f9135c642666bd9cf4265f92a04da81","abstract_canon_sha256":"f1ea0b94627729d3ea21ebcc1be5a898c4d006ef060155ab10524a18c7a55d68"},"schema_version":"1.0"},"canonical_sha256":"80a8a20022f0be2a8c2240113522491a152781b2b561c8f016d5f0545a38327e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:42.986978Z","signature_b64":"OGboFbalxQUzHVEcAtpyF20y8pZS9qFvcMuE8u8C3GoMd84PUnpaATIXJlfaystcPPWLKnUCpb698iCNsnubAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80a8a20022f0be2a8c2240113522491a152781b2b561c8f016d5f0545a38327e","last_reissued_at":"2026-05-18T03:06:42.986500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:42.986500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.5332","source_version":2,"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-18T03:06:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AgZdgezptBGVk8Ug7S6Dk/j7f1VIQNpAcMQzmrIyXIgm3AerCcHRKc+8818iE2SbhOaMk8kvHdCJwGuVzTUFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:43:21.632135Z"},"content_sha256":"e4b39b26c242c401682e7e006284fce0d8fc2ce6df90774ce8449d61e8d8147a","schema_version":"1.0","event_id":"sha256:e4b39b26c242c401682e7e006284fce0d8fc2ce6df90774ce8449d61e8d8147a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QCUKEABC6C7CVDBCIAITKISJDI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal classification in sparse Gaussian graphic model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Jiashun Jin, Yingying Fan, Zhigang Yao","submitted_at":"2012-12-21T04:25:12Z","abstract_excerpt":"Consider a two-class classification problem where the number of features is much larger than the sample size. The features are masked by Gaussian noise with mean zero and covariance matrix $\\Sigma$, where the precision matrix $\\Omega=\\Sigma^{-1}$ is unknown but is presumably sparse. The useful features, also unknown, are sparse and each contributes weakly (i.e., rare and weak) to the classification decision. By obtaining a reasonably good estimate of $\\Omega$, we formulate the setting as a linear regression model. We propose a two-stage classification method where we first select features by t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5332","kind":"arxiv","version":2},"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-18T03:06:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTI8rCadMeqcrTXyxjYhPPJnt0BTaJcRlPuE97lW+ch0uPEe3gNhz5TBW+3KOiFTtzz0RYxEqa1/tQk3koDjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:43:21.632883Z"},"content_sha256":"58eda51774c27f2f7c15ab9b050bbe41026a2b31aef21039cc2d03b94f469460","schema_version":"1.0","event_id":"sha256:58eda51774c27f2f7c15ab9b050bbe41026a2b31aef21039cc2d03b94f469460"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QCUKEABC6C7CVDBCIAITKISJDI/bundle.json","state_url":"https://pith.science/pith/QCUKEABC6C7CVDBCIAITKISJDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QCUKEABC6C7CVDBCIAITKISJDI/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-26T15:43:21Z","links":{"resolver":"https://pith.science/pith/QCUKEABC6C7CVDBCIAITKISJDI","bundle":"https://pith.science/pith/QCUKEABC6C7CVDBCIAITKISJDI/bundle.json","state":"https://pith.science/pith/QCUKEABC6C7CVDBCIAITKISJDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QCUKEABC6C7CVDBCIAITKISJDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QCUKEABC6C7CVDBCIAITKISJDI","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":"f1ea0b94627729d3ea21ebcc1be5a898c4d006ef060155ab10524a18c7a55d68","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-21T04:25:12Z","title_canon_sha256":"8bb09fbb0e33e65cef9356f90946da2a1f9135c642666bd9cf4265f92a04da81"},"schema_version":"1.0","source":{"id":"1212.5332","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5332","created_at":"2026-05-18T03:06:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5332v2","created_at":"2026-05-18T03:06:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5332","created_at":"2026-05-18T03:06:42Z"},{"alias_kind":"pith_short_12","alias_value":"QCUKEABC6C7C","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QCUKEABC6C7CVDBC","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QCUKEABC","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:58eda51774c27f2f7c15ab9b050bbe41026a2b31aef21039cc2d03b94f469460","target":"graph","created_at":"2026-05-18T03:06:42Z","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":"Consider a two-class classification problem where the number of features is much larger than the sample size. The features are masked by Gaussian noise with mean zero and covariance matrix $\\Sigma$, where the precision matrix $\\Omega=\\Sigma^{-1}$ is unknown but is presumably sparse. The useful features, also unknown, are sparse and each contributes weakly (i.e., rare and weak) to the classification decision. By obtaining a reasonably good estimate of $\\Omega$, we formulate the setting as a linear regression model. We propose a two-stage classification method where we first select features by t","authors_text":"Jiashun Jin, Yingying Fan, Zhigang Yao","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-21T04:25:12Z","title":"Optimal classification in sparse Gaussian graphic model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5332","kind":"arxiv","version":2},"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:e4b39b26c242c401682e7e006284fce0d8fc2ce6df90774ce8449d61e8d8147a","target":"record","created_at":"2026-05-18T03:06:42Z","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":"f1ea0b94627729d3ea21ebcc1be5a898c4d006ef060155ab10524a18c7a55d68","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-21T04:25:12Z","title_canon_sha256":"8bb09fbb0e33e65cef9356f90946da2a1f9135c642666bd9cf4265f92a04da81"},"schema_version":"1.0","source":{"id":"1212.5332","kind":"arxiv","version":2}},"canonical_sha256":"80a8a20022f0be2a8c2240113522491a152781b2b561c8f016d5f0545a38327e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80a8a20022f0be2a8c2240113522491a152781b2b561c8f016d5f0545a38327e","first_computed_at":"2026-05-18T03:06:42.986500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:42.986500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OGboFbalxQUzHVEcAtpyF20y8pZS9qFvcMuE8u8C3GoMd84PUnpaATIXJlfaystcPPWLKnUCpb698iCNsnubAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:42.986978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.5332","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4b39b26c242c401682e7e006284fce0d8fc2ce6df90774ce8449d61e8d8147a","sha256:58eda51774c27f2f7c15ab9b050bbe41026a2b31aef21039cc2d03b94f469460"],"state_sha256":"307f8dbddcfbbfc3274d9a393da9a6ddd2c28b6773961397fc5a9578418cd620"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2+v6bsIYtUgzLdaFzgjZxHim8oCsbM/6aBtyWDj+ub6fquycvmXibqvymWfPXsBsBlo643E4PL8aU+raQDdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:43:21.635906Z","bundle_sha256":"40c2f4937eb95f5c879c3f4deb696ae68f96e8198547bfebcfad343eb8adfff8"}}