{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5X2ZM5GZLGRHRCMYF5W5PJCNEC","short_pith_number":"pith:5X2ZM5GZ","schema_version":"1.0","canonical_sha256":"edf59674d959a27889982f6dd7a44d209b7074cb1bf508f1fa1cae0cea964431","source":{"kind":"arxiv","id":"1712.04542","version":2},"attestation_state":"computed","paper":{"title":"Learning Sparse Graphs for Prediction and Filtering of Multivariate Data Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Arun Venkitaraman, Dave Zachariah","submitted_at":"2017-12-12T21:39:18Z","abstract_excerpt":"We address the problem of prediction of multivariate data process using an underlying graph model. We develop a method that learns a sparse partial correlation graph in a tuning-free and computationally efficient manner. Specifically, the graph structure is learned recursively without the need for cross-validation or parameter tuning by building upon a hyperparameter-free framework. Our approach does not require the graph to be undirected and also accommodates varying noise levels across different nodes.Experiments using real-world datasets show that the proposed method offers significant perf"},"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":"1712.04542","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-12T21:39:18Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"83d46ee6ae84ad3a204712d309e35866ad8d4c99755187ad6461d1b8255b9216","abstract_canon_sha256":"66ce537d36c5d3e583f1c93157247edab4adf58ae4ac0f4da3ccbca304393c06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:35.365679Z","signature_b64":"z+VFKehfxcEC0dbMvw3HNffDci51AFWW8H3shj5MUzWqgfwxqdzb9/nVbGLV0sDQSYj9TEihyzztGou6Gsa5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edf59674d959a27889982f6dd7a44d209b7074cb1bf508f1fa1cae0cea964431","last_reissued_at":"2026-05-18T00:00:35.365091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:35.365091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Sparse Graphs for Prediction and Filtering of Multivariate Data Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Arun Venkitaraman, Dave Zachariah","submitted_at":"2017-12-12T21:39:18Z","abstract_excerpt":"We address the problem of prediction of multivariate data process using an underlying graph model. We develop a method that learns a sparse partial correlation graph in a tuning-free and computationally efficient manner. Specifically, the graph structure is learned recursively without the need for cross-validation or parameter tuning by building upon a hyperparameter-free framework. Our approach does not require the graph to be undirected and also accommodates varying noise levels across different nodes.Experiments using real-world datasets show that the proposed method offers significant perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04542","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.04542","created_at":"2026-05-18T00:00:35.365171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04542v2","created_at":"2026-05-18T00:00:35.365171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04542","created_at":"2026-05-18T00:00:35.365171+00:00"},{"alias_kind":"pith_short_12","alias_value":"5X2ZM5GZLGRH","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"5X2ZM5GZLGRHRCMY","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"5X2ZM5GZ","created_at":"2026-05-18T12:31:03.183658+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/5X2ZM5GZLGRHRCMYF5W5PJCNEC","json":"https://pith.science/pith/5X2ZM5GZLGRHRCMYF5W5PJCNEC.json","graph_json":"https://pith.science/api/pith-number/5X2ZM5GZLGRHRCMYF5W5PJCNEC/graph.json","events_json":"https://pith.science/api/pith-number/5X2ZM5GZLGRHRCMYF5W5PJCNEC/events.json","paper":"https://pith.science/paper/5X2ZM5GZ"},"agent_actions":{"view_html":"https://pith.science/pith/5X2ZM5GZLGRHRCMYF5W5PJCNEC","download_json":"https://pith.science/pith/5X2ZM5GZLGRHRCMYF5W5PJCNEC.json","view_paper":"https://pith.science/paper/5X2ZM5GZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04542&json=true","fetch_graph":"https://pith.science/api/pith-number/5X2ZM5GZLGRHRCMYF5W5PJCNEC/graph.json","fetch_events":"https://pith.science/api/pith-number/5X2ZM5GZLGRHRCMYF5W5PJCNEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5X2ZM5GZLGRHRCMYF5W5PJCNEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5X2ZM5GZLGRHRCMYF5W5PJCNEC/action/storage_attestation","attest_author":"https://pith.science/pith/5X2ZM5GZLGRHRCMYF5W5PJCNEC/action/author_attestation","sign_citation":"https://pith.science/pith/5X2ZM5GZLGRHRCMYF5W5PJCNEC/action/citation_signature","submit_replication":"https://pith.science/pith/5X2ZM5GZLGRHRCMYF5W5PJCNEC/action/replication_record"}},"created_at":"2026-05-18T00:00:35.365171+00:00","updated_at":"2026-05-18T00:00:35.365171+00:00"}