{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YAIPIK7ECK5ASK6ODKLVUXQXSW","short_pith_number":"pith:YAIPIK7E","schema_version":"1.0","canonical_sha256":"c010f42be412ba092bce1a975a5e17959725cf8d10249bd9514eb651c7ef7368","source":{"kind":"arxiv","id":"1902.00600","version":3},"attestation_state":"computed","paper":{"title":"Efficient Learning of Discrete Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Andrey Y. Lokhov, Marc Vuffray, Sidhant Misra","submitted_at":"2019-02-02T00:54:57Z","abstract_excerpt":"Graphical models are useful tools for describing structured high-dimensional probability distributions. Development of efficient algorithms for learning graphical models with least amount of data remains an active research topic. Reconstruction of graphical models that describe the statistics of discrete variables is a particularly challenging problem, for which the maximum likelihood approach is intractable. In this work, we provide the first sample-efficient method based on the Interaction Screening framework that allows one to provably learn fully general discrete factor models with node-sp"},"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":"1902.00600","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-02T00:54:57Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"a9715d7a9d15d6578dd54131ef09551f822e5c4b6054b9bcd70089ddfdc0063d","abstract_canon_sha256":"bc130239defabd2acaa7f5e17170470bc642b5a0da8862d7e3bbb32d2d88adcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:32:36.915179Z","signature_b64":"zW/qepjiRZxNdUhuDkrROdrDmBJXzDAOIrSMag2VZTOBhZAJ4bLb30d0ZUIWUciY2VQBjvIGxb4PLB1rGf8aBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c010f42be412ba092bce1a975a5e17959725cf8d10249bd9514eb651c7ef7368","last_reissued_at":"2026-07-05T03:32:36.914762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:32:36.914762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Learning of Discrete Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Andrey Y. Lokhov, Marc Vuffray, Sidhant Misra","submitted_at":"2019-02-02T00:54:57Z","abstract_excerpt":"Graphical models are useful tools for describing structured high-dimensional probability distributions. Development of efficient algorithms for learning graphical models with least amount of data remains an active research topic. Reconstruction of graphical models that describe the statistics of discrete variables is a particularly challenging problem, for which the maximum likelihood approach is intractable. In this work, we provide the first sample-efficient method based on the Interaction Screening framework that allows one to provably learn fully general discrete factor models with node-sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00600","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.00600/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1902.00600","created_at":"2026-07-05T03:32:36.914820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00600v3","created_at":"2026-07-05T03:32:36.914820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00600","created_at":"2026-07-05T03:32:36.914820+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAIPIK7ECK5A","created_at":"2026-07-05T03:32:36.914820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAIPIK7ECK5ASK6O","created_at":"2026-07-05T03:32:36.914820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAIPIK7E","created_at":"2026-07-05T03:32:36.914820+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/YAIPIK7ECK5ASK6ODKLVUXQXSW","json":"https://pith.science/pith/YAIPIK7ECK5ASK6ODKLVUXQXSW.json","graph_json":"https://pith.science/api/pith-number/YAIPIK7ECK5ASK6ODKLVUXQXSW/graph.json","events_json":"https://pith.science/api/pith-number/YAIPIK7ECK5ASK6ODKLVUXQXSW/events.json","paper":"https://pith.science/paper/YAIPIK7E"},"agent_actions":{"view_html":"https://pith.science/pith/YAIPIK7ECK5ASK6ODKLVUXQXSW","download_json":"https://pith.science/pith/YAIPIK7ECK5ASK6ODKLVUXQXSW.json","view_paper":"https://pith.science/paper/YAIPIK7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00600&json=true","fetch_graph":"https://pith.science/api/pith-number/YAIPIK7ECK5ASK6ODKLVUXQXSW/graph.json","fetch_events":"https://pith.science/api/pith-number/YAIPIK7ECK5ASK6ODKLVUXQXSW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAIPIK7ECK5ASK6ODKLVUXQXSW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAIPIK7ECK5ASK6ODKLVUXQXSW/action/storage_attestation","attest_author":"https://pith.science/pith/YAIPIK7ECK5ASK6ODKLVUXQXSW/action/author_attestation","sign_citation":"https://pith.science/pith/YAIPIK7ECK5ASK6ODKLVUXQXSW/action/citation_signature","submit_replication":"https://pith.science/pith/YAIPIK7ECK5ASK6ODKLVUXQXSW/action/replication_record"}},"created_at":"2026-07-05T03:32:36.914820+00:00","updated_at":"2026-07-05T03:32:36.914820+00:00"}