{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RVLO4NXZIS5525LWSKWFTCLDWX","short_pith_number":"pith:RVLO4NXZ","schema_version":"1.0","canonical_sha256":"8d56ee36f944bbdd757692ac598963b5d156b2c38783da34fb3bce9926b1fd5f","source":{"kind":"arxiv","id":"1706.06613","version":1},"attestation_state":"computed","paper":{"title":"End-to-End Neural Ad-hoc Ranking with Kernel Pooling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Chenyan Xiong, Jamie Callan, Russell Power, Zhiyuan Liu, Zhuyun Dai","submitted_at":"2017-06-20T18:19:54Z","abstract_excerpt":"This paper proposes K-NRM, a kernel based neural model for document ranking. Given a query and a set of documents, K-NRM uses a translation matrix that models word-level similarities via word embeddings, a new kernel-pooling technique that uses kernels to extract multi-level soft match features, and a learning-to-rank layer that combines those features into the final ranking score. The whole model is trained end-to-end. The ranking layer learns desired feature patterns from the pairwise ranking loss. The kernels transfer the feature patterns into soft-match targets at each similarity level and"},"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":"1706.06613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-20T18:19:54Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"afcd5d72cc6e5535072fba06f3d78802b4f06deb4dbe9641a239938e726a5fe6","abstract_canon_sha256":"6849e957ab83c2904835257a582f63752565dc797355038b941c5b99eeb2c383"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:57.414484Z","signature_b64":"Gydsoooyb9dnOz9hHjHFS5n7MpWF5IcaXmYWlijYhaycnLYydyv3SvrFDIsOKg69cq6HMMjd87NcYv/onHG4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d56ee36f944bbdd757692ac598963b5d156b2c38783da34fb3bce9926b1fd5f","last_reissued_at":"2026-05-18T00:41:57.413790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:57.413790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-End Neural Ad-hoc Ranking with Kernel Pooling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Chenyan Xiong, Jamie Callan, Russell Power, Zhiyuan Liu, Zhuyun Dai","submitted_at":"2017-06-20T18:19:54Z","abstract_excerpt":"This paper proposes K-NRM, a kernel based neural model for document ranking. Given a query and a set of documents, K-NRM uses a translation matrix that models word-level similarities via word embeddings, a new kernel-pooling technique that uses kernels to extract multi-level soft match features, and a learning-to-rank layer that combines those features into the final ranking score. The whole model is trained end-to-end. The ranking layer learns desired feature patterns from the pairwise ranking loss. The kernels transfer the feature patterns into soft-match targets at each similarity level and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06613","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":""},"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":"1706.06613","created_at":"2026-05-18T00:41:57.413892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06613v1","created_at":"2026-05-18T00:41:57.413892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06613","created_at":"2026-05-18T00:41:57.413892+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVLO4NXZIS55","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVLO4NXZIS5525LW","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVLO4NXZ","created_at":"2026-05-18T12:31:43.269735+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/RVLO4NXZIS5525LWSKWFTCLDWX","json":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX.json","graph_json":"https://pith.science/api/pith-number/RVLO4NXZIS5525LWSKWFTCLDWX/graph.json","events_json":"https://pith.science/api/pith-number/RVLO4NXZIS5525LWSKWFTCLDWX/events.json","paper":"https://pith.science/paper/RVLO4NXZ"},"agent_actions":{"view_html":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX","download_json":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX.json","view_paper":"https://pith.science/paper/RVLO4NXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06613&json=true","fetch_graph":"https://pith.science/api/pith-number/RVLO4NXZIS5525LWSKWFTCLDWX/graph.json","fetch_events":"https://pith.science/api/pith-number/RVLO4NXZIS5525LWSKWFTCLDWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX/action/storage_attestation","attest_author":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX/action/author_attestation","sign_citation":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX/action/citation_signature","submit_replication":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX/action/replication_record"}},"created_at":"2026-05-18T00:41:57.413892+00:00","updated_at":"2026-05-18T00:41:57.413892+00:00"}