{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AR7D67CWWQM2OHMXSLLEJ3OAAV","short_pith_number":"pith:AR7D67CW","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"},"canonical_sha256":"047e3f7c56b419a71d9792d644edc0054a87eebf0f1838c1dbd9b6936f86fd7f","source":{"kind":"arxiv","id":"1611.00724","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00724","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00724v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00724","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"AR7D67CWWQM2","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AR7D67CWWQM2OHMX","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AR7D67CW","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AR7D67CWWQM2OHMXSLLEJ3OAAV","target":"record","payload":{"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"},"canonical_sha256":"047e3f7c56b419a71d9792d644edc0054a87eebf0f1838c1dbd9b6936f86fd7f","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"},"source_kind":"arxiv","source_id":"1611.00724","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-05-18T01:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Swe9XGYOcLToNXuUJ0Z89HPUq4Sng1va5iyuqP5GqpSYd3by0ptpxjcppdTdpYGqbJYRY/mwO2GphA7fN3cAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T10:36:03.221395Z"},"content_sha256":"fedc59413ee5c0a88ca487dc980c1ec75f42b3cc952008b8625ed301d60405b8","schema_version":"1.0","event_id":"sha256:fedc59413ee5c0a88ca487dc980c1ec75f42b3cc952008b8625ed301d60405b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AR7D67CWWQM2OHMXSLLEJ3OAAV","target":"graph","payload":{"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"},"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-05-18T01:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Le+xHw6HwzNdConR7VptD7+3CSQpUOCu2KVnb1QXsJd1EiHjjdkgTGLbp71I2NlgyoJ2ta28sBrF9s9IWRUTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T10:36:03.222056Z"},"content_sha256":"11c9b658d26ad4763672a46c94f3e6471a340c85b620bc3d51a8824001db3b15","schema_version":"1.0","event_id":"sha256:11c9b658d26ad4763672a46c94f3e6471a340c85b620bc3d51a8824001db3b15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV/bundle.json","state_url":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV/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-05-22T10:36:03Z","links":{"resolver":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV","bundle":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV/bundle.json","state":"https://pith.science/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AR7D67CWWQM2OHMXSLLEJ3OAAV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AR7D67CWWQM2OHMXSLLEJ3OAAV","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":"6b177e1e8ddd0cb449fb247a5d0a0bcf0fdf1a6d61e924c897a0151c8f7c22fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T18:54:14Z","title_canon_sha256":"68bb13fc670a16c23dacfd606d25bb0111b335a0e353c2a7eb97eb93b7cdc563"},"schema_version":"1.0","source":{"id":"1611.00724","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00724","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00724v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00724","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"AR7D67CWWQM2","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AR7D67CWWQM2OHMX","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AR7D67CW","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:11c9b658d26ad4763672a46c94f3e6471a340c85b620bc3d51a8824001db3b15","target":"graph","created_at":"2026-05-18T01:00:32Z","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"},"paper":{"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","authors_text":"Chayne Planiden, Warren Hare","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T18:54:14Z","title":"Computing proximal points of convex functions with inexact subgradients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00724","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:fedc59413ee5c0a88ca487dc980c1ec75f42b3cc952008b8625ed301d60405b8","target":"record","created_at":"2026-05-18T01:00:32Z","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":"6b177e1e8ddd0cb449fb247a5d0a0bcf0fdf1a6d61e924c897a0151c8f7c22fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T18:54:14Z","title_canon_sha256":"68bb13fc670a16c23dacfd606d25bb0111b335a0e353c2a7eb97eb93b7cdc563"},"schema_version":"1.0","source":{"id":"1611.00724","kind":"arxiv","version":1}},"canonical_sha256":"047e3f7c56b419a71d9792d644edc0054a87eebf0f1838c1dbd9b6936f86fd7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"047e3f7c56b419a71d9792d644edc0054a87eebf0f1838c1dbd9b6936f86fd7f","first_computed_at":"2026-05-18T01:00:32.010962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:32.010962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bIrq+wit6li2xOaWBZjd5N7pkHy+BWwJB5RtFpfqF8/IyvkGv/J3gTJ/OPXP19jsowkbRLjkiW/q5n84ft1gAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:32.011565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00724","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fedc59413ee5c0a88ca487dc980c1ec75f42b3cc952008b8625ed301d60405b8","sha256:11c9b658d26ad4763672a46c94f3e6471a340c85b620bc3d51a8824001db3b15"],"state_sha256":"6b8247a139639baa7b1ca0ab2e0483a7f523a6620f1abeada2e5c425f218d1fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdrTVQBFdSRcFoN3Jx4Rb88bnWf6R4dakAuqTQyxQgxRejPy8jer/FjbdEYnxWmZbgs5Joo61FujMhEkKbBqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T10:36:03.225700Z","bundle_sha256":"e2718cf9ce71c84d3a39dfdd60c229f025107ba78f6a4dad63deab09b8103297"}}