{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QWKKSDNX5KIXRBHGEUTANWMHZ6","short_pith_number":"pith:QWKKSDNX","canonical_record":{"source":{"id":"1903.06902","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-16T10:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"ca6268cec40bf52d6e7be4660cdd566950af6b9c41b604296ce21ca10af466c3","abstract_canon_sha256":"6b01ad24ced3bedd1c844e5b6e5f4445d136315b8f853e1fd36aa842aab43e14"},"schema_version":"1.0"},"canonical_sha256":"8594a90db7ea917884e6252606d987cfa68eaf3b28e5893675613115c3faaa6d","source":{"kind":"arxiv","id":"1903.06902","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06902","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06902v3","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06902","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"pith_short_12","alias_value":"QWKKSDNX5KIX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QWKKSDNX5KIXRBHG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QWKKSDNX","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QWKKSDNX5KIXRBHGEUTANWMHZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1903.06902","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-16T10:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"ca6268cec40bf52d6e7be4660cdd566950af6b9c41b604296ce21ca10af466c3","abstract_canon_sha256":"6b01ad24ced3bedd1c844e5b6e5f4445d136315b8f853e1fd36aa842aab43e14"},"schema_version":"1.0"},"canonical_sha256":"8594a90db7ea917884e6252606d987cfa68eaf3b28e5893675613115c3faaa6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:08.228440Z","signature_b64":"wUmEh15pYg+AvDYM4BCTFxmrFQz/KOnquJ/CMf/S9QYvGrkzrJDMRcp3Qxa4Axiw59lx3eTpYAA2hT/UCyv3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8594a90db7ea917884e6252606d987cfa68eaf3b28e5893675613115c3faaa6d","last_reissued_at":"2026-05-17T23:42:08.227809Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:08.227809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.06902","source_version":3,"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-17T23:42:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AoetoWO7UquGviW7bbNDVRaUTTeuaCasUe9mrAIQPvJHveuxcIb/bSKUNZIGOO9KIVj099fXrSw78OYg3HciCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T08:29:40.848715Z"},"content_sha256":"4e001ff0d0d620b40a1281e0783f61335a69e2262d0e0aafc6495162f971efe6","schema_version":"1.0","event_id":"sha256:4e001ff0d0d620b40a1281e0783f61335a69e2262d0e0aafc6495162f971efe6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QWKKSDNX5KIXRBHGEUTANWMHZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deep Look into Neural Ranking Models for Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chen Wu, Hamed Zamani, Jiafeng Guo, Liang Pang, Liu Yang, Qingyao Ai, W. Bruce Croft, Xueqi Cheng, Yixing Fan","submitted_at":"2019-03-16T10:20:09Z","abstract_excerpt":"Ranking models lie at the heart of research on information retrieval (IR). During the past decades, different techniques have been proposed for constructing ranking models, from traditional heuristic methods, probabilistic methods, to modern machine learning methods. Recently, with the advance of deep learning technology, we have witnessed a growing body of work in applying shallow or deep neural networks to the ranking problem in IR, referred to as neural ranking models in this paper. The power of neural ranking models lies in the ability to learn from the raw text inputs for the ranking prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06902","kind":"arxiv","version":3},"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-17T23:42:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UL5RsYDnoIIYzzKSb7c4h+hvFCs8CBcpA7u6ubLkIPUgKN9IhueB3WOMpng4tv8R6EPGR3SRenZNQIXku+MlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T08:29:40.849359Z"},"content_sha256":"46a314dbfef7d740721f0688867d94de993b59defd1d077cb386c56623ee406a","schema_version":"1.0","event_id":"sha256:46a314dbfef7d740721f0688867d94de993b59defd1d077cb386c56623ee406a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWKKSDNX5KIXRBHGEUTANWMHZ6/bundle.json","state_url":"https://pith.science/pith/QWKKSDNX5KIXRBHGEUTANWMHZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWKKSDNX5KIXRBHGEUTANWMHZ6/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-05-21T08:29:40Z","links":{"resolver":"https://pith.science/pith/QWKKSDNX5KIXRBHGEUTANWMHZ6","bundle":"https://pith.science/pith/QWKKSDNX5KIXRBHGEUTANWMHZ6/bundle.json","state":"https://pith.science/pith/QWKKSDNX5KIXRBHGEUTANWMHZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWKKSDNX5KIXRBHGEUTANWMHZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QWKKSDNX5KIXRBHGEUTANWMHZ6","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":"6b01ad24ced3bedd1c844e5b6e5f4445d136315b8f853e1fd36aa842aab43e14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-16T10:20:09Z","title_canon_sha256":"ca6268cec40bf52d6e7be4660cdd566950af6b9c41b604296ce21ca10af466c3"},"schema_version":"1.0","source":{"id":"1903.06902","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06902","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06902v3","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06902","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"pith_short_12","alias_value":"QWKKSDNX5KIX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QWKKSDNX5KIXRBHG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QWKKSDNX","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:46a314dbfef7d740721f0688867d94de993b59defd1d077cb386c56623ee406a","target":"graph","created_at":"2026-05-17T23:42:08Z","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":"Ranking models lie at the heart of research on information retrieval (IR). During the past decades, different techniques have been proposed for constructing ranking models, from traditional heuristic methods, probabilistic methods, to modern machine learning methods. Recently, with the advance of deep learning technology, we have witnessed a growing body of work in applying shallow or deep neural networks to the ranking problem in IR, referred to as neural ranking models in this paper. The power of neural ranking models lies in the ability to learn from the raw text inputs for the ranking prob","authors_text":"Chen Wu, Hamed Zamani, Jiafeng Guo, Liang Pang, Liu Yang, Qingyao Ai, W. Bruce Croft, Xueqi Cheng, Yixing Fan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-16T10:20:09Z","title":"A Deep Look into Neural Ranking Models for Information Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06902","kind":"arxiv","version":3},"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:4e001ff0d0d620b40a1281e0783f61335a69e2262d0e0aafc6495162f971efe6","target":"record","created_at":"2026-05-17T23:42:08Z","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":"6b01ad24ced3bedd1c844e5b6e5f4445d136315b8f853e1fd36aa842aab43e14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-16T10:20:09Z","title_canon_sha256":"ca6268cec40bf52d6e7be4660cdd566950af6b9c41b604296ce21ca10af466c3"},"schema_version":"1.0","source":{"id":"1903.06902","kind":"arxiv","version":3}},"canonical_sha256":"8594a90db7ea917884e6252606d987cfa68eaf3b28e5893675613115c3faaa6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8594a90db7ea917884e6252606d987cfa68eaf3b28e5893675613115c3faaa6d","first_computed_at":"2026-05-17T23:42:08.227809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:08.227809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wUmEh15pYg+AvDYM4BCTFxmrFQz/KOnquJ/CMf/S9QYvGrkzrJDMRcp3Qxa4Axiw59lx3eTpYAA2hT/UCyv3Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:08.228440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06902","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e001ff0d0d620b40a1281e0783f61335a69e2262d0e0aafc6495162f971efe6","sha256:46a314dbfef7d740721f0688867d94de993b59defd1d077cb386c56623ee406a"],"state_sha256":"d6305268789c88541c9e8e35919aa6e6a99fad685e36b187794a28b4ec5518c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FW40RIWREZ0Npm7bxKioUtXQ8OMiFVcUZzWdeuOkxcgfgWC8UvbKbhFLSgGv8fTrDygnv5m7x4uO36lfhKs1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T08:29:40.852823Z","bundle_sha256":"49f4773e59f1dc4af655187abb71afc7f796ae5afa91ebaa0d1e2351d771509d"}}