{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TDFHYAP4WUSOIGARQRQP6E5EDU","short_pith_number":"pith:TDFHYAP4","canonical_record":{"source":{"id":"2001.03322","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-10T06:23:13Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"d66a0cc259587d562ff6b35ef0a9b6dbb67ec53caf1fbc542bc64a9cc69d89f9","abstract_canon_sha256":"16a4b16a4d6c844ae0cd8a7060785171f9a1649a0638b3bdb8e5fa8410605e36"},"schema_version":"1.0"},"canonical_sha256":"98ca7c01fcb524e418118460ff13a41d26f42c35ab552b1b12169621e4db9ac7","source":{"kind":"arxiv","id":"2001.03322","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.03322","created_at":"2026-07-05T01:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"2001.03322v3","created_at":"2026-07-05T01:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.03322","created_at":"2026-07-05T01:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"TDFHYAP4WUSO","created_at":"2026-07-05T01:43:38Z"},{"alias_kind":"pith_short_16","alias_value":"TDFHYAP4WUSOIGAR","created_at":"2026-07-05T01:43:38Z"},{"alias_kind":"pith_short_8","alias_value":"TDFHYAP4","created_at":"2026-07-05T01:43:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TDFHYAP4WUSOIGARQRQP6E5EDU","target":"record","payload":{"canonical_record":{"source":{"id":"2001.03322","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-10T06:23:13Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"d66a0cc259587d562ff6b35ef0a9b6dbb67ec53caf1fbc542bc64a9cc69d89f9","abstract_canon_sha256":"16a4b16a4d6c844ae0cd8a7060785171f9a1649a0638b3bdb8e5fa8410605e36"},"schema_version":"1.0"},"canonical_sha256":"98ca7c01fcb524e418118460ff13a41d26f42c35ab552b1b12169621e4db9ac7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:38.922070Z","signature_b64":"RYR/TFEWgGQtm93HHBCsuhiCOadObDvG6+CVwvygtfe334HY2WqqxDwxKDD5SS6C3Q6/TP/95+YrJcP/Yi1QAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98ca7c01fcb524e418118460ff13a41d26f42c35ab552b1b12169621e4db9ac7","last_reissued_at":"2026-07-05T01:43:38.921570Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:38.921570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.03322","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-05T01:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5dPGucVQ61Sc7RC4GNkbH6YMMgo3MLjt04eCmN7gEV71mkZDaXYT70HYMSX6LjErQFvJEV7BVDLjZrboGVyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T16:00:03.300775Z"},"content_sha256":"dd7cce6215e3a1020b467e6f9a518d36a7ac24a2b700aa2b79423aa68ddf6ee0","schema_version":"1.0","event_id":"sha256:dd7cce6215e3a1020b467e6f9a518d36a7ac24a2b700aa2b79423aa68ddf6ee0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TDFHYAP4WUSOIGARQRQP6E5EDU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A first-order optimization algorithm for statistical learning with hierarchical sparsity structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Dewei Zhang, Sam Davanloo Tajbakhsh, Yin Liu","submitted_at":"2020-01-10T06:23:13Z","abstract_excerpt":"In many statistical learning problems, it is desired that the optimal solution conforms to an a priori known sparsity structure represented by a directed acyclic graph. Inducing such structures by means of convex regularizers requires nonsmooth penalty functions that exploit group overlapping. Our study focuses on evaluating the proximal operator of the Latent Overlapping Group lasso developed by Jacob et al. (2009). We implemented an Alternating Direction Method of Multiplier with a sharing scheme to solve large-scale instances of the underlying optimization problem efficiently. In the absenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.03322","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/2001.03322/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-05T01:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bvpSGGH7iZ1F88DFztfLEQdXejlZ9vzkC+f79HWNDF5XbyrDSyjWCDgj90A+kQvACfEsK8aJwHNgvqmiiKiKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T16:00:03.301143Z"},"content_sha256":"2fe767f0d58490b6ecf71d01fd7b9c51d71a6d292a4562e39a03ba1aa3bd21be","schema_version":"1.0","event_id":"sha256:2fe767f0d58490b6ecf71d01fd7b9c51d71a6d292a4562e39a03ba1aa3bd21be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TDFHYAP4WUSOIGARQRQP6E5EDU/bundle.json","state_url":"https://pith.science/pith/TDFHYAP4WUSOIGARQRQP6E5EDU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TDFHYAP4WUSOIGARQRQP6E5EDU/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-07-05T16:00:03Z","links":{"resolver":"https://pith.science/pith/TDFHYAP4WUSOIGARQRQP6E5EDU","bundle":"https://pith.science/pith/TDFHYAP4WUSOIGARQRQP6E5EDU/bundle.json","state":"https://pith.science/pith/TDFHYAP4WUSOIGARQRQP6E5EDU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TDFHYAP4WUSOIGARQRQP6E5EDU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TDFHYAP4WUSOIGARQRQP6E5EDU","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":"16a4b16a4d6c844ae0cd8a7060785171f9a1649a0638b3bdb8e5fa8410605e36","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-10T06:23:13Z","title_canon_sha256":"d66a0cc259587d562ff6b35ef0a9b6dbb67ec53caf1fbc542bc64a9cc69d89f9"},"schema_version":"1.0","source":{"id":"2001.03322","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.03322","created_at":"2026-07-05T01:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"2001.03322v3","created_at":"2026-07-05T01:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.03322","created_at":"2026-07-05T01:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"TDFHYAP4WUSO","created_at":"2026-07-05T01:43:38Z"},{"alias_kind":"pith_short_16","alias_value":"TDFHYAP4WUSOIGAR","created_at":"2026-07-05T01:43:38Z"},{"alias_kind":"pith_short_8","alias_value":"TDFHYAP4","created_at":"2026-07-05T01:43:38Z"}],"graph_snapshots":[{"event_id":"sha256:2fe767f0d58490b6ecf71d01fd7b9c51d71a6d292a4562e39a03ba1aa3bd21be","target":"graph","created_at":"2026-07-05T01:43:38Z","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/2001.03322/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In many statistical learning problems, it is desired that the optimal solution conforms to an a priori known sparsity structure represented by a directed acyclic graph. Inducing such structures by means of convex regularizers requires nonsmooth penalty functions that exploit group overlapping. Our study focuses on evaluating the proximal operator of the Latent Overlapping Group lasso developed by Jacob et al. (2009). We implemented an Alternating Direction Method of Multiplier with a sharing scheme to solve large-scale instances of the underlying optimization problem efficiently. In the absenc","authors_text":"Dewei Zhang, Sam Davanloo Tajbakhsh, Yin Liu","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-10T06:23:13Z","title":"A first-order optimization algorithm for statistical learning with hierarchical sparsity structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.03322","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:dd7cce6215e3a1020b467e6f9a518d36a7ac24a2b700aa2b79423aa68ddf6ee0","target":"record","created_at":"2026-07-05T01:43:38Z","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":"16a4b16a4d6c844ae0cd8a7060785171f9a1649a0638b3bdb8e5fa8410605e36","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-10T06:23:13Z","title_canon_sha256":"d66a0cc259587d562ff6b35ef0a9b6dbb67ec53caf1fbc542bc64a9cc69d89f9"},"schema_version":"1.0","source":{"id":"2001.03322","kind":"arxiv","version":3}},"canonical_sha256":"98ca7c01fcb524e418118460ff13a41d26f42c35ab552b1b12169621e4db9ac7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98ca7c01fcb524e418118460ff13a41d26f42c35ab552b1b12169621e4db9ac7","first_computed_at":"2026-07-05T01:43:38.921570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:43:38.921570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RYR/TFEWgGQtm93HHBCsuhiCOadObDvG6+CVwvygtfe334HY2WqqxDwxKDD5SS6C3Q6/TP/95+YrJcP/Yi1QAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:43:38.922070Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.03322","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd7cce6215e3a1020b467e6f9a518d36a7ac24a2b700aa2b79423aa68ddf6ee0","sha256:2fe767f0d58490b6ecf71d01fd7b9c51d71a6d292a4562e39a03ba1aa3bd21be"],"state_sha256":"a77bba9cb7d132ef94484fb4e46e31b30bfee3b8d248c29d1b1f594896b78ffd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlziYvP2x8UArP6h8hdbFGHPS670edVaQubpx+NBaTkaV7NJPfOqVUzv7XG9NiLyoPqWmjrOZFLtKGmjz8EfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T16:00:03.303203Z","bundle_sha256":"4a9107f3a911ab5e0560987ae196bbbc92b8067c40111a4f0aa4669d26330655"}}