{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4TVNESVIZQDLVYHL23M4CQJ6WW","short_pith_number":"pith:4TVNESVI","canonical_record":{"source":{"id":"1902.06952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-19T08:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"38f988f7926718c5d858327e8e3260d05fe148ee1519e1549be06c8e68f6b0fb","abstract_canon_sha256":"e23f12554a73947e8ec4dd6e8f46ca82705861b176932c4aa1887f382b765da9"},"schema_version":"1.0"},"canonical_sha256":"e4ead24aa8cc06bae0ebd6d9c1413eb58837b9cdd2972860c07bd384f90451ca","source":{"kind":"arxiv","id":"1902.06952","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06952","created_at":"2026-07-05T02:34:05Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06952v1","created_at":"2026-07-05T02:34:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06952","created_at":"2026-07-05T02:34:05Z"},{"alias_kind":"pith_short_12","alias_value":"4TVNESVIZQDL","created_at":"2026-07-05T02:34:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TVNESVIZQDLVYHL","created_at":"2026-07-05T02:34:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TVNESVI","created_at":"2026-07-05T02:34:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4TVNESVIZQDLVYHL23M4CQJ6WW","target":"record","payload":{"canonical_record":{"source":{"id":"1902.06952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-19T08:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"38f988f7926718c5d858327e8e3260d05fe148ee1519e1549be06c8e68f6b0fb","abstract_canon_sha256":"e23f12554a73947e8ec4dd6e8f46ca82705861b176932c4aa1887f382b765da9"},"schema_version":"1.0"},"canonical_sha256":"e4ead24aa8cc06bae0ebd6d9c1413eb58837b9cdd2972860c07bd384f90451ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:05.515833Z","signature_b64":"dN5KxnaqQMTBAkkiw6JpjIMqWUTsn1n6OunI62QLrqxFPKZNmkpTq9XsPMIr77dbpm4Yuwaiw9s+q8fo64WsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ead24aa8cc06bae0ebd6d9c1413eb58837b9cdd2972860c07bd384f90451ca","last_reissued_at":"2026-07-05T02:34:05.515311Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:05.515311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.06952","source_version":1,"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-05T02:34:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bRLA6weijKvaav5Y4QnEvW4qdkm8JEcjIAKk6/cE2JF7AjhOTiybMUOfOcO6sz4gAToTt7sqmZ1oLDAU99RFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:57:08.729175Z"},"content_sha256":"471547bb8b6aad7a4ad3cad4bafd1ba4762b7d7ed7d82c4e78e75b368b1445c5","schema_version":"1.0","event_id":"sha256:471547bb8b6aad7a4ad3cad4bafd1ba4762b7d7ed7d82c4e78e75b368b1445c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4TVNESVIZQDLVYHL23M4CQJ6WW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Ning Zhang, Yangjing Zhang","submitted_at":"2019-02-19T08:59:38Z","abstract_excerpt":"Nowadays, analysing data from different classes or over a temporal grid has attracted a great deal of interest. As a result, various multiple graphical models for learning a collection of graphical models simultaneously have been derived by introducing sparsity in graphs and similarity across multiple graphs. This paper focuses on the fused multiple graphical Lasso model which encourages not only shared pattern of sparsity, but also shared values of edges across different graphs. For solving this model, we develop an efficient regularized proximal point algorithm, where the subproblem in each "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06952","kind":"arxiv","version":1},"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.06952/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-05T02:34:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMexszJEBFnvgHO+WXdalVP5fjecHdnirH3R8Z6BSfySfLSBNn53DC/OIP12YPTJj9/G4lRnKq2UCPMfQ1IZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:57:08.729686Z"},"content_sha256":"e06204e26825504be85f7d83ed6aa85d2e8c1b73674dfc65fa30672619d43ae0","schema_version":"1.0","event_id":"sha256:e06204e26825504be85f7d83ed6aa85d2e8c1b73674dfc65fa30672619d43ae0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TVNESVIZQDLVYHL23M4CQJ6WW/bundle.json","state_url":"https://pith.science/pith/4TVNESVIZQDLVYHL23M4CQJ6WW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TVNESVIZQDLVYHL23M4CQJ6WW/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-10T17:57:08Z","links":{"resolver":"https://pith.science/pith/4TVNESVIZQDLVYHL23M4CQJ6WW","bundle":"https://pith.science/pith/4TVNESVIZQDLVYHL23M4CQJ6WW/bundle.json","state":"https://pith.science/pith/4TVNESVIZQDLVYHL23M4CQJ6WW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TVNESVIZQDLVYHL23M4CQJ6WW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4TVNESVIZQDLVYHL23M4CQJ6WW","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":"e23f12554a73947e8ec4dd6e8f46ca82705861b176932c4aa1887f382b765da9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-19T08:59:38Z","title_canon_sha256":"38f988f7926718c5d858327e8e3260d05fe148ee1519e1549be06c8e68f6b0fb"},"schema_version":"1.0","source":{"id":"1902.06952","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06952","created_at":"2026-07-05T02:34:05Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06952v1","created_at":"2026-07-05T02:34:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06952","created_at":"2026-07-05T02:34:05Z"},{"alias_kind":"pith_short_12","alias_value":"4TVNESVIZQDL","created_at":"2026-07-05T02:34:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TVNESVIZQDLVYHL","created_at":"2026-07-05T02:34:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TVNESVI","created_at":"2026-07-05T02:34:05Z"}],"graph_snapshots":[{"event_id":"sha256:e06204e26825504be85f7d83ed6aa85d2e8c1b73674dfc65fa30672619d43ae0","target":"graph","created_at":"2026-07-05T02:34:05Z","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/1902.06952/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Nowadays, analysing data from different classes or over a temporal grid has attracted a great deal of interest. As a result, various multiple graphical models for learning a collection of graphical models simultaneously have been derived by introducing sparsity in graphs and similarity across multiple graphs. This paper focuses on the fused multiple graphical Lasso model which encourages not only shared pattern of sparsity, but also shared values of edges across different graphs. For solving this model, we develop an efficient regularized proximal point algorithm, where the subproblem in each ","authors_text":"Defeng Sun, Kim-Chuan Toh, Ning Zhang, Yangjing Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-19T08:59:38Z","title":"An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06952","kind":"arxiv","version":1},"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:471547bb8b6aad7a4ad3cad4bafd1ba4762b7d7ed7d82c4e78e75b368b1445c5","target":"record","created_at":"2026-07-05T02:34:05Z","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":"e23f12554a73947e8ec4dd6e8f46ca82705861b176932c4aa1887f382b765da9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-19T08:59:38Z","title_canon_sha256":"38f988f7926718c5d858327e8e3260d05fe148ee1519e1549be06c8e68f6b0fb"},"schema_version":"1.0","source":{"id":"1902.06952","kind":"arxiv","version":1}},"canonical_sha256":"e4ead24aa8cc06bae0ebd6d9c1413eb58837b9cdd2972860c07bd384f90451ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4ead24aa8cc06bae0ebd6d9c1413eb58837b9cdd2972860c07bd384f90451ca","first_computed_at":"2026-07-05T02:34:05.515311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:34:05.515311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dN5KxnaqQMTBAkkiw6JpjIMqWUTsn1n6OunI62QLrqxFPKZNmkpTq9XsPMIr77dbpm4Yuwaiw9s+q8fo64WsDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:34:05.515833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06952","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:471547bb8b6aad7a4ad3cad4bafd1ba4762b7d7ed7d82c4e78e75b368b1445c5","sha256:e06204e26825504be85f7d83ed6aa85d2e8c1b73674dfc65fa30672619d43ae0"],"state_sha256":"f94feb648a9450cea8d50a7397d296d9a52400fa9885f8485df978c09f14eaeb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cLyqlT6fqbbpt3Pe8xbrizh1m1JCE0qE+xPy3TOeyFeKqCRQnYOnIafOmziVLHGt6S7Eor/xcrKTu9iaq0QACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T17:57:08.734864Z","bundle_sha256":"41fbbc465a58193a870ad580cffee1e8450f88a00c4b012f6e9251dfe738b4c4"}}