{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UXIEM3IRD4MFDHM6JLEKPCOHNR","short_pith_number":"pith:UXIEM3IR","schema_version":"1.0","canonical_sha256":"a5d0466d111f18519d9e4ac8a789c76c7757ac8157e6a2fa60cc07b9218888c6","source":{"kind":"arxiv","id":"1605.05362","version":1},"attestation_state":"computed","paper":{"title":"Yelp Dataset Challenge: Review Rating Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.CL","authors_text":"Nabiha Asghar","submitted_at":"2016-05-17T20:52:33Z","abstract_excerpt":"Review websites, such as TripAdvisor and Yelp, allow users to post online reviews for various businesses, products and services, and have been recently shown to have a significant influence on consumer shopping behaviour. An online review typically consists of free-form text and a star rating out of 5. The problem of predicting a user's star rating for a product, given the user's text review for that product, is called Review Rating Prediction and has lately become a popular, albeit hard, problem in machine learning. In this paper, we treat Review Rating Prediction as a multi-class classificat"},"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":"1605.05362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-17T20:52:33Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"7c21cfc71e9ed252d4ab855a6b9196ad99eee7f4afcea14dbf57c5caad1174a5","abstract_canon_sha256":"4005a41cb77835c6484f1b08fd74f733a6ac0957c20e21b9cfdf62e2b7e56df0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:35.184267Z","signature_b64":"qOtFYSIZip4jFUU4AXVDImAkh5V93Ki6CLv0mEAgBrC4/QNqWyZgrRh7FKv9sTpA1rBSR/YDKhvvX/oJhVNyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5d0466d111f18519d9e4ac8a789c76c7757ac8157e6a2fa60cc07b9218888c6","last_reissued_at":"2026-05-18T01:14:35.183550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:35.183550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Yelp Dataset Challenge: Review Rating Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.CL","authors_text":"Nabiha Asghar","submitted_at":"2016-05-17T20:52:33Z","abstract_excerpt":"Review websites, such as TripAdvisor and Yelp, allow users to post online reviews for various businesses, products and services, and have been recently shown to have a significant influence on consumer shopping behaviour. An online review typically consists of free-form text and a star rating out of 5. The problem of predicting a user's star rating for a product, given the user's text review for that product, is called Review Rating Prediction and has lately become a popular, albeit hard, problem in machine learning. In this paper, we treat Review Rating Prediction as a multi-class classificat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05362","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.05362","created_at":"2026-05-18T01:14:35.183671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05362v1","created_at":"2026-05-18T01:14:35.183671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05362","created_at":"2026-05-18T01:14:35.183671+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXIEM3IRD4MF","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXIEM3IRD4MFDHM6","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXIEM3IR","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2606.20554","citing_title":"Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2606.03718","citing_title":"MARS: Multi-rate Aggregation of Recency Signals for Sequential Recommendation across Sparse and Dense Regimes","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2509.12958","citing_title":"Forget What's Sensitive, Remember What Matters: Token-Level Differential Privacy in Memory Sculpting for Continual Learning","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2505.15443","citing_title":"ALIEN: Aligned Entropy Head for Improving Uncertainty Estimation of LLMs","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2303.09014","citing_title":"ART: Automatic multi-step reasoning and tool-use for large language models","ref_index":51,"is_internal_anchor":true},{"citing_arxiv_id":"2604.04038","citing_title":"FLAME: Condensing Ensemble Diversity into a Single Network for Efficient Sequential Recommendation","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2412.05579","citing_title":"LLMs-as-Judges: A Comprehensive Survey on LLM-based Evaluation Methods","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21197","citing_title":"Toward Efficient Membership Inference Attacks against Federated Large Language Models: A Projection Residual Approach","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UXIEM3IRD4MFDHM6JLEKPCOHNR","json":"https://pith.science/pith/UXIEM3IRD4MFDHM6JLEKPCOHNR.json","graph_json":"https://pith.science/api/pith-number/UXIEM3IRD4MFDHM6JLEKPCOHNR/graph.json","events_json":"https://pith.science/api/pith-number/UXIEM3IRD4MFDHM6JLEKPCOHNR/events.json","paper":"https://pith.science/paper/UXIEM3IR"},"agent_actions":{"view_html":"https://pith.science/pith/UXIEM3IRD4MFDHM6JLEKPCOHNR","download_json":"https://pith.science/pith/UXIEM3IRD4MFDHM6JLEKPCOHNR.json","view_paper":"https://pith.science/paper/UXIEM3IR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05362&json=true","fetch_graph":"https://pith.science/api/pith-number/UXIEM3IRD4MFDHM6JLEKPCOHNR/graph.json","fetch_events":"https://pith.science/api/pith-number/UXIEM3IRD4MFDHM6JLEKPCOHNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXIEM3IRD4MFDHM6JLEKPCOHNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXIEM3IRD4MFDHM6JLEKPCOHNR/action/storage_attestation","attest_author":"https://pith.science/pith/UXIEM3IRD4MFDHM6JLEKPCOHNR/action/author_attestation","sign_citation":"https://pith.science/pith/UXIEM3IRD4MFDHM6JLEKPCOHNR/action/citation_signature","submit_replication":"https://pith.science/pith/UXIEM3IRD4MFDHM6JLEKPCOHNR/action/replication_record"}},"created_at":"2026-05-18T01:14:35.183671+00:00","updated_at":"2026-05-18T01:14:35.183671+00:00"}