{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Y7QY2LGMX54EE7HMG4EXKPVVWF","short_pith_number":"pith:Y7QY2LGM","schema_version":"1.0","canonical_sha256":"c7e18d2cccbf78427cec3709753eb5b17f4b270adc4377c73b3b5874be22a873","source":{"kind":"arxiv","id":"1405.7741","version":2},"attestation_state":"computed","paper":{"title":"Properties of Pseudocontractive Updates in Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Patrick W. Gallagher, Zhuowen Tu","submitted_at":"2014-05-29T22:36:19Z","abstract_excerpt":"Many convex optimization methods are conceived of and analyzed in a largely separate fashion. In contrast to this traditional separation, this manuscript points out and demonstrates the utility of an important but largely unremarked common thread running through many prominent optimization methods. In particular, we show that methods such as successive orthogonal projection, gradient descent, projected gradient descent, the proximal-point method, forward-backward splitting, the alternating direction method of multipliers, and under- or over-relaxed variants of the preceding all involve updates"},"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":"1405.7741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-29T22:36:19Z","cross_cats_sorted":[],"title_canon_sha256":"922c70f00cd824f19d2e22871bb9c39465f6e11a7164b63f90f5114244c19d52","abstract_canon_sha256":"e5b30208c0d293daf04ffb072d57cdac05f5dc7116f33095860bf523011c9d7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:45.875611Z","signature_b64":"Vd9jHdNThHkX4qkCmQpKotjySL3UUYX6B5TuhSk0CdP5uwv0+0SR/h/E2EkXHWYaB0XPmEM1OOWQKcVeRa99DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7e18d2cccbf78427cec3709753eb5b17f4b270adc4377c73b3b5874be22a873","last_reissued_at":"2026-05-18T02:48:45.874936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:45.874936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Properties of Pseudocontractive Updates in Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Patrick W. Gallagher, Zhuowen Tu","submitted_at":"2014-05-29T22:36:19Z","abstract_excerpt":"Many convex optimization methods are conceived of and analyzed in a largely separate fashion. In contrast to this traditional separation, this manuscript points out and demonstrates the utility of an important but largely unremarked common thread running through many prominent optimization methods. In particular, we show that methods such as successive orthogonal projection, gradient descent, projected gradient descent, the proximal-point method, forward-backward splitting, the alternating direction method of multipliers, and under- or over-relaxed variants of the preceding all involve updates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7741","kind":"arxiv","version":2},"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":"1405.7741","created_at":"2026-05-18T02:48:45.875039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7741v2","created_at":"2026-05-18T02:48:45.875039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7741","created_at":"2026-05-18T02:48:45.875039+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7QY2LGMX54E","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7QY2LGMX54EE7HM","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7QY2LGM","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.07513","citing_title":"Tessellations of Semi-Discrete Flow Matching","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y7QY2LGMX54EE7HMG4EXKPVVWF","json":"https://pith.science/pith/Y7QY2LGMX54EE7HMG4EXKPVVWF.json","graph_json":"https://pith.science/api/pith-number/Y7QY2LGMX54EE7HMG4EXKPVVWF/graph.json","events_json":"https://pith.science/api/pith-number/Y7QY2LGMX54EE7HMG4EXKPVVWF/events.json","paper":"https://pith.science/paper/Y7QY2LGM"},"agent_actions":{"view_html":"https://pith.science/pith/Y7QY2LGMX54EE7HMG4EXKPVVWF","download_json":"https://pith.science/pith/Y7QY2LGMX54EE7HMG4EXKPVVWF.json","view_paper":"https://pith.science/paper/Y7QY2LGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7741&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7QY2LGMX54EE7HMG4EXKPVVWF/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7QY2LGMX54EE7HMG4EXKPVVWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7QY2LGMX54EE7HMG4EXKPVVWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7QY2LGMX54EE7HMG4EXKPVVWF/action/storage_attestation","attest_author":"https://pith.science/pith/Y7QY2LGMX54EE7HMG4EXKPVVWF/action/author_attestation","sign_citation":"https://pith.science/pith/Y7QY2LGMX54EE7HMG4EXKPVVWF/action/citation_signature","submit_replication":"https://pith.science/pith/Y7QY2LGMX54EE7HMG4EXKPVVWF/action/replication_record"}},"created_at":"2026-05-18T02:48:45.875039+00:00","updated_at":"2026-05-18T02:48:45.875039+00:00"}