{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RADUZNULM3S77GD6UEEZFWMEBB","short_pith_number":"pith:RADUZNUL","canonical_record":{"source":{"id":"1508.03110","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-13T03:37:04Z","cross_cats_sorted":["cs.DC","cs.IR","cs.NA"],"title_canon_sha256":"36560b81dc17b7e8be903c6b388792ab36f47951d046bc4f8bb8d36ffc9d9246","abstract_canon_sha256":"5a3f323906605df44d36fc656f211e8538e3e6890185015304f7e24594beefaa"},"schema_version":"1.0"},"canonical_sha256":"88074cb68b66e5ff987ea10992d98408543cf4c525894ce344687dbb40e2362b","source":{"kind":"arxiv","id":"1508.03110","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03110","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03110v3","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03110","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"RADUZNULM3S7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RADUZNULM3S77GD6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RADUZNUL","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RADUZNULM3S77GD6UEEZFWMEBB","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03110","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-13T03:37:04Z","cross_cats_sorted":["cs.DC","cs.IR","cs.NA"],"title_canon_sha256":"36560b81dc17b7e8be903c6b388792ab36f47951d046bc4f8bb8d36ffc9d9246","abstract_canon_sha256":"5a3f323906605df44d36fc656f211e8538e3e6890185015304f7e24594beefaa"},"schema_version":"1.0"},"canonical_sha256":"88074cb68b66e5ff987ea10992d98408543cf4c525894ce344687dbb40e2362b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:08.218742Z","signature_b64":"+hhAumnK/cXpdjP9/UQkZLuwSpFEEYa2L1IFDeZpKx25sipyLw3cR/jVtw3OiYjpcfJ821I8C3xBDVdnTuCKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88074cb68b66e5ff987ea10992d98408543cf4c525894ce344687dbb40e2362b","last_reissued_at":"2026-05-18T01:23:08.218276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:08.218276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03110","source_version":3,"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-18T01:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rcj87S9mLktFJXNXGt0MDbBOwRJo302sSpdHgO92C1aKJW1F1GTReqrZDQBwNPQFU3KvJUmkAotMUNDJmwWkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:37:53.003069Z"},"content_sha256":"912104cced8b949041d1601923b95034080f446bbbc0bc8e3ac31e38924c0de1","schema_version":"1.0","event_id":"sha256:912104cced8b949041d1601923b95034080f446bbbc0bc8e3ac31e38924c0de1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RADUZNULM3S77GD6UEEZFWMEBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Acceleration of Parallel ALS for Collaborative Filtering: Speeding up Distributed Big Data Recommendation in Spark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IR","cs.NA"],"primary_cat":"math.NA","authors_text":"Anthony Caterini, Hans De Sterck, Manda Winlaw, Michael B. Hynes","submitted_at":"2015-08-13T03:37:04Z","abstract_excerpt":"Collaborative filtering algorithms are important building blocks in many practical recommendation systems. For example, many large-scale data processing environments include collaborative filtering models for which the Alternating Least Squares (ALS) algorithm is used to compute latent factor matrix decompositions. In this paper, we propose an approach to accelerate the convergence of parallel ALS-based optimization methods for collaborative filtering using a nonlinear conjugate gradient (NCG) wrapper around the ALS iterations. We also provide a parallel implementation of the accelerated ALS-N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03110","kind":"arxiv","version":3},"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-18T01:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+r7T66JUtkl5xtI7l62O8VdJfWN8SOUxTHSTeC68nmUs2VDH2WQr3Zxta5qhk1/gsPaz6sYR3SAzJ7fNuOi+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:37:53.003438Z"},"content_sha256":"d62f157ffa4179c1b9981460e6135c417d178f70c732368dbfd9189dfee21d85","schema_version":"1.0","event_id":"sha256:d62f157ffa4179c1b9981460e6135c417d178f70c732368dbfd9189dfee21d85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RADUZNULM3S77GD6UEEZFWMEBB/bundle.json","state_url":"https://pith.science/pith/RADUZNULM3S77GD6UEEZFWMEBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RADUZNULM3S77GD6UEEZFWMEBB/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-06-09T14:37:53Z","links":{"resolver":"https://pith.science/pith/RADUZNULM3S77GD6UEEZFWMEBB","bundle":"https://pith.science/pith/RADUZNULM3S77GD6UEEZFWMEBB/bundle.json","state":"https://pith.science/pith/RADUZNULM3S77GD6UEEZFWMEBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RADUZNULM3S77GD6UEEZFWMEBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RADUZNULM3S77GD6UEEZFWMEBB","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":"5a3f323906605df44d36fc656f211e8538e3e6890185015304f7e24594beefaa","cross_cats_sorted":["cs.DC","cs.IR","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-13T03:37:04Z","title_canon_sha256":"36560b81dc17b7e8be903c6b388792ab36f47951d046bc4f8bb8d36ffc9d9246"},"schema_version":"1.0","source":{"id":"1508.03110","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03110","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03110v3","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03110","created_at":"2026-05-18T01:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"RADUZNULM3S7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RADUZNULM3S77GD6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RADUZNUL","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:d62f157ffa4179c1b9981460e6135c417d178f70c732368dbfd9189dfee21d85","target":"graph","created_at":"2026-05-18T01:23:08Z","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":"Collaborative filtering algorithms are important building blocks in many practical recommendation systems. For example, many large-scale data processing environments include collaborative filtering models for which the Alternating Least Squares (ALS) algorithm is used to compute latent factor matrix decompositions. In this paper, we propose an approach to accelerate the convergence of parallel ALS-based optimization methods for collaborative filtering using a nonlinear conjugate gradient (NCG) wrapper around the ALS iterations. We also provide a parallel implementation of the accelerated ALS-N","authors_text":"Anthony Caterini, Hans De Sterck, Manda Winlaw, Michael B. Hynes","cross_cats":["cs.DC","cs.IR","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-13T03:37:04Z","title":"Algorithmic Acceleration of Parallel ALS for Collaborative Filtering: Speeding up Distributed Big Data Recommendation in Spark"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03110","kind":"arxiv","version":3},"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:912104cced8b949041d1601923b95034080f446bbbc0bc8e3ac31e38924c0de1","target":"record","created_at":"2026-05-18T01:23:08Z","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":"5a3f323906605df44d36fc656f211e8538e3e6890185015304f7e24594beefaa","cross_cats_sorted":["cs.DC","cs.IR","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-13T03:37:04Z","title_canon_sha256":"36560b81dc17b7e8be903c6b388792ab36f47951d046bc4f8bb8d36ffc9d9246"},"schema_version":"1.0","source":{"id":"1508.03110","kind":"arxiv","version":3}},"canonical_sha256":"88074cb68b66e5ff987ea10992d98408543cf4c525894ce344687dbb40e2362b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88074cb68b66e5ff987ea10992d98408543cf4c525894ce344687dbb40e2362b","first_computed_at":"2026-05-18T01:23:08.218276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:08.218276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+hhAumnK/cXpdjP9/UQkZLuwSpFEEYa2L1IFDeZpKx25sipyLw3cR/jVtw3OiYjpcfJ821I8C3xBDVdnTuCKDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:08.218742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03110","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:912104cced8b949041d1601923b95034080f446bbbc0bc8e3ac31e38924c0de1","sha256:d62f157ffa4179c1b9981460e6135c417d178f70c732368dbfd9189dfee21d85"],"state_sha256":"65060da85df6453a6ccc53c5f3d7a0080b26d5dd176f0faeb344864e2a88cfe4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYCQLgC9ksEpVt6WcGyEDfQ3Oz1L6ONag1CzuQcQn1aXjEC3MQkx24x8Cehzt3wF5BC1E0O48QFvG9KOiiu5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:37:53.005887Z","bundle_sha256":"fe8f621d2849cd13aabc2a5abb5df2517814cf49cb5efc76401102a0c5e1abbd"}}