{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FRNUTHMH4RMYNDZ5XPVODL4UPJ","short_pith_number":"pith:FRNUTHMH","canonical_record":{"source":{"id":"1706.06274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-20T05:41:31Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"02e2ff107372b338fadd26bd790abca462d76fce80c9a1ccc7b83e46bd524281","abstract_canon_sha256":"3070296edbb0fd44a28abcc3dea62e234bee1ea8ea997ff887f719e684d4b39a"},"schema_version":"1.0"},"canonical_sha256":"2c5b499d87e459868f3dbbeae1af947a71bd933f397ce090d54a7a2713413c12","source":{"kind":"arxiv","id":"1706.06274","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06274","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06274v1","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06274","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"FRNUTHMH4RMY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRNUTHMH4RMYNDZ5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRNUTHMH","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FRNUTHMH4RMYNDZ5XPVODL4UPJ","target":"record","payload":{"canonical_record":{"source":{"id":"1706.06274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-20T05:41:31Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"02e2ff107372b338fadd26bd790abca462d76fce80c9a1ccc7b83e46bd524281","abstract_canon_sha256":"3070296edbb0fd44a28abcc3dea62e234bee1ea8ea997ff887f719e684d4b39a"},"schema_version":"1.0"},"canonical_sha256":"2c5b499d87e459868f3dbbeae1af947a71bd933f397ce090d54a7a2713413c12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:03.713204Z","signature_b64":"53M9xuqh6GMzgFgxgSxU1McoAA0tgVAuTu1IGpiyzzZ+9VPrT3rF7jnFaC9MZRITCcJSqwl50f1iC0bW8/m5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c5b499d87e459868f3dbbeae1af947a71bd933f397ce090d54a7a2713413c12","last_reissued_at":"2026-05-18T00:42:03.712555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:03.712555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.06274","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-18T00:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AWK+XNHyUOHZaF9qB2uOzUPQCAOEp8iia8JYbfevngcX5Vh8XkG29W/aK7AdeHXiuKKH4DTb4smrbIL2zDHsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:49:28.095603Z"},"content_sha256":"d447d807009f922ebc8bf046a0e0e79da4740984d8fedb0490fa5a33a365fbcf","schema_version":"1.0","event_id":"sha256:d447d807009f922ebc8bf046a0e0e79da4740984d8fedb0490fa5a33a365fbcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FRNUTHMH4RMYNDZ5XPVODL4UPJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Graphical Models Using Multiplicative Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Adam Klivans, Raghu Meka","submitted_at":"2017-06-20T05:41:31Z","abstract_excerpt":"We give a simple, multiplicative-weight update algorithm for learning undirected graphical models or Markov random fields (MRFs). The approach is new, and for the well-studied case of Ising models or Boltzmann machines, we obtain an algorithm that uses a nearly optimal number of samples and has quadratic running time (up to logarithmic factors), subsuming and improving on all prior work. Additionally, we give the first efficient algorithm for learning Ising models over general alphabets.\n  Our main application is an algorithm for learning the structure of t-wise MRFs with nearly-optimal sample"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06274","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-18T00:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"876CgQRrz+qPbW4BwqtmvspND+fqpyiNuz83J9ucBJdXFktwvrA/gLOEnDvs3QDcmmbX2DEikHRl1M+ApNLqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:49:28.095963Z"},"content_sha256":"152ccc7f02001273e328291a7878c6bba219ea704e60bd63c512c3e655269d86","schema_version":"1.0","event_id":"sha256:152ccc7f02001273e328291a7878c6bba219ea704e60bd63c512c3e655269d86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRNUTHMH4RMYNDZ5XPVODL4UPJ/bundle.json","state_url":"https://pith.science/pith/FRNUTHMH4RMYNDZ5XPVODL4UPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRNUTHMH4RMYNDZ5XPVODL4UPJ/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-19T17:49:28Z","links":{"resolver":"https://pith.science/pith/FRNUTHMH4RMYNDZ5XPVODL4UPJ","bundle":"https://pith.science/pith/FRNUTHMH4RMYNDZ5XPVODL4UPJ/bundle.json","state":"https://pith.science/pith/FRNUTHMH4RMYNDZ5XPVODL4UPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRNUTHMH4RMYNDZ5XPVODL4UPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FRNUTHMH4RMYNDZ5XPVODL4UPJ","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":"3070296edbb0fd44a28abcc3dea62e234bee1ea8ea997ff887f719e684d4b39a","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-20T05:41:31Z","title_canon_sha256":"02e2ff107372b338fadd26bd790abca462d76fce80c9a1ccc7b83e46bd524281"},"schema_version":"1.0","source":{"id":"1706.06274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06274","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06274v1","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06274","created_at":"2026-05-18T00:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"FRNUTHMH4RMY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRNUTHMH4RMYNDZ5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRNUTHMH","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:152ccc7f02001273e328291a7878c6bba219ea704e60bd63c512c3e655269d86","target":"graph","created_at":"2026-05-18T00:42:03Z","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 give a simple, multiplicative-weight update algorithm for learning undirected graphical models or Markov random fields (MRFs). The approach is new, and for the well-studied case of Ising models or Boltzmann machines, we obtain an algorithm that uses a nearly optimal number of samples and has quadratic running time (up to logarithmic factors), subsuming and improving on all prior work. Additionally, we give the first efficient algorithm for learning Ising models over general alphabets.\n  Our main application is an algorithm for learning the structure of t-wise MRFs with nearly-optimal sample","authors_text":"Adam Klivans, Raghu Meka","cross_cats":["cs.DS","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-20T05:41:31Z","title":"Learning Graphical Models Using Multiplicative Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06274","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:d447d807009f922ebc8bf046a0e0e79da4740984d8fedb0490fa5a33a365fbcf","target":"record","created_at":"2026-05-18T00:42:03Z","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":"3070296edbb0fd44a28abcc3dea62e234bee1ea8ea997ff887f719e684d4b39a","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-20T05:41:31Z","title_canon_sha256":"02e2ff107372b338fadd26bd790abca462d76fce80c9a1ccc7b83e46bd524281"},"schema_version":"1.0","source":{"id":"1706.06274","kind":"arxiv","version":1}},"canonical_sha256":"2c5b499d87e459868f3dbbeae1af947a71bd933f397ce090d54a7a2713413c12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c5b499d87e459868f3dbbeae1af947a71bd933f397ce090d54a7a2713413c12","first_computed_at":"2026-05-18T00:42:03.712555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:03.712555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"53M9xuqh6GMzgFgxgSxU1McoAA0tgVAuTu1IGpiyzzZ+9VPrT3rF7jnFaC9MZRITCcJSqwl50f1iC0bW8/m5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:03.713204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d447d807009f922ebc8bf046a0e0e79da4740984d8fedb0490fa5a33a365fbcf","sha256:152ccc7f02001273e328291a7878c6bba219ea704e60bd63c512c3e655269d86"],"state_sha256":"6d9f0c021f6cfc37df38d17d2bcfdf31e1b98b69dc1a5b6a1e05bf8a1b4f2d96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xAWRZrIO7Cn6HXTotj0N5ho6ZhHvEQLSiND/Wqmcq2MY2SvEGDTD1KWMaLpiX3K8b7h37kM3QbDoSu9MtqYbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T17:49:28.098692Z","bundle_sha256":"57a311b30bc16ec7bdf8a621cec2c2d5a2c5090ca605c0951a1eef5b5bd4a585"}}