{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZXMHOSRX75FZF3ANKAAFFUKHWC","short_pith_number":"pith:ZXMHOSRX","canonical_record":{"source":{"id":"1412.1443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-03T19:08:55Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"e6e0dea2e927d8f742f430762005c6855259eaf36edf49da0295c80a00945794","abstract_canon_sha256":"ab8c4c130d6454498cfda46aa2d092127cf0b9e731770946d80722a714b82112"},"schema_version":"1.0"},"canonical_sha256":"cdd8774a37ff4b92ec0d500052d147b09f2bc3db90abfc4b029d67277858f725","source":{"kind":"arxiv","id":"1412.1443","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZXMHOSRX75FZF3ANKAAFFUKHWC","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-03T19:08:55Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"e6e0dea2e927d8f742f430762005c6855259eaf36edf49da0295c80a00945794","abstract_canon_sha256":"ab8c4c130d6454498cfda46aa2d092127cf0b9e731770946d80722a714b82112"},"schema_version":"1.0"},"canonical_sha256":"cdd8774a37ff4b92ec0d500052d147b09f2bc3db90abfc4b029d67277858f725","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:12.468796Z","signature_b64":"niGu0hwAes0M0eIXeCNY3/1WzlleD0etTSjqJPphhk+085ao+E57GHp9PiZgYKNDShWxdhLMc9d4fFLCRWhXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdd8774a37ff4b92ec0d500052d147b09f2bc3db90abfc4b029d67277858f725","last_reissued_at":"2026-05-18T02:32:12.468311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:12.468311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1443","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-18T02:32:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OrZ3D1nGrzb5ihuOCQt+ENTr9+KwdTfTvu6E01pcahGcnVpl5rL4+Df42O7/CY1XNbFpWQNZETg7mnETQvdqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:54:07.139220Z"},"content_sha256":"301e57c2357e9cacce9f376b949013ff2253b3a11d268c8735179e0679e314f0","schema_version":"1.0","event_id":"sha256:301e57c2357e9cacce9f376b949013ff2253b3a11d268c8735179e0679e314f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZXMHOSRX75FZF3ANKAAFFUKHWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure learning of antiferromagnetic Ising models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"David Gamarnik, Devavrat Shah, Guy Bresler","submitted_at":"2014-12-03T19:08:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1443","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-18T02:32:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bE2Aw+pt9oqY59CyAeSlI1rFe5zhwbFbL7pD+tDilCQWaX5rRyDW8O28SAFVyj1aiKt8Zh9WIHBszWdWzg0fBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:54:07.139591Z"},"content_sha256":"28967f32067490f4844394768cfac7b491552bda50dc957b8ccff7f70cb63465","schema_version":"1.0","event_id":"sha256:28967f32067490f4844394768cfac7b491552bda50dc957b8ccff7f70cb63465"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXMHOSRX75FZF3ANKAAFFUKHWC/bundle.json","state_url":"https://pith.science/pith/ZXMHOSRX75FZF3ANKAAFFUKHWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXMHOSRX75FZF3ANKAAFFUKHWC/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-04T16:54:07Z","links":{"resolver":"https://pith.science/pith/ZXMHOSRX75FZF3ANKAAFFUKHWC","bundle":"https://pith.science/pith/ZXMHOSRX75FZF3ANKAAFFUKHWC/bundle.json","state":"https://pith.science/pith/ZXMHOSRX75FZF3ANKAAFFUKHWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXMHOSRX75FZF3ANKAAFFUKHWC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zi7I1f38HGs2l7E5aedUq3OsDSBbnWSdMvbUOvHBVdB1yM9yvVwHAMXNwUYHwMDgZWs+5EQy7NklZpeGLJ26AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:54:07.141572Z","bundle_sha256":"98843463e87dc19bd4c760e1eb6447ae8d2728c7ef0ede1ee8a414242d02615a"}}