{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DSDEMHTGQXU63J2YFJBOWY37WU","short_pith_number":"pith:DSDEMHTG","schema_version":"1.0","canonical_sha256":"1c86461e6685e9eda7582a42eb637fb523dfe17cbdd578c37fd1031dc4623202","source":{"kind":"arxiv","id":"2302.03487","version":1},"attestation_state":"computed","paper":{"title":"PIER: Permutation-Level Interest-Based End-to-End Re-ranking Framework in E-commerce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Dong Wang, Fan Yang, Guogang Liao, Muzhi Guan, Xiaowen Shi, Xiaoxu Wu, Xingxing Wang, Yongkang Wang, Ze Wang","submitted_at":"2023-02-06T09:17:52Z","abstract_excerpt":"Re-ranking draws increased attention on both academics and industries, which rearranges the ranking list by modeling the mutual influence among items to better meet users' demands. Many existing re-ranking methods directly take the initial ranking list as input, and generate the optimal permutation through a well-designed context-wise model, which brings the evaluation-before-reranking problem. Meanwhile, evaluating all candidate permutations brings unacceptable computational costs in practice. Thus, to better balance efficiency and effectiveness, online systems usually use a two-stage archite"},"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":"2302.03487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-02-06T09:17:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b22dcd9525668f13295c86d3e19db8800bdf0cce8691473fa87d8209547f0e1d","abstract_canon_sha256":"f814d16d10ec0844a421b866d4466aa5a4a69e36d93adec05729d49d72c98492"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:39:37.605168Z","signature_b64":"ra/+crkF7qAWz8Tg3jRdCwiEdy86LnL1gejVWxPfu9xAUY5GZxnpwtTtszlKg8/PdTJ/xpdVvY1CKOLD7wCIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c86461e6685e9eda7582a42eb637fb523dfe17cbdd578c37fd1031dc4623202","last_reissued_at":"2026-07-05T05:39:37.604604Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:39:37.604604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PIER: Permutation-Level Interest-Based End-to-End Re-ranking Framework in E-commerce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Dong Wang, Fan Yang, Guogang Liao, Muzhi Guan, Xiaowen Shi, Xiaoxu Wu, Xingxing Wang, Yongkang Wang, Ze Wang","submitted_at":"2023-02-06T09:17:52Z","abstract_excerpt":"Re-ranking draws increased attention on both academics and industries, which rearranges the ranking list by modeling the mutual influence among items to better meet users' demands. Many existing re-ranking methods directly take the initial ranking list as input, and generate the optimal permutation through a well-designed context-wise model, which brings the evaluation-before-reranking problem. Meanwhile, evaluating all candidate permutations brings unacceptable computational costs in practice. Thus, to better balance efficiency and effectiveness, online systems usually use a two-stage archite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03487","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/2302.03487/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":"2302.03487","created_at":"2026-07-05T05:39:37.604663+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.03487v1","created_at":"2026-07-05T05:39:37.604663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03487","created_at":"2026-07-05T05:39:37.604663+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSDEMHTGQXU6","created_at":"2026-07-05T05:39:37.604663+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSDEMHTGQXU63J2Y","created_at":"2026-07-05T05:39:37.604663+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSDEMHTG","created_at":"2026-07-05T05:39:37.604663+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/DSDEMHTGQXU63J2YFJBOWY37WU","json":"https://pith.science/pith/DSDEMHTGQXU63J2YFJBOWY37WU.json","graph_json":"https://pith.science/api/pith-number/DSDEMHTGQXU63J2YFJBOWY37WU/graph.json","events_json":"https://pith.science/api/pith-number/DSDEMHTGQXU63J2YFJBOWY37WU/events.json","paper":"https://pith.science/paper/DSDEMHTG"},"agent_actions":{"view_html":"https://pith.science/pith/DSDEMHTGQXU63J2YFJBOWY37WU","download_json":"https://pith.science/pith/DSDEMHTGQXU63J2YFJBOWY37WU.json","view_paper":"https://pith.science/paper/DSDEMHTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.03487&json=true","fetch_graph":"https://pith.science/api/pith-number/DSDEMHTGQXU63J2YFJBOWY37WU/graph.json","fetch_events":"https://pith.science/api/pith-number/DSDEMHTGQXU63J2YFJBOWY37WU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSDEMHTGQXU63J2YFJBOWY37WU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSDEMHTGQXU63J2YFJBOWY37WU/action/storage_attestation","attest_author":"https://pith.science/pith/DSDEMHTGQXU63J2YFJBOWY37WU/action/author_attestation","sign_citation":"https://pith.science/pith/DSDEMHTGQXU63J2YFJBOWY37WU/action/citation_signature","submit_replication":"https://pith.science/pith/DSDEMHTGQXU63J2YFJBOWY37WU/action/replication_record"}},"created_at":"2026-07-05T05:39:37.604663+00:00","updated_at":"2026-07-05T05:39:37.604663+00:00"}