{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JH7ILZF5RDM7X4CFU2XP7KOCRB","short_pith_number":"pith:JH7ILZF5","schema_version":"1.0","canonical_sha256":"49fe85e4bd88d9fbf045a6aeffa9c28868ba49c0ba135569b087de0c1a55235a","source":{"kind":"arxiv","id":"1508.05571","version":4},"attestation_state":"computed","paper":{"title":"Robust sparse Gaussian graphical modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Hironori Fujisawa, Jun Sese, Kei Hirose","submitted_at":"2015-08-23T07:34:02Z","abstract_excerpt":"Gaussian graphical modeling has been widely used to explore various network structures, such as gene regulatory networks and social networks. We often use a penalized maximum likelihood approach with the $L_1$ penalty for learning a high-dimensional graphical model. However, the penalized maximum likelihood procedure is sensitive to outliers. To overcome this problem, we introduce a robust estimation procedure based on the $\\gamma$-divergence. The proposed method has a redescending property, which is known as a desirable property in robust statistics. The parameter estimation procedure is cons"},"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":"1508.05571","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-08-23T07:34:02Z","cross_cats_sorted":[],"title_canon_sha256":"d8dbb517697a227aaf6b1f09da573ae0c09b9bedeb1d1d495b2b32c0310b3800","abstract_canon_sha256":"008e222f04f5c99ce45b70f40d817ba87800ef15dd4ce70492feb7f151c05487"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:39.740708Z","signature_b64":"fIqzZaFo/82dcpE3NW3NuRFdXXkd42qDN1YH+ViOQ4CTWypxNGaZ+sz4bos/QvyCTmltBJDGU+uL2EiFXb/6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49fe85e4bd88d9fbf045a6aeffa9c28868ba49c0ba135569b087de0c1a55235a","last_reissued_at":"2026-05-18T00:42:39.739960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:39.739960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust sparse Gaussian graphical modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Hironori Fujisawa, Jun Sese, Kei Hirose","submitted_at":"2015-08-23T07:34:02Z","abstract_excerpt":"Gaussian graphical modeling has been widely used to explore various network structures, such as gene regulatory networks and social networks. We often use a penalized maximum likelihood approach with the $L_1$ penalty for learning a high-dimensional graphical model. However, the penalized maximum likelihood procedure is sensitive to outliers. To overcome this problem, we introduce a robust estimation procedure based on the $\\gamma$-divergence. The proposed method has a redescending property, which is known as a desirable property in robust statistics. The parameter estimation procedure is cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05571","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":"1508.05571","created_at":"2026-05-18T00:42:39.740077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05571v4","created_at":"2026-05-18T00:42:39.740077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05571","created_at":"2026-05-18T00:42:39.740077+00:00"},{"alias_kind":"pith_short_12","alias_value":"JH7ILZF5RDM7","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JH7ILZF5RDM7X4CF","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JH7ILZF5","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JH7ILZF5RDM7X4CFU2XP7KOCRB","json":"https://pith.science/pith/JH7ILZF5RDM7X4CFU2XP7KOCRB.json","graph_json":"https://pith.science/api/pith-number/JH7ILZF5RDM7X4CFU2XP7KOCRB/graph.json","events_json":"https://pith.science/api/pith-number/JH7ILZF5RDM7X4CFU2XP7KOCRB/events.json","paper":"https://pith.science/paper/JH7ILZF5"},"agent_actions":{"view_html":"https://pith.science/pith/JH7ILZF5RDM7X4CFU2XP7KOCRB","download_json":"https://pith.science/pith/JH7ILZF5RDM7X4CFU2XP7KOCRB.json","view_paper":"https://pith.science/paper/JH7ILZF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05571&json=true","fetch_graph":"https://pith.science/api/pith-number/JH7ILZF5RDM7X4CFU2XP7KOCRB/graph.json","fetch_events":"https://pith.science/api/pith-number/JH7ILZF5RDM7X4CFU2XP7KOCRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JH7ILZF5RDM7X4CFU2XP7KOCRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JH7ILZF5RDM7X4CFU2XP7KOCRB/action/storage_attestation","attest_author":"https://pith.science/pith/JH7ILZF5RDM7X4CFU2XP7KOCRB/action/author_attestation","sign_citation":"https://pith.science/pith/JH7ILZF5RDM7X4CFU2XP7KOCRB/action/citation_signature","submit_replication":"https://pith.science/pith/JH7ILZF5RDM7X4CFU2XP7KOCRB/action/replication_record"}},"created_at":"2026-05-18T00:42:39.740077+00:00","updated_at":"2026-05-18T00:42:39.740077+00:00"}