{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RVLO4NXZIS5525LWSKWFTCLDWX","short_pith_number":"pith:RVLO4NXZ","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"},"canonical_sha256":"8d56ee36f944bbdd757692ac598963b5d156b2c38783da34fb3bce9926b1fd5f","source":{"kind":"arxiv","id":"1706.06613","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06613","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06613v1","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06613","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"RVLO4NXZIS55","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RVLO4NXZIS5525LW","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RVLO4NXZ","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RVLO4NXZIS5525LWSKWFTCLDWX","target":"record","payload":{"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"},"canonical_sha256":"8d56ee36f944bbdd757692ac598963b5d156b2c38783da34fb3bce9926b1fd5f","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"},"source_kind":"arxiv","source_id":"1706.06613","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hgkgDeICrOwS2gNqUoX4f+tXrd0UbZDkk0jpS8M1r5SCpI1v5pTS+e9W5FED/pgy0Fa2xwHunrjXUZ9orxqPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:44:27.329688Z"},"content_sha256":"dca8ebaa0f5cd10aee007bdad7cd009e491a3620e1c8a79efceef78fc89807be","schema_version":"1.0","event_id":"sha256:dca8ebaa0f5cd10aee007bdad7cd009e491a3620e1c8a79efceef78fc89807be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RVLO4NXZIS5525LWSKWFTCLDWX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBVq2LRD5aWXn+pR7QyQUEA0mwqwMbnpxwzk8Z1hW/qriFfzo0tfLlqYss/Mvtd+8Mae7Xrz90RAmRrh+FSGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:44:27.330236Z"},"content_sha256":"25d7af45dbeaa0cdc60cafa91d386298776cde5a8af4d89cf27ec4d52cda479d","schema_version":"1.0","event_id":"sha256:25d7af45dbeaa0cdc60cafa91d386298776cde5a8af4d89cf27ec4d52cda479d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX/bundle.json","state_url":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVLO4NXZIS5525LWSKWFTCLDWX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T02:44:27Z","links":{"resolver":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX","bundle":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX/bundle.json","state":"https://pith.science/pith/RVLO4NXZIS5525LWSKWFTCLDWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVLO4NXZIS5525LWSKWFTCLDWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RVLO4NXZIS5525LWSKWFTCLDWX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6849e957ab83c2904835257a582f63752565dc797355038b941c5b99eeb2c383","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-20T18:19:54Z","title_canon_sha256":"afcd5d72cc6e5535072fba06f3d78802b4f06deb4dbe9641a239938e726a5fe6"},"schema_version":"1.0","source":{"id":"1706.06613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06613","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06613v1","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06613","created_at":"2026-05-18T00:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"RVLO4NXZIS55","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RVLO4NXZIS5525LW","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RVLO4NXZ","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:25d7af45dbeaa0cdc60cafa91d386298776cde5a8af4d89cf27ec4d52cda479d","target":"graph","created_at":"2026-05-18T00:41:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Chenyan Xiong, Jamie Callan, Russell Power, Zhiyuan Liu, Zhuyun Dai","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-20T18:19:54Z","title":"End-to-End Neural Ad-hoc Ranking with Kernel Pooling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06613","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dca8ebaa0f5cd10aee007bdad7cd009e491a3620e1c8a79efceef78fc89807be","target":"record","created_at":"2026-05-18T00:41:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6849e957ab83c2904835257a582f63752565dc797355038b941c5b99eeb2c383","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-20T18:19:54Z","title_canon_sha256":"afcd5d72cc6e5535072fba06f3d78802b4f06deb4dbe9641a239938e726a5fe6"},"schema_version":"1.0","source":{"id":"1706.06613","kind":"arxiv","version":1}},"canonical_sha256":"8d56ee36f944bbdd757692ac598963b5d156b2c38783da34fb3bce9926b1fd5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d56ee36f944bbdd757692ac598963b5d156b2c38783da34fb3bce9926b1fd5f","first_computed_at":"2026-05-18T00:41:57.413790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:57.413790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gydsoooyb9dnOz9hHjHFS5n7MpWF5IcaXmYWlijYhaycnLYydyv3SvrFDIsOKg69cq6HMMjd87NcYv/onHG4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:57.414484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dca8ebaa0f5cd10aee007bdad7cd009e491a3620e1c8a79efceef78fc89807be","sha256:25d7af45dbeaa0cdc60cafa91d386298776cde5a8af4d89cf27ec4d52cda479d"],"state_sha256":"5383477e46a02e8592f5aff54d487cb6832c798729e2a3108fadf6bbbf4f6ae6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2LbfyJ70k9TtACRy1T5PKlvrQrtfwFJiZgQUkDvSTZVRy8UghTtzLlfb3NNGOUBWTew2AzB++AllBjiIjILAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:44:27.333183Z","bundle_sha256":"eca5d08e979bbce0c00b183547d8cefebf3a57f3c36dfbe3661ccdb6a6736e24"}}