{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6RA6ODSCO4BEV4YT2DDOX7MU3W","short_pith_number":"pith:6RA6ODSC","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"},"canonical_sha256":"f441e70e4277024af313d0c6ebfd94ddb91cc6d01f3918d27476545e1f87c38d","source":{"kind":"arxiv","id":"1312.0193","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0193","created_at":"2026-05-18T02:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0193v2","created_at":"2026-05-18T02:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0193","created_at":"2026-05-18T02:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"6RA6ODSCO4BE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6RA6ODSCO4BEV4YT","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6RA6ODSC","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6RA6ODSCO4BEV4YT2DDOX7MU3W","target":"record","payload":{"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"},"canonical_sha256":"f441e70e4277024af313d0c6ebfd94ddb91cc6d01f3918d27476545e1f87c38d","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"},"source_kind":"arxiv","source_id":"1312.0193","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:53:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHpM9ErXjk19xN7ojL8BvgCveBuFPYAuO/2STbXkaGWk36corcz3mtjMCPRrX9dbV+2V3kOxZBi3DpXz99+EDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:56:09.923351Z"},"content_sha256":"e6054fa706d5346789d1fc01e9f96a854742a2008c0035e804b29659ed0851e3","schema_version":"1.0","event_id":"sha256:e6054fa706d5346789d1fc01e9f96a854742a2008c0035e804b29659ed0851e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6RA6ODSCO4BEV4YT2DDOX7MU3W","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:53:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eM18iKYYATMN4cDX4O4GvhsspE0+dTkvgmpdczeXdTrZEoM36fuphD3YEXh+TehCGFipha/j9uQy/P7cMqzhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:56:09.923710Z"},"content_sha256":"e5b80b068c9f79f802a388f5d8adf2326de73b6515a8dfc14930118474fcd077","schema_version":"1.0","event_id":"sha256:e5b80b068c9f79f802a388f5d8adf2326de73b6515a8dfc14930118474fcd077"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W/bundle.json","state_url":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T05:56:09Z","links":{"resolver":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W","bundle":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W/bundle.json","state":"https://pith.science/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RA6ODSCO4BEV4YT2DDOX7MU3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6RA6ODSCO4BEV4YT2DDOX7MU3W","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c8cb488f05e3f56efc380d0cb40fbb32012ba6fed2a0e1bad666a5975a664c68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-01T08:56:36Z","title_canon_sha256":"c6fd9f8152990f40dd19efd809a7b5bcf36d5eaaefa254b1f4302e71e923fc0f"},"schema_version":"1.0","source":{"id":"1312.0193","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0193","created_at":"2026-05-18T02:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0193v2","created_at":"2026-05-18T02:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0193","created_at":"2026-05-18T02:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"6RA6ODSCO4BE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6RA6ODSCO4BEV4YT","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6RA6ODSC","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:e5b80b068c9f79f802a388f5d8adf2326de73b6515a8dfc14930118474fcd077","target":"graph","created_at":"2026-05-18T02:53:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Cho-Jui Hsieh, Hsiang-Fu Yu, Hyokun Yun, Inderjit Dhillon, S.V.N. Vishwanathan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-01T08:56:36Z","title":"NOMAD: Non-locking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0193","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e6054fa706d5346789d1fc01e9f96a854742a2008c0035e804b29659ed0851e3","target":"record","created_at":"2026-05-18T02:53:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c8cb488f05e3f56efc380d0cb40fbb32012ba6fed2a0e1bad666a5975a664c68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-01T08:56:36Z","title_canon_sha256":"c6fd9f8152990f40dd19efd809a7b5bcf36d5eaaefa254b1f4302e71e923fc0f"},"schema_version":"1.0","source":{"id":"1312.0193","kind":"arxiv","version":2}},"canonical_sha256":"f441e70e4277024af313d0c6ebfd94ddb91cc6d01f3918d27476545e1f87c38d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f441e70e4277024af313d0c6ebfd94ddb91cc6d01f3918d27476545e1f87c38d","first_computed_at":"2026-05-18T02:53:26.831531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:26.831531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KzjOG22WAmooy3FQC+hcMLfNmLhf2QVkdEqzAwMg6p9Gf1hupATSqfkqqHw44cxIr1SNCVBF2WhWve/H2ou9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:26.832233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0193","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6054fa706d5346789d1fc01e9f96a854742a2008c0035e804b29659ed0851e3","sha256:e5b80b068c9f79f802a388f5d8adf2326de73b6515a8dfc14930118474fcd077"],"state_sha256":"3e3a8eb31eab4c7d3932aa945ae3855ba355cbe810453411a4b5649f31f45551"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHdX6K+5SwJ5sumH96+0NQqQSSfQ5jns3ZMmuWeOc4R62NDBekFNjxjPY6bbqTgYyVn2UXFUn2JNlSAufVVrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:56:09.926034Z","bundle_sha256":"0a39b07532c29b997c5d530027ba8b3f68f989a1c15ef11dc68d6f15ee175966"}}