{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZXMHOSRX75FZF3ANKAAFFUKHWC","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":"ab8c4c130d6454498cfda46aa2d092127cf0b9e731770946d80722a714b82112","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-03T19:08:55Z","title_canon_sha256":"e6e0dea2e927d8f742f430762005c6855259eaf36edf49da0295c80a00945794"},"schema_version":"1.0","source":{"id":"1412.1443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1443","created_at":"2026-05-18T02:32:12Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1443v1","created_at":"2026-05-18T02:32:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1443","created_at":"2026-05-18T02:32:12Z"},{"alias_kind":"pith_short_12","alias_value":"ZXMHOSRX75FZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXMHOSRX75FZF3AN","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXMHOSRX","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:28967f32067490f4844394768cfac7b491552bda50dc957b8ccff7f70cb63465","target":"graph","created_at":"2026-05-18T02:32:12Z","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":"In this paper we investigate the computational complexity of learning the graph structure underlying a discrete undirected graphical model from i.i.d. samples. We first observe that the notoriously difficult problem of learning parities with noise can be captured as a special case of learning graphical models. This leads to an unconditional computational lower bound of $\\Omega (p^{d/2})$ for learning general graphical models on $p$ nodes of maximum degree $d$, for the class of so-called statistical algorithms recently introduced by Feldman et al (2013). The lower bound suggests that the $O(p^d","authors_text":"David Gamarnik, Devavrat Shah, Guy Bresler","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-03T19:08:55Z","title":"Structure learning of antiferromagnetic Ising models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1443","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:301e57c2357e9cacce9f376b949013ff2253b3a11d268c8735179e0679e314f0","target":"record","created_at":"2026-05-18T02:32:12Z","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":"ab8c4c130d6454498cfda46aa2d092127cf0b9e731770946d80722a714b82112","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-03T19:08:55Z","title_canon_sha256":"e6e0dea2e927d8f742f430762005c6855259eaf36edf49da0295c80a00945794"},"schema_version":"1.0","source":{"id":"1412.1443","kind":"arxiv","version":1}},"canonical_sha256":"cdd8774a37ff4b92ec0d500052d147b09f2bc3db90abfc4b029d67277858f725","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdd8774a37ff4b92ec0d500052d147b09f2bc3db90abfc4b029d67277858f725","first_computed_at":"2026-05-18T02:32:12.468311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:12.468311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"niGu0hwAes0M0eIXeCNY3/1WzlleD0etTSjqJPphhk+085ao+E57GHp9PiZgYKNDShWxdhLMc9d4fFLCRWhXAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:12.468796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:301e57c2357e9cacce9f376b949013ff2253b3a11d268c8735179e0679e314f0","sha256:28967f32067490f4844394768cfac7b491552bda50dc957b8ccff7f70cb63465"],"state_sha256":"b056c3de79539e2a4544b3497a53be4beebf3ccb870a765dd8158f3aade816a5"}