{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TAZLNTPXWBBA6VBFXFKES7MX36","short_pith_number":"pith:TAZLNTPX","canonical_record":{"source":{"id":"1705.01509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-05-03T17:08:05Z","cross_cats_sorted":[],"title_canon_sha256":"559cb7e80e2a1f15c08a6bd0946434cbf8279bc038fde93ac9ae4f06de59e17d","abstract_canon_sha256":"7f7ded3a70e20d82610c9da19cc8e1ec2808d13f5e05748e9e4d123ae2290613"},"schema_version":"1.0"},"canonical_sha256":"9832b6cdf7b0420f5425b954497d97df8567e34b678d41c9405fb144b92a852e","source":{"kind":"arxiv","id":"1705.01509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01509","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01509v1","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01509","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"TAZLNTPXWBBA","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"TAZLNTPXWBBA6VBF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"TAZLNTPX","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TAZLNTPXWBBA6VBFXFKES7MX36","target":"record","payload":{"canonical_record":{"source":{"id":"1705.01509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-05-03T17:08:05Z","cross_cats_sorted":[],"title_canon_sha256":"559cb7e80e2a1f15c08a6bd0946434cbf8279bc038fde93ac9ae4f06de59e17d","abstract_canon_sha256":"7f7ded3a70e20d82610c9da19cc8e1ec2808d13f5e05748e9e4d123ae2290613"},"schema_version":"1.0"},"canonical_sha256":"9832b6cdf7b0420f5425b954497d97df8567e34b678d41c9405fb144b92a852e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:05.070083Z","signature_b64":"eHuFFSG6G2ZP8LzU8bNrhnXt2XdIFfOIX0wdll3F9i8zfdwR7BfQcJpCpq4mkqyHS5OpkohnD6ChWnB8efEyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9832b6cdf7b0420f5425b954497d97df8567e34b678d41c9405fb144b92a852e","last_reissued_at":"2026-05-18T00:45:05.069715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:05.069715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.01509","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:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"htJ94vkDI1axbVyqTkz4Yf/z1qEV0z6xU4qwIOe3X+h2wlj6AAgcVcxnjRcfOiBCmFGx1fQhBkxKoPYC0druBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:24:45.230951Z"},"content_sha256":"4f3d6a435cbf5ab2d72667fc04ecc01e4d86fc67d2910107a3946b6b10312903","schema_version":"1.0","event_id":"sha256:4f3d6a435cbf5ab2d72667fc04ecc01e4d86fc67d2910107a3946b6b10312903"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TAZLNTPXWBBA6VBFXFKES7MX36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Models for Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Bhaskar Mitra, Nick Craswell","submitted_at":"2017-05-03T17:08:05Z","abstract_excerpt":"Neural ranking models for information retrieval (IR) use shallow or deep neural networks to rank search results in response to a query. Traditional learning to rank models employ machine learning techniques over hand-crafted IR features. By contrast, neural models learn representations of language from raw text that can bridge the gap between query and document vocabulary. Unlike classical IR models, these new machine learning based approaches are data-hungry, requiring large scale training data before they can be deployed. This tutorial introduces basic concepts and intuitions behind neural I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01509","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:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+7j6sEgGmKPf15vqqYVsIQKElM2saZIeP3bhxEz7tbqdsqQbkHvzxPQNknE37DzAM3xeK4njOcDyrNUzMX5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:24:45.231292Z"},"content_sha256":"cdfdf2976752f2faff05e945afe9368569daba00523080e1cac05c548e5def33","schema_version":"1.0","event_id":"sha256:cdfdf2976752f2faff05e945afe9368569daba00523080e1cac05c548e5def33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAZLNTPXWBBA6VBFXFKES7MX36/bundle.json","state_url":"https://pith.science/pith/TAZLNTPXWBBA6VBFXFKES7MX36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAZLNTPXWBBA6VBFXFKES7MX36/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-07-04T11:24:45Z","links":{"resolver":"https://pith.science/pith/TAZLNTPXWBBA6VBFXFKES7MX36","bundle":"https://pith.science/pith/TAZLNTPXWBBA6VBFXFKES7MX36/bundle.json","state":"https://pith.science/pith/TAZLNTPXWBBA6VBFXFKES7MX36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAZLNTPXWBBA6VBFXFKES7MX36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TAZLNTPXWBBA6VBFXFKES7MX36","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":"7f7ded3a70e20d82610c9da19cc8e1ec2808d13f5e05748e9e4d123ae2290613","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-05-03T17:08:05Z","title_canon_sha256":"559cb7e80e2a1f15c08a6bd0946434cbf8279bc038fde93ac9ae4f06de59e17d"},"schema_version":"1.0","source":{"id":"1705.01509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01509","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01509v1","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01509","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"TAZLNTPXWBBA","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"TAZLNTPXWBBA6VBF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"TAZLNTPX","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:cdfdf2976752f2faff05e945afe9368569daba00523080e1cac05c548e5def33","target":"graph","created_at":"2026-05-18T00:45:05Z","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":"Neural ranking models for information retrieval (IR) use shallow or deep neural networks to rank search results in response to a query. Traditional learning to rank models employ machine learning techniques over hand-crafted IR features. By contrast, neural models learn representations of language from raw text that can bridge the gap between query and document vocabulary. Unlike classical IR models, these new machine learning based approaches are data-hungry, requiring large scale training data before they can be deployed. This tutorial introduces basic concepts and intuitions behind neural I","authors_text":"Bhaskar Mitra, Nick Craswell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-05-03T17:08:05Z","title":"Neural Models for Information Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01509","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:4f3d6a435cbf5ab2d72667fc04ecc01e4d86fc67d2910107a3946b6b10312903","target":"record","created_at":"2026-05-18T00:45:05Z","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":"7f7ded3a70e20d82610c9da19cc8e1ec2808d13f5e05748e9e4d123ae2290613","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-05-03T17:08:05Z","title_canon_sha256":"559cb7e80e2a1f15c08a6bd0946434cbf8279bc038fde93ac9ae4f06de59e17d"},"schema_version":"1.0","source":{"id":"1705.01509","kind":"arxiv","version":1}},"canonical_sha256":"9832b6cdf7b0420f5425b954497d97df8567e34b678d41c9405fb144b92a852e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9832b6cdf7b0420f5425b954497d97df8567e34b678d41c9405fb144b92a852e","first_computed_at":"2026-05-18T00:45:05.069715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:05.069715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eHuFFSG6G2ZP8LzU8bNrhnXt2XdIFfOIX0wdll3F9i8zfdwR7BfQcJpCpq4mkqyHS5OpkohnD6ChWnB8efEyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:05.070083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f3d6a435cbf5ab2d72667fc04ecc01e4d86fc67d2910107a3946b6b10312903","sha256:cdfdf2976752f2faff05e945afe9368569daba00523080e1cac05c548e5def33"],"state_sha256":"2da0d060ef32942aeaa87ded9b58867c7abd5c41b78f39514672cc6615ac11c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eUFMu3wbbxJeNGCz0LQryyHabPqzPVMg1jgegr90/xkUCOBkHaVHke5NNq3Al3ilyrESzUL/kQRuxlV6HX2ADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T11:24:45.233140Z","bundle_sha256":"a59fd24405ed25c196b42bde6cc76c22aa256a97f2053e40bbea5bed5592241e"}}