{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5X2ZM5GZLGRHRCMYF5W5PJCNEC","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":"66ce537d36c5d3e583f1c93157247edab4adf58ae4ac0f4da3ccbca304393c06","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-12T21:39:18Z","title_canon_sha256":"83d46ee6ae84ad3a204712d309e35866ad8d4c99755187ad6461d1b8255b9216"},"schema_version":"1.0","source":{"id":"1712.04542","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04542","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04542v2","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04542","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"5X2ZM5GZLGRH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5X2ZM5GZLGRHRCMY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5X2ZM5GZ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:511cfaab8544c9eb54dfcfb22692d991fc1172199914f6e781b3f7d4d1bb5a7a","target":"graph","created_at":"2026-05-18T00:00:35Z","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 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","authors_text":"Arun Venkitaraman, Dave Zachariah","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-12T21:39:18Z","title":"Learning Sparse Graphs for Prediction and Filtering of Multivariate Data Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04542","kind":"arxiv","version":2},"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:7d3c9aecab34cc8c4d7e93d0865b17184bb3573ba6ca6d5f85a442f8fb5b6bfa","target":"record","created_at":"2026-05-18T00:00:35Z","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":"66ce537d36c5d3e583f1c93157247edab4adf58ae4ac0f4da3ccbca304393c06","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-12T21:39:18Z","title_canon_sha256":"83d46ee6ae84ad3a204712d309e35866ad8d4c99755187ad6461d1b8255b9216"},"schema_version":"1.0","source":{"id":"1712.04542","kind":"arxiv","version":2}},"canonical_sha256":"edf59674d959a27889982f6dd7a44d209b7074cb1bf508f1fa1cae0cea964431","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edf59674d959a27889982f6dd7a44d209b7074cb1bf508f1fa1cae0cea964431","first_computed_at":"2026-05-18T00:00:35.365091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:35.365091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z+VFKehfxcEC0dbMvw3HNffDci51AFWW8H3shj5MUzWqgfwxqdzb9/nVbGLV0sDQSYj9TEihyzztGou6Gsa5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:35.365679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04542","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d3c9aecab34cc8c4d7e93d0865b17184bb3573ba6ca6d5f85a442f8fb5b6bfa","sha256:511cfaab8544c9eb54dfcfb22692d991fc1172199914f6e781b3f7d4d1bb5a7a"],"state_sha256":"d1d53f56623e1441c3ea3bd8bed2e8c4b5658efcc471e1b015b7a2ff3f47ebb5"}