{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UVNA3GMB24YXNVWWTVDRHB26TH","short_pith_number":"pith:UVNA3GMB","canonical_record":{"source":{"id":"1107.1736","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-07-08T21:35:48Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"d4661c3979c287c582f71c35640aed75bd67ca5e918acc7eba1a955afe5fca3e","abstract_canon_sha256":"750dd29f37243526ec39e6b4cb888f2c840972bb0fcbaa7a99ab812104ec9cb9"},"schema_version":"1.0"},"canonical_sha256":"a55a0d9981d73176d6d69d4713875e99d2c832ea5557435aca74136eeb2b035a","source":{"kind":"arxiv","id":"1107.1736","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1736","created_at":"2026-05-18T03:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1736v4","created_at":"2026-05-18T03:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1736","created_at":"2026-05-18T03:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"UVNA3GMB24YX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UVNA3GMB24YXNVWW","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UVNA3GMB","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UVNA3GMB24YXNVWWTVDRHB26TH","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1736","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-07-08T21:35:48Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"d4661c3979c287c582f71c35640aed75bd67ca5e918acc7eba1a955afe5fca3e","abstract_canon_sha256":"750dd29f37243526ec39e6b4cb888f2c840972bb0fcbaa7a99ab812104ec9cb9"},"schema_version":"1.0"},"canonical_sha256":"a55a0d9981d73176d6d69d4713875e99d2c832ea5557435aca74136eeb2b035a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:34.219379Z","signature_b64":"c42DRkm5+OYFgNU4Aofi4oT4WtUtfYQ0IF26Wykho+G8kkCBHDLPue94im21pn4NvBCeGeGziQ6p2iZNB3Y6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a55a0d9981d73176d6d69d4713875e99d2c832ea5557435aca74136eeb2b035a","last_reissued_at":"2026-05-18T03:48:34.218713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:34.218713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1736","source_version":4,"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-18T03:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYiA5TR9lejMGBgDqDrsoVGA+Ei7oo9M1wKlxfqbgMZD4HIAh0QX3fDlPCaxI57ks/sO+3eMoiIkPxeTCpD1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:48:13.863181Z"},"content_sha256":"581b0b81164b0a16aa82264f882f93544d8cb2fd96410d4890640206cb16e751","schema_version":"1.0","event_id":"sha256:581b0b81164b0a16aa82264f882f93544d8cb2fd96410d4890640206cb16e751"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UVNA3GMB24YXNVWWTVDRHB26TH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-dimensional structure estimation in Ising models: Local separation criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alan S. Willsky, Animashree Anandkumar, Furong Huang, Vincent Y. F. Tan","submitted_at":"2011-07-08T21:35:48Z","abstract_excerpt":"We consider the problem of high-dimensional Ising (graphical) model selection. We propose a simple algorithm for structure estimation based on the thresholding of the empirical conditional variation distances. We introduce a novel criterion for tractable graph families, where this method is efficient, based on the presence of sparse local separators between node pairs in the underlying graph. For such graphs, the proposed algorithm has a sample complexity of $n=\\Omega(J_{\\min}^{-2}\\log p)$, where $p$ is the number of variables, and $J_{\\min}$ is the minimum (absolute) edge potential in the mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1736","kind":"arxiv","version":4},"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-18T03:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RCkSeqU34S0ZxfUMcDr+6/A6D11tvJPC2OEq5NwSBtk+NHjiwYhEhYYH3WUclcv6kSU+mhY6NgGKpXBP3EVyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:48:13.863549Z"},"content_sha256":"83d9e5ad991fffd25f879d7dd7064770bafb4a0b31d715959fd9501b363cda2c","schema_version":"1.0","event_id":"sha256:83d9e5ad991fffd25f879d7dd7064770bafb4a0b31d715959fd9501b363cda2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVNA3GMB24YXNVWWTVDRHB26TH/bundle.json","state_url":"https://pith.science/pith/UVNA3GMB24YXNVWWTVDRHB26TH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVNA3GMB24YXNVWWTVDRHB26TH/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-30T18:48:13Z","links":{"resolver":"https://pith.science/pith/UVNA3GMB24YXNVWWTVDRHB26TH","bundle":"https://pith.science/pith/UVNA3GMB24YXNVWWTVDRHB26TH/bundle.json","state":"https://pith.science/pith/UVNA3GMB24YXNVWWTVDRHB26TH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVNA3GMB24YXNVWWTVDRHB26TH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UVNA3GMB24YXNVWWTVDRHB26TH","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":"750dd29f37243526ec39e6b4cb888f2c840972bb0fcbaa7a99ab812104ec9cb9","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-07-08T21:35:48Z","title_canon_sha256":"d4661c3979c287c582f71c35640aed75bd67ca5e918acc7eba1a955afe5fca3e"},"schema_version":"1.0","source":{"id":"1107.1736","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1736","created_at":"2026-05-18T03:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1736v4","created_at":"2026-05-18T03:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1736","created_at":"2026-05-18T03:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"UVNA3GMB24YX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UVNA3GMB24YXNVWW","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UVNA3GMB","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:83d9e5ad991fffd25f879d7dd7064770bafb4a0b31d715959fd9501b363cda2c","target":"graph","created_at":"2026-05-18T03:48:34Z","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 high-dimensional Ising (graphical) model selection. We propose a simple algorithm for structure estimation based on the thresholding of the empirical conditional variation distances. We introduce a novel criterion for tractable graph families, where this method is efficient, based on the presence of sparse local separators between node pairs in the underlying graph. For such graphs, the proposed algorithm has a sample complexity of $n=\\Omega(J_{\\min}^{-2}\\log p)$, where $p$ is the number of variables, and $J_{\\min}$ is the minimum (absolute) edge potential in the mod","authors_text":"Alan S. Willsky, Animashree Anandkumar, Furong Huang, Vincent Y. F. Tan","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-07-08T21:35:48Z","title":"High-dimensional structure estimation in Ising models: Local separation criterion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1736","kind":"arxiv","version":4},"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:581b0b81164b0a16aa82264f882f93544d8cb2fd96410d4890640206cb16e751","target":"record","created_at":"2026-05-18T03:48:34Z","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":"750dd29f37243526ec39e6b4cb888f2c840972bb0fcbaa7a99ab812104ec9cb9","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-07-08T21:35:48Z","title_canon_sha256":"d4661c3979c287c582f71c35640aed75bd67ca5e918acc7eba1a955afe5fca3e"},"schema_version":"1.0","source":{"id":"1107.1736","kind":"arxiv","version":4}},"canonical_sha256":"a55a0d9981d73176d6d69d4713875e99d2c832ea5557435aca74136eeb2b035a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a55a0d9981d73176d6d69d4713875e99d2c832ea5557435aca74136eeb2b035a","first_computed_at":"2026-05-18T03:48:34.218713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:34.218713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c42DRkm5+OYFgNU4Aofi4oT4WtUtfYQ0IF26Wykho+G8kkCBHDLPue94im21pn4NvBCeGeGziQ6p2iZNB3Y6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:34.219379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1736","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:581b0b81164b0a16aa82264f882f93544d8cb2fd96410d4890640206cb16e751","sha256:83d9e5ad991fffd25f879d7dd7064770bafb4a0b31d715959fd9501b363cda2c"],"state_sha256":"ed953ad38d567ce89bccd26b19cf854302210f75d421edf0db591085c4d8c633"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R1woAeHAhrNO8fLeB5QAxgumet/yc+HnxEfrH41GRF7dcOOkv03pLLFb7E0UQE0tX7fooyxWTbsy+/sGWFi1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:48:13.865819Z","bundle_sha256":"7b77c212cbb680f2501c75577f44c71e5516a6dda2334889cd5db6eb6513484e"}}