{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ODC35LFZPBX23WSREDD26PNVHO","short_pith_number":"pith:ODC35LFZ","schema_version":"1.0","canonical_sha256":"70c5beacb9786fadda5120c7af3db53baa7be994029cc76f6928de141b7cfdcd","source":{"kind":"arxiv","id":"2508.01128","version":1},"attestation_state":"computed","paper":{"title":"Towards Bridging Review Sparsity in Recommendation with Textual Edge Graph Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Bo Ni, Leyao Wang, Nesreen K. Ahmed, Ryan A. Rossi, Tyler Derr, Xuhui Zhan, Xutao Mao, Yuying Zhao","submitted_at":"2025-08-02T00:53:40Z","abstract_excerpt":"Textual reviews enrich recommender systems with fine-grained preference signals and enhanced explainability. However, in real-world scenarios, users rarely leave reviews, resulting in severe sparsity that undermines the effectiveness of existing models. A natural solution is to impute or generate missing reviews to enrich the data. However, conventional imputation techniques -- such as matrix completion and LLM-based augmentation -- either lose contextualized semantics by embedding texts into vectors, or overlook structural dependencies among user-item interactions. To address these shortcomin"},"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":"2508.01128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-08-02T00:53:40Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"490e9c24495203437ff99ca2fe50b78ffc69d297ffb94c8b38d29ce4e02e3cbb","abstract_canon_sha256":"9d1123a1d587d8320774914d8ac177b748be5571ec5bcfa74e6db9b190ac821f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:33.480896Z","signature_b64":"kwEAJRdTaUQr5DuMFtTyyRj2Nte1atrLrxuKayVoTtw9lb8v/mchOT3nYPMvZTN+qhjYpk/J23f+ItVrSIm/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70c5beacb9786fadda5120c7af3db53baa7be994029cc76f6928de141b7cfdcd","last_reissued_at":"2026-07-05T11:47:33.480439Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:33.480439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Bridging Review Sparsity in Recommendation with Textual Edge Graph Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Bo Ni, Leyao Wang, Nesreen K. Ahmed, Ryan A. Rossi, Tyler Derr, Xuhui Zhan, Xutao Mao, Yuying Zhao","submitted_at":"2025-08-02T00:53:40Z","abstract_excerpt":"Textual reviews enrich recommender systems with fine-grained preference signals and enhanced explainability. However, in real-world scenarios, users rarely leave reviews, resulting in severe sparsity that undermines the effectiveness of existing models. A natural solution is to impute or generate missing reviews to enrich the data. However, conventional imputation techniques -- such as matrix completion and LLM-based augmentation -- either lose contextualized semantics by embedding texts into vectors, or overlook structural dependencies among user-item interactions. To address these shortcomin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01128","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.01128/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.01128","created_at":"2026-07-05T11:47:33.480496+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.01128v1","created_at":"2026-07-05T11:47:33.480496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01128","created_at":"2026-07-05T11:47:33.480496+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODC35LFZPBX2","created_at":"2026-07-05T11:47:33.480496+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODC35LFZPBX23WSR","created_at":"2026-07-05T11:47:33.480496+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODC35LFZ","created_at":"2026-07-05T11:47:33.480496+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.08011","citing_title":"Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODC35LFZPBX23WSREDD26PNVHO","json":"https://pith.science/pith/ODC35LFZPBX23WSREDD26PNVHO.json","graph_json":"https://pith.science/api/pith-number/ODC35LFZPBX23WSREDD26PNVHO/graph.json","events_json":"https://pith.science/api/pith-number/ODC35LFZPBX23WSREDD26PNVHO/events.json","paper":"https://pith.science/paper/ODC35LFZ"},"agent_actions":{"view_html":"https://pith.science/pith/ODC35LFZPBX23WSREDD26PNVHO","download_json":"https://pith.science/pith/ODC35LFZPBX23WSREDD26PNVHO.json","view_paper":"https://pith.science/paper/ODC35LFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.01128&json=true","fetch_graph":"https://pith.science/api/pith-number/ODC35LFZPBX23WSREDD26PNVHO/graph.json","fetch_events":"https://pith.science/api/pith-number/ODC35LFZPBX23WSREDD26PNVHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODC35LFZPBX23WSREDD26PNVHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODC35LFZPBX23WSREDD26PNVHO/action/storage_attestation","attest_author":"https://pith.science/pith/ODC35LFZPBX23WSREDD26PNVHO/action/author_attestation","sign_citation":"https://pith.science/pith/ODC35LFZPBX23WSREDD26PNVHO/action/citation_signature","submit_replication":"https://pith.science/pith/ODC35LFZPBX23WSREDD26PNVHO/action/replication_record"}},"created_at":"2026-07-05T11:47:33.480496+00:00","updated_at":"2026-07-05T11:47:33.480496+00:00"}