{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A7MBII4LNETH32AENIFF7S4MRP","short_pith_number":"pith:A7MBII4L","canonical_record":{"source":{"id":"1705.11107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-31T14:18:20Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"fe950ba5d269bb17583a3c2094c0cad1cf47d039b7420461124c7f970260440b","abstract_canon_sha256":"e5334c178e2233e48aaf45c1abf52aad627f501db8ec71987a0924cd76fc90fd"},"schema_version":"1.0"},"canonical_sha256":"07d814238b69267de8046a0a5fcb8c8bc9bcfcd9cd224d86b0fa98e793f75f47","source":{"kind":"arxiv","id":"1705.11107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.11107","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.11107v1","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11107","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"pith_short_12","alias_value":"A7MBII4LNETH","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A7MBII4LNETH32AE","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A7MBII4L","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A7MBII4LNETH32AENIFF7S4MRP","target":"record","payload":{"canonical_record":{"source":{"id":"1705.11107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-31T14:18:20Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"fe950ba5d269bb17583a3c2094c0cad1cf47d039b7420461124c7f970260440b","abstract_canon_sha256":"e5334c178e2233e48aaf45c1abf52aad627f501db8ec71987a0924cd76fc90fd"},"schema_version":"1.0"},"canonical_sha256":"07d814238b69267de8046a0a5fcb8c8bc9bcfcd9cd224d86b0fa98e793f75f47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:19.278159Z","signature_b64":"HqOt8HWY1WQcNNFI21lb3JpHq0tCy7FmnIzgoAezs/thvdJUaSqWDfkkyUiWKYzo29Gz5IJn6xcXY/aJ6tx6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d814238b69267de8046a0a5fcb8c8bc9bcfcd9cd224d86b0fa98e793f75f47","last_reissued_at":"2026-05-18T00:43:19.277374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:19.277374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.11107","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:43:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYe5yjaCGmIBnaNuOmmh/CubmBppCKnMgk2l3WahBux4mCm0lXXjhDUYc0KHUxo6bJE9IAN21xe+y0Htl7OJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:27:55.279776Z"},"content_sha256":"3d15b9cb8760755aff6659ffd5a8690523b44cd8f9e196b7771dcccf68259b4b","schema_version":"1.0","event_id":"sha256:3d15b9cb8760755aff6659ffd5a8690523b44cd8f9e196b7771dcccf68259b4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A7MBII4LNETH32AENIFF7S4MRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Ankur Moitra, Frederic Koehler, Linus Hamilton","submitted_at":"2017-05-31T14:18:20Z","abstract_excerpt":"Markov random fields area popular model for high-dimensional probability distributions. Over the years, many mathematical, statistical and algorithmic problems on them have been studied. Until recently, the only known algorithms for provably learning them relied on exhaustive search, correlation decay or various incoherence assumptions. Bresler gave an algorithm for learning general Ising models on bounded degree graphs. His approach was based on a structural result about mutual information in Ising models.\n  Here we take a more conceptual approach to proving lower bounds on the mutual informa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11107","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:43:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bg0Q8E/ldRzgaQjStUkNsbclAftlqtkfpSxQm8w+48T9L0nq2xYGDQeZCUMvuZBuZhNHDCB8uuHyOzYwhxq0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:27:55.280128Z"},"content_sha256":"cc6205eb23004dfb32255f9a1b02cf42fed754e177c9f4b1ad39fea763068bea","schema_version":"1.0","event_id":"sha256:cc6205eb23004dfb32255f9a1b02cf42fed754e177c9f4b1ad39fea763068bea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7MBII4LNETH32AENIFF7S4MRP/bundle.json","state_url":"https://pith.science/pith/A7MBII4LNETH32AENIFF7S4MRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7MBII4LNETH32AENIFF7S4MRP/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-28T11:27:55Z","links":{"resolver":"https://pith.science/pith/A7MBII4LNETH32AENIFF7S4MRP","bundle":"https://pith.science/pith/A7MBII4LNETH32AENIFF7S4MRP/bundle.json","state":"https://pith.science/pith/A7MBII4LNETH32AENIFF7S4MRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7MBII4LNETH32AENIFF7S4MRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A7MBII4LNETH32AENIFF7S4MRP","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":"e5334c178e2233e48aaf45c1abf52aad627f501db8ec71987a0924cd76fc90fd","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-31T14:18:20Z","title_canon_sha256":"fe950ba5d269bb17583a3c2094c0cad1cf47d039b7420461124c7f970260440b"},"schema_version":"1.0","source":{"id":"1705.11107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.11107","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.11107v1","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11107","created_at":"2026-05-18T00:43:19Z"},{"alias_kind":"pith_short_12","alias_value":"A7MBII4LNETH","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A7MBII4LNETH32AE","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A7MBII4L","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:cc6205eb23004dfb32255f9a1b02cf42fed754e177c9f4b1ad39fea763068bea","target":"graph","created_at":"2026-05-18T00:43:19Z","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":"Markov random fields area popular model for high-dimensional probability distributions. Over the years, many mathematical, statistical and algorithmic problems on them have been studied. Until recently, the only known algorithms for provably learning them relied on exhaustive search, correlation decay or various incoherence assumptions. Bresler gave an algorithm for learning general Ising models on bounded degree graphs. His approach was based on a structural result about mutual information in Ising models.\n  Here we take a more conceptual approach to proving lower bounds on the mutual informa","authors_text":"Ankur Moitra, Frederic Koehler, Linus Hamilton","cross_cats":["cs.DS","cs.IT","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-31T14:18:20Z","title":"Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11107","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:3d15b9cb8760755aff6659ffd5a8690523b44cd8f9e196b7771dcccf68259b4b","target":"record","created_at":"2026-05-18T00:43:19Z","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":"e5334c178e2233e48aaf45c1abf52aad627f501db8ec71987a0924cd76fc90fd","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-31T14:18:20Z","title_canon_sha256":"fe950ba5d269bb17583a3c2094c0cad1cf47d039b7420461124c7f970260440b"},"schema_version":"1.0","source":{"id":"1705.11107","kind":"arxiv","version":1}},"canonical_sha256":"07d814238b69267de8046a0a5fcb8c8bc9bcfcd9cd224d86b0fa98e793f75f47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07d814238b69267de8046a0a5fcb8c8bc9bcfcd9cd224d86b0fa98e793f75f47","first_computed_at":"2026-05-18T00:43:19.277374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:19.277374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HqOt8HWY1WQcNNFI21lb3JpHq0tCy7FmnIzgoAezs/thvdJUaSqWDfkkyUiWKYzo29Gz5IJn6xcXY/aJ6tx6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:19.278159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.11107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d15b9cb8760755aff6659ffd5a8690523b44cd8f9e196b7771dcccf68259b4b","sha256:cc6205eb23004dfb32255f9a1b02cf42fed754e177c9f4b1ad39fea763068bea"],"state_sha256":"68edf7101870a0dea22aadf85cf3f60f6dfd8e0fc2d64e6a8a5dabc591ead421"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwdd4Q99H9f2kXVVaZcy5xDSqJKFSEjlbCQz5Jw0xKd+8FlfnZjtOSTeLl2HRstTCrLItPYRfLLS/U+R8LSjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:27:55.282168Z","bundle_sha256":"35975488580893defbb3d62aaae6f64de3b867350a40c00f7aec274de82c7269"}}