{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q4QBQWMFM76VCMEWDP3LQZJ7DT","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":"f126e7ac621fcf9da4ef8e199312d0d6f2e3f1baffc04473bbe2cf303ea00eb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-27T15:17:04Z","title_canon_sha256":"006d1710e8e4caa71e2ce3e255efadd471a4945b833c431ff8cdde720339e59d"},"schema_version":"1.0","source":{"id":"1702.08320","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08320","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08320v2","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08320","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"Q4QBQWMFM76V","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q4QBQWMFM76VCMEW","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q4QBQWMF","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:f7b8dea1534706558ca04b40460ce731fe43e20a49b756e5e5b875afd768a7e8","target":"graph","created_at":"2026-05-18T00:46:51Z","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":"The pseudo-likelihood method is one of the most popular algorithms for learning sparse binary pairwise Markov networks. In this paper, we formulate the $L_1$ regularized pseudo-likelihood problem as a sparse multiple logistic regression problem. In this way, many insights and optimization procedures for sparse logistic regression can be applied to the learning of discrete Markov networks. Specifically, we use the coordinate descent algorithm for generalized linear models with convex penalties, combined with strong screening rules, to solve the pseudo-likelihood problem with $L_1$ regularizatio","authors_text":"David Page, Sinong Geng, Zhaobin Kuang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-27T15:17:04Z","title":"An Efficient Pseudo-likelihood Method for Sparse Binary Pairwise Markov Network Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08320","kind":"arxiv","version":2},"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:117da1bdb5e549c033ffcffed5ae8b005fb9ddc25cc1e12bd8143b58b1eda038","target":"record","created_at":"2026-05-18T00:46:51Z","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":"f126e7ac621fcf9da4ef8e199312d0d6f2e3f1baffc04473bbe2cf303ea00eb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-27T15:17:04Z","title_canon_sha256":"006d1710e8e4caa71e2ce3e255efadd471a4945b833c431ff8cdde720339e59d"},"schema_version":"1.0","source":{"id":"1702.08320","kind":"arxiv","version":2}},"canonical_sha256":"872018598567fd5130961bf6b8653f1cf8dd3e2090609730a1a0081d24b2ccf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"872018598567fd5130961bf6b8653f1cf8dd3e2090609730a1a0081d24b2ccf4","first_computed_at":"2026-05-18T00:46:51.284190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:51.284190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nOD9hCPHEnwbYbRei67+iohwiMD8Qits2a0btzNKiZQZ1vFsRZi7WTZuNe27AcKHVFDxPqma6wQ53cPVtNw+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:51.284798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08320","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:117da1bdb5e549c033ffcffed5ae8b005fb9ddc25cc1e12bd8143b58b1eda038","sha256:f7b8dea1534706558ca04b40460ce731fe43e20a49b756e5e5b875afd768a7e8"],"state_sha256":"3b1f7066c3527eb7563804b2d74463e2b15713a2af746972dec5a9fb6c6e3a31"}