{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OZWAN5BPBTS5GDG5BW6NN3NEJC","short_pith_number":"pith:OZWAN5BP","canonical_record":{"source":{"id":"1206.3320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-06-14T20:23:24Z","cross_cats_sorted":[],"title_canon_sha256":"c3cc25777f0618191fffa940c46b7476a7d392ba447cfff19ea8cd1413351286","abstract_canon_sha256":"817d280c2d9432a057576e73c8b76e3e65c5f6664217cd6526d115ce213fa4ab"},"schema_version":"1.0"},"canonical_sha256":"766c06f42f0ce5d30cdd0dbcd6eda44883899357c9554948b738b5ae35c51373","source":{"kind":"arxiv","id":"1206.3320","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3320","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3320v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3320","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"OZWAN5BPBTS5","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OZWAN5BPBTS5GDG5","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OZWAN5BP","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OZWAN5BPBTS5GDG5BW6NN3NEJC","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-06-14T20:23:24Z","cross_cats_sorted":[],"title_canon_sha256":"c3cc25777f0618191fffa940c46b7476a7d392ba447cfff19ea8cd1413351286","abstract_canon_sha256":"817d280c2d9432a057576e73c8b76e3e65c5f6664217cd6526d115ce213fa4ab"},"schema_version":"1.0"},"canonical_sha256":"766c06f42f0ce5d30cdd0dbcd6eda44883899357c9554948b738b5ae35c51373","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:30.623058Z","signature_b64":"m3PRjBQ88zc8V0flIYoB3mFQyAg6lQAsadINKJZD4VepWiAm22lR8PJFe1kvHEUX9Pdx9iZaxXyBuyIvNy8lAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"766c06f42f0ce5d30cdd0dbcd6eda44883899357c9554948b738b5ae35c51373","last_reissued_at":"2026-05-18T03:53:30.622520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:30.622520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3320","source_version":1,"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-18T03:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HhI+sBObIODJUeOeqLhoeLblLZrOITxjsmY4Dg2WPQVm/4vuTuX0RxCfM9Rx53vWoRgEK2nexSHL02ZCm8DsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:51:44.776354Z"},"content_sha256":"f24623620ed1379b1dc8e8d120c554003434ccfb1cf78dce8a48e28bc63dc83d","schema_version":"1.0","event_id":"sha256:f24623620ed1379b1dc8e8d120c554003434ccfb1cf78dce8a48e28bc63dc83d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OZWAN5BPBTS5GDG5BW6NN3NEJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A two-step Recommendation Algorithm via Iterative Local Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chengcheng Yang, Jinhu Liu, Zi-Ke Zhang","submitted_at":"2012-06-14T20:23:24Z","abstract_excerpt":"Recommender systems can change our life a lot and help us select suitable and favorite items much more conveniently and easily. As a consequence, various kinds of algorithms have been proposed in last few years to improve the performance. However, all of them face one critical problem: data sparsity. In this paper, we proposed a two-step recommendation algorithm via iterative local least squares (ILLS). Firstly, we obtain the ratings matrix which is constructed via users' behavioral records, and it is normally very sparse. Secondly, we preprocess the \"ratings\" matrix through ProbS which can co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3320","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"},"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-18T03:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wkUKpk2pDWKjmzyo7ic/RuAPdIoRe/YGux3SAlpfalvEVKuSmYhMDrIaE60cS4TrdUx9/ZKvXxA74Z0bOOP6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:51:44.777054Z"},"content_sha256":"8d612c2516fa606c35aea290b565a0ad6f0c0c9e74bcbfcf44e422c7a1b7be21","schema_version":"1.0","event_id":"sha256:8d612c2516fa606c35aea290b565a0ad6f0c0c9e74bcbfcf44e422c7a1b7be21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZWAN5BPBTS5GDG5BW6NN3NEJC/bundle.json","state_url":"https://pith.science/pith/OZWAN5BPBTS5GDG5BW6NN3NEJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZWAN5BPBTS5GDG5BW6NN3NEJC/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-29T14:51:44Z","links":{"resolver":"https://pith.science/pith/OZWAN5BPBTS5GDG5BW6NN3NEJC","bundle":"https://pith.science/pith/OZWAN5BPBTS5GDG5BW6NN3NEJC/bundle.json","state":"https://pith.science/pith/OZWAN5BPBTS5GDG5BW6NN3NEJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZWAN5BPBTS5GDG5BW6NN3NEJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OZWAN5BPBTS5GDG5BW6NN3NEJC","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":"817d280c2d9432a057576e73c8b76e3e65c5f6664217cd6526d115ce213fa4ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-06-14T20:23:24Z","title_canon_sha256":"c3cc25777f0618191fffa940c46b7476a7d392ba447cfff19ea8cd1413351286"},"schema_version":"1.0","source":{"id":"1206.3320","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3320","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3320v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3320","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"OZWAN5BPBTS5","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OZWAN5BPBTS5GDG5","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OZWAN5BP","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:8d612c2516fa606c35aea290b565a0ad6f0c0c9e74bcbfcf44e422c7a1b7be21","target":"graph","created_at":"2026-05-18T03:53:30Z","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":"Recommender systems can change our life a lot and help us select suitable and favorite items much more conveniently and easily. As a consequence, various kinds of algorithms have been proposed in last few years to improve the performance. However, all of them face one critical problem: data sparsity. In this paper, we proposed a two-step recommendation algorithm via iterative local least squares (ILLS). Firstly, we obtain the ratings matrix which is constructed via users' behavioral records, and it is normally very sparse. Secondly, we preprocess the \"ratings\" matrix through ProbS which can co","authors_text":"Chengcheng Yang, Jinhu Liu, Zi-Ke Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-06-14T20:23:24Z","title":"A two-step Recommendation Algorithm via Iterative Local Least Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3320","kind":"arxiv","version":1},"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:f24623620ed1379b1dc8e8d120c554003434ccfb1cf78dce8a48e28bc63dc83d","target":"record","created_at":"2026-05-18T03:53:30Z","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":"817d280c2d9432a057576e73c8b76e3e65c5f6664217cd6526d115ce213fa4ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-06-14T20:23:24Z","title_canon_sha256":"c3cc25777f0618191fffa940c46b7476a7d392ba447cfff19ea8cd1413351286"},"schema_version":"1.0","source":{"id":"1206.3320","kind":"arxiv","version":1}},"canonical_sha256":"766c06f42f0ce5d30cdd0dbcd6eda44883899357c9554948b738b5ae35c51373","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"766c06f42f0ce5d30cdd0dbcd6eda44883899357c9554948b738b5ae35c51373","first_computed_at":"2026-05-18T03:53:30.622520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:30.622520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m3PRjBQ88zc8V0flIYoB3mFQyAg6lQAsadINKJZD4VepWiAm22lR8PJFe1kvHEUX9Pdx9iZaxXyBuyIvNy8lAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:30.623058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3320","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f24623620ed1379b1dc8e8d120c554003434ccfb1cf78dce8a48e28bc63dc83d","sha256:8d612c2516fa606c35aea290b565a0ad6f0c0c9e74bcbfcf44e422c7a1b7be21"],"state_sha256":"de80ddf740dfa4a40eb70c867b868d1025b392d046afdbac03b480041b25c5f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y8lj58h54kqy3Fw8jHw+SYQY9iCjO565UDGMJ0uHfaCgkbLFpsfHoMUXe3LLazpbP/o4Cqiu6e8+5mCpJPayBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:51:44.780738Z","bundle_sha256":"d9c2ac908812aff8113b9db264cf1d58d955c177d0804074e2fe66649199fdd7"}}