{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BCV4J4IDT2OJWVUZSDMNXDGZQN","short_pith_number":"pith:BCV4J4ID","schema_version":"1.0","canonical_sha256":"08abc4f1039e9c9b569990d8db8cd98349cde1a0b7d41ab42cc550e2eb14abf2","source":{"kind":"arxiv","id":"1908.00865","version":5},"attestation_state":"computed","paper":{"title":"Gradient flows and proximal splitting methods: A unified view on accelerated and stochastic optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Daniel P. Robinson, Guilherme Fran\\c{c}a, Ren\\'e Vidal","submitted_at":"2019-08-02T14:01:11Z","abstract_excerpt":"Optimization is at the heart of machine learning, statistics and many applied scientific disciplines. It also has a long history in physics, ranging from the minimal action principle to finding ground states of disordered systems such as spin glasses. Proximal algorithms form a class of methods that are broadly applicable and are particularly well-suited to nonsmooth, constrained, large-scale, and distributed optimization problems. There are essentially five proximal algorithms currently known: Forward-backward splitting, Tseng splitting, Douglas-Rachford, alternating direction method of multi"},"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":"1908.00865","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-02T14:01:11Z","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"title_canon_sha256":"076e7b71ab436dda3e9e8bd6cfff68e340f83cbf33687e7a4dc3ecd8d5cb84a2","abstract_canon_sha256":"a8f0b063724de619dd018e62fc5d0f0ac6be929699aef615cd0ed4c37c07b8a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:38:50.190871Z","signature_b64":"gT8VQEWzLA8DExCvRh0GR+pZIljQnjqxHHe/Ia0eX49yV5sQi7F9dLVFJxIzClTQvLqJmNGdmHsIDqZMtin4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08abc4f1039e9c9b569990d8db8cd98349cde1a0b7d41ab42cc550e2eb14abf2","last_reissued_at":"2026-07-05T02:38:50.190502Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:38:50.190502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient flows and proximal splitting methods: A unified view on accelerated and stochastic optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Daniel P. Robinson, Guilherme Fran\\c{c}a, Ren\\'e Vidal","submitted_at":"2019-08-02T14:01:11Z","abstract_excerpt":"Optimization is at the heart of machine learning, statistics and many applied scientific disciplines. It also has a long history in physics, ranging from the minimal action principle to finding ground states of disordered systems such as spin glasses. Proximal algorithms form a class of methods that are broadly applicable and are particularly well-suited to nonsmooth, constrained, large-scale, and distributed optimization problems. There are essentially five proximal algorithms currently known: Forward-backward splitting, Tseng splitting, Douglas-Rachford, alternating direction method of multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00865","kind":"arxiv","version":5},"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/1908.00865/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":"1908.00865","created_at":"2026-07-05T02:38:50.190564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.00865v5","created_at":"2026-07-05T02:38:50.190564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00865","created_at":"2026-07-05T02:38:50.190564+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCV4J4IDT2OJ","created_at":"2026-07-05T02:38:50.190564+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCV4J4IDT2OJWVUZ","created_at":"2026-07-05T02:38:50.190564+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCV4J4ID","created_at":"2026-07-05T02:38:50.190564+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/BCV4J4IDT2OJWVUZSDMNXDGZQN","json":"https://pith.science/pith/BCV4J4IDT2OJWVUZSDMNXDGZQN.json","graph_json":"https://pith.science/api/pith-number/BCV4J4IDT2OJWVUZSDMNXDGZQN/graph.json","events_json":"https://pith.science/api/pith-number/BCV4J4IDT2OJWVUZSDMNXDGZQN/events.json","paper":"https://pith.science/paper/BCV4J4ID"},"agent_actions":{"view_html":"https://pith.science/pith/BCV4J4IDT2OJWVUZSDMNXDGZQN","download_json":"https://pith.science/pith/BCV4J4IDT2OJWVUZSDMNXDGZQN.json","view_paper":"https://pith.science/paper/BCV4J4ID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.00865&json=true","fetch_graph":"https://pith.science/api/pith-number/BCV4J4IDT2OJWVUZSDMNXDGZQN/graph.json","fetch_events":"https://pith.science/api/pith-number/BCV4J4IDT2OJWVUZSDMNXDGZQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCV4J4IDT2OJWVUZSDMNXDGZQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCV4J4IDT2OJWVUZSDMNXDGZQN/action/storage_attestation","attest_author":"https://pith.science/pith/BCV4J4IDT2OJWVUZSDMNXDGZQN/action/author_attestation","sign_citation":"https://pith.science/pith/BCV4J4IDT2OJWVUZSDMNXDGZQN/action/citation_signature","submit_replication":"https://pith.science/pith/BCV4J4IDT2OJWVUZSDMNXDGZQN/action/replication_record"}},"created_at":"2026-07-05T02:38:50.190564+00:00","updated_at":"2026-07-05T02:38:50.190564+00:00"}