{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:U5WR6KIEW3QJGOOFTYQZC2FCIG","short_pith_number":"pith:U5WR6KIE","canonical_record":{"source":{"id":"1810.11905","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-28T23:40:42Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"a209b75d99e450c07289ed950d5cc1ea57553a6682dbd34f6a548354c3d207b4","abstract_canon_sha256":"71ad5c6f9f305bc55520ed83853842db9107012b2503f13906c57e6e6d2faf27"},"schema_version":"1.0"},"canonical_sha256":"a76d1f2904b6e09339c59e219168a241b006e8f6179991437ae115c03e547682","source":{"kind":"arxiv","id":"1810.11905","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11905","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11905v3","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11905","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"pith_short_12","alias_value":"U5WR6KIEW3QJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U5WR6KIEW3QJGOOF","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U5WR6KIE","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:U5WR6KIEW3QJGOOFTYQZC2FCIG","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11905","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-28T23:40:42Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"a209b75d99e450c07289ed950d5cc1ea57553a6682dbd34f6a548354c3d207b4","abstract_canon_sha256":"71ad5c6f9f305bc55520ed83853842db9107012b2503f13906c57e6e6d2faf27"},"schema_version":"1.0"},"canonical_sha256":"a76d1f2904b6e09339c59e219168a241b006e8f6179991437ae115c03e547682","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:58.697300Z","signature_b64":"fnoOx1lBUGksMmF0q8dhAHOcLVQO6/tzrVLkEU8nQ+LMbnf4jQQ/Ai8K2zCwLSLnwFsjVZmrrafoMz79JSNkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a76d1f2904b6e09339c59e219168a241b006e8f6179991437ae115c03e547682","last_reissued_at":"2026-05-17T23:42:58.696571Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:58.696571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11905","source_version":3,"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-17T23:42:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lO2iDBpeO7oLm7620Fwx90bsg3HqOgrwjeqbf0YVZlKWQtAFtxlpe7ra0ylpau9JrJQsTTzjxLGrDMTtb7S2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:38:18.113359Z"},"content_sha256":"832304c32aeb0225962dc78888fdaedb969569cfb5363faf758106245025a682","schema_version":"1.0","event_id":"sha256:832304c32aeb0225962dc78888fdaedb969569cfb5363faf758106245025a682"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:U5WR6KIEW3QJGOOFTYQZC2FCIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Logistic Regression Learns All Discrete Pairwise Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Alexandros G. Dimakis, Shanshan Wu, Sujay Sanghavi","submitted_at":"2018-10-28T23:40:42Z","abstract_excerpt":"We characterize the effectiveness of a classical algorithm for recovering the Markov graph of a general discrete pairwise graphical model from i.i.d. samples. The algorithm is (appropriately regularized) maximum conditional log-likelihood, which involves solving a convex program for each node; for Ising models this is $\\ell_1$-constrained logistic regression, while for more general alphabets an $\\ell_{2,1}$ group-norm constraint needs to be used. We show that this algorithm can recover any arbitrary discrete pairwise graphical model, and also characterize its sample complexity as a function of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11905","kind":"arxiv","version":3},"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-17T23:42:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7dFA0ECdGU1bmZ3/SmVkqs9fXdKW9YDCG6nc+BlGw2LVgw++aT1IoaBkewta7aJ4hHGLGjZNXeHweTCtoPcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:38:18.114050Z"},"content_sha256":"bfd9b703959d449f4f94cead79f493e9cc7abc12a57bbc901a5db909e4d28b30","schema_version":"1.0","event_id":"sha256:bfd9b703959d449f4f94cead79f493e9cc7abc12a57bbc901a5db909e4d28b30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5WR6KIEW3QJGOOFTYQZC2FCIG/bundle.json","state_url":"https://pith.science/pith/U5WR6KIEW3QJGOOFTYQZC2FCIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5WR6KIEW3QJGOOFTYQZC2FCIG/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-06-05T01:38:18Z","links":{"resolver":"https://pith.science/pith/U5WR6KIEW3QJGOOFTYQZC2FCIG","bundle":"https://pith.science/pith/U5WR6KIEW3QJGOOFTYQZC2FCIG/bundle.json","state":"https://pith.science/pith/U5WR6KIEW3QJGOOFTYQZC2FCIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5WR6KIEW3QJGOOFTYQZC2FCIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U5WR6KIEW3QJGOOFTYQZC2FCIG","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":"71ad5c6f9f305bc55520ed83853842db9107012b2503f13906c57e6e6d2faf27","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-28T23:40:42Z","title_canon_sha256":"a209b75d99e450c07289ed950d5cc1ea57553a6682dbd34f6a548354c3d207b4"},"schema_version":"1.0","source":{"id":"1810.11905","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11905","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11905v3","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11905","created_at":"2026-05-17T23:42:58Z"},{"alias_kind":"pith_short_12","alias_value":"U5WR6KIEW3QJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U5WR6KIEW3QJGOOF","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U5WR6KIE","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:bfd9b703959d449f4f94cead79f493e9cc7abc12a57bbc901a5db909e4d28b30","target":"graph","created_at":"2026-05-17T23:42: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 characterize the effectiveness of a classical algorithm for recovering the Markov graph of a general discrete pairwise graphical model from i.i.d. samples. The algorithm is (appropriately regularized) maximum conditional log-likelihood, which involves solving a convex program for each node; for Ising models this is $\\ell_1$-constrained logistic regression, while for more general alphabets an $\\ell_{2,1}$ group-norm constraint needs to be used. We show that this algorithm can recover any arbitrary discrete pairwise graphical model, and also characterize its sample complexity as a function of","authors_text":"Alexandros G. Dimakis, Shanshan Wu, Sujay Sanghavi","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-28T23:40:42Z","title":"Sparse Logistic Regression Learns All Discrete Pairwise Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11905","kind":"arxiv","version":3},"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:832304c32aeb0225962dc78888fdaedb969569cfb5363faf758106245025a682","target":"record","created_at":"2026-05-17T23:42: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":"71ad5c6f9f305bc55520ed83853842db9107012b2503f13906c57e6e6d2faf27","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-28T23:40:42Z","title_canon_sha256":"a209b75d99e450c07289ed950d5cc1ea57553a6682dbd34f6a548354c3d207b4"},"schema_version":"1.0","source":{"id":"1810.11905","kind":"arxiv","version":3}},"canonical_sha256":"a76d1f2904b6e09339c59e219168a241b006e8f6179991437ae115c03e547682","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a76d1f2904b6e09339c59e219168a241b006e8f6179991437ae115c03e547682","first_computed_at":"2026-05-17T23:42:58.696571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:58.696571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fnoOx1lBUGksMmF0q8dhAHOcLVQO6/tzrVLkEU8nQ+LMbnf4jQQ/Ai8K2zCwLSLnwFsjVZmrrafoMz79JSNkBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:58.697300Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11905","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:832304c32aeb0225962dc78888fdaedb969569cfb5363faf758106245025a682","sha256:bfd9b703959d449f4f94cead79f493e9cc7abc12a57bbc901a5db909e4d28b30"],"state_sha256":"e63b08048fd57e0ed132fded78b2a4041430fc2a82df77413c4f002dc1c6fde3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/WFmyhwNMbRIxMiM3asKD2LZ3wF1cUK8uJ0klSPnXRcouotMGHm6JGg9FlQIHfojYVp72HXKNpGbYR8OA+i5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:38:18.117703Z","bundle_sha256":"618cc02d0ebacdac66c88585b2c6dacc2171c954b981ec26f84b0102cfcecbbf"}}