{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TUKTHZSQ67WB3ZR6UKRNECRXDN","short_pith_number":"pith:TUKTHZSQ","schema_version":"1.0","canonical_sha256":"9d1533e650f7ec1de63ea2a2d20a371b70fc53f144705309f3171440c3d5c316","source":{"kind":"arxiv","id":"1608.07102","version":4},"attestation_state":"computed","paper":{"title":"Multi-behavioral Sequential Prediction with Recurrent Log-bilinear Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Liang Wang, Qiang Liu, Shu Wu","submitted_at":"2016-08-25T12:01:18Z","abstract_excerpt":"With the rapid growth of Internet applications, sequential prediction in collaborative filtering has become an emerging and crucial task. Given the behavioral history of a specific user, predicting his or her next choice plays a key role in improving various online services. Meanwhile, there are more and more scenarios with multiple types of behaviors, while existing works mainly study sequences with a single type of behavior. As a widely used approach, Markov chain based models are based on a strong independence assumption. As two classical neural network methods for modeling sequences, recur"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1608.07102","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-08-25T12:01:18Z","cross_cats_sorted":[],"title_canon_sha256":"ecc27d0da750c09d17d1daca5eaa23f1a7b216f72c53d23034e255369bfd2d9e","abstract_canon_sha256":"fbc039b109598ff5ad03484493dac35dd4005997e9474e8e203ddfaadd1d5df0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:59.978841Z","signature_b64":"4/HbxTR1Zx4gfTbY59rQBt0wxTa56AqQsjEx/wMHGkCowDoy1OJisnLOPYD7fCpkUqYCZOrt9Jk4Am5K9BGpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d1533e650f7ec1de63ea2a2d20a371b70fc53f144705309f3171440c3d5c316","last_reissued_at":"2026-05-18T00:51:59.978236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:59.978236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-behavioral Sequential Prediction with Recurrent Log-bilinear Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Liang Wang, Qiang Liu, Shu Wu","submitted_at":"2016-08-25T12:01:18Z","abstract_excerpt":"With the rapid growth of Internet applications, sequential prediction in collaborative filtering has become an emerging and crucial task. Given the behavioral history of a specific user, predicting his or her next choice plays a key role in improving various online services. Meanwhile, there are more and more scenarios with multiple types of behaviors, while existing works mainly study sequences with a single type of behavior. As a widely used approach, Markov chain based models are based on a strong independence assumption. As two classical neural network methods for modeling sequences, recur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07102","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.07102","created_at":"2026-05-18T00:51:59.978339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07102v4","created_at":"2026-05-18T00:51:59.978339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07102","created_at":"2026-05-18T00:51:59.978339+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUKTHZSQ67WB","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUKTHZSQ67WB3ZR6","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUKTHZSQ","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TUKTHZSQ67WB3ZR6UKRNECRXDN","json":"https://pith.science/pith/TUKTHZSQ67WB3ZR6UKRNECRXDN.json","graph_json":"https://pith.science/api/pith-number/TUKTHZSQ67WB3ZR6UKRNECRXDN/graph.json","events_json":"https://pith.science/api/pith-number/TUKTHZSQ67WB3ZR6UKRNECRXDN/events.json","paper":"https://pith.science/paper/TUKTHZSQ"},"agent_actions":{"view_html":"https://pith.science/pith/TUKTHZSQ67WB3ZR6UKRNECRXDN","download_json":"https://pith.science/pith/TUKTHZSQ67WB3ZR6UKRNECRXDN.json","view_paper":"https://pith.science/paper/TUKTHZSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07102&json=true","fetch_graph":"https://pith.science/api/pith-number/TUKTHZSQ67WB3ZR6UKRNECRXDN/graph.json","fetch_events":"https://pith.science/api/pith-number/TUKTHZSQ67WB3ZR6UKRNECRXDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUKTHZSQ67WB3ZR6UKRNECRXDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUKTHZSQ67WB3ZR6UKRNECRXDN/action/storage_attestation","attest_author":"https://pith.science/pith/TUKTHZSQ67WB3ZR6UKRNECRXDN/action/author_attestation","sign_citation":"https://pith.science/pith/TUKTHZSQ67WB3ZR6UKRNECRXDN/action/citation_signature","submit_replication":"https://pith.science/pith/TUKTHZSQ67WB3ZR6UKRNECRXDN/action/replication_record"}},"created_at":"2026-05-18T00:51:59.978339+00:00","updated_at":"2026-05-18T00:51:59.978339+00:00"}