{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ERUJSMTPNVLWDTS7VDLNMRPHOA","short_pith_number":"pith:ERUJSMTP","schema_version":"1.0","canonical_sha256":"246899326f6d5761ce5fa8d6d645e770203c819a54f8e734069810b5591519ce","source":{"kind":"arxiv","id":"2005.10084","version":4},"attestation_state":"computed","paper":{"title":"Context-Aware Learning to Rank with Self-Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Jaros{\\l}aw Bojar, Miko{\\l}aj Synowiec, Przemys{\\l}aw Pobrotyn, Rados{\\l}aw Bia{\\l}obrzeski, Tomasz Bartczak","submitted_at":"2020-05-20T14:48:16Z","abstract_excerpt":"Learning to rank is a key component of many e-commerce search engines. In learning to rank, one is interested in optimising the global ordering of a list of items according to their utility for users.Popular approaches learn a scoring function that scores items individually (i.e. without the context of other items in the list) by optimising a pointwise, pairwise or listwise loss. The list is then sorted in the descending order of the scores. Possible interactions between items present in the same list are taken into account in the training phase at the loss level. However, during inference, it"},"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":"2005.10084","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-05-20T14:48:16Z","cross_cats_sorted":[],"title_canon_sha256":"d3d8689bd4508144b587be1d90447641038fe357b9df115089667ddf80b63a13","abstract_canon_sha256":"0cd6db40e988ea95d532ddef4834881f9a7e8f7f8850b45450b631ccb463d154"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:12.941862Z","signature_b64":"0Z3WHjHlUkp02xi4kyUgubHEssJT6IJZbReO8WSF9XmCH+VxyZ/AqH2jBAbvufTZM0wd7Gsd5ZpJl95hsBjrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"246899326f6d5761ce5fa8d6d645e770203c819a54f8e734069810b5591519ce","last_reissued_at":"2026-07-05T02:42:12.941424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:12.941424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Context-Aware Learning to Rank with Self-Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Jaros{\\l}aw Bojar, Miko{\\l}aj Synowiec, Przemys{\\l}aw Pobrotyn, Rados{\\l}aw Bia{\\l}obrzeski, Tomasz Bartczak","submitted_at":"2020-05-20T14:48:16Z","abstract_excerpt":"Learning to rank is a key component of many e-commerce search engines. In learning to rank, one is interested in optimising the global ordering of a list of items according to their utility for users.Popular approaches learn a scoring function that scores items individually (i.e. without the context of other items in the list) by optimising a pointwise, pairwise or listwise loss. The list is then sorted in the descending order of the scores. Possible interactions between items present in the same list are taken into account in the training phase at the loss level. However, during inference, it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.10084","kind":"arxiv","version":4},"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/2005.10084/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":"2005.10084","created_at":"2026-07-05T02:42:12.941480+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.10084v4","created_at":"2026-07-05T02:42:12.941480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.10084","created_at":"2026-07-05T02:42:12.941480+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERUJSMTPNVLW","created_at":"2026-07-05T02:42:12.941480+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERUJSMTPNVLWDTS7","created_at":"2026-07-05T02:42:12.941480+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERUJSMTP","created_at":"2026-07-05T02:42:12.941480+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.20753","citing_title":"Industry Insights from Comparing Deep Learning and GBDT Models for E-Commerce Learning-to-Rank","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ERUJSMTPNVLWDTS7VDLNMRPHOA","json":"https://pith.science/pith/ERUJSMTPNVLWDTS7VDLNMRPHOA.json","graph_json":"https://pith.science/api/pith-number/ERUJSMTPNVLWDTS7VDLNMRPHOA/graph.json","events_json":"https://pith.science/api/pith-number/ERUJSMTPNVLWDTS7VDLNMRPHOA/events.json","paper":"https://pith.science/paper/ERUJSMTP"},"agent_actions":{"view_html":"https://pith.science/pith/ERUJSMTPNVLWDTS7VDLNMRPHOA","download_json":"https://pith.science/pith/ERUJSMTPNVLWDTS7VDLNMRPHOA.json","view_paper":"https://pith.science/paper/ERUJSMTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.10084&json=true","fetch_graph":"https://pith.science/api/pith-number/ERUJSMTPNVLWDTS7VDLNMRPHOA/graph.json","fetch_events":"https://pith.science/api/pith-number/ERUJSMTPNVLWDTS7VDLNMRPHOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERUJSMTPNVLWDTS7VDLNMRPHOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERUJSMTPNVLWDTS7VDLNMRPHOA/action/storage_attestation","attest_author":"https://pith.science/pith/ERUJSMTPNVLWDTS7VDLNMRPHOA/action/author_attestation","sign_citation":"https://pith.science/pith/ERUJSMTPNVLWDTS7VDLNMRPHOA/action/citation_signature","submit_replication":"https://pith.science/pith/ERUJSMTPNVLWDTS7VDLNMRPHOA/action/replication_record"}},"created_at":"2026-07-05T02:42:12.941480+00:00","updated_at":"2026-07-05T02:42:12.941480+00:00"}