{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VQCZOZGBT7F22I5I6UQXRE6YMH","short_pith_number":"pith:VQCZOZGB","schema_version":"1.0","canonical_sha256":"ac059764c19fcbad23a8f5217893d861f15a0b887047dd9b6cfc8c4adb1601a9","source":{"kind":"arxiv","id":"2508.14420","version":1},"attestation_state":"computed","paper":{"title":"You Only Evaluate Once: A Tree-based Rerank Method at Meituan","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Changhao Li, Haitao Wang, Shuli Wang, Xingxing Wang, Yinhua Zhu, Yinqiu Huang, Yonggang Liu, Yongqiang Zhang, Yuan Zhou","submitted_at":"2025-08-20T04:36:25Z","abstract_excerpt":"Reranking plays a crucial role in modern recommender systems by capturing the mutual influences within the list. Due to the inherent challenges of combinatorial search spaces, most methods adopt a two-stage search paradigm: a simple General Search Unit (GSU) efficiently reduces the candidate space, and an Exact Search Unit (ESU) effectively selects the optimal sequence. These methods essentially involve making trade-offs between effectiveness and efficiency, while suffering from a severe \\textbf{inconsistency problem}, that is, the GSU often misses high-value lists from ESU. To address this pr"},"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.14420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-08-20T04:36:25Z","cross_cats_sorted":[],"title_canon_sha256":"1217280b20ed892aa98e7261ca190549143bc5d25cc2dde04f92102ca253d3e4","abstract_canon_sha256":"90ba2bca35ce4a7f2b4a7aa5fcf0595060c16d28117ed5458a2e3954537d4cf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:31.599188Z","signature_b64":"Hq4Yz5IXKQs2XAAnc+a3trcYZRPZoFXFsEU1XmKQG+Y6olxE611/przy99WT7HPxxOgmSFv8+jyhqpXkZoDADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac059764c19fcbad23a8f5217893d861f15a0b887047dd9b6cfc8c4adb1601a9","last_reissued_at":"2026-07-05T11:56:31.598818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:31.598818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"You Only Evaluate Once: A Tree-based Rerank Method at Meituan","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Changhao Li, Haitao Wang, Shuli Wang, Xingxing Wang, Yinhua Zhu, Yinqiu Huang, Yonggang Liu, Yongqiang Zhang, Yuan Zhou","submitted_at":"2025-08-20T04:36:25Z","abstract_excerpt":"Reranking plays a crucial role in modern recommender systems by capturing the mutual influences within the list. Due to the inherent challenges of combinatorial search spaces, most methods adopt a two-stage search paradigm: a simple General Search Unit (GSU) efficiently reduces the candidate space, and an Exact Search Unit (ESU) effectively selects the optimal sequence. These methods essentially involve making trade-offs between effectiveness and efficiency, while suffering from a severe \\textbf{inconsistency problem}, that is, the GSU often misses high-value lists from ESU. To address this pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14420","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.14420/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.14420","created_at":"2026-07-05T11:56:31.598873+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14420v1","created_at":"2026-07-05T11:56:31.598873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14420","created_at":"2026-07-05T11:56:31.598873+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQCZOZGBT7F2","created_at":"2026-07-05T11:56:31.598873+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQCZOZGBT7F22I5I","created_at":"2026-07-05T11:56:31.598873+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQCZOZGB","created_at":"2026-07-05T11:56:31.598873+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05314","citing_title":"Next-Scale Generative Reranking: A Tree-based Generative Rerank Method at Meituan","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQCZOZGBT7F22I5I6UQXRE6YMH","json":"https://pith.science/pith/VQCZOZGBT7F22I5I6UQXRE6YMH.json","graph_json":"https://pith.science/api/pith-number/VQCZOZGBT7F22I5I6UQXRE6YMH/graph.json","events_json":"https://pith.science/api/pith-number/VQCZOZGBT7F22I5I6UQXRE6YMH/events.json","paper":"https://pith.science/paper/VQCZOZGB"},"agent_actions":{"view_html":"https://pith.science/pith/VQCZOZGBT7F22I5I6UQXRE6YMH","download_json":"https://pith.science/pith/VQCZOZGBT7F22I5I6UQXRE6YMH.json","view_paper":"https://pith.science/paper/VQCZOZGB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14420&json=true","fetch_graph":"https://pith.science/api/pith-number/VQCZOZGBT7F22I5I6UQXRE6YMH/graph.json","fetch_events":"https://pith.science/api/pith-number/VQCZOZGBT7F22I5I6UQXRE6YMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQCZOZGBT7F22I5I6UQXRE6YMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQCZOZGBT7F22I5I6UQXRE6YMH/action/storage_attestation","attest_author":"https://pith.science/pith/VQCZOZGBT7F22I5I6UQXRE6YMH/action/author_attestation","sign_citation":"https://pith.science/pith/VQCZOZGBT7F22I5I6UQXRE6YMH/action/citation_signature","submit_replication":"https://pith.science/pith/VQCZOZGBT7F22I5I6UQXRE6YMH/action/replication_record"}},"created_at":"2026-07-05T11:56:31.598873+00:00","updated_at":"2026-07-05T11:56:31.598873+00:00"}