{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HJWAFJQJ3JBKWZDECU3SCFBUKB","short_pith_number":"pith:HJWAFJQJ","canonical_record":{"source":{"id":"2102.11903","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-02-23T19:30:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"000bce2c4c91cc68416cfb7b15be33c1d536208ddc99d078c2663b2e868b0466","abstract_canon_sha256":"37762144128b10e3f55e70b9e7dce5dad12fad48b974039c0087c37222f5b86c"},"schema_version":"1.0"},"canonical_sha256":"3a6c02a609da42ab646415372114345059caf255e0d09902810fe5557df8f192","source":{"kind":"arxiv","id":"2102.11903","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.11903","created_at":"2026-07-05T03:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"2102.11903v2","created_at":"2026-07-05T03:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.11903","created_at":"2026-07-05T03:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"HJWAFJQJ3JBK","created_at":"2026-07-05T03:27:56Z"},{"alias_kind":"pith_short_16","alias_value":"HJWAFJQJ3JBKWZDE","created_at":"2026-07-05T03:27:56Z"},{"alias_kind":"pith_short_8","alias_value":"HJWAFJQJ","created_at":"2026-07-05T03:27:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HJWAFJQJ3JBKWZDECU3SCFBUKB","target":"record","payload":{"canonical_record":{"source":{"id":"2102.11903","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-02-23T19:30:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"000bce2c4c91cc68416cfb7b15be33c1d536208ddc99d078c2663b2e868b0466","abstract_canon_sha256":"37762144128b10e3f55e70b9e7dce5dad12fad48b974039c0087c37222f5b86c"},"schema_version":"1.0"},"canonical_sha256":"3a6c02a609da42ab646415372114345059caf255e0d09902810fe5557df8f192","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:56.466419Z","signature_b64":"h+sc50PpLUF58nAOJhB3Ae5mhig6CPxxQVxtJxd07QpCs+tFv8NDwaw3q+PKYZ+4lo42C3mtbZgc/Gp76fQWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a6c02a609da42ab646415372114345059caf255e0d09902810fe5557df8f192","last_reissued_at":"2026-07-05T03:27:56.465918Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:56.465918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.11903","source_version":2,"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-07-05T03:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+W7Ldg81IYeaDm8sXWhhE2Y0UvcWYvpTAODALE+zIW9YQalT8/JhAc6jbO9pElEHTfFslZvd2IAWCVlh79DDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:55:46.162678Z"},"content_sha256":"0495171462e962d945685a50d073692ff13a704a219df3c5b2b01f2b42cb7967","schema_version":"1.0","event_id":"sha256:0495171462e962d945685a50d073692ff13a704a219df3c5b2b01f2b42cb7967"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HJWAFJQJ3JBKWZDECU3SCFBUKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural ranking models for document retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Brian D. Davison, Jeff Heflin, Mohamed Trabelsi, Zhiyu Chen","submitted_at":"2021-02-23T19:30:37Z","abstract_excerpt":"Ranking models are the main components of information retrieval systems. Several approaches to ranking are based on traditional machine learning algorithms using a set of hand-crafted features. Recently, researchers have leveraged deep learning models in information retrieval. These models are trained end-to-end to extract features from the raw data for ranking tasks, so that they overcome the limitations of hand-crafted features. A variety of deep learning models have been proposed, and each model presents a set of neural network components to extract features that are used for ranking. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.11903","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.11903/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aysNxM1/XCmEtVT+Bs/xvaflpB+uBqyMlLzWMViSdI3dduXI7UjM+oEfr9LkClmKq3cQ3MwnRyqul0K7Fx6IBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:55:46.163260Z"},"content_sha256":"fa18e6251ffea9eabc0f0dfac47e7d398904a5238e48a4a4beafd50c9a6eaa66","schema_version":"1.0","event_id":"sha256:fa18e6251ffea9eabc0f0dfac47e7d398904a5238e48a4a4beafd50c9a6eaa66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB/bundle.json","state_url":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB/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-08-19T13:55:46Z","links":{"resolver":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB","bundle":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB/bundle.json","state":"https://pith.science/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJWAFJQJ3JBKWZDECU3SCFBUKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HJWAFJQJ3JBKWZDECU3SCFBUKB","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":"37762144128b10e3f55e70b9e7dce5dad12fad48b974039c0087c37222f5b86c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-02-23T19:30:37Z","title_canon_sha256":"000bce2c4c91cc68416cfb7b15be33c1d536208ddc99d078c2663b2e868b0466"},"schema_version":"1.0","source":{"id":"2102.11903","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.11903","created_at":"2026-07-05T03:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"2102.11903v2","created_at":"2026-07-05T03:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.11903","created_at":"2026-07-05T03:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"HJWAFJQJ3JBK","created_at":"2026-07-05T03:27:56Z"},{"alias_kind":"pith_short_16","alias_value":"HJWAFJQJ3JBKWZDE","created_at":"2026-07-05T03:27:56Z"},{"alias_kind":"pith_short_8","alias_value":"HJWAFJQJ","created_at":"2026-07-05T03:27:56Z"}],"graph_snapshots":[{"event_id":"sha256:fa18e6251ffea9eabc0f0dfac47e7d398904a5238e48a4a4beafd50c9a6eaa66","target":"graph","created_at":"2026-07-05T03:27:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.11903/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ranking models are the main components of information retrieval systems. Several approaches to ranking are based on traditional machine learning algorithms using a set of hand-crafted features. Recently, researchers have leveraged deep learning models in information retrieval. These models are trained end-to-end to extract features from the raw data for ranking tasks, so that they overcome the limitations of hand-crafted features. A variety of deep learning models have been proposed, and each model presents a set of neural network components to extract features that are used for ranking. In th","authors_text":"Brian D. Davison, Jeff Heflin, Mohamed Trabelsi, Zhiyu Chen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-02-23T19:30:37Z","title":"Neural ranking models for document retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.11903","kind":"arxiv","version":2},"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:0495171462e962d945685a50d073692ff13a704a219df3c5b2b01f2b42cb7967","target":"record","created_at":"2026-07-05T03:27:56Z","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":"37762144128b10e3f55e70b9e7dce5dad12fad48b974039c0087c37222f5b86c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-02-23T19:30:37Z","title_canon_sha256":"000bce2c4c91cc68416cfb7b15be33c1d536208ddc99d078c2663b2e868b0466"},"schema_version":"1.0","source":{"id":"2102.11903","kind":"arxiv","version":2}},"canonical_sha256":"3a6c02a609da42ab646415372114345059caf255e0d09902810fe5557df8f192","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a6c02a609da42ab646415372114345059caf255e0d09902810fe5557df8f192","first_computed_at":"2026-07-05T03:27:56.465918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:27:56.465918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h+sc50PpLUF58nAOJhB3Ae5mhig6CPxxQVxtJxd07QpCs+tFv8NDwaw3q+PKYZ+4lo42C3mtbZgc/Gp76fQWAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:27:56.466419Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.11903","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0495171462e962d945685a50d073692ff13a704a219df3c5b2b01f2b42cb7967","sha256:fa18e6251ffea9eabc0f0dfac47e7d398904a5238e48a4a4beafd50c9a6eaa66"],"state_sha256":"83021782a4672a26d3a4a19ea48761c4f12fb52acefd8e8590ffd5c3ee984b68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElokO2FPdAZs6hOeE8xPOIpfzx+AuwWvjL6JphCNkjqdDOFHhVkKXuR7t+P1kkzNkmBI1hiyDsLHrMXwrDOoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T13:55:46.167333Z","bundle_sha256":"319bd69f7164d4884241dfac4ee7d5bc37229e1eef1ffcfc0dc59b083255aa82"}}