{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LAADUQRVEZXAR3VFWZI44W3YGI","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":"bb226ccd2f57e9a92fcbad75573aee264ea6609b2e2055fc9d27aa14acbf1f67","cross_cats_sorted":["cond-mat.stat-mech","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-10-31T05:57:39Z","title_canon_sha256":"da737e93ae02a69dbc67246b786019db0311e8597aa765b3d6decece29b1cefa"},"schema_version":"1.0","source":{"id":"1011.0129","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0129","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0129v7","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0129","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"LAADUQRVEZXA","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LAADUQRVEZXAR3VF","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LAADUQRV","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:563ba466f1f9072cbc75b9d73e092c5b4bca4807c156f0713a34b1005635f7c2","target":"graph","created_at":"2026-05-18T02:23:38Z","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 consider the problem of learning the structure of ferromagnetic Ising models Markov on sparse Erdos-Renyi random graph. We propose simple local algorithms and analyze their performance in the regime of correlation decay. We prove that an algorithm based on a set of conditional mutual information tests is consistent for structure learning throughout the regime of correlation decay. This algorithm requires the number of samples to scale as \\omega(\\log n), and has a computational complexity of O(n^4). A simpler algorithm based on correlation thresholding outputs a graph with a constant edit di","authors_text":"Alan Willsky, Animashree Anandkumar, Vincent Tan","cross_cats":["cond-mat.stat-mech","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-10-31T05:57:39Z","title":"High Dimensional Structure Learning of Ising Models on Sparse Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0129","kind":"arxiv","version":7},"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:05f08331a6e8f217631215111806f771488ccfc1cb188e5750c290f42cb56251","target":"record","created_at":"2026-05-18T02:23:38Z","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":"bb226ccd2f57e9a92fcbad75573aee264ea6609b2e2055fc9d27aa14acbf1f67","cross_cats_sorted":["cond-mat.stat-mech","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-10-31T05:57:39Z","title_canon_sha256":"da737e93ae02a69dbc67246b786019db0311e8597aa765b3d6decece29b1cefa"},"schema_version":"1.0","source":{"id":"1011.0129","kind":"arxiv","version":7}},"canonical_sha256":"58003a4235266e08eea5b651ce5b783200bd153e702db8b6aa2391c5322d4c08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58003a4235266e08eea5b651ce5b783200bd153e702db8b6aa2391c5322d4c08","first_computed_at":"2026-05-18T02:23:38.034505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:38.034505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kG8207l7VBRgIwO4hvR2Sl0JnwZquh6BkwaQpPURazHETsHlq/ZooG7DxFpMA3WODXSj9fXD6XBo2DRM98ZDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:38.035079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0129","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05f08331a6e8f217631215111806f771488ccfc1cb188e5750c290f42cb56251","sha256:563ba466f1f9072cbc75b9d73e092c5b4bca4807c156f0713a34b1005635f7c2"],"state_sha256":"5916beb2e7571f171a10e9ecea91ec2cfbb481dcbfdf50f1930b9eaeb2b1d2b6"}