{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HJWAFJQJ3JBKWZDECU3SCFBUKB","short_pith_number":"pith:HJWAFJQJ","schema_version":"1.0","canonical_sha256":"3a6c02a609da42ab646415372114345059caf255e0d09902810fe5557df8f192","source":{"kind":"arxiv","id":"2102.11903","version":2},"attestation_state":"computed","paper":{"title":"Neural ranking models for document retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Brian D. Davison, Jeff Heflin, Mohamed Trabelsi, Zhiyu Chen","submitted_at":"2021-02-23T19:30:37Z","abstract_excerpt":"Ranking models are the main components of information retrieval systems. Several approaches to ranking are based on traditional machine learning algorithms using a set of hand-crafted features. Recently, researchers have leveraged deep learning models in information retrieval. These models are trained end-to-end to extract features from the raw data for ranking tasks, so that they overcome the limitations of hand-crafted features. A variety of deep learning models have been proposed, and each model presents a set of neural network components to extract features that are used for ranking. In th"},"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":"2102.11903","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-02-23T19:30:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"000bce2c4c91cc68416cfb7b15be33c1d536208ddc99d078c2663b2e868b0466","abstract_canon_sha256":"37762144128b10e3f55e70b9e7dce5dad12fad48b974039c0087c37222f5b86c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:56.466419Z","signature_b64":"h+sc50PpLUF58nAOJhB3Ae5mhig6CPxxQVxtJxd07QpCs+tFv8NDwaw3q+PKYZ+4lo42C3mtbZgc/Gp76fQWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a6c02a609da42ab646415372114345059caf255e0d09902810fe5557df8f192","last_reissued_at":"2026-07-05T03:27:56.465918Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:56.465918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural ranking models for document retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Brian D. Davison, Jeff Heflin, Mohamed Trabelsi, Zhiyu Chen","submitted_at":"2021-02-23T19:30:37Z","abstract_excerpt":"Ranking models are the main components of information retrieval systems. Several approaches to ranking are based on traditional machine learning algorithms using a set of hand-crafted features. Recently, researchers have leveraged deep learning models in information retrieval. These models are trained end-to-end to extract features from the raw data for ranking tasks, so that they overcome the limitations of hand-crafted features. A variety of deep learning models have been proposed, and each model presents a set of neural network components to extract features that are used for ranking. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.11903","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/2102.11903/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":"2102.11903","created_at":"2026-07-05T03:27:56.465979+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.11903v2","created_at":"2026-07-05T03:27:56.465979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.11903","created_at":"2026-07-05T03:27:56.465979+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJWAFJQJ3JBK","created_at":"2026-07-05T03:27:56.465979+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJWAFJQJ3JBKWZDE","created_at":"2026-07-05T03:27:56.465979+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJWAFJQJ","created_at":"2026-07-05T03:27:56.465979+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/HJWAFJQJ3JBKWZDECU3SCFBUKB","json":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB.json","graph_json":"https://pith.science/api/pith-number/HJWAFJQJ3JBKWZDECU3SCFBUKB/graph.json","events_json":"https://pith.science/api/pith-number/HJWAFJQJ3JBKWZDECU3SCFBUKB/events.json","paper":"https://pith.science/paper/HJWAFJQJ"},"agent_actions":{"view_html":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB","download_json":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB.json","view_paper":"https://pith.science/paper/HJWAFJQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.11903&json=true","fetch_graph":"https://pith.science/api/pith-number/HJWAFJQJ3JBKWZDECU3SCFBUKB/graph.json","fetch_events":"https://pith.science/api/pith-number/HJWAFJQJ3JBKWZDECU3SCFBUKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB/action/storage_attestation","attest_author":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB/action/author_attestation","sign_citation":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB/action/citation_signature","submit_replication":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB/action/replication_record"}},"created_at":"2026-07-05T03:27:56.465979+00:00","updated_at":"2026-07-05T03:27:56.465979+00:00"}