{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XYI5CUMSND344KI3R7YJI56TTF","short_pith_number":"pith:XYI5CUMS","schema_version":"1.0","canonical_sha256":"be11d1519268f7ce291b8ff09477d39969162c21036e4ec50313fb70d1d091aa","source":{"kind":"arxiv","id":"1601.00698","version":2},"attestation_state":"computed","paper":{"title":"SMART: The Stochastic Monotone Aggregated Root-Finding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Damek Davis","submitted_at":"2016-01-04T23:02:41Z","abstract_excerpt":"We introduce the Stochastic Monotone Aggregated Root-Finding (SMART) algorithm, a new randomized operator-splitting scheme for finding roots of finite sums of operators. These algorithms are similar to the growing class of incremental aggregated gradient algorithms, which minimize finite sums of functions; the difference is that we replace gradients of functions with black-boxes called operators, which represent subproblems to be solved during the algorithm. By replacing gradients with operators, we increase our modeling power, and we simplify the application and analysis of the resulting algo"},"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":"1601.00698","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-04T23:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"8f8f21f3aeb9bb2328dfe693203841c58ad06fe2f51b23b459c3452c261de242","abstract_canon_sha256":"687e5d1b033b4190736eaf7a3593974e48fe7eb662f88f847387e8f0b4bc1e04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:37.872545Z","signature_b64":"JGYrO5cYHsPWsyfxMftENQrKg7Wfo2yMQn3PdrVj5G0qZf7RRq5nuJDgJsvhHUDhVRNUH6runeAGpQh+qCdQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be11d1519268f7ce291b8ff09477d39969162c21036e4ec50313fb70d1d091aa","last_reissued_at":"2026-05-18T01:12:37.872200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:37.872200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SMART: The Stochastic Monotone Aggregated Root-Finding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Damek Davis","submitted_at":"2016-01-04T23:02:41Z","abstract_excerpt":"We introduce the Stochastic Monotone Aggregated Root-Finding (SMART) algorithm, a new randomized operator-splitting scheme for finding roots of finite sums of operators. These algorithms are similar to the growing class of incremental aggregated gradient algorithms, which minimize finite sums of functions; the difference is that we replace gradients of functions with black-boxes called operators, which represent subproblems to be solved during the algorithm. By replacing gradients with operators, we increase our modeling power, and we simplify the application and analysis of the resulting algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00698","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":"1601.00698","created_at":"2026-05-18T01:12:37.872254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00698v2","created_at":"2026-05-18T01:12:37.872254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00698","created_at":"2026-05-18T01:12:37.872254+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYI5CUMSND34","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYI5CUMSND344KI3","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYI5CUMS","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09547","citing_title":"Stochastic algorithms with geometric step decay converge linearly on sharp functions","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XYI5CUMSND344KI3R7YJI56TTF","json":"https://pith.science/pith/XYI5CUMSND344KI3R7YJI56TTF.json","graph_json":"https://pith.science/api/pith-number/XYI5CUMSND344KI3R7YJI56TTF/graph.json","events_json":"https://pith.science/api/pith-number/XYI5CUMSND344KI3R7YJI56TTF/events.json","paper":"https://pith.science/paper/XYI5CUMS"},"agent_actions":{"view_html":"https://pith.science/pith/XYI5CUMSND344KI3R7YJI56TTF","download_json":"https://pith.science/pith/XYI5CUMSND344KI3R7YJI56TTF.json","view_paper":"https://pith.science/paper/XYI5CUMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00698&json=true","fetch_graph":"https://pith.science/api/pith-number/XYI5CUMSND344KI3R7YJI56TTF/graph.json","fetch_events":"https://pith.science/api/pith-number/XYI5CUMSND344KI3R7YJI56TTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYI5CUMSND344KI3R7YJI56TTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYI5CUMSND344KI3R7YJI56TTF/action/storage_attestation","attest_author":"https://pith.science/pith/XYI5CUMSND344KI3R7YJI56TTF/action/author_attestation","sign_citation":"https://pith.science/pith/XYI5CUMSND344KI3R7YJI56TTF/action/citation_signature","submit_replication":"https://pith.science/pith/XYI5CUMSND344KI3R7YJI56TTF/action/replication_record"}},"created_at":"2026-05-18T01:12:37.872254+00:00","updated_at":"2026-05-18T01:12:37.872254+00:00"}