{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7OO6TOFKECSR5UD27TNQGH5KZF","short_pith_number":"pith:7OO6TOFK","canonical_record":{"source":{"id":"1010.0311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-10-02T08:55:02Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"0011a95ff24f13362a9634006bd327100374d398f2bce2402d5ddd1670d504ab","abstract_canon_sha256":"40750fc2a006769338b6a674a7b6f2473b0af316063e3e088d42809cff0556c3"},"schema_version":"1.0"},"canonical_sha256":"fb9de9b8aa20a51ed07afcdb031faac94af333e436c3f566d81db08035b397bf","source":{"kind":"arxiv","id":"1010.0311","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0311","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0311v1","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0311","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"7OO6TOFKECSR","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7OO6TOFKECSR5UD2","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7OO6TOFK","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7OO6TOFKECSR5UD27TNQGH5KZF","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-10-02T08:55:02Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"0011a95ff24f13362a9634006bd327100374d398f2bce2402d5ddd1670d504ab","abstract_canon_sha256":"40750fc2a006769338b6a674a7b6f2473b0af316063e3e088d42809cff0556c3"},"schema_version":"1.0"},"canonical_sha256":"fb9de9b8aa20a51ed07afcdb031faac94af333e436c3f566d81db08035b397bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:58.687330Z","signature_b64":"pgbTqdKOYeg2CTh/Wgw7QjxCR2v+yecIm+uN/olzdEF3g8341GMDHadBVxRJ7ZYfYZnmTDcv346aMpxcqS//AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb9de9b8aa20a51ed07afcdb031faac94af333e436c3f566d81db08035b397bf","last_reissued_at":"2026-05-18T04:39:58.686746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:58.686746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0311","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-05-18T04:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wQ6tRQBdPvtW6eldWstFb0+xHUque5nfJTghfJeaSrSBhl252sYWxObvk0znOhZpWynPSOzsLYHtZgtUaIShCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:05.135534Z"},"content_sha256":"836a3d3824f7439e89b8f60d7003e8ec85917b7bc148aa17b5d23a4086a55f34","schema_version":"1.0","event_id":"sha256:836a3d3824f7439e89b8f60d7003e8ec85917b7bc148aa17b5d23a4086a55f34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7OO6TOFKECSR5UD27TNQGH5KZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-dimensional Ising model selection using ${\\ell_1}$-regularized logistic regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"John D. Lafferty, Martin J. Wainwright, Pradeep Ravikumar","submitted_at":"2010-10-02T08:55:02Z","abstract_excerpt":"We consider the problem of estimating the graph associated with a binary Ising Markov random field. We describe a method based on $\\ell_1$-regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an $\\ell_1$-constraint. The method is analyzed under high-dimensional scaling in which both the number of nodes $p$ and maximum neighborhood size $d$ are allowed to grow as a function of the number of observations $n$. Our main results provide sufficient conditions on the triple $(n,p,d)$ and the model parameters for the met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0311","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":""},"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-18T04:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5GIZIQGccd270FwSazB1hobwKFy8GQg+TyFh7al94EOtibKztQIHb4ax0eLT2Ywzo+zuCjooOeZqL9CEnAAnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:05.135888Z"},"content_sha256":"d632a2dd6cee923ebd0f8d23722c8971017e3c3f630e418831053cdd1c8c7c6f","schema_version":"1.0","event_id":"sha256:d632a2dd6cee923ebd0f8d23722c8971017e3c3f630e418831053cdd1c8c7c6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7OO6TOFKECSR5UD27TNQGH5KZF/bundle.json","state_url":"https://pith.science/pith/7OO6TOFKECSR5UD27TNQGH5KZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7OO6TOFKECSR5UD27TNQGH5KZF/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-30T06:54:05Z","links":{"resolver":"https://pith.science/pith/7OO6TOFKECSR5UD27TNQGH5KZF","bundle":"https://pith.science/pith/7OO6TOFKECSR5UD27TNQGH5KZF/bundle.json","state":"https://pith.science/pith/7OO6TOFKECSR5UD27TNQGH5KZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7OO6TOFKECSR5UD27TNQGH5KZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7OO6TOFKECSR5UD27TNQGH5KZF","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":"40750fc2a006769338b6a674a7b6f2473b0af316063e3e088d42809cff0556c3","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-10-02T08:55:02Z","title_canon_sha256":"0011a95ff24f13362a9634006bd327100374d398f2bce2402d5ddd1670d504ab"},"schema_version":"1.0","source":{"id":"1010.0311","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0311","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0311v1","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0311","created_at":"2026-05-18T04:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"7OO6TOFKECSR","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7OO6TOFKECSR5UD2","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7OO6TOFK","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:d632a2dd6cee923ebd0f8d23722c8971017e3c3f630e418831053cdd1c8c7c6f","target":"graph","created_at":"2026-05-18T04:39:58Z","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":"We consider the problem of estimating the graph associated with a binary Ising Markov random field. We describe a method based on $\\ell_1$-regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an $\\ell_1$-constraint. The method is analyzed under high-dimensional scaling in which both the number of nodes $p$ and maximum neighborhood size $d$ are allowed to grow as a function of the number of observations $n$. Our main results provide sufficient conditions on the triple $(n,p,d)$ and the model parameters for the met","authors_text":"John D. Lafferty, Martin J. Wainwright, Pradeep Ravikumar","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-10-02T08:55:02Z","title":"High-dimensional Ising model selection using ${\\ell_1}$-regularized logistic regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0311","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:836a3d3824f7439e89b8f60d7003e8ec85917b7bc148aa17b5d23a4086a55f34","target":"record","created_at":"2026-05-18T04:39:58Z","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":"40750fc2a006769338b6a674a7b6f2473b0af316063e3e088d42809cff0556c3","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-10-02T08:55:02Z","title_canon_sha256":"0011a95ff24f13362a9634006bd327100374d398f2bce2402d5ddd1670d504ab"},"schema_version":"1.0","source":{"id":"1010.0311","kind":"arxiv","version":1}},"canonical_sha256":"fb9de9b8aa20a51ed07afcdb031faac94af333e436c3f566d81db08035b397bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb9de9b8aa20a51ed07afcdb031faac94af333e436c3f566d81db08035b397bf","first_computed_at":"2026-05-18T04:39:58.686746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:58.686746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pgbTqdKOYeg2CTh/Wgw7QjxCR2v+yecIm+uN/olzdEF3g8341GMDHadBVxRJ7ZYfYZnmTDcv346aMpxcqS//AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:58.687330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0311","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:836a3d3824f7439e89b8f60d7003e8ec85917b7bc148aa17b5d23a4086a55f34","sha256:d632a2dd6cee923ebd0f8d23722c8971017e3c3f630e418831053cdd1c8c7c6f"],"state_sha256":"29835fe2bc6aa2b704bc8198f25f3fcb77de73ab74f389cd148013fdb662e886"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L7QjzY+m+qUnEpJ3I5Cf8biyYFUIdHZVG2ESC78zBXP+fdgcj4KfGxrtZhTqvXf6sEjo5FM+7eqDI3ub7tZbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:54:05.138009Z","bundle_sha256":"88a1d925acfc7e97a1b06b3701af9cd36d11116fe7ee907d70e339e289a8793d"}}