{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XLSEJEI5INI5FQ3GGMBM7MCPY5","short_pith_number":"pith:XLSEJEI5","canonical_record":{"source":{"id":"1711.08611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-23T08:29:22Z","cross_cats_sorted":[],"title_canon_sha256":"c6954e0306bd45a5d72e6307124def1363b8e02b59ee06adc604729f8e884733","abstract_canon_sha256":"0fd51e663e01c7d02436085973c1552a3343344603e7adac448b2050e98ff124"},"schema_version":"1.0"},"canonical_sha256":"bae444911d4351d2c3663302cfb04fc7436a36055ed80401883024fd67505a2d","source":{"kind":"arxiv","id":"1711.08611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08611","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08611v1","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08611","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"XLSEJEI5INI5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XLSEJEI5INI5FQ3G","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XLSEJEI5","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XLSEJEI5INI5FQ3GGMBM7MCPY5","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-23T08:29:22Z","cross_cats_sorted":[],"title_canon_sha256":"c6954e0306bd45a5d72e6307124def1363b8e02b59ee06adc604729f8e884733","abstract_canon_sha256":"0fd51e663e01c7d02436085973c1552a3343344603e7adac448b2050e98ff124"},"schema_version":"1.0"},"canonical_sha256":"bae444911d4351d2c3663302cfb04fc7436a36055ed80401883024fd67505a2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:44.575853Z","signature_b64":"g3fvzp/SqARN6VoAVn/2iVi9pcQC3gq07Rr32ewh8kGtPYcm/czD/1vaQttuf7yJ1GyWno/u4fPSLfByBROnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bae444911d4351d2c3663302cfb04fc7436a36055ed80401883024fd67505a2d","last_reissued_at":"2026-05-18T00:29:44.575159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:44.575159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08611","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:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJxBK42YXytfp2SmahDokbrlyYRJygmDBIRsXSQm0yBGcAS8FfiOl3hfS/g+weWu88PPN0E4+nWvuOE3D8cIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:47:20.422207Z"},"content_sha256":"6652a5aff5444cd62ad4de10ab300fc8e9c5fade28faf0993c53481bd2838381","schema_version":"1.0","event_id":"sha256:6652a5aff5444cd62ad4de10ab300fc8e9c5fade28faf0993c53481bd2838381"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XLSEJEI5INI5FQ3GGMBM7MCPY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deep Relevance Matching Model for Ad-hoc Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Jiafeng Guo, Qingyao Ai, W. Bruce Croft, Yixing Fan","submitted_at":"2017-11-23T08:29:22Z","abstract_excerpt":"In recent years, deep neural networks have led to exciting breakthroughs in speech recognition, computer vision, and natural language processing (NLP) tasks. However, there have been few positive results of deep models on ad-hoc retrieval tasks. This is partially due to the fact that many important characteristics of the ad-hoc retrieval task have not been well addressed in deep models yet. Typically, the ad-hoc retrieval task is formalized as a matching problem between two pieces of text in existing work using deep models, and treated equivalent to many NLP tasks such as paraphrase identifica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08611","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:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IrtU8LNmqAenjDyMJyOqHGhsqi7fg+m10ZWfeySyij4adaQXIlNDnjWXRjeo06Jwdw3pLvcCWxKi3gPLkPKXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:47:20.422927Z"},"content_sha256":"e85d850d4f7c9c682681d2e07d7330734560d76df4fd175251f87a8fd3f718aa","schema_version":"1.0","event_id":"sha256:e85d850d4f7c9c682681d2e07d7330734560d76df4fd175251f87a8fd3f718aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLSEJEI5INI5FQ3GGMBM7MCPY5/bundle.json","state_url":"https://pith.science/pith/XLSEJEI5INI5FQ3GGMBM7MCPY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLSEJEI5INI5FQ3GGMBM7MCPY5/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-30T22:47:20Z","links":{"resolver":"https://pith.science/pith/XLSEJEI5INI5FQ3GGMBM7MCPY5","bundle":"https://pith.science/pith/XLSEJEI5INI5FQ3GGMBM7MCPY5/bundle.json","state":"https://pith.science/pith/XLSEJEI5INI5FQ3GGMBM7MCPY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLSEJEI5INI5FQ3GGMBM7MCPY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XLSEJEI5INI5FQ3GGMBM7MCPY5","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":"0fd51e663e01c7d02436085973c1552a3343344603e7adac448b2050e98ff124","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-23T08:29:22Z","title_canon_sha256":"c6954e0306bd45a5d72e6307124def1363b8e02b59ee06adc604729f8e884733"},"schema_version":"1.0","source":{"id":"1711.08611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08611","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08611v1","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08611","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"XLSEJEI5INI5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XLSEJEI5INI5FQ3G","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XLSEJEI5","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:e85d850d4f7c9c682681d2e07d7330734560d76df4fd175251f87a8fd3f718aa","target":"graph","created_at":"2026-05-18T00:29:44Z","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":"In recent years, deep neural networks have led to exciting breakthroughs in speech recognition, computer vision, and natural language processing (NLP) tasks. However, there have been few positive results of deep models on ad-hoc retrieval tasks. This is partially due to the fact that many important characteristics of the ad-hoc retrieval task have not been well addressed in deep models yet. Typically, the ad-hoc retrieval task is formalized as a matching problem between two pieces of text in existing work using deep models, and treated equivalent to many NLP tasks such as paraphrase identifica","authors_text":"Jiafeng Guo, Qingyao Ai, W. Bruce Croft, Yixing Fan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-23T08:29:22Z","title":"A Deep Relevance Matching Model for Ad-hoc Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08611","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:6652a5aff5444cd62ad4de10ab300fc8e9c5fade28faf0993c53481bd2838381","target":"record","created_at":"2026-05-18T00:29:44Z","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":"0fd51e663e01c7d02436085973c1552a3343344603e7adac448b2050e98ff124","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-23T08:29:22Z","title_canon_sha256":"c6954e0306bd45a5d72e6307124def1363b8e02b59ee06adc604729f8e884733"},"schema_version":"1.0","source":{"id":"1711.08611","kind":"arxiv","version":1}},"canonical_sha256":"bae444911d4351d2c3663302cfb04fc7436a36055ed80401883024fd67505a2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bae444911d4351d2c3663302cfb04fc7436a36055ed80401883024fd67505a2d","first_computed_at":"2026-05-18T00:29:44.575159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:44.575159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g3fvzp/SqARN6VoAVn/2iVi9pcQC3gq07Rr32ewh8kGtPYcm/czD/1vaQttuf7yJ1GyWno/u4fPSLfByBROnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:44.575853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6652a5aff5444cd62ad4de10ab300fc8e9c5fade28faf0993c53481bd2838381","sha256:e85d850d4f7c9c682681d2e07d7330734560d76df4fd175251f87a8fd3f718aa"],"state_sha256":"594a9e61c2e51191d31d724dbbf5fd91d00c395258f7b725b15f6009f65c51fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uy4MAZt0Haaiw9mnijssO8RqBv9QG/QScvaTascXj1ZIJpQ3pOJoPmOUErble9TvUeSvnn3/6G4mjLEt35bLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:47:20.426264Z","bundle_sha256":"01cb6905b17e3835cbda07c13371684be63c07a2e554b4d7cff08d3d8ec08fff"}}