{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3ZY4DAJQBZLSKV6GRU236RLDLJ","short_pith_number":"pith:3ZY4DAJQ","schema_version":"1.0","canonical_sha256":"de71c181300e572557c68d35bf45635a558f9e2b682228ab6f73a5619433ed27","source":{"kind":"arxiv","id":"2104.00860","version":2},"attestation_state":"computed","paper":{"title":"GRN: Generative Rerank Network for Context-wise Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"BinBin Hu, Fei Sun, Qingwen Liu, Wenwu Ou, Yufei Feng, Yu Gong","submitted_at":"2021-04-02T02:40:23Z","abstract_excerpt":"Reranking is attracting incremental attention in the recommender systems, which rearranges the input ranking list into the final rank-ing list to better meet user demands. Most existing methods greedily rerank candidates through the rating scores from point-wise or list-wise models. Despite effectiveness, neglecting the mutual influence between each item and its contexts in the final ranking list often makes the greedy strategy based reranking methods sub-optimal. In this work, we propose a new context-wise reranking framework named Generative Rerank Network (GRN). Specifically, we first desig"},"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":"2104.00860","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-04-02T02:40:23Z","cross_cats_sorted":[],"title_canon_sha256":"1c18c149ada7229454c983763511629ffc0c07c878a76fde9a19b66f3d65656e","abstract_canon_sha256":"0ec8cc6bcd41887f80b2046d4423482b1ef4f152f889238f63976d462ba8fa39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:29:58.364249Z","signature_b64":"7kbSgNuqjCQsA9DHaHbKRQzaVDpYDp+QdyZsM8bDU5ult375w4z/Tp3bY+VGaufDDJpn/lkbDtCrqDzVcfGeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de71c181300e572557c68d35bf45635a558f9e2b682228ab6f73a5619433ed27","last_reissued_at":"2026-07-05T02:29:58.363779Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:29:58.363779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GRN: Generative Rerank Network for Context-wise Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"BinBin Hu, Fei Sun, Qingwen Liu, Wenwu Ou, Yufei Feng, Yu Gong","submitted_at":"2021-04-02T02:40:23Z","abstract_excerpt":"Reranking is attracting incremental attention in the recommender systems, which rearranges the input ranking list into the final rank-ing list to better meet user demands. Most existing methods greedily rerank candidates through the rating scores from point-wise or list-wise models. Despite effectiveness, neglecting the mutual influence between each item and its contexts in the final ranking list often makes the greedy strategy based reranking methods sub-optimal. In this work, we propose a new context-wise reranking framework named Generative Rerank Network (GRN). Specifically, we first desig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.00860","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.00860/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":"2104.00860","created_at":"2026-07-05T02:29:58.363836+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.00860v2","created_at":"2026-07-05T02:29:58.363836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.00860","created_at":"2026-07-05T02:29:58.363836+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZY4DAJQBZLS","created_at":"2026-07-05T02:29:58.363836+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZY4DAJQBZLSKV6G","created_at":"2026-07-05T02:29:58.363836+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZY4DAJQ","created_at":"2026-07-05T02:29:58.363836+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25749","citing_title":"DeGRe: Dense-supervised Generative Reranking for Recommendation","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2602.03324","citing_title":"SCASRec: A Self-Correcting and Auto-Stopping Model for Generative Route List Recommendation","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2602.05408","citing_title":"Rich-Media Re-Ranker: A User Satisfaction-Driven LLM Re-ranking Framework for Rich-Media Search","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07420","citing_title":"Dual-Rerank: Fusing Causality and Utility for Industrial Generative Reranking","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05314","citing_title":"Next-Scale Generative Reranking: A Tree-based Generative Rerank Method at Meituan","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3ZY4DAJQBZLSKV6GRU236RLDLJ","json":"https://pith.science/pith/3ZY4DAJQBZLSKV6GRU236RLDLJ.json","graph_json":"https://pith.science/api/pith-number/3ZY4DAJQBZLSKV6GRU236RLDLJ/graph.json","events_json":"https://pith.science/api/pith-number/3ZY4DAJQBZLSKV6GRU236RLDLJ/events.json","paper":"https://pith.science/paper/3ZY4DAJQ"},"agent_actions":{"view_html":"https://pith.science/pith/3ZY4DAJQBZLSKV6GRU236RLDLJ","download_json":"https://pith.science/pith/3ZY4DAJQBZLSKV6GRU236RLDLJ.json","view_paper":"https://pith.science/paper/3ZY4DAJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.00860&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZY4DAJQBZLSKV6GRU236RLDLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZY4DAJQBZLSKV6GRU236RLDLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZY4DAJQBZLSKV6GRU236RLDLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZY4DAJQBZLSKV6GRU236RLDLJ/action/storage_attestation","attest_author":"https://pith.science/pith/3ZY4DAJQBZLSKV6GRU236RLDLJ/action/author_attestation","sign_citation":"https://pith.science/pith/3ZY4DAJQBZLSKV6GRU236RLDLJ/action/citation_signature","submit_replication":"https://pith.science/pith/3ZY4DAJQBZLSKV6GRU236RLDLJ/action/replication_record"}},"created_at":"2026-07-05T02:29:58.363836+00:00","updated_at":"2026-07-05T02:29:58.363836+00:00"}