{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:INO3DASB54COT4YOMRS5XQRDIH","short_pith_number":"pith:INO3DASB","schema_version":"1.0","canonical_sha256":"435db18241ef04e9f30e6465dbc22341ffb65b8196fad25545e1223573b29915","source":{"kind":"arxiv","id":"2503.24311","version":1},"attestation_state":"computed","paper":{"title":"Selective Inference in Graphical Models via Maximum Likelihood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.CO"],"primary_cat":"stat.ME","authors_text":"Gerda Claeskens, Snigdha Panigrahi, Sofia Guglielmini","submitted_at":"2025-03-31T16:57:04Z","abstract_excerpt":"The graphical lasso is a widely used algorithm for fitting undirected Gaussian graphical models. However, for inference on functionals of edge values in the learned graph, standard tools lack formal statistical guarantees, such as control of the type I error rate. In this paper, we introduce a selective inference method for asymptotically valid inference after graphical lasso selection with added randomization. We obtain a selective likelihood, conditional on the event of selection, through a change of variable on the known density of the randomization variables. Our method enables interval es"},"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":"2503.24311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-03-31T16:57:04Z","cross_cats_sorted":["stat.AP","stat.CO"],"title_canon_sha256":"65aaf59cb4fd5387042ebe861944596a852691e310acd8144ad70f376a20b95d","abstract_canon_sha256":"faf7d0af3254bcecb3eeab10e604f564b20037216443192a7d40c8c5e15870ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:42:08.099055Z","signature_b64":"2CjnIffn4RRwG1Q4FmxctpsRgBf7h+uDNztr2NjQh77ugeU6kiFuY54zUSGoOwfJ0um3d8AjifSwAX/fdJvvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"435db18241ef04e9f30e6465dbc22341ffb65b8196fad25545e1223573b29915","last_reissued_at":"2026-07-05T10:42:08.098570Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:42:08.098570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selective Inference in Graphical Models via Maximum Likelihood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.CO"],"primary_cat":"stat.ME","authors_text":"Gerda Claeskens, Snigdha Panigrahi, Sofia Guglielmini","submitted_at":"2025-03-31T16:57:04Z","abstract_excerpt":"The graphical lasso is a widely used algorithm for fitting undirected Gaussian graphical models. However, for inference on functionals of edge values in the learned graph, standard tools lack formal statistical guarantees, such as control of the type I error rate. In this paper, we introduce a selective inference method for asymptotically valid inference after graphical lasso selection with added randomization. We obtain a selective likelihood, conditional on the event of selection, through a change of variable on the known density of the randomization variables. Our method enables interval es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.24311","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/2503.24311/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2503.24311","created_at":"2026-07-05T10:42:08.098627+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.24311v1","created_at":"2026-07-05T10:42:08.098627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.24311","created_at":"2026-07-05T10:42:08.098627+00:00"},{"alias_kind":"pith_short_12","alias_value":"INO3DASB54CO","created_at":"2026-07-05T10:42:08.098627+00:00"},{"alias_kind":"pith_short_16","alias_value":"INO3DASB54COT4YO","created_at":"2026-07-05T10:42:08.098627+00:00"},{"alias_kind":"pith_short_8","alias_value":"INO3DASB","created_at":"2026-07-05T10:42:08.098627+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03141","citing_title":"In-Sample Evaluation of Subgroups Identified by Generic Machine Learning","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/INO3DASB54COT4YOMRS5XQRDIH","json":"https://pith.science/pith/INO3DASB54COT4YOMRS5XQRDIH.json","graph_json":"https://pith.science/api/pith-number/INO3DASB54COT4YOMRS5XQRDIH/graph.json","events_json":"https://pith.science/api/pith-number/INO3DASB54COT4YOMRS5XQRDIH/events.json","paper":"https://pith.science/paper/INO3DASB"},"agent_actions":{"view_html":"https://pith.science/pith/INO3DASB54COT4YOMRS5XQRDIH","download_json":"https://pith.science/pith/INO3DASB54COT4YOMRS5XQRDIH.json","view_paper":"https://pith.science/paper/INO3DASB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.24311&json=true","fetch_graph":"https://pith.science/api/pith-number/INO3DASB54COT4YOMRS5XQRDIH/graph.json","fetch_events":"https://pith.science/api/pith-number/INO3DASB54COT4YOMRS5XQRDIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INO3DASB54COT4YOMRS5XQRDIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INO3DASB54COT4YOMRS5XQRDIH/action/storage_attestation","attest_author":"https://pith.science/pith/INO3DASB54COT4YOMRS5XQRDIH/action/author_attestation","sign_citation":"https://pith.science/pith/INO3DASB54COT4YOMRS5XQRDIH/action/citation_signature","submit_replication":"https://pith.science/pith/INO3DASB54COT4YOMRS5XQRDIH/action/replication_record"}},"created_at":"2026-07-05T10:42:08.098627+00:00","updated_at":"2026-07-05T10:42:08.098627+00:00"}