{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:B3SLVA6HSVCIQJ3HURPA3CEUN2","short_pith_number":"pith:B3SLVA6H","schema_version":"1.0","canonical_sha256":"0ee4ba83c79544882767a45e0d88946ea43d5fbee12e2609896c983500bfb2ef","source":{"kind":"arxiv","id":"2402.06871","version":6},"attestation_state":"computed","paper":{"title":"Non-autoregressive Generative Models for Reranking Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Qiya Yang, Wei Xu, Yalong Wang, Yichun Wu, Yuxin Ren, Zhiqiang Zhang","submitted_at":"2024-02-10T03:21:13Z","abstract_excerpt":"Contemporary recommendation systems are designed to meet users' needs by delivering tailored lists of items that align with their specific demands or interests. In a multi-stage recommendation system, reranking plays a crucial role by modeling the intra-list correlations among items. The key challenge of reranking lies in the exploration of optimal sequences within the combinatorial space of permutations. Recent research proposes a generator-evaluator learning paradigm, where the generator generates multiple feasible sequences and the evaluator picks out the best sequence based on the estimate"},"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":"2402.06871","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-02-10T03:21:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e11683f022b77511c0c4e36cdf7a8724d3480ee62e2af16f401e55e3d4947421","abstract_canon_sha256":"c25ba0585bc1126a09f00eb4147b8f33791e1048c78b46bafd0ea3f01aa6261a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:31.990943Z","signature_b64":"wc/vnSWX1GQV/2Nka+aTV+7XZbHDXYZtI6gDPsQqv4yGYSIpGdfwsWSSyP4fav06iSkDGAotK6AbRnH7hKwbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ee4ba83c79544882767a45e0d88946ea43d5fbee12e2609896c983500bfb2ef","last_reissued_at":"2026-07-05T10:38:31.990519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:31.990519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-autoregressive Generative Models for Reranking Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Qiya Yang, Wei Xu, Yalong Wang, Yichun Wu, Yuxin Ren, Zhiqiang Zhang","submitted_at":"2024-02-10T03:21:13Z","abstract_excerpt":"Contemporary recommendation systems are designed to meet users' needs by delivering tailored lists of items that align with their specific demands or interests. In a multi-stage recommendation system, reranking plays a crucial role by modeling the intra-list correlations among items. The key challenge of reranking lies in the exploration of optimal sequences within the combinatorial space of permutations. Recent research proposes a generator-evaluator learning paradigm, where the generator generates multiple feasible sequences and the evaluator picks out the best sequence based on the estimate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.06871","kind":"arxiv","version":6},"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/2402.06871/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":"2402.06871","created_at":"2026-07-05T10:38:31.990573+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.06871v6","created_at":"2026-07-05T10:38:31.990573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.06871","created_at":"2026-07-05T10:38:31.990573+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3SLVA6HSVCI","created_at":"2026-07-05T10:38:31.990573+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3SLVA6HSVCIQJ3H","created_at":"2026-07-05T10:38:31.990573+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3SLVA6H","created_at":"2026-07-05T10:38:31.990573+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/B3SLVA6HSVCIQJ3HURPA3CEUN2","json":"https://pith.science/pith/B3SLVA6HSVCIQJ3HURPA3CEUN2.json","graph_json":"https://pith.science/api/pith-number/B3SLVA6HSVCIQJ3HURPA3CEUN2/graph.json","events_json":"https://pith.science/api/pith-number/B3SLVA6HSVCIQJ3HURPA3CEUN2/events.json","paper":"https://pith.science/paper/B3SLVA6H"},"agent_actions":{"view_html":"https://pith.science/pith/B3SLVA6HSVCIQJ3HURPA3CEUN2","download_json":"https://pith.science/pith/B3SLVA6HSVCIQJ3HURPA3CEUN2.json","view_paper":"https://pith.science/paper/B3SLVA6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.06871&json=true","fetch_graph":"https://pith.science/api/pith-number/B3SLVA6HSVCIQJ3HURPA3CEUN2/graph.json","fetch_events":"https://pith.science/api/pith-number/B3SLVA6HSVCIQJ3HURPA3CEUN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3SLVA6HSVCIQJ3HURPA3CEUN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3SLVA6HSVCIQJ3HURPA3CEUN2/action/storage_attestation","attest_author":"https://pith.science/pith/B3SLVA6HSVCIQJ3HURPA3CEUN2/action/author_attestation","sign_citation":"https://pith.science/pith/B3SLVA6HSVCIQJ3HURPA3CEUN2/action/citation_signature","submit_replication":"https://pith.science/pith/B3SLVA6HSVCIQJ3HURPA3CEUN2/action/replication_record"}},"created_at":"2026-07-05T10:38:31.990573+00:00","updated_at":"2026-07-05T10:38:31.990573+00:00"}