{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4DQC5JHVFVUGF2AXTDUMTDPGW3","short_pith_number":"pith:4DQC5JHV","canonical_record":{"source":{"id":"1411.1434","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-05T22:28:00Z","cross_cats_sorted":[],"title_canon_sha256":"1fce1f2743c47197249cfcf74b83b84c0d6aacd7a5fbf99695bed06c4daf94fa","abstract_canon_sha256":"3f0ad66ea98d301304eaf87863efb04096c95bbda18de06f9d0d7aa949f4702a"},"schema_version":"1.0"},"canonical_sha256":"e0e02ea4f52d6862e81798e8c98de6b6de9e34d737749e71768d4f226aeb41cb","source":{"kind":"arxiv","id":"1411.1434","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1434","created_at":"2026-05-18T02:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1434v2","created_at":"2026-05-18T02:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1434","created_at":"2026-05-18T02:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"4DQC5JHVFVUG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DQC5JHVFVUGF2AX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DQC5JHV","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4DQC5JHVFVUGF2AXTDUMTDPGW3","target":"record","payload":{"canonical_record":{"source":{"id":"1411.1434","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-05T22:28:00Z","cross_cats_sorted":[],"title_canon_sha256":"1fce1f2743c47197249cfcf74b83b84c0d6aacd7a5fbf99695bed06c4daf94fa","abstract_canon_sha256":"3f0ad66ea98d301304eaf87863efb04096c95bbda18de06f9d0d7aa949f4702a"},"schema_version":"1.0"},"canonical_sha256":"e0e02ea4f52d6862e81798e8c98de6b6de9e34d737749e71768d4f226aeb41cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:59.074740Z","signature_b64":"8OOdJqvrek91CqoUmd+90sic1dnE3ISoC2dSPl2HPybquaEuzhYxYyq9Jl7azWAwgkTPfq1Ne5Hew7GIrJnKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0e02ea4f52d6862e81798e8c98de6b6de9e34d737749e71768d4f226aeb41cb","last_reissued_at":"2026-05-18T02:31:59.074210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:59.074210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.1434","source_version":2,"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:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r51UOs/NXm580DXSLHScdNWMfqblzbYZ8E75kVKUtR3duTk9uI0+bn+mipv5mbza+mBzMbOgnGVau2bQ9LPNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:01:24.134508Z"},"content_sha256":"8024da8bd46be3281e59306467699e11e9e8fc841580c4faf8edbba038995881","schema_version":"1.0","event_id":"sha256:8024da8bd46be3281e59306467699e11e9e8fc841580c4faf8edbba038995881"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4DQC5JHVFVUGF2AXTDUMTDPGW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Information Theoretic Limits of Learning Ising Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam, Pradeep Ravikumar, Rashish Tandon","submitted_at":"2014-11-05T22:28:00Z","abstract_excerpt":"We provide a general framework for computing lower-bounds on the sample complexity of recovering the underlying graphs of Ising models, given i.i.d samples. While there have been recent results for specific graph classes, these involve fairly extensive technical arguments that are specialized to each specific graph class. In contrast, we isolate two key graph-structural ingredients that can then be used to specify sample complexity lower-bounds. Presence of these structural properties makes the graph class hard to learn. We derive corollaries of our main result that not only recover existing r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1434","kind":"arxiv","version":2},"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:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9t8o/5IL4tgOs7ZU2KpOOzUa0ufUBTLP7gfFX0H7P+TBujCr7X8vA3YWHgTE8fO+pkrtN/+UAUjx0WjARe4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:01:24.134891Z"},"content_sha256":"1f57764164e4cb077a34753c64d3869c0e02c96e79cf6b8aebce07b966bdd2d6","schema_version":"1.0","event_id":"sha256:1f57764164e4cb077a34753c64d3869c0e02c96e79cf6b8aebce07b966bdd2d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DQC5JHVFVUGF2AXTDUMTDPGW3/bundle.json","state_url":"https://pith.science/pith/4DQC5JHVFVUGF2AXTDUMTDPGW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DQC5JHVFVUGF2AXTDUMTDPGW3/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:01:24Z","links":{"resolver":"https://pith.science/pith/4DQC5JHVFVUGF2AXTDUMTDPGW3","bundle":"https://pith.science/pith/4DQC5JHVFVUGF2AXTDUMTDPGW3/bundle.json","state":"https://pith.science/pith/4DQC5JHVFVUGF2AXTDUMTDPGW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DQC5JHVFVUGF2AXTDUMTDPGW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4DQC5JHVFVUGF2AXTDUMTDPGW3","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":"3f0ad66ea98d301304eaf87863efb04096c95bbda18de06f9d0d7aa949f4702a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-05T22:28:00Z","title_canon_sha256":"1fce1f2743c47197249cfcf74b83b84c0d6aacd7a5fbf99695bed06c4daf94fa"},"schema_version":"1.0","source":{"id":"1411.1434","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1434","created_at":"2026-05-18T02:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1434v2","created_at":"2026-05-18T02:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1434","created_at":"2026-05-18T02:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"4DQC5JHVFVUG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4DQC5JHVFVUGF2AX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4DQC5JHV","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:1f57764164e4cb077a34753c64d3869c0e02c96e79cf6b8aebce07b966bdd2d6","target":"graph","created_at":"2026-05-18T02:31:59Z","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 provide a general framework for computing lower-bounds on the sample complexity of recovering the underlying graphs of Ising models, given i.i.d samples. While there have been recent results for specific graph classes, these involve fairly extensive technical arguments that are specialized to each specific graph class. In contrast, we isolate two key graph-structural ingredients that can then be used to specify sample complexity lower-bounds. Presence of these structural properties makes the graph class hard to learn. We derive corollaries of our main result that not only recover existing r","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam, Pradeep Ravikumar, Rashish Tandon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-05T22:28:00Z","title":"On the Information Theoretic Limits of Learning Ising Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1434","kind":"arxiv","version":2},"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:8024da8bd46be3281e59306467699e11e9e8fc841580c4faf8edbba038995881","target":"record","created_at":"2026-05-18T02:31:59Z","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":"3f0ad66ea98d301304eaf87863efb04096c95bbda18de06f9d0d7aa949f4702a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-05T22:28:00Z","title_canon_sha256":"1fce1f2743c47197249cfcf74b83b84c0d6aacd7a5fbf99695bed06c4daf94fa"},"schema_version":"1.0","source":{"id":"1411.1434","kind":"arxiv","version":2}},"canonical_sha256":"e0e02ea4f52d6862e81798e8c98de6b6de9e34d737749e71768d4f226aeb41cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0e02ea4f52d6862e81798e8c98de6b6de9e34d737749e71768d4f226aeb41cb","first_computed_at":"2026-05-18T02:31:59.074210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:59.074210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8OOdJqvrek91CqoUmd+90sic1dnE3ISoC2dSPl2HPybquaEuzhYxYyq9Jl7azWAwgkTPfq1Ne5Hew7GIrJnKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:59.074740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1434","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8024da8bd46be3281e59306467699e11e9e8fc841580c4faf8edbba038995881","sha256:1f57764164e4cb077a34753c64d3869c0e02c96e79cf6b8aebce07b966bdd2d6"],"state_sha256":"6bfa8aa26b2d21be01ab2030ac3eb09d141c41e266d318144f0517d9f3b21338"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDL1l5WIdW5UMr+Zg3Dl1us6cZouOhqRJtyYlvH/4H0bTPMQaN4GR/J/LxAnHOcJoS7ib3p+NBTndfPchflwBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T17:01:24.137802Z","bundle_sha256":"7cfaaf158ab49d80316498d85edf972ec39c5c9d141879f48858f175d3ff8817"}}