{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LCBD3LX4R6XYOK26FFJMABHZ6H","short_pith_number":"pith:LCBD3LX4","canonical_record":{"source":{"id":"2501.04889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-09T00:05:31Z","cross_cats_sorted":[],"title_canon_sha256":"768b90a5867991aa3e9ec3c816fb717110b21df97ffb6dc208a482d1ddf6ac07","abstract_canon_sha256":"3b36a2096d30169ba347623e14b8ce5ac9fad07abea4a694bca206454eb63aa8"},"schema_version":"1.0"},"canonical_sha256":"58823daefc8faf872b5e2952c004f9f1db4ce2a28e6078ef6db60e59957e3032","source":{"kind":"arxiv","id":"2501.04889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04889","created_at":"2026-07-05T09:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04889v1","created_at":"2026-07-05T09:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04889","created_at":"2026-07-05T09:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"LCBD3LX4R6XY","created_at":"2026-07-05T09:58:48Z"},{"alias_kind":"pith_short_16","alias_value":"LCBD3LX4R6XYOK26","created_at":"2026-07-05T09:58:48Z"},{"alias_kind":"pith_short_8","alias_value":"LCBD3LX4","created_at":"2026-07-05T09:58:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LCBD3LX4R6XYOK26FFJMABHZ6H","target":"record","payload":{"canonical_record":{"source":{"id":"2501.04889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-09T00:05:31Z","cross_cats_sorted":[],"title_canon_sha256":"768b90a5867991aa3e9ec3c816fb717110b21df97ffb6dc208a482d1ddf6ac07","abstract_canon_sha256":"3b36a2096d30169ba347623e14b8ce5ac9fad07abea4a694bca206454eb63aa8"},"schema_version":"1.0"},"canonical_sha256":"58823daefc8faf872b5e2952c004f9f1db4ce2a28e6078ef6db60e59957e3032","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:48.024021Z","signature_b64":"DvsqwB5XbpvTzlJ7+JODDDmFP380Vaks1wK3JWyjkQdJFqG58okYkXXZzNixOMcJ61BV9ho9PYfWVubTRRc4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58823daefc8faf872b5e2952c004f9f1db4ce2a28e6078ef6db60e59957e3032","last_reissued_at":"2026-07-05T09:58:48.023653Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:48.023653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.04889","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-05T09:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGvRQR3gh66JAArKHsv1gbPtL/0FqPteSBX4ripkYThVhnIHpOw5S9jLMo6TZGc8Yd5CZVFD8eTaOAVgKL3qBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:08:26.682139Z"},"content_sha256":"1cce6d0392522808b8e51d7e08ab6f35f5ff1095ecbd68d16764c8b95aed6807","schema_version":"1.0","event_id":"sha256:1cce6d0392522808b8e51d7e08ab6f35f5ff1095ecbd68d16764c8b95aed6807"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LCBD3LX4R6XYOK26FFJMABHZ6H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hung M. Phan, Lindon Roberts, Minh N. Dao","submitted_at":"2025-01-09T00:05:31Z","abstract_excerpt":"We consider trust-region methods for solving optimization problems where the objective is the sum of a smooth, nonconvex function and a nonsmooth, convex regularizer. We extend the global convergence theory of such methods to include worst-case complexity bounds in the case of unbounded model Hessian growth, and introduce a new, simple nonsmooth trust-region subproblem solver based on combining several iterations of proximal gradient descent with a single projection into the trust region, which meets the sufficient descent requirements for algorithm convergence and has promising numerical resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04889","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/2501.04889/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-05T09:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2EZMUVb/z0K9OOiSQKONUKIHw8o7TKQ3zeSJPNGNr/8Z9SJyPhd063PjBT4a/+reQnOr5wvX310J0KPauKQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:08:26.683130Z"},"content_sha256":"6757076a985613305d15789345713a8695ea45838478af2fac26f53302a37ef2","schema_version":"1.0","event_id":"sha256:6757076a985613305d15789345713a8695ea45838478af2fac26f53302a37ef2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCBD3LX4R6XYOK26FFJMABHZ6H/bundle.json","state_url":"https://pith.science/pith/LCBD3LX4R6XYOK26FFJMABHZ6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCBD3LX4R6XYOK26FFJMABHZ6H/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-11T13:08:26Z","links":{"resolver":"https://pith.science/pith/LCBD3LX4R6XYOK26FFJMABHZ6H","bundle":"https://pith.science/pith/LCBD3LX4R6XYOK26FFJMABHZ6H/bundle.json","state":"https://pith.science/pith/LCBD3LX4R6XYOK26FFJMABHZ6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCBD3LX4R6XYOK26FFJMABHZ6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LCBD3LX4R6XYOK26FFJMABHZ6H","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":"3b36a2096d30169ba347623e14b8ce5ac9fad07abea4a694bca206454eb63aa8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-09T00:05:31Z","title_canon_sha256":"768b90a5867991aa3e9ec3c816fb717110b21df97ffb6dc208a482d1ddf6ac07"},"schema_version":"1.0","source":{"id":"2501.04889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04889","created_at":"2026-07-05T09:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04889v1","created_at":"2026-07-05T09:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04889","created_at":"2026-07-05T09:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"LCBD3LX4R6XY","created_at":"2026-07-05T09:58:48Z"},{"alias_kind":"pith_short_16","alias_value":"LCBD3LX4R6XYOK26","created_at":"2026-07-05T09:58:48Z"},{"alias_kind":"pith_short_8","alias_value":"LCBD3LX4","created_at":"2026-07-05T09:58:48Z"}],"graph_snapshots":[{"event_id":"sha256:6757076a985613305d15789345713a8695ea45838478af2fac26f53302a37ef2","target":"graph","created_at":"2026-07-05T09:58:48Z","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/2501.04889/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider trust-region methods for solving optimization problems where the objective is the sum of a smooth, nonconvex function and a nonsmooth, convex regularizer. We extend the global convergence theory of such methods to include worst-case complexity bounds in the case of unbounded model Hessian growth, and introduce a new, simple nonsmooth trust-region subproblem solver based on combining several iterations of proximal gradient descent with a single projection into the trust region, which meets the sufficient descent requirements for algorithm convergence and has promising numerical resu","authors_text":"Hung M. Phan, Lindon Roberts, Minh N. Dao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04889","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:1cce6d0392522808b8e51d7e08ab6f35f5ff1095ecbd68d16764c8b95aed6807","target":"record","created_at":"2026-07-05T09:58:48Z","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":"3b36a2096d30169ba347623e14b8ce5ac9fad07abea4a694bca206454eb63aa8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-09T00:05:31Z","title_canon_sha256":"768b90a5867991aa3e9ec3c816fb717110b21df97ffb6dc208a482d1ddf6ac07"},"schema_version":"1.0","source":{"id":"2501.04889","kind":"arxiv","version":1}},"canonical_sha256":"58823daefc8faf872b5e2952c004f9f1db4ce2a28e6078ef6db60e59957e3032","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58823daefc8faf872b5e2952c004f9f1db4ce2a28e6078ef6db60e59957e3032","first_computed_at":"2026-07-05T09:58:48.023653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:58:48.023653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DvsqwB5XbpvTzlJ7+JODDDmFP380Vaks1wK3JWyjkQdJFqG58okYkXXZzNixOMcJ61BV9ho9PYfWVubTRRc4Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:58:48.024021Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.04889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cce6d0392522808b8e51d7e08ab6f35f5ff1095ecbd68d16764c8b95aed6807","sha256:6757076a985613305d15789345713a8695ea45838478af2fac26f53302a37ef2"],"state_sha256":"efe9e641c244af14e3c1a6829e955e82ad0323102e2ba18c996e51d13f8f90ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOgraIttZ8v3RgnY+tpaMdaEmDPQxlSGSMNM0kuCPOEkdi0k2B5pXJuUZtA1mYiz9lrk18efuoTU9pH/VrlXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T13:08:26.690794Z","bundle_sha256":"04d3ce0e892b7c26bcd6d42421986add4f96cbfb5e936a95c63e3353980883e1"}}