{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FFUDIQHWMLNIPQ7K4NIMPJKFCA","short_pith_number":"pith:FFUDIQHW","canonical_record":{"source":{"id":"1906.00271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T18:59:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eff0e3091a0daba91ff49d1b18e6107e0e2787c7425fca8a93c737e7e8da7268","abstract_canon_sha256":"37fdaacf6ac0858f26ac2bdc35f28dd01b7571d8312f2d800c4c2949732d4b59"},"schema_version":"1.0"},"canonical_sha256":"29683440f662da87c3eae350c7a54510027e95d4603d9182259ef88461a23f91","source":{"kind":"arxiv","id":"1906.00271","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00271","created_at":"2026-07-05T00:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00271v3","created_at":"2026-07-05T00:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00271","created_at":"2026-07-05T00:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"FFUDIQHWMLNI","created_at":"2026-07-05T00:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"FFUDIQHWMLNIPQ7K","created_at":"2026-07-05T00:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"FFUDIQHW","created_at":"2026-07-05T00:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FFUDIQHWMLNIPQ7K4NIMPJKFCA","target":"record","payload":{"canonical_record":{"source":{"id":"1906.00271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T18:59:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eff0e3091a0daba91ff49d1b18e6107e0e2787c7425fca8a93c737e7e8da7268","abstract_canon_sha256":"37fdaacf6ac0858f26ac2bdc35f28dd01b7571d8312f2d800c4c2949732d4b59"},"schema_version":"1.0"},"canonical_sha256":"29683440f662da87c3eae350c7a54510027e95d4603d9182259ef88461a23f91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:27:43.662689Z","signature_b64":"/mNUNQOSCrHD6vKyMsZt8imUFPa+UmYW7MspYi/YmZ5etqJu/cUupWuPlXCutzAVP5b5QT2JrkdB1PG8quYxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29683440f662da87c3eae350c7a54510027e95d4603d9182259ef88461a23f91","last_reissued_at":"2026-07-05T00:27:43.662189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:27:43.662189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.00271","source_version":3,"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-05T00:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kE6ZPsgaLjlyTMWwlfWSOMeXnyp56mBcCD0XRhgKOlcPt2ms04Xqa7GLTltBrA1L5rhGl04FMQ3LklhZ/toBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T18:36:39.922194Z"},"content_sha256":"d05e7a07057fa085705bd1400eacdbf8ec03abd59a88620c25ef06e4ff452fc0","schema_version":"1.0","event_id":"sha256:d05e7a07057fa085705bd1400eacdbf8ec03abd59a88620c25ef06e4ff452fc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FFUDIQHWMLNIPQ7K4NIMPJKFCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GLAD: Learning Sparse Graph Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Binghong Chen, Guanghui Lan, Han Liu, Harsh Shrivastava, Le Song, Srinvas Aluru, Xinshi Chen","submitted_at":"2019-06-01T18:59:56Z","abstract_excerpt":"Recovering sparse conditional independence graphs from data is a fundamental problem in machine learning with wide applications. A popular formulation of the problem is an $\\ell_1$ regularized maximum likelihood estimation. Many convex optimization algorithms have been designed to solve this formulation to recover the graph structure. Recently, there is a surge of interest to learn algorithms directly based on data, and in this case, learn to map empirical covariance to the sparse precision matrix. However, it is a challenging task in this case, since the symmetric positive definiteness (SPD) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00271","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/1906.00271/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-05T00:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aj6gGhq3slUtoGLMvE4flX/3c6INl2rOV3dQpX2bQwemeSaUTOUDr7RqLczJT9S7vOYKBRbAoC1qhOdVZwpbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T18:36:39.922758Z"},"content_sha256":"6b01e212adc08ca159fe3eb56a70f9d970d0638440ba06279572df4a148f5d98","schema_version":"1.0","event_id":"sha256:6b01e212adc08ca159fe3eb56a70f9d970d0638440ba06279572df4a148f5d98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFUDIQHWMLNIPQ7K4NIMPJKFCA/bundle.json","state_url":"https://pith.science/pith/FFUDIQHWMLNIPQ7K4NIMPJKFCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFUDIQHWMLNIPQ7K4NIMPJKFCA/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-15T18:36:39Z","links":{"resolver":"https://pith.science/pith/FFUDIQHWMLNIPQ7K4NIMPJKFCA","bundle":"https://pith.science/pith/FFUDIQHWMLNIPQ7K4NIMPJKFCA/bundle.json","state":"https://pith.science/pith/FFUDIQHWMLNIPQ7K4NIMPJKFCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFUDIQHWMLNIPQ7K4NIMPJKFCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FFUDIQHWMLNIPQ7K4NIMPJKFCA","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":"37fdaacf6ac0858f26ac2bdc35f28dd01b7571d8312f2d800c4c2949732d4b59","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T18:59:56Z","title_canon_sha256":"eff0e3091a0daba91ff49d1b18e6107e0e2787c7425fca8a93c737e7e8da7268"},"schema_version":"1.0","source":{"id":"1906.00271","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00271","created_at":"2026-07-05T00:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00271v3","created_at":"2026-07-05T00:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00271","created_at":"2026-07-05T00:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"FFUDIQHWMLNI","created_at":"2026-07-05T00:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"FFUDIQHWMLNIPQ7K","created_at":"2026-07-05T00:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"FFUDIQHW","created_at":"2026-07-05T00:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:6b01e212adc08ca159fe3eb56a70f9d970d0638440ba06279572df4a148f5d98","target":"graph","created_at":"2026-07-05T00:27:43Z","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/1906.00271/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recovering sparse conditional independence graphs from data is a fundamental problem in machine learning with wide applications. A popular formulation of the problem is an $\\ell_1$ regularized maximum likelihood estimation. Many convex optimization algorithms have been designed to solve this formulation to recover the graph structure. Recently, there is a surge of interest to learn algorithms directly based on data, and in this case, learn to map empirical covariance to the sparse precision matrix. However, it is a challenging task in this case, since the symmetric positive definiteness (SPD) ","authors_text":"Binghong Chen, Guanghui Lan, Han Liu, Harsh Shrivastava, Le Song, Srinvas Aluru, Xinshi Chen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T18:59:56Z","title":"GLAD: Learning Sparse Graph Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00271","kind":"arxiv","version":3},"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:d05e7a07057fa085705bd1400eacdbf8ec03abd59a88620c25ef06e4ff452fc0","target":"record","created_at":"2026-07-05T00:27:43Z","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":"37fdaacf6ac0858f26ac2bdc35f28dd01b7571d8312f2d800c4c2949732d4b59","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T18:59:56Z","title_canon_sha256":"eff0e3091a0daba91ff49d1b18e6107e0e2787c7425fca8a93c737e7e8da7268"},"schema_version":"1.0","source":{"id":"1906.00271","kind":"arxiv","version":3}},"canonical_sha256":"29683440f662da87c3eae350c7a54510027e95d4603d9182259ef88461a23f91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29683440f662da87c3eae350c7a54510027e95d4603d9182259ef88461a23f91","first_computed_at":"2026-07-05T00:27:43.662189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:27:43.662189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/mNUNQOSCrHD6vKyMsZt8imUFPa+UmYW7MspYi/YmZ5etqJu/cUupWuPlXCutzAVP5b5QT2JrkdB1PG8quYxDA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:27:43.662689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00271","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d05e7a07057fa085705bd1400eacdbf8ec03abd59a88620c25ef06e4ff452fc0","sha256:6b01e212adc08ca159fe3eb56a70f9d970d0638440ba06279572df4a148f5d98"],"state_sha256":"b8a7a23439c8f9024fc44df3890baecd10a4832fc3efacba445c32a29a3b727d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ow9CPGjMgx/lZyJk86EvuPEFxpGPhbt1C2rwuU7jlIYD4QRdSpn4PNTe+sLaSXyFf2pBZ5VknIL+evJFzEj4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T18:36:39.929224Z","bundle_sha256":"94eedb0b553f4490af454bc432e45ea8e75ec1ede9856dad52f9548d712e5a9f"}}