{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HDGUSN3YS43SXHPAYF2TPNSH3M","short_pith_number":"pith:HDGUSN3Y","schema_version":"1.0","canonical_sha256":"38cd49377897372b9de0c17537b647db3ed4187bdb2016f0e28395fe16baec24","source":{"kind":"arxiv","id":"1605.03468","version":6},"attestation_state":"computed","paper":{"title":"A constrained L1 minimization approach for estimating multiple Sparse Gaussian or Nonparanormal Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Beilun Wang, Ritambhara Singh, Yanjun Qi","submitted_at":"2016-05-11T14:54:44Z","abstract_excerpt":"Identifying context-specific entity networks from aggregated data is an important task, arising often in bioinformatics and neuroimaging. Computationally, this task can be formulated as jointly estimating multiple different, but related, sparse Undirected Graphical Models (UGM) from aggregated samples across several contexts. Previous joint-UGM studies have mostly focused on sparse Gaussian Graphical Models (sGGMs) and can't identify context-specific edge patterns directly. We, therefore, propose a novel approach, SIMULE (detecting Shared and Individual parts of MULtiple graphs Explicitly) to "},"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.03468","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-11T14:54:44Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"ac209c66efe95841ded35e8de121dd498e895bed87a169a0149e0f323e7dc5ab","abstract_canon_sha256":"1ae44ef4d8dc5125ceefdd4aa6253f04086d408d0598ad558591712b9105701f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:05.430169Z","signature_b64":"dfLuIHKrsL4u0gjXzQ9f2DU6dYUNg8Opnn9c70nklvmJ4PVSOARFi8DyJlTSYBXgcxyXILuFU+oKeFsaSp0sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38cd49377897372b9de0c17537b647db3ed4187bdb2016f0e28395fe16baec24","last_reissued_at":"2026-05-18T00:35:05.429590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:05.429590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A constrained L1 minimization approach for estimating multiple Sparse Gaussian or Nonparanormal Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Beilun Wang, Ritambhara Singh, Yanjun Qi","submitted_at":"2016-05-11T14:54:44Z","abstract_excerpt":"Identifying context-specific entity networks from aggregated data is an important task, arising often in bioinformatics and neuroimaging. Computationally, this task can be formulated as jointly estimating multiple different, but related, sparse Undirected Graphical Models (UGM) from aggregated samples across several contexts. Previous joint-UGM studies have mostly focused on sparse Gaussian Graphical Models (sGGMs) and can't identify context-specific edge patterns directly. We, therefore, propose a novel approach, SIMULE (detecting Shared and Individual parts of MULtiple graphs Explicitly) to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03468","kind":"arxiv","version":6},"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.03468","created_at":"2026-05-18T00:35:05.429670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03468v6","created_at":"2026-05-18T00:35:05.429670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03468","created_at":"2026-05-18T00:35:05.429670+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDGUSN3YS43S","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDGUSN3YS43SXHPA","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDGUSN3Y","created_at":"2026-05-18T12:30:19.053100+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/HDGUSN3YS43SXHPAYF2TPNSH3M","json":"https://pith.science/pith/HDGUSN3YS43SXHPAYF2TPNSH3M.json","graph_json":"https://pith.science/api/pith-number/HDGUSN3YS43SXHPAYF2TPNSH3M/graph.json","events_json":"https://pith.science/api/pith-number/HDGUSN3YS43SXHPAYF2TPNSH3M/events.json","paper":"https://pith.science/paper/HDGUSN3Y"},"agent_actions":{"view_html":"https://pith.science/pith/HDGUSN3YS43SXHPAYF2TPNSH3M","download_json":"https://pith.science/pith/HDGUSN3YS43SXHPAYF2TPNSH3M.json","view_paper":"https://pith.science/paper/HDGUSN3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03468&json=true","fetch_graph":"https://pith.science/api/pith-number/HDGUSN3YS43SXHPAYF2TPNSH3M/graph.json","fetch_events":"https://pith.science/api/pith-number/HDGUSN3YS43SXHPAYF2TPNSH3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDGUSN3YS43SXHPAYF2TPNSH3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDGUSN3YS43SXHPAYF2TPNSH3M/action/storage_attestation","attest_author":"https://pith.science/pith/HDGUSN3YS43SXHPAYF2TPNSH3M/action/author_attestation","sign_citation":"https://pith.science/pith/HDGUSN3YS43SXHPAYF2TPNSH3M/action/citation_signature","submit_replication":"https://pith.science/pith/HDGUSN3YS43SXHPAYF2TPNSH3M/action/replication_record"}},"created_at":"2026-05-18T00:35:05.429670+00:00","updated_at":"2026-05-18T00:35:05.429670+00:00"}