{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AR7D67CWWQM2OHMXSLLEJ3OAAV","short_pith_number":"pith:AR7D67CW","schema_version":"1.0","canonical_sha256":"047e3f7c56b419a71d9792d644edc0054a87eebf0f1838c1dbd9b6936f86fd7f","source":{"kind":"arxiv","id":"1611.00724","version":1},"attestation_state":"computed","paper":{"title":"Computing proximal points of convex functions with inexact subgradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chayne Planiden, Warren Hare","submitted_at":"2016-11-02T18:54:14Z","abstract_excerpt":"Locating proximal points is a component of numerous minimization algorithms. This work focuses on developing a method to find the proximal point of a convex function at a point, given an inexact oracle. Our method assumes that exact function values are at hand, but exact subgradients are either not available or not useful. We use approximate subgradients to build a model of the objective function, and prove that the method converges to the true prox-point within acceptable tolerance. The subgradient $g_k$ used at each step $k$ is such that the distance from $g_k$ to the true subdifferential of"},"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":"1611.00724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T18:54:14Z","cross_cats_sorted":[],"title_canon_sha256":"68bb13fc670a16c23dacfd606d25bb0111b335a0e353c2a7eb97eb93b7cdc563","abstract_canon_sha256":"6b177e1e8ddd0cb449fb247a5d0a0bcf0fdf1a6d61e924c897a0151c8f7c22fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:32.011565Z","signature_b64":"bIrq+wit6li2xOaWBZjd5N7pkHy+BWwJB5RtFpfqF8/IyvkGv/J3gTJ/OPXP19jsowkbRLjkiW/q5n84ft1gAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"047e3f7c56b419a71d9792d644edc0054a87eebf0f1838c1dbd9b6936f86fd7f","last_reissued_at":"2026-05-18T01:00:32.010962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:32.010962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing proximal points of convex functions with inexact subgradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chayne Planiden, Warren Hare","submitted_at":"2016-11-02T18:54:14Z","abstract_excerpt":"Locating proximal points is a component of numerous minimization algorithms. This work focuses on developing a method to find the proximal point of a convex function at a point, given an inexact oracle. Our method assumes that exact function values are at hand, but exact subgradients are either not available or not useful. We use approximate subgradients to build a model of the objective function, and prove that the method converges to the true prox-point within acceptable tolerance. The subgradient $g_k$ used at each step $k$ is such that the distance from $g_k$ to the true subdifferential of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00724","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":""},"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":"1611.00724","created_at":"2026-05-18T01:00:32.011044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00724v1","created_at":"2026-05-18T01:00:32.011044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00724","created_at":"2026-05-18T01:00:32.011044+00:00"},{"alias_kind":"pith_short_12","alias_value":"AR7D67CWWQM2","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AR7D67CWWQM2OHMX","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AR7D67CW","created_at":"2026-05-18T12:30:07.202191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV","json":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV.json","graph_json":"https://pith.science/api/pith-number/AR7D67CWWQM2OHMXSLLEJ3OAAV/graph.json","events_json":"https://pith.science/api/pith-number/AR7D67CWWQM2OHMXSLLEJ3OAAV/events.json","paper":"https://pith.science/paper/AR7D67CW"},"agent_actions":{"view_html":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV","download_json":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV.json","view_paper":"https://pith.science/paper/AR7D67CW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00724&json=true","fetch_graph":"https://pith.science/api/pith-number/AR7D67CWWQM2OHMXSLLEJ3OAAV/graph.json","fetch_events":"https://pith.science/api/pith-number/AR7D67CWWQM2OHMXSLLEJ3OAAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV/action/storage_attestation","attest_author":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV/action/author_attestation","sign_citation":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV/action/citation_signature","submit_replication":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV/action/replication_record"}},"created_at":"2026-05-18T01:00:32.011044+00:00","updated_at":"2026-05-18T01:00:32.011044+00:00"}