{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Z2WO5RCZIZESJGRCH3V4RZPL57","short_pith_number":"pith:Z2WO5RCZ","schema_version":"1.0","canonical_sha256":"ceaceec4594649249a223eebc8e5ebefe577c29e532ffd40e46d71a3a915fa81","source":{"kind":"arxiv","id":"2603.02565","version":2},"attestation_state":"computed","paper":{"title":"FlashEvaluator: Expanding Search Space with Parallel Sequence-Level Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Chao Feng, Chenghao Zhang, Chunjie Chen, Kaiqiao Zhan, Shanqi Liu, Shuchang Liu, Xiang Li, Yuanhao Pu","submitted_at":"2026-03-03T03:35:34Z","abstract_excerpt":"The Generator-Evaluator (G-E) framework generates K candidate sequences and uses an evaluator to select the highest-scoring one, which is widely used in recommender systems (RecSys) and natural language processing (NLP). Existing evaluators commonly score candidates independently. Although such evaluations can be batched, independent scoring neither models interactions among candidates nor eliminates repeated computation of request-level context and recurring candidate elements, causing the total evaluation work to grow approximately linearly with K. To handle with, we propose FlashEvaluator, "},"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":"2603.02565","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-03-03T03:35:34Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"b59b58a9119728a57f66dedaa2399d333e75e817b73f77592324d8d0835c48ba","abstract_canon_sha256":"033aac108e643064401ccaedc4129a042c6961c0ae0ef87f92c088465fc9e50d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:24:30.268836Z","signature_b64":"GdSs3tXMYyWnkZ2hZilio5rU2tkx2PkFQcwOz6dinAcVDHYpOQrgwtKMM3tq7e86iPpXphcx9v3KUCRENaU7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceaceec4594649249a223eebc8e5ebefe577c29e532ffd40e46d71a3a915fa81","last_reissued_at":"2026-07-29T01:24:30.267906Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:24:30.267906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FlashEvaluator: Expanding Search Space with Parallel Sequence-Level Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Chao Feng, Chenghao Zhang, Chunjie Chen, Kaiqiao Zhan, Shanqi Liu, Shuchang Liu, Xiang Li, Yuanhao Pu","submitted_at":"2026-03-03T03:35:34Z","abstract_excerpt":"The Generator-Evaluator (G-E) framework generates K candidate sequences and uses an evaluator to select the highest-scoring one, which is widely used in recommender systems (RecSys) and natural language processing (NLP). Existing evaluators commonly score candidates independently. Although such evaluations can be batched, independent scoring neither models interactions among candidates nor eliminates repeated computation of request-level context and recurring candidate elements, causing the total evaluation work to grow approximately linearly with K. To handle with, we propose FlashEvaluator, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.02565","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/2603.02565/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":"2603.02565","created_at":"2026-07-29T01:24:30.268337+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.02565v2","created_at":"2026-07-29T01:24:30.268337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.02565","created_at":"2026-07-29T01:24:30.268337+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2WO5RCZIZES","created_at":"2026-07-29T01:24:30.268337+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2WO5RCZIZESJGRC","created_at":"2026-07-29T01:24:30.268337+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2WO5RCZ","created_at":"2026-07-29T01:24:30.268337+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/Z2WO5RCZIZESJGRCH3V4RZPL57","json":"https://pith.science/pith/Z2WO5RCZIZESJGRCH3V4RZPL57.json","graph_json":"https://pith.science/api/pith-number/Z2WO5RCZIZESJGRCH3V4RZPL57/graph.json","events_json":"https://pith.science/api/pith-number/Z2WO5RCZIZESJGRCH3V4RZPL57/events.json","paper":"https://pith.science/paper/Z2WO5RCZ"},"agent_actions":{"view_html":"https://pith.science/pith/Z2WO5RCZIZESJGRCH3V4RZPL57","download_json":"https://pith.science/pith/Z2WO5RCZIZESJGRCH3V4RZPL57.json","view_paper":"https://pith.science/paper/Z2WO5RCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.02565&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2WO5RCZIZESJGRCH3V4RZPL57/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2WO5RCZIZESJGRCH3V4RZPL57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2WO5RCZIZESJGRCH3V4RZPL57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2WO5RCZIZESJGRCH3V4RZPL57/action/storage_attestation","attest_author":"https://pith.science/pith/Z2WO5RCZIZESJGRCH3V4RZPL57/action/author_attestation","sign_citation":"https://pith.science/pith/Z2WO5RCZIZESJGRCH3V4RZPL57/action/citation_signature","submit_replication":"https://pith.science/pith/Z2WO5RCZIZESJGRCH3V4RZPL57/action/replication_record"}},"created_at":"2026-07-29T01:24:30.268337+00:00","updated_at":"2026-07-29T01:24:30.268337+00:00"}