{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HWB25IMUYBAMIS2FFKUBYCPR2V","short_pith_number":"pith:HWB25IMU","canonical_record":{"source":{"id":"2205.11610","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-23T20:20:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9276187ec06890a9e029827b63b07249073dc8ad72b140ec53c2e3b960177992","abstract_canon_sha256":"ee6696188801e5a573c115c6f04d3d97b94ffd13a402582767a06a35624e6db1"},"schema_version":"1.0"},"canonical_sha256":"3d83aea194c040c44b452aa81c09f1d56a7bbee5303d5decdbf25216c3a74f8e","source":{"kind":"arxiv","id":"2205.11610","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.11610","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"2205.11610v2","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11610","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"HWB25IMUYBAM","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"HWB25IMUYBAMIS2F","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"HWB25IMU","created_at":"2026-07-05T05:05:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HWB25IMUYBAMIS2FFKUBYCPR2V","target":"record","payload":{"canonical_record":{"source":{"id":"2205.11610","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-23T20:20:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9276187ec06890a9e029827b63b07249073dc8ad72b140ec53c2e3b960177992","abstract_canon_sha256":"ee6696188801e5a573c115c6f04d3d97b94ffd13a402582767a06a35624e6db1"},"schema_version":"1.0"},"canonical_sha256":"3d83aea194c040c44b452aa81c09f1d56a7bbee5303d5decdbf25216c3a74f8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:05:47.593058Z","signature_b64":"XCgB0cx1yxmklgZ3sUOGIIkESHuX4G/izGVG1VexpluMZdUocjhhP/uJTe2rIEhduA0+TU+LSBbpVmV5Ks3uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d83aea194c040c44b452aa81c09f1d56a7bbee5303d5decdbf25216c3a74f8e","last_reissued_at":"2026-07-05T05:05:47.592564Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:05:47.592564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.11610","source_version":2,"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-07-05T05:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4JhYFwDIkO75+xxOot02mexTlwHFGT02iLXQrOs97e8hMxuwI/YJpsTm4hUSZUSpF9S0rZQKYKPqst/lrHO8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:12:12.659775Z"},"content_sha256":"3c033aa4631000dc256ade3a3850c9901df8ef20ef13b3374868a59633ed669e","schema_version":"1.0","event_id":"sha256:3c033aa4631000dc256ade3a3850c9901df8ef20ef13b3374868a59633ed669e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HWB25IMUYBAMIS2FFKUBYCPR2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"uGLAD: Sparse graph recovery by optimizing deep unrolled networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Harsh Shrivastava, Robin Abraham, Urszula Chajewska, Xinshi Chen","submitted_at":"2022-05-23T20:20:27Z","abstract_excerpt":"Probabilistic Graphical Models (PGMs) are generative models of complex systems. They rely on conditional independence assumptions between variables to learn sparse representations which can be visualized in a form of a graph. Such models are used for domain exploration and structure discovery in poorly understood domains. This work introduces a novel technique to perform sparse graph recovery by optimizing deep unrolled networks. Assuming that the input data $X\\in\\mathbb{R}^{M\\times D}$ comes from an underlying multivariate Gaussian distribution, we apply a deep model on $X$ that outputs the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11610","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.11610/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"},"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-07-05T05:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0jnGrvtkmp2WdvS294bYA71uBS//OMBCMY29/ZpLmqUzrSBcLjYPoBHBKMJMqKKJVGXkLwk+oFkfMUSw0ZbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:12:12.662267Z"},"content_sha256":"f743469482f2f2633012ed2a22c34b0d5f8c4b310b1398ec9e26d12a230b02cb","schema_version":"1.0","event_id":"sha256:f743469482f2f2633012ed2a22c34b0d5f8c4b310b1398ec9e26d12a230b02cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWB25IMUYBAMIS2FFKUBYCPR2V/bundle.json","state_url":"https://pith.science/pith/HWB25IMUYBAMIS2FFKUBYCPR2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWB25IMUYBAMIS2FFKUBYCPR2V/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-08-15T13:12:12Z","links":{"resolver":"https://pith.science/pith/HWB25IMUYBAMIS2FFKUBYCPR2V","bundle":"https://pith.science/pith/HWB25IMUYBAMIS2FFKUBYCPR2V/bundle.json","state":"https://pith.science/pith/HWB25IMUYBAMIS2FFKUBYCPR2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWB25IMUYBAMIS2FFKUBYCPR2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HWB25IMUYBAMIS2FFKUBYCPR2V","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":"ee6696188801e5a573c115c6f04d3d97b94ffd13a402582767a06a35624e6db1","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-23T20:20:27Z","title_canon_sha256":"9276187ec06890a9e029827b63b07249073dc8ad72b140ec53c2e3b960177992"},"schema_version":"1.0","source":{"id":"2205.11610","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.11610","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"2205.11610v2","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11610","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"HWB25IMUYBAM","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"HWB25IMUYBAMIS2F","created_at":"2026-07-05T05:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"HWB25IMU","created_at":"2026-07-05T05:05:47Z"}],"graph_snapshots":[{"event_id":"sha256:f743469482f2f2633012ed2a22c34b0d5f8c4b310b1398ec9e26d12a230b02cb","target":"graph","created_at":"2026-07-05T05:05:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.11610/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Probabilistic Graphical Models (PGMs) are generative models of complex systems. They rely on conditional independence assumptions between variables to learn sparse representations which can be visualized in a form of a graph. Such models are used for domain exploration and structure discovery in poorly understood domains. This work introduces a novel technique to perform sparse graph recovery by optimizing deep unrolled networks. Assuming that the input data $X\\in\\mathbb{R}^{M\\times D}$ comes from an underlying multivariate Gaussian distribution, we apply a deep model on $X$ that outputs the p","authors_text":"Harsh Shrivastava, Robin Abraham, Urszula Chajewska, Xinshi Chen","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-23T20:20:27Z","title":"uGLAD: Sparse graph recovery by optimizing deep unrolled networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11610","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:3c033aa4631000dc256ade3a3850c9901df8ef20ef13b3374868a59633ed669e","target":"record","created_at":"2026-07-05T05:05:47Z","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":"ee6696188801e5a573c115c6f04d3d97b94ffd13a402582767a06a35624e6db1","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-23T20:20:27Z","title_canon_sha256":"9276187ec06890a9e029827b63b07249073dc8ad72b140ec53c2e3b960177992"},"schema_version":"1.0","source":{"id":"2205.11610","kind":"arxiv","version":2}},"canonical_sha256":"3d83aea194c040c44b452aa81c09f1d56a7bbee5303d5decdbf25216c3a74f8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d83aea194c040c44b452aa81c09f1d56a7bbee5303d5decdbf25216c3a74f8e","first_computed_at":"2026-07-05T05:05:47.592564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:05:47.592564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XCgB0cx1yxmklgZ3sUOGIIkESHuX4G/izGVG1VexpluMZdUocjhhP/uJTe2rIEhduA0+TU+LSBbpVmV5Ks3uDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:05:47.593058Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.11610","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c033aa4631000dc256ade3a3850c9901df8ef20ef13b3374868a59633ed669e","sha256:f743469482f2f2633012ed2a22c34b0d5f8c4b310b1398ec9e26d12a230b02cb"],"state_sha256":"426bdbee31474f4a6220351431b0379d779712a93abaf96700341cb8bcefb29e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WgbBgNLYSEkLY3SKuoXJ+krRXUztrQhmLDAi1DMMGQaO7TG33VxaxIgP0is38/kol9HnF3Hz8FP6j8BMTurYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T13:12:12.684019Z","bundle_sha256":"780bbe490d157c9a441f0563ad293ac71caf41168b448c8f624c04397cf663c8"}}