{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FBOSHM6EQBANKHGRG2JDD24N2D","short_pith_number":"pith:FBOSHM6E","schema_version":"1.0","canonical_sha256":"285d23b3c48040d51cd1369231eb8dd0d3500faf0e9a8089f7377c573b226c02","source":{"kind":"arxiv","id":"2309.08433","version":1},"attestation_state":"computed","paper":{"title":"The Indefinite Proximal Gradient Method","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dominique Orban, Geoffroy Leconte","submitted_at":"2023-09-15T14:32:54Z","abstract_excerpt":"We introduce a variant of the proximal gradient method in which the quadratic term is diagonal but may be indefinite, and is safeguarded by a trust region. Our method is a special case of the proximal quasi-Newton trust-region method of arXiv:2103.15993v3. We provide closed-form solution of the step computation in certain cases where the nonsmooth term is separable and the trust region is defined in infinity norm, so that no iterative subproblem solver is required. Our analysis expands upon that of arXiv:2103.15993v3 by generalizing the trust-region approach to problems with bound constraints."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2309.08433","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2023-09-15T14:32:54Z","cross_cats_sorted":[],"title_canon_sha256":"5ff57f6e5c199e80bb63c529fc396e8c97ea83b9e2f35611ba8961a9310b0f02","abstract_canon_sha256":"73aef5e1e3e60b47451e53d45298d43bfca694ddb3655e315fe71d31cb4323d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:51:06.502078Z","signature_b64":"0028lViTfxBvtZ//UdD+MhfcjJh3BJ68OrbwMrC3io2BY6m5idOZCiMu98IqwLantFe4KHSutg0RebkePqtuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"285d23b3c48040d51cd1369231eb8dd0d3500faf0e9a8089f7377c573b226c02","last_reissued_at":"2026-07-05T06:51:06.501669Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:51:06.501669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Indefinite Proximal Gradient Method","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dominique Orban, Geoffroy Leconte","submitted_at":"2023-09-15T14:32:54Z","abstract_excerpt":"We introduce a variant of the proximal gradient method in which the quadratic term is diagonal but may be indefinite, and is safeguarded by a trust region. Our method is a special case of the proximal quasi-Newton trust-region method of arXiv:2103.15993v3. We provide closed-form solution of the step computation in certain cases where the nonsmooth term is separable and the trust region is defined in infinity norm, so that no iterative subproblem solver is required. Our analysis expands upon that of arXiv:2103.15993v3 by generalizing the trust-region approach to problems with bound constraints."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.08433","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/2309.08433/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.08433","created_at":"2026-07-05T06:51:06.501724+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.08433v1","created_at":"2026-07-05T06:51:06.501724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.08433","created_at":"2026-07-05T06:51:06.501724+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBOSHM6EQBAN","created_at":"2026-07-05T06:51:06.501724+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBOSHM6EQBANKHGR","created_at":"2026-07-05T06:51:06.501724+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBOSHM6E","created_at":"2026-07-05T06:51:06.501724+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04889","citing_title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FBOSHM6EQBANKHGRG2JDD24N2D","json":"https://pith.science/pith/FBOSHM6EQBANKHGRG2JDD24N2D.json","graph_json":"https://pith.science/api/pith-number/FBOSHM6EQBANKHGRG2JDD24N2D/graph.json","events_json":"https://pith.science/api/pith-number/FBOSHM6EQBANKHGRG2JDD24N2D/events.json","paper":"https://pith.science/paper/FBOSHM6E"},"agent_actions":{"view_html":"https://pith.science/pith/FBOSHM6EQBANKHGRG2JDD24N2D","download_json":"https://pith.science/pith/FBOSHM6EQBANKHGRG2JDD24N2D.json","view_paper":"https://pith.science/paper/FBOSHM6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.08433&json=true","fetch_graph":"https://pith.science/api/pith-number/FBOSHM6EQBANKHGRG2JDD24N2D/graph.json","fetch_events":"https://pith.science/api/pith-number/FBOSHM6EQBANKHGRG2JDD24N2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBOSHM6EQBANKHGRG2JDD24N2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBOSHM6EQBANKHGRG2JDD24N2D/action/storage_attestation","attest_author":"https://pith.science/pith/FBOSHM6EQBANKHGRG2JDD24N2D/action/author_attestation","sign_citation":"https://pith.science/pith/FBOSHM6EQBANKHGRG2JDD24N2D/action/citation_signature","submit_replication":"https://pith.science/pith/FBOSHM6EQBANKHGRG2JDD24N2D/action/replication_record"}},"created_at":"2026-07-05T06:51:06.501724+00:00","updated_at":"2026-07-05T06:51:06.501724+00:00"}