{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OLR4EU2YUANLW5S5LQOZF66FRW","short_pith_number":"pith:OLR4EU2Y","schema_version":"1.0","canonical_sha256":"72e3c25358a01abb765d5c1d92fbc58d9067c3fc3378eb0ae73185a355292656","source":{"kind":"arxiv","id":"1412.0159","version":1},"attestation_state":"computed","paper":{"title":"Amortized Analysis on Asynchronous Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Richard Cole, Yun Kuen Cheung","submitted_at":"2014-11-29T22:08:03Z","abstract_excerpt":"Gradient descent is an important class of iterative algorithms for minimizing convex functions. Classically, gradient descent has been a sequential and synchronous process. Distributed and asynchronous variants of gradient descent have been studied since the 1980s, and they have been experiencing a resurgence due to demand from large-scale machine learning problems running on multi-core processors.\n  We provide a version of asynchronous gradient descent (AGD) in which communication between cores is minimal and for which there is little synchronization overhead. We also propose a new timing mod"},"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":"1412.0159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-29T22:08:03Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"38b253e66b6be272348ba3d8750287860a128b88c10ea36b397a1a548d91c4cd","abstract_canon_sha256":"245cbc05e2b7c77528bafa0f3ae64f011cf5e5e70f18d691d10e00639bd33da9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:30.198677Z","signature_b64":"4FFOSVr+1ng6VbY36zVUNIg3fa+8CLZx4NLdPb9InR7rDrSNeQ/CQU+n/BlIu9mb5GksU5/qHeEIN7R48OizBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72e3c25358a01abb765d5c1d92fbc58d9067c3fc3378eb0ae73185a355292656","last_reissued_at":"2026-05-18T02:32:30.197985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:30.197985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Amortized Analysis on Asynchronous Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Richard Cole, Yun Kuen Cheung","submitted_at":"2014-11-29T22:08:03Z","abstract_excerpt":"Gradient descent is an important class of iterative algorithms for minimizing convex functions. Classically, gradient descent has been a sequential and synchronous process. Distributed and asynchronous variants of gradient descent have been studied since the 1980s, and they have been experiencing a resurgence due to demand from large-scale machine learning problems running on multi-core processors.\n  We provide a version of asynchronous gradient descent (AGD) in which communication between cores is minimal and for which there is little synchronization overhead. We also propose a new timing mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0159","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.0159","created_at":"2026-05-18T02:32:30.198112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0159v1","created_at":"2026-05-18T02:32:30.198112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0159","created_at":"2026-05-18T02:32:30.198112+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLR4EU2YUANL","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLR4EU2YUANLW5S5","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLR4EU2Y","created_at":"2026-05-18T12:28:41.024544+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/OLR4EU2YUANLW5S5LQOZF66FRW","json":"https://pith.science/pith/OLR4EU2YUANLW5S5LQOZF66FRW.json","graph_json":"https://pith.science/api/pith-number/OLR4EU2YUANLW5S5LQOZF66FRW/graph.json","events_json":"https://pith.science/api/pith-number/OLR4EU2YUANLW5S5LQOZF66FRW/events.json","paper":"https://pith.science/paper/OLR4EU2Y"},"agent_actions":{"view_html":"https://pith.science/pith/OLR4EU2YUANLW5S5LQOZF66FRW","download_json":"https://pith.science/pith/OLR4EU2YUANLW5S5LQOZF66FRW.json","view_paper":"https://pith.science/paper/OLR4EU2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0159&json=true","fetch_graph":"https://pith.science/api/pith-number/OLR4EU2YUANLW5S5LQOZF66FRW/graph.json","fetch_events":"https://pith.science/api/pith-number/OLR4EU2YUANLW5S5LQOZF66FRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLR4EU2YUANLW5S5LQOZF66FRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLR4EU2YUANLW5S5LQOZF66FRW/action/storage_attestation","attest_author":"https://pith.science/pith/OLR4EU2YUANLW5S5LQOZF66FRW/action/author_attestation","sign_citation":"https://pith.science/pith/OLR4EU2YUANLW5S5LQOZF66FRW/action/citation_signature","submit_replication":"https://pith.science/pith/OLR4EU2YUANLW5S5LQOZF66FRW/action/replication_record"}},"created_at":"2026-05-18T02:32:30.198112+00:00","updated_at":"2026-05-18T02:32:30.198112+00:00"}