{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DV4ZKLSQRP5Q2AOB3GIKZXF5BG","short_pith_number":"pith:DV4ZKLSQ","canonical_record":{"source":{"id":"1107.3258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-16T22:04:13Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"ec7119e74c2c90cfad9e4a3dda0825568b8689bde5e3912cb104b4a9177c6c6e","abstract_canon_sha256":"3cfa8aec63d08b4190d79cd7c53f015c2423f05efa65a76a86ad0eae4def16d8"},"schema_version":"1.0"},"canonical_sha256":"1d79952e508bfb0d01c1d990acdcbd099a7a02311f99fc078cb8dd7a7e658d9d","source":{"kind":"arxiv","id":"1107.3258","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3258","created_at":"2026-05-18T04:01:26Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3258v1","created_at":"2026-05-18T04:01:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3258","created_at":"2026-05-18T04:01:26Z"},{"alias_kind":"pith_short_12","alias_value":"DV4ZKLSQRP5Q","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DV4ZKLSQRP5Q2AOB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DV4ZKLSQ","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DV4ZKLSQRP5Q2AOB3GIKZXF5BG","target":"record","payload":{"canonical_record":{"source":{"id":"1107.3258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-16T22:04:13Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"ec7119e74c2c90cfad9e4a3dda0825568b8689bde5e3912cb104b4a9177c6c6e","abstract_canon_sha256":"3cfa8aec63d08b4190d79cd7c53f015c2423f05efa65a76a86ad0eae4def16d8"},"schema_version":"1.0"},"canonical_sha256":"1d79952e508bfb0d01c1d990acdcbd099a7a02311f99fc078cb8dd7a7e658d9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:26.189447Z","signature_b64":"el8cVBK2vfrZmQOmBufACkKYTUOmHy7SAgiQV7W7C4eDzRyIP9k3YR9eych6c4uoiNFIBNsDRxNxsIqnqkyQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d79952e508bfb0d01c1d990acdcbd099a7a02311f99fc078cb8dd7a7e658d9d","last_reissued_at":"2026-05-18T04:01:26.188690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:26.188690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.3258","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-18T04:01:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnBXi4a7VTOubNc78il7UmdqimoG3bLiRAyzuZ/8nztyHmc+Pehca2X+OUEOlsN7UymHBLqjWWkNTiugykrYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:48:36.744780Z"},"content_sha256":"3a46432f35efb03624e4918300ee3040284959b3456d2298433ea9cadab58d8c","schema_version":"1.0","event_id":"sha256:3a46432f35efb03624e4918300ee3040284959b3456d2298433ea9cadab58d8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DV4ZKLSQRP5Q2AOB3GIKZXF5BG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Learning Discrete Graphical Models Using Greedy Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Ali Jalali, Chris Johnson, Pradeep Ravikumar","submitted_at":"2011-07-16T22:04:13Z","abstract_excerpt":"In this paper, we address the problem of learning the structure of a pairwise graphical model from samples in a high-dimensional setting. Our first main result studies the sparsistency, or consistency in sparsity pattern recovery, properties of a forward-backward greedy algorithm as applied to general statistical models. As a special case, we then apply this algorithm to learn the structure of a discrete graphical model via neighborhood estimation. As a corollary of our general result, we derive sufficient conditions on the number of samples n, the maximum node-degree d and the problem size p,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3258","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-18T04:01:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCgdAF8ilWui6+4AmsfHmOJkEiAEFrf4nl9gxtVUKj0KS+HQ2+S4o8XD0Sf+jceRFekirOZC7AcF0F1bEc56CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:48:36.745206Z"},"content_sha256":"25cd338a110919e83782dfc04354f57010516c7cacf403e5c8161f2c25bfb2b8","schema_version":"1.0","event_id":"sha256:25cd338a110919e83782dfc04354f57010516c7cacf403e5c8161f2c25bfb2b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/bundle.json","state_url":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/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-26T20:48:36Z","links":{"resolver":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG","bundle":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/bundle.json","state":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DV4ZKLSQRP5Q2AOB3GIKZXF5BG","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":"3cfa8aec63d08b4190d79cd7c53f015c2423f05efa65a76a86ad0eae4def16d8","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-16T22:04:13Z","title_canon_sha256":"ec7119e74c2c90cfad9e4a3dda0825568b8689bde5e3912cb104b4a9177c6c6e"},"schema_version":"1.0","source":{"id":"1107.3258","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3258","created_at":"2026-05-18T04:01:26Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3258v1","created_at":"2026-05-18T04:01:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3258","created_at":"2026-05-18T04:01:26Z"},{"alias_kind":"pith_short_12","alias_value":"DV4ZKLSQRP5Q","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DV4ZKLSQRP5Q2AOB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DV4ZKLSQ","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:25cd338a110919e83782dfc04354f57010516c7cacf403e5c8161f2c25bfb2b8","target":"graph","created_at":"2026-05-18T04:01:26Z","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 address the problem of learning the structure of a pairwise graphical model from samples in a high-dimensional setting. Our first main result studies the sparsistency, or consistency in sparsity pattern recovery, properties of a forward-backward greedy algorithm as applied to general statistical models. As a special case, we then apply this algorithm to learn the structure of a discrete graphical model via neighborhood estimation. As a corollary of our general result, we derive sufficient conditions on the number of samples n, the maximum node-degree d and the problem size p,","authors_text":"Ali Jalali, Chris Johnson, Pradeep Ravikumar","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-16T22:04:13Z","title":"On Learning Discrete Graphical Models Using Greedy Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3258","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:3a46432f35efb03624e4918300ee3040284959b3456d2298433ea9cadab58d8c","target":"record","created_at":"2026-05-18T04:01:26Z","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":"3cfa8aec63d08b4190d79cd7c53f015c2423f05efa65a76a86ad0eae4def16d8","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-16T22:04:13Z","title_canon_sha256":"ec7119e74c2c90cfad9e4a3dda0825568b8689bde5e3912cb104b4a9177c6c6e"},"schema_version":"1.0","source":{"id":"1107.3258","kind":"arxiv","version":1}},"canonical_sha256":"1d79952e508bfb0d01c1d990acdcbd099a7a02311f99fc078cb8dd7a7e658d9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d79952e508bfb0d01c1d990acdcbd099a7a02311f99fc078cb8dd7a7e658d9d","first_computed_at":"2026-05-18T04:01:26.188690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:26.188690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"el8cVBK2vfrZmQOmBufACkKYTUOmHy7SAgiQV7W7C4eDzRyIP9k3YR9eych6c4uoiNFIBNsDRxNxsIqnqkyQDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:26.189447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3258","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a46432f35efb03624e4918300ee3040284959b3456d2298433ea9cadab58d8c","sha256:25cd338a110919e83782dfc04354f57010516c7cacf403e5c8161f2c25bfb2b8"],"state_sha256":"c07e99ba734c81bcee52f0109868dfbaa556263ab59c30cc8b9e3e2b1a447c5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTVaJNhJpY3hUWZrZPhPbwcdUY/yC0fpBuf3fOYDt2Wjc8Hnu8SJ7O/B9F4oOiHedqYR5sIqDY/16r1TtET0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:48:36.747453Z","bundle_sha256":"1cc694d560533f5dd850b0bc3628a2c4be76067efa3dde1193896beb5825b629"}}