{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AYUXIGKF3SCB4PZIQZ5IHLQGYP","short_pith_number":"pith:AYUXIGKF","canonical_record":{"source":{"id":"2402.18423","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-28T15:44:33Z","cross_cats_sorted":[],"title_canon_sha256":"784fc69c2ac1be599650a5bde4b4bff93420716102e0a1fa41ec42785230eae0","abstract_canon_sha256":"878122029f021e76383dfaac2fabcc7e9337760a4f1c4d00c69e5566664f3900"},"schema_version":"1.0"},"canonical_sha256":"0629741945dc841e3f28867a83ae06c3f2b95e98c6ac6741ccdfa6e3f9671401","source":{"kind":"arxiv","id":"2402.18423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.18423","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"arxiv_version","alias_value":"2402.18423v1","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18423","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_12","alias_value":"AYUXIGKF3SCB","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_16","alias_value":"AYUXIGKF3SCB4PZI","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_8","alias_value":"AYUXIGKF","created_at":"2026-07-05T07:50:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AYUXIGKF3SCB4PZIQZ5IHLQGYP","target":"record","payload":{"canonical_record":{"source":{"id":"2402.18423","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-28T15:44:33Z","cross_cats_sorted":[],"title_canon_sha256":"784fc69c2ac1be599650a5bde4b4bff93420716102e0a1fa41ec42785230eae0","abstract_canon_sha256":"878122029f021e76383dfaac2fabcc7e9337760a4f1c4d00c69e5566664f3900"},"schema_version":"1.0"},"canonical_sha256":"0629741945dc841e3f28867a83ae06c3f2b95e98c6ac6741ccdfa6e3f9671401","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:16.079761Z","signature_b64":"kxuplczOxzFonkDhP6LXnKiwUW1oWBWc1Vn/WBof7h6GYgRWvkgUk7DWoTj/DbBTaJRQZnyKS8KJvw2PUP6qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0629741945dc841e3f28867a83ae06c3f2b95e98c6ac6741ccdfa6e3f9671401","last_reissued_at":"2026-07-05T07:50:16.079204Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:16.079204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.18423","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-05T07:50:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2SeZhZlvHmxTREn/MBs3GH30RTInrGd9rhC/JmCaXdu8hOV9FEODPKK0mUdJy2CgtsCmtuMR82WX9dvaEDyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:44:19.748332Z"},"content_sha256":"d1376b6f5cfa90ac10d8a29c78f1536c47ab884adfdbf1a2a64e68c065035ece","schema_version":"1.0","event_id":"sha256:d1376b6f5cfa90ac10d8a29c78f1536c47ab884adfdbf1a2a64e68c065035ece"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AYUXIGKF3SCB4PZIQZ5IHLQGYP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An interior-point trust-region method for nonsmooth regularized bound-constrained optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dominique Orban, Geoffroy Leconte","submitted_at":"2024-02-28T15:44:33Z","abstract_excerpt":"We develop an interior-point method for nonsmooth regularized bound-constrained optimization problems. Our method consists of iteratively solving a sequence of unconstrained nonsmooth barrier subproblems. We use a variant of the proximal quasi-Newton trust-region algorithm TR of arXiv:2103.15993v3 to solve the barrier subproblems, with additional assumptions inspired from well-known smooth interior-point trust-region methods. We show global convergence of our algorithm with respect to the criticality measure of arXiv:2103.15993v3. Under an additional assumption linked to the convexity of the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.18423","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/2402.18423/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-05T07:50:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h3gyPKLXQvdOFFD01bE6cUWtAIwHrxBaAUOndIkVwNSeyVFWPprEgV4NjNBOiR7v+y3EI23zSjwUG3Plsb3EDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:44:19.748841Z"},"content_sha256":"fe64b7619b8ea50477c95f25d319ff0d8ff546c3c11796817096b09779522d95","schema_version":"1.0","event_id":"sha256:fe64b7619b8ea50477c95f25d319ff0d8ff546c3c11796817096b09779522d95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP/bundle.json","state_url":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP/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-19T20:44:19Z","links":{"resolver":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP","bundle":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP/bundle.json","state":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AYUXIGKF3SCB4PZIQZ5IHLQGYP","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":"878122029f021e76383dfaac2fabcc7e9337760a4f1c4d00c69e5566664f3900","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-28T15:44:33Z","title_canon_sha256":"784fc69c2ac1be599650a5bde4b4bff93420716102e0a1fa41ec42785230eae0"},"schema_version":"1.0","source":{"id":"2402.18423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.18423","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"arxiv_version","alias_value":"2402.18423v1","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18423","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_12","alias_value":"AYUXIGKF3SCB","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_16","alias_value":"AYUXIGKF3SCB4PZI","created_at":"2026-07-05T07:50:16Z"},{"alias_kind":"pith_short_8","alias_value":"AYUXIGKF","created_at":"2026-07-05T07:50:16Z"}],"graph_snapshots":[{"event_id":"sha256:fe64b7619b8ea50477c95f25d319ff0d8ff546c3c11796817096b09779522d95","target":"graph","created_at":"2026-07-05T07:50:16Z","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/2402.18423/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop an interior-point method for nonsmooth regularized bound-constrained optimization problems. Our method consists of iteratively solving a sequence of unconstrained nonsmooth barrier subproblems. We use a variant of the proximal quasi-Newton trust-region algorithm TR of arXiv:2103.15993v3 to solve the barrier subproblems, with additional assumptions inspired from well-known smooth interior-point trust-region methods. We show global convergence of our algorithm with respect to the criticality measure of arXiv:2103.15993v3. Under an additional assumption linked to the convexity of the n","authors_text":"Dominique Orban, Geoffroy Leconte","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-28T15:44:33Z","title":"An interior-point trust-region method for nonsmooth regularized bound-constrained optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.18423","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:d1376b6f5cfa90ac10d8a29c78f1536c47ab884adfdbf1a2a64e68c065035ece","target":"record","created_at":"2026-07-05T07:50:16Z","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":"878122029f021e76383dfaac2fabcc7e9337760a4f1c4d00c69e5566664f3900","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-28T15:44:33Z","title_canon_sha256":"784fc69c2ac1be599650a5bde4b4bff93420716102e0a1fa41ec42785230eae0"},"schema_version":"1.0","source":{"id":"2402.18423","kind":"arxiv","version":1}},"canonical_sha256":"0629741945dc841e3f28867a83ae06c3f2b95e98c6ac6741ccdfa6e3f9671401","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0629741945dc841e3f28867a83ae06c3f2b95e98c6ac6741ccdfa6e3f9671401","first_computed_at":"2026-07-05T07:50:16.079204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:50:16.079204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kxuplczOxzFonkDhP6LXnKiwUW1oWBWc1Vn/WBof7h6GYgRWvkgUk7DWoTj/DbBTaJRQZnyKS8KJvw2PUP6qAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:50:16.079761Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.18423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1376b6f5cfa90ac10d8a29c78f1536c47ab884adfdbf1a2a64e68c065035ece","sha256:fe64b7619b8ea50477c95f25d319ff0d8ff546c3c11796817096b09779522d95"],"state_sha256":"dfa171a75c06a0a8dac677afed3b1996eb7c3c13f60651c9d7045e1ddcc5b2b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmsKM10da+83iSlK0XbPvWVvyidU4CT2AKMymEofnfSPbUS5Ua0gdgGiWErpfW9g2027FgAuVwFZbnyotIXwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T20:44:19.753945Z","bundle_sha256":"58bbe7f07ae29fbf9732af86a70493475049083964c60fc39339eec56ef73bc1"}}