{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6RA6ODSCO4BEV4YT2DDOX7MU3W","short_pith_number":"pith:6RA6ODSC","schema_version":"1.0","canonical_sha256":"f441e70e4277024af313d0c6ebfd94ddb91cc6d01f3918d27476545e1f87c38d","source":{"kind":"arxiv","id":"1312.0193","version":2},"attestation_state":"computed","paper":{"title":"NOMAD: Non-locking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cho-Jui Hsieh, Hsiang-Fu Yu, Hyokun Yun, Inderjit Dhillon, S.V.N. Vishwanathan","submitted_at":"2013-12-01T08:56:36Z","abstract_excerpt":"We develop an efficient parallel distributed algorithm for matrix completion, named NOMAD (Non-locking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion). NOMAD is a decentralized algorithm with non-blocking communication between processors. One of the key features of NOMAD is that the ownership of a variable is asynchronously transferred between processors in a decentralized fashion. As a consequence it is a lock-free parallel algorithm. In spite of being an asynchronous algorithm, the variable updates of NOMAD are serializable, that is, there is an equi"},"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":"1312.0193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-01T08:56:36Z","cross_cats_sorted":[],"title_canon_sha256":"c6fd9f8152990f40dd19efd809a7b5bcf36d5eaaefa254b1f4302e71e923fc0f","abstract_canon_sha256":"c8cb488f05e3f56efc380d0cb40fbb32012ba6fed2a0e1bad666a5975a664c68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:26.832233Z","signature_b64":"KzjOG22WAmooy3FQC+hcMLfNmLhf2QVkdEqzAwMg6p9Gf1hupATSqfkqqHw44cxIr1SNCVBF2WhWve/H2ou9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f441e70e4277024af313d0c6ebfd94ddb91cc6d01f3918d27476545e1f87c38d","last_reissued_at":"2026-05-18T02:53:26.831531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:26.831531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NOMAD: Non-locking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cho-Jui Hsieh, Hsiang-Fu Yu, Hyokun Yun, Inderjit Dhillon, S.V.N. Vishwanathan","submitted_at":"2013-12-01T08:56:36Z","abstract_excerpt":"We develop an efficient parallel distributed algorithm for matrix completion, named NOMAD (Non-locking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion). NOMAD is a decentralized algorithm with non-blocking communication between processors. One of the key features of NOMAD is that the ownership of a variable is asynchronously transferred between processors in a decentralized fashion. As a consequence it is a lock-free parallel algorithm. In spite of being an asynchronous algorithm, the variable updates of NOMAD are serializable, that is, there is an equi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0193","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":"1312.0193","created_at":"2026-05-18T02:53:26.831632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0193v2","created_at":"2026-05-18T02:53:26.831632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0193","created_at":"2026-05-18T02:53:26.831632+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RA6ODSCO4BE","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RA6ODSCO4BEV4YT","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RA6ODSC","created_at":"2026-05-18T12:27:36.564083+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/6RA6ODSCO4BEV4YT2DDOX7MU3W","json":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W.json","graph_json":"https://pith.science/api/pith-number/6RA6ODSCO4BEV4YT2DDOX7MU3W/graph.json","events_json":"https://pith.science/api/pith-number/6RA6ODSCO4BEV4YT2DDOX7MU3W/events.json","paper":"https://pith.science/paper/6RA6ODSC"},"agent_actions":{"view_html":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W","download_json":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W.json","view_paper":"https://pith.science/paper/6RA6ODSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0193&json=true","fetch_graph":"https://pith.science/api/pith-number/6RA6ODSCO4BEV4YT2DDOX7MU3W/graph.json","fetch_events":"https://pith.science/api/pith-number/6RA6ODSCO4BEV4YT2DDOX7MU3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W/action/storage_attestation","attest_author":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W/action/author_attestation","sign_citation":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W/action/citation_signature","submit_replication":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W/action/replication_record"}},"created_at":"2026-05-18T02:53:26.831632+00:00","updated_at":"2026-05-18T02:53:26.831632+00:00"}