{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AR77JP4OS7FIIU3VORUVXMXGXC","short_pith_number":"pith:AR77JP4O","canonical_record":{"source":{"id":"1506.02190","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-06-06T20:13:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1415ea04336a8230dc5707ecd37163200b5e99be70c678256d708913cb892aaa","abstract_canon_sha256":"605a99e32e4598c6437671aa46cd3c16fc21ac22e9efd449c0ac7b8bcda06893"},"schema_version":"1.0"},"canonical_sha256":"047ff4bf8e97ca84537574695bb2e6b8aa52c490f5103ea4356bfc354609a8fc","source":{"kind":"arxiv","id":"1506.02190","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02190","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02190v2","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02190","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"AR77JP4OS7FI","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AR77JP4OS7FIIU3V","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AR77JP4O","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AR77JP4OS7FIIU3VORUVXMXGXC","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02190","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-06-06T20:13:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1415ea04336a8230dc5707ecd37163200b5e99be70c678256d708913cb892aaa","abstract_canon_sha256":"605a99e32e4598c6437671aa46cd3c16fc21ac22e9efd449c0ac7b8bcda06893"},"schema_version":"1.0"},"canonical_sha256":"047ff4bf8e97ca84537574695bb2e6b8aa52c490f5103ea4356bfc354609a8fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:31.563984Z","signature_b64":"c51BzhcWv4RJDJOPMZ0dkZOBf7OqASQgNweeGGHmL27jaKveM4wwM5vHDMhduPJBvQibisnFLStIbV4M2eIRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"047ff4bf8e97ca84537574695bb2e6b8aa52c490f5103ea4356bfc354609a8fc","last_reissued_at":"2026-05-18T01:27:31.563503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:31.563503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02190","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-18T01:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDA7ItEOewdXIn2509+X4q80FxoU7keODm3W9pPhzp+9zU4ndzSPeHvK6ceE7sUmcUcnM5X9KBGIk76FDm9vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:08:49.151037Z"},"content_sha256":"51bf759d03c1e9f7681397f561012f8999ae897558113339e9094d3c056232b4","schema_version":"1.0","event_id":"sha256:51bf759d03c1e9f7681397f561012f8999ae897558113339e9094d3c056232b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AR77JP4OS7FIIU3VORUVXMXGXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thresholding for Top-k Recommendation with Temporal Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Lei Tang","submitted_at":"2015-06-06T20:13:28Z","abstract_excerpt":"This work focuses on top-k recommendation in domains where underlying data distribution shifts overtime. We propose to learn a time-dependent bias for each item over whatever existing recommendation engine. Such a bias learning process alleviates data sparsity in constructing the engine, and at the same time captures recent trend shift observed in data. We present an alternating optimization framework to resolve the bias learning problem, and develop methods to handle a variety of commonly used recommendation evaluation criteria, as well as large number of items and users in practice. The prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02190","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-18T01:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXTIOeB4kiwGwK4fdCg8Cgl0y2yJpAbIxV65xeTpdFh2Oio2XAnN8m/yRk6y9kx6uWK1KOwTZZ+08gsYiOJLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:08:49.151394Z"},"content_sha256":"ce535dd3f488886933c084aba59747c810c83cf76ebb45200d4a4671a8c5ad1c","schema_version":"1.0","event_id":"sha256:ce535dd3f488886933c084aba59747c810c83cf76ebb45200d4a4671a8c5ad1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AR77JP4OS7FIIU3VORUVXMXGXC/bundle.json","state_url":"https://pith.science/pith/AR77JP4OS7FIIU3VORUVXMXGXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AR77JP4OS7FIIU3VORUVXMXGXC/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-12T09:08:49Z","links":{"resolver":"https://pith.science/pith/AR77JP4OS7FIIU3VORUVXMXGXC","bundle":"https://pith.science/pith/AR77JP4OS7FIIU3VORUVXMXGXC/bundle.json","state":"https://pith.science/pith/AR77JP4OS7FIIU3VORUVXMXGXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AR77JP4OS7FIIU3VORUVXMXGXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AR77JP4OS7FIIU3VORUVXMXGXC","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":"605a99e32e4598c6437671aa46cd3c16fc21ac22e9efd449c0ac7b8bcda06893","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-06-06T20:13:28Z","title_canon_sha256":"1415ea04336a8230dc5707ecd37163200b5e99be70c678256d708913cb892aaa"},"schema_version":"1.0","source":{"id":"1506.02190","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02190","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02190v2","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02190","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"AR77JP4OS7FI","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AR77JP4OS7FIIU3V","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AR77JP4O","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:ce535dd3f488886933c084aba59747c810c83cf76ebb45200d4a4671a8c5ad1c","target":"graph","created_at":"2026-05-18T01:27:31Z","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":"This work focuses on top-k recommendation in domains where underlying data distribution shifts overtime. We propose to learn a time-dependent bias for each item over whatever existing recommendation engine. Such a bias learning process alleviates data sparsity in constructing the engine, and at the same time captures recent trend shift observed in data. We present an alternating optimization framework to resolve the bias learning problem, and develop methods to handle a variety of commonly used recommendation evaluation criteria, as well as large number of items and users in practice. The prop","authors_text":"Lei Tang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-06-06T20:13:28Z","title":"Thresholding for Top-k Recommendation with Temporal Dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02190","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:51bf759d03c1e9f7681397f561012f8999ae897558113339e9094d3c056232b4","target":"record","created_at":"2026-05-18T01:27:31Z","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":"605a99e32e4598c6437671aa46cd3c16fc21ac22e9efd449c0ac7b8bcda06893","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-06-06T20:13:28Z","title_canon_sha256":"1415ea04336a8230dc5707ecd37163200b5e99be70c678256d708913cb892aaa"},"schema_version":"1.0","source":{"id":"1506.02190","kind":"arxiv","version":2}},"canonical_sha256":"047ff4bf8e97ca84537574695bb2e6b8aa52c490f5103ea4356bfc354609a8fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"047ff4bf8e97ca84537574695bb2e6b8aa52c490f5103ea4356bfc354609a8fc","first_computed_at":"2026-05-18T01:27:31.563503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:31.563503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c51BzhcWv4RJDJOPMZ0dkZOBf7OqASQgNweeGGHmL27jaKveM4wwM5vHDMhduPJBvQibisnFLStIbV4M2eIRDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:31.563984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02190","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51bf759d03c1e9f7681397f561012f8999ae897558113339e9094d3c056232b4","sha256:ce535dd3f488886933c084aba59747c810c83cf76ebb45200d4a4671a8c5ad1c"],"state_sha256":"37a4c4c3cdba68f07a13ecc46dd7259870a794a7fea7e02a873c87815cb4bde1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TsG5ySPp1fKC64/xav3bNRh1oQjdh6ZY7d2rBDIyNylz6wzz13ld8fVLU9FLwp9YX63vAveY0Xj++Mp0dm7OBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:08:49.154265Z","bundle_sha256":"cd082f1ca3c2b6e6e520b244087eb1f7a95a3b6f31bb4065612778291e42bf75"}}