{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:JUMLXVRT4U6SALIOH26HJABUMG","short_pith_number":"pith:JUMLXVRT","canonical_record":{"source":{"id":"0707.0704","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"2007-07-04T22:13:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7371e002389ad2c5899046fe6d780d7fd953ae54f33508c45a3ddbdee6e6e6bc","abstract_canon_sha256":"da148915d89ef5ebd8ac99479ee379e0d32116122cbef915a22c226717653651"},"schema_version":"1.0"},"canonical_sha256":"4d18bbd633e53d202d0e3ebc74803461964f3df716a654b8e5067183f178f3ef","source":{"kind":"arxiv","id":"0707.0704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.0704","created_at":"2026-07-04T15:02:37Z"},{"alias_kind":"arxiv_version","alias_value":"0707.0704v1","created_at":"2026-07-04T15:02:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.0704","created_at":"2026-07-04T15:02:37Z"},{"alias_kind":"pith_short_12","alias_value":"JUMLXVRT4U6S","created_at":"2026-07-04T15:02:37Z"},{"alias_kind":"pith_short_16","alias_value":"JUMLXVRT4U6SALIO","created_at":"2026-07-04T15:02:37Z"},{"alias_kind":"pith_short_8","alias_value":"JUMLXVRT","created_at":"2026-07-04T15:02:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:JUMLXVRT4U6SALIOH26HJABUMG","target":"record","payload":{"canonical_record":{"source":{"id":"0707.0704","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"2007-07-04T22:13:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7371e002389ad2c5899046fe6d780d7fd953ae54f33508c45a3ddbdee6e6e6bc","abstract_canon_sha256":"da148915d89ef5ebd8ac99479ee379e0d32116122cbef915a22c226717653651"},"schema_version":"1.0"},"canonical_sha256":"4d18bbd633e53d202d0e3ebc74803461964f3df716a654b8e5067183f178f3ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:37.708592Z","signature_b64":"ie6AErKpdkPCxIyx/hRuK+fF3Wf/5e5v7ZUhCpuPA6qW7Dj/FMMwVJ05yjLD5sQyHh69NDh5jnFcc3uhIM37Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d18bbd633e53d202d0e3ebc74803461964f3df716a654b8e5067183f178f3ef","last_reissued_at":"2026-07-04T15:02:37.708188Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:37.708188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0707.0704","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-07-04T15:02:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ZQqiOMJYppHAtpWjmSIJSE1XyDjSo5OcQ30eSoK7zGPYoRSODvnBZQDinsRdXcqqq9AmYjJFel6XWY92As5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:44:35.075080Z"},"content_sha256":"2736f38884fa3de8f675aed7396fbe1dcb7d8eaffb2ecb493ee19e8bfa61713d","schema_version":"1.0","event_id":"sha256:2736f38884fa3de8f675aed7396fbe1dcb7d8eaffb2ecb493ee19e8bfa61713d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:JUMLXVRT4U6SALIOH26HJABUMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Selection Through Sparse Maximum Likelihood Estimation","license":"","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alexandre d'Aspremont, Laurent El Ghaoui, Onureena Banerjee","submitted_at":"2007-07-04T22:13:42Z","abstract_excerpt":"We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to solve a maximum likelihood problem with an added l_1-norm penalty term. The problem as formulated is convex but the memory requirements and complexity of existing interior point methods are prohibitive for problems with more than tens of nodes. We present two new algorithms for solving problems with at least a thousand nodes in the Gaussian case. Our first algorithm uses block coordinate descent, and can be interpret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.0704","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0707.0704/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:02:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vbQlc1Gwj8Vvaebagav036M2EIQJLUBIrBmB9moiuRE/Ywl+Ztn99SsY/TGmdobfBSkqcniyPsSWdGqSCF7BDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:44:35.075588Z"},"content_sha256":"c725932752aa3ddf1f6cb1964ceff1bf6407f2ab6b299fb22d1f8967c1df94b0","schema_version":"1.0","event_id":"sha256:c725932752aa3ddf1f6cb1964ceff1bf6407f2ab6b299fb22d1f8967c1df94b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUMLXVRT4U6SALIOH26HJABUMG/bundle.json","state_url":"https://pith.science/pith/JUMLXVRT4U6SALIOH26HJABUMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUMLXVRT4U6SALIOH26HJABUMG/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-08-05T19:44:35Z","links":{"resolver":"https://pith.science/pith/JUMLXVRT4U6SALIOH26HJABUMG","bundle":"https://pith.science/pith/JUMLXVRT4U6SALIOH26HJABUMG/bundle.json","state":"https://pith.science/pith/JUMLXVRT4U6SALIOH26HJABUMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUMLXVRT4U6SALIOH26HJABUMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:JUMLXVRT4U6SALIOH26HJABUMG","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":"da148915d89ef5ebd8ac99479ee379e0d32116122cbef915a22c226717653651","cross_cats_sorted":["cs.LG"],"license":"","primary_cat":"cs.AI","submitted_at":"2007-07-04T22:13:42Z","title_canon_sha256":"7371e002389ad2c5899046fe6d780d7fd953ae54f33508c45a3ddbdee6e6e6bc"},"schema_version":"1.0","source":{"id":"0707.0704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.0704","created_at":"2026-07-04T15:02:37Z"},{"alias_kind":"arxiv_version","alias_value":"0707.0704v1","created_at":"2026-07-04T15:02:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.0704","created_at":"2026-07-04T15:02:37Z"},{"alias_kind":"pith_short_12","alias_value":"JUMLXVRT4U6S","created_at":"2026-07-04T15:02:37Z"},{"alias_kind":"pith_short_16","alias_value":"JUMLXVRT4U6SALIO","created_at":"2026-07-04T15:02:37Z"},{"alias_kind":"pith_short_8","alias_value":"JUMLXVRT","created_at":"2026-07-04T15:02:37Z"}],"graph_snapshots":[{"event_id":"sha256:c725932752aa3ddf1f6cb1964ceff1bf6407f2ab6b299fb22d1f8967c1df94b0","target":"graph","created_at":"2026-07-04T15:02:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0707.0704/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to solve a maximum likelihood problem with an added l_1-norm penalty term. The problem as formulated is convex but the memory requirements and complexity of existing interior point methods are prohibitive for problems with more than tens of nodes. We present two new algorithms for solving problems with at least a thousand nodes in the Gaussian case. Our first algorithm uses block coordinate descent, and can be interpret","authors_text":"Alexandre d'Aspremont, Laurent El Ghaoui, Onureena Banerjee","cross_cats":["cs.LG"],"headline":"","license":"","primary_cat":"cs.AI","submitted_at":"2007-07-04T22:13:42Z","title":"Model Selection Through Sparse Maximum Likelihood Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.0704","kind":"arxiv","version":1},"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:2736f38884fa3de8f675aed7396fbe1dcb7d8eaffb2ecb493ee19e8bfa61713d","target":"record","created_at":"2026-07-04T15:02:37Z","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":"da148915d89ef5ebd8ac99479ee379e0d32116122cbef915a22c226717653651","cross_cats_sorted":["cs.LG"],"license":"","primary_cat":"cs.AI","submitted_at":"2007-07-04T22:13:42Z","title_canon_sha256":"7371e002389ad2c5899046fe6d780d7fd953ae54f33508c45a3ddbdee6e6e6bc"},"schema_version":"1.0","source":{"id":"0707.0704","kind":"arxiv","version":1}},"canonical_sha256":"4d18bbd633e53d202d0e3ebc74803461964f3df716a654b8e5067183f178f3ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d18bbd633e53d202d0e3ebc74803461964f3df716a654b8e5067183f178f3ef","first_computed_at":"2026-07-04T15:02:37.708188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:02:37.708188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ie6AErKpdkPCxIyx/hRuK+fF3Wf/5e5v7ZUhCpuPA6qW7Dj/FMMwVJ05yjLD5sQyHh69NDh5jnFcc3uhIM37Dw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:02:37.708592Z","signed_message":"canonical_sha256_bytes"},"source_id":"0707.0704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2736f38884fa3de8f675aed7396fbe1dcb7d8eaffb2ecb493ee19e8bfa61713d","sha256:c725932752aa3ddf1f6cb1964ceff1bf6407f2ab6b299fb22d1f8967c1df94b0"],"state_sha256":"666bc343f7665a100b6ce165fe02fdb2b16cfbcf91075b4c480f96562b7d500a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vCj82v+6atjkj4RIW+cfG8s/2h/qcL0iFhOI7y7Apq2xpUGBvRIfEqasssbzwRXXIb0fiEkw+WJnS0jadH7QAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T19:44:35.079252Z","bundle_sha256":"57d3d5fec7acca3042d282df01b9152218b12d0ff1cac703a775dc07052d2ad2"}}