{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HVICYUR6NGDW5OUE5RAK3PWA7Y","short_pith_number":"pith:HVICYUR6","canonical_record":{"source":{"id":"1802.08988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-25T11:15:31Z","cross_cats_sorted":[],"title_canon_sha256":"965acd2cd72dbfbce8df6292b8167bc289321f3c5daac6c9e974cc4ad6d28aaa","abstract_canon_sha256":"aaa4e83a83789f85807f0dd74c58f1318601f7d43ab3a9f20d399d7996965deb"},"schema_version":"1.0"},"canonical_sha256":"3d502c523e69876eba84ec40adbec0fe2aafa8b717b39fda6cf7475a5c83ebc0","source":{"kind":"arxiv","id":"1802.08988","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08988","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08988v1","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08988","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"pith_short_12","alias_value":"HVICYUR6NGDW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HVICYUR6NGDW5OUE","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HVICYUR6","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HVICYUR6NGDW5OUE5RAK3PWA7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-25T11:15:31Z","cross_cats_sorted":[],"title_canon_sha256":"965acd2cd72dbfbce8df6292b8167bc289321f3c5daac6c9e974cc4ad6d28aaa","abstract_canon_sha256":"aaa4e83a83789f85807f0dd74c58f1318601f7d43ab3a9f20d399d7996965deb"},"schema_version":"1.0"},"canonical_sha256":"3d502c523e69876eba84ec40adbec0fe2aafa8b717b39fda6cf7475a5c83ebc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:35.845034Z","signature_b64":"MBZ11tiYQhFOBnZRtjWGSt0cirhL30TUIMwdMWan5oZS9NlhBZ2pPe6L5bjescFR1S4T2RIhkHwwGuLDKcdHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d502c523e69876eba84ec40adbec0fe2aafa8b717b39fda6cf7475a5c83ebc0","last_reissued_at":"2026-05-18T00:22:35.844432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:35.844432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08988","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:22:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xkfhSwdZdb2qv0WFsWxwl9xk00TyVRDnd9xNkOEXJLc1/XC132bfpwd34u8vlaiDhz5HvmmpMn2ZtsIaak+GDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:43:58.112676Z"},"content_sha256":"f32d89b79818038b137e347e55653abcc1fcc002fd5ddc8bb29d538129c6b8be","schema_version":"1.0","event_id":"sha256:f32d89b79818038b137e347e55653abcc1fcc002fd5ddc8bb29d538129c6b8be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HVICYUR6NGDW5OUE5RAK3PWA7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Neural Network for Learning to Rank Query-Text Pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Baoyang Song","submitted_at":"2018-02-25T11:15:31Z","abstract_excerpt":"This paper considers the problem of document ranking in information retrieval systems by Learning to Rank. We propose ConvRankNet combining a Siamese Convolutional Neural Network encoder and the RankNet ranking model which could be trained in an end-to-end fashion. We prove a general result justifying the linear test-time complexity of pairwise Learning to Rank approach. Experiments on the OHSUMED dataset show that ConvRankNet outperforms systematically existing feature-based models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08988","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:22:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"faFCbnw/xiJBMFyQB0oY+tIt0xOP/U+UDhbPe9fKZfMkxN5i7jhVp+FXXgPq/okqt0bDOSZCO53jhXKcSLe8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:43:58.113070Z"},"content_sha256":"87837a98242abf0846f9a2f15b556b8175b94bb88cb53be4259d1a0164a5c430","schema_version":"1.0","event_id":"sha256:87837a98242abf0846f9a2f15b556b8175b94bb88cb53be4259d1a0164a5c430"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVICYUR6NGDW5OUE5RAK3PWA7Y/bundle.json","state_url":"https://pith.science/pith/HVICYUR6NGDW5OUE5RAK3PWA7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVICYUR6NGDW5OUE5RAK3PWA7Y/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-01T14:43:58Z","links":{"resolver":"https://pith.science/pith/HVICYUR6NGDW5OUE5RAK3PWA7Y","bundle":"https://pith.science/pith/HVICYUR6NGDW5OUE5RAK3PWA7Y/bundle.json","state":"https://pith.science/pith/HVICYUR6NGDW5OUE5RAK3PWA7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVICYUR6NGDW5OUE5RAK3PWA7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HVICYUR6NGDW5OUE5RAK3PWA7Y","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":"aaa4e83a83789f85807f0dd74c58f1318601f7d43ab3a9f20d399d7996965deb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-25T11:15:31Z","title_canon_sha256":"965acd2cd72dbfbce8df6292b8167bc289321f3c5daac6c9e974cc4ad6d28aaa"},"schema_version":"1.0","source":{"id":"1802.08988","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08988","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08988v1","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08988","created_at":"2026-05-18T00:22:35Z"},{"alias_kind":"pith_short_12","alias_value":"HVICYUR6NGDW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HVICYUR6NGDW5OUE","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HVICYUR6","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:87837a98242abf0846f9a2f15b556b8175b94bb88cb53be4259d1a0164a5c430","target":"graph","created_at":"2026-05-18T00:22:35Z","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 considers the problem of document ranking in information retrieval systems by Learning to Rank. We propose ConvRankNet combining a Siamese Convolutional Neural Network encoder and the RankNet ranking model which could be trained in an end-to-end fashion. We prove a general result justifying the linear test-time complexity of pairwise Learning to Rank approach. Experiments on the OHSUMED dataset show that ConvRankNet outperforms systematically existing feature-based models.","authors_text":"Baoyang Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-25T11:15:31Z","title":"Deep Neural Network for Learning to Rank Query-Text Pairs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08988","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:f32d89b79818038b137e347e55653abcc1fcc002fd5ddc8bb29d538129c6b8be","target":"record","created_at":"2026-05-18T00:22:35Z","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":"aaa4e83a83789f85807f0dd74c58f1318601f7d43ab3a9f20d399d7996965deb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-02-25T11:15:31Z","title_canon_sha256":"965acd2cd72dbfbce8df6292b8167bc289321f3c5daac6c9e974cc4ad6d28aaa"},"schema_version":"1.0","source":{"id":"1802.08988","kind":"arxiv","version":1}},"canonical_sha256":"3d502c523e69876eba84ec40adbec0fe2aafa8b717b39fda6cf7475a5c83ebc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d502c523e69876eba84ec40adbec0fe2aafa8b717b39fda6cf7475a5c83ebc0","first_computed_at":"2026-05-18T00:22:35.844432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:35.844432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MBZ11tiYQhFOBnZRtjWGSt0cirhL30TUIMwdMWan5oZS9NlhBZ2pPe6L5bjescFR1S4T2RIhkHwwGuLDKcdHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:35.845034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08988","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f32d89b79818038b137e347e55653abcc1fcc002fd5ddc8bb29d538129c6b8be","sha256:87837a98242abf0846f9a2f15b556b8175b94bb88cb53be4259d1a0164a5c430"],"state_sha256":"f350191d89a97494ac792b137be9a0d6c7de56aa2616cd15826c173b87d7797a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mDjvzqbqRK705vBsbpa7B0AiD1tsyeje09yxHi23YRihYstBqgjHqe3CqiBEAZDM9pR5bqZarDXWrQgRWunaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:43:58.115052Z","bundle_sha256":"fc0cfbd9548f691b4cedddebb641773c624c896e5772dcc53c6ab864f354c89b"}}