{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DV4ZKLSQRP5Q2AOB3GIKZXF5BG","short_pith_number":"pith:DV4ZKLSQ","schema_version":"1.0","canonical_sha256":"1d79952e508bfb0d01c1d990acdcbd099a7a02311f99fc078cb8dd7a7e658d9d","source":{"kind":"arxiv","id":"1107.3258","version":1},"attestation_state":"computed","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,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.3258","created_at":"2026-05-18T04:01:26.188817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.3258v1","created_at":"2026-05-18T04:01:26.188817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3258","created_at":"2026-05-18T04:01:26.188817+00:00"},{"alias_kind":"pith_short_12","alias_value":"DV4ZKLSQRP5Q","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DV4ZKLSQRP5Q2AOB","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DV4ZKLSQ","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG","json":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG.json","graph_json":"https://pith.science/api/pith-number/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/graph.json","events_json":"https://pith.science/api/pith-number/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/events.json","paper":"https://pith.science/paper/DV4ZKLSQ"},"agent_actions":{"view_html":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG","download_json":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG.json","view_paper":"https://pith.science/paper/DV4ZKLSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.3258&json=true","fetch_graph":"https://pith.science/api/pith-number/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/graph.json","fetch_events":"https://pith.science/api/pith-number/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/action/storage_attestation","attest_author":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/action/author_attestation","sign_citation":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/action/citation_signature","submit_replication":"https://pith.science/pith/DV4ZKLSQRP5Q2AOB3GIKZXF5BG/action/replication_record"}},"created_at":"2026-05-18T04:01:26.188817+00:00","updated_at":"2026-05-18T04:01:26.188817+00:00"}