{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4HY3ERLLPWJFJOWENIY52NCFSH","short_pith_number":"pith:4HY3ERLL","schema_version":"1.0","canonical_sha256":"e1f1b2456b7d9254bac46a31dd344591d497124a8624306f0c0e06fd22011af5","source":{"kind":"arxiv","id":"1803.09169","version":5},"attestation_state":"computed","paper":{"title":"FROST -- Fast row-stochastic optimization with uncoordinated step-sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chenguang Xi, Ran Xin, Usman A. Khan","submitted_at":"2018-03-24T22:29:07Z","abstract_excerpt":"In this paper, we discuss distributed optimization over directed graphs, where doubly-stochastic weights cannot be constructed. Most of the existing algorithms overcome this issue by applying push-sum consensus, which utilizes column-stochastic weights. The formulation of column-stochastic weights requires each agent to know (at least) its out-degree, which may be impractical in e.g., broadcast-based communication protocols. In contrast, we describe FROST (Fast Row-stochastic-Optimization with uncoordinated STep-sizes), an optimization algorithm applicable to directed graphs that does not requ"},"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":"1803.09169","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-24T22:29:07Z","cross_cats_sorted":[],"title_canon_sha256":"a0c603a8e34f7fd0cc6421626bc6fa1f19fab577f0226d216e0466d6f65b4298","abstract_canon_sha256":"c4f78674aa247e5d02ff1f1128f3f72b076ec57bafb51fa6020028e17c35419c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:21.097974Z","signature_b64":"OgcJiitaT852gjN8vU0iV3KFpuynfcYtOJya6XtHtmVfpqeyqaRxjTE5Gk+Vo/0RiY1En2beXL0k5UcTu17JAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f1b2456b7d9254bac46a31dd344591d497124a8624306f0c0e06fd22011af5","last_reissued_at":"2026-05-17T23:55:21.097564Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:21.097564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FROST -- Fast row-stochastic optimization with uncoordinated step-sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chenguang Xi, Ran Xin, Usman A. Khan","submitted_at":"2018-03-24T22:29:07Z","abstract_excerpt":"In this paper, we discuss distributed optimization over directed graphs, where doubly-stochastic weights cannot be constructed. Most of the existing algorithms overcome this issue by applying push-sum consensus, which utilizes column-stochastic weights. The formulation of column-stochastic weights requires each agent to know (at least) its out-degree, which may be impractical in e.g., broadcast-based communication protocols. In contrast, we describe FROST (Fast Row-stochastic-Optimization with uncoordinated STep-sizes), an optimization algorithm applicable to directed graphs that does not requ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09169","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":""},"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":"1803.09169","created_at":"2026-05-17T23:55:21.097646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09169v5","created_at":"2026-05-17T23:55:21.097646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09169","created_at":"2026-05-17T23:55:21.097646+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HY3ERLLPWJF","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HY3ERLLPWJFJOWE","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HY3ERLL","created_at":"2026-05-18T12:32:05.422762+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/4HY3ERLLPWJFJOWENIY52NCFSH","json":"https://pith.science/pith/4HY3ERLLPWJFJOWENIY52NCFSH.json","graph_json":"https://pith.science/api/pith-number/4HY3ERLLPWJFJOWENIY52NCFSH/graph.json","events_json":"https://pith.science/api/pith-number/4HY3ERLLPWJFJOWENIY52NCFSH/events.json","paper":"https://pith.science/paper/4HY3ERLL"},"agent_actions":{"view_html":"https://pith.science/pith/4HY3ERLLPWJFJOWENIY52NCFSH","download_json":"https://pith.science/pith/4HY3ERLLPWJFJOWENIY52NCFSH.json","view_paper":"https://pith.science/paper/4HY3ERLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09169&json=true","fetch_graph":"https://pith.science/api/pith-number/4HY3ERLLPWJFJOWENIY52NCFSH/graph.json","fetch_events":"https://pith.science/api/pith-number/4HY3ERLLPWJFJOWENIY52NCFSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HY3ERLLPWJFJOWENIY52NCFSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HY3ERLLPWJFJOWENIY52NCFSH/action/storage_attestation","attest_author":"https://pith.science/pith/4HY3ERLLPWJFJOWENIY52NCFSH/action/author_attestation","sign_citation":"https://pith.science/pith/4HY3ERLLPWJFJOWENIY52NCFSH/action/citation_signature","submit_replication":"https://pith.science/pith/4HY3ERLLPWJFJOWENIY52NCFSH/action/replication_record"}},"created_at":"2026-05-17T23:55:21.097646+00:00","updated_at":"2026-05-17T23:55:21.097646+00:00"}