{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LSETJ2CEJTMQFGARHNNT3R2O5X","short_pith_number":"pith:LSETJ2CE","canonical_record":{"source":{"id":"1608.03333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-11T00:48:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"964ffab00ea1043effbd7cdaa26d73f6ebafb2220e3095b3ae55645e1762ee99","abstract_canon_sha256":"1555e818814239bc0e40dc033d7172e72e6cb1883c851a89cd911af3e795ec6c"},"schema_version":"1.0"},"canonical_sha256":"5c8934e8444cd90298113b5b3dc74eede8a80c3b1c430537e6769034d1c1f77a","source":{"kind":"arxiv","id":"1608.03333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03333","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03333v1","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03333","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"LSETJ2CEJTMQ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSETJ2CEJTMQFGAR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSETJ2CE","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LSETJ2CEJTMQFGARHNNT3R2O5X","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-11T00:48:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"964ffab00ea1043effbd7cdaa26d73f6ebafb2220e3095b3ae55645e1762ee99","abstract_canon_sha256":"1555e818814239bc0e40dc033d7172e72e6cb1883c851a89cd911af3e795ec6c"},"schema_version":"1.0"},"canonical_sha256":"5c8934e8444cd90298113b5b3dc74eede8a80c3b1c430537e6769034d1c1f77a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:06.014296Z","signature_b64":"H7c+r1iDcEhddoAJCDKMhdjXACwSeoNJWru3q+XvGQLd6yzSmTiOtd7DI+DgzC7sSYZ56rG+SK4EN8PUwUVeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c8934e8444cd90298113b5b3dc74eede8a80c3b1c430537e6769034d1c1f77a","last_reissued_at":"2026-05-18T01:09:06.013878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:06.013878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03333","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-18T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLLkMKMAwTD5MEqwMlAg7rispzrlGycnRBnxxEodYgCcl9OnlkYDnGBIq18K8l4NQcnCNrY6l+/fOLeFbsZ3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:18:52.938557Z"},"content_sha256":"f613c07ab48e835350238b8f0b82ce63e13a51ee68fb396adf319da976104a04","schema_version":"1.0","event_id":"sha256:f613c07ab48e835350238b8f0b82ce63e13a51ee68fb396adf319da976104a04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LSETJ2CEJTMQFGARHNNT3R2O5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Temporal Learning and Sequence Modeling for a Job Recommender System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anoop Kumar, Kuan Liu, Linhong Zhu, Prem Natarajan, Xing Shi","submitted_at":"2016-08-11T00:48:00Z","abstract_excerpt":"We present our solution to the job recommendation task for RecSys Challenge 2016. The main contribution of our work is to combine temporal learning with sequence modeling to capture complex user-item activity patterns to improve job recommendations. First, we propose a time-based ranking model applied to historical observations and a hybrid matrix factorization over time re-weighted interactions. Second, we exploit sequence properties in user-items activities and develop a RNN-based recommendation model. Our solution achieved 5$^{th}$ place in the challenge among more than 100 participants. No"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03333","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-18T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNaZUxOoxBFdyW1rj/y/sbrlNH37B6fdQu4u8/kincCwIRIa4r5nCXuvmjkAMv7HODnAK+/hbhh4mmSXJAwCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:18:52.938903Z"},"content_sha256":"f92da7e74d65c670d4d46cd0b279271a6b27cfacaa87ac4e7edeff8d8fdb5ff7","schema_version":"1.0","event_id":"sha256:f92da7e74d65c670d4d46cd0b279271a6b27cfacaa87ac4e7edeff8d8fdb5ff7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSETJ2CEJTMQFGARHNNT3R2O5X/bundle.json","state_url":"https://pith.science/pith/LSETJ2CEJTMQFGARHNNT3R2O5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSETJ2CEJTMQFGARHNNT3R2O5X/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-02T04:18:52Z","links":{"resolver":"https://pith.science/pith/LSETJ2CEJTMQFGARHNNT3R2O5X","bundle":"https://pith.science/pith/LSETJ2CEJTMQFGARHNNT3R2O5X/bundle.json","state":"https://pith.science/pith/LSETJ2CEJTMQFGARHNNT3R2O5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSETJ2CEJTMQFGARHNNT3R2O5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LSETJ2CEJTMQFGARHNNT3R2O5X","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":"1555e818814239bc0e40dc033d7172e72e6cb1883c851a89cd911af3e795ec6c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-11T00:48:00Z","title_canon_sha256":"964ffab00ea1043effbd7cdaa26d73f6ebafb2220e3095b3ae55645e1762ee99"},"schema_version":"1.0","source":{"id":"1608.03333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03333","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03333v1","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03333","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"LSETJ2CEJTMQ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSETJ2CEJTMQFGAR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSETJ2CE","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:f92da7e74d65c670d4d46cd0b279271a6b27cfacaa87ac4e7edeff8d8fdb5ff7","target":"graph","created_at":"2026-05-18T01:09:06Z","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 present our solution to the job recommendation task for RecSys Challenge 2016. The main contribution of our work is to combine temporal learning with sequence modeling to capture complex user-item activity patterns to improve job recommendations. First, we propose a time-based ranking model applied to historical observations and a hybrid matrix factorization over time re-weighted interactions. Second, we exploit sequence properties in user-items activities and develop a RNN-based recommendation model. Our solution achieved 5$^{th}$ place in the challenge among more than 100 participants. No","authors_text":"Anoop Kumar, Kuan Liu, Linhong Zhu, Prem Natarajan, Xing Shi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-11T00:48:00Z","title":"Temporal Learning and Sequence Modeling for a Job Recommender System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03333","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:f613c07ab48e835350238b8f0b82ce63e13a51ee68fb396adf319da976104a04","target":"record","created_at":"2026-05-18T01:09:06Z","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":"1555e818814239bc0e40dc033d7172e72e6cb1883c851a89cd911af3e795ec6c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-11T00:48:00Z","title_canon_sha256":"964ffab00ea1043effbd7cdaa26d73f6ebafb2220e3095b3ae55645e1762ee99"},"schema_version":"1.0","source":{"id":"1608.03333","kind":"arxiv","version":1}},"canonical_sha256":"5c8934e8444cd90298113b5b3dc74eede8a80c3b1c430537e6769034d1c1f77a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c8934e8444cd90298113b5b3dc74eede8a80c3b1c430537e6769034d1c1f77a","first_computed_at":"2026-05-18T01:09:06.013878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:06.013878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H7c+r1iDcEhddoAJCDKMhdjXACwSeoNJWru3q+XvGQLd6yzSmTiOtd7DI+DgzC7sSYZ56rG+SK4EN8PUwUVeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:06.014296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f613c07ab48e835350238b8f0b82ce63e13a51ee68fb396adf319da976104a04","sha256:f92da7e74d65c670d4d46cd0b279271a6b27cfacaa87ac4e7edeff8d8fdb5ff7"],"state_sha256":"a5a0276652e3d83d96a7b9c8f45ceba396c1eed034cc6404b8580668a930d915"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6F1rUAQtAM1GEujHpiIRQZ+qRGcKYnQig2kcqERL05yvczIIGaM0yMfySHPlTZhFT8Ygsht7nZeMF6WNx+pgBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:18:52.940854Z","bundle_sha256":"70821bcc74c084df97033386acf06f1535e7891a31abe2a2f891937b00401c14"}}