{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IECX2NHDOOGP4FWO7GIT6XRCVT","short_pith_number":"pith:IECX2NHD","schema_version":"1.0","canonical_sha256":"41057d34e3738cfe16cef9913f5e22acf5a9f75edda57e63064b40273e08afae","source":{"kind":"arxiv","id":"2411.02404","version":1},"attestation_state":"computed","paper":{"title":"Enhancing Retrieval Performance: An Ensemble Approach For Hard Negative Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Hansa Meghwani","submitted_at":"2024-10-18T05:23:39Z","abstract_excerpt":"Ranking consistently emerges as a primary focus in information retrieval research. Retrieval and ranking models serve as the foundation for numerous applications, including web search, open domain QA, enterprise domain QA, and text-based recommender systems. Typically, these models undergo training on triplets consisting of binary relevance assignments, comprising one positive and one negative passage. However, their utilization involves a context where a significantly more nuanced understanding of relevance is necessary, especially when re-ranking a large pool of potentially relevant passages"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.02404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-10-18T05:23:39Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"493066603566ce8c0d9929c8eeed9a979cfeda28a78de293ef7bf6f9e63094c2","abstract_canon_sha256":"0177f34266a94d5e155c905276a8c4b883230d943ce1f759dbace8bc3c5e112f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:36.825397Z","signature_b64":"V477OR8L14Zd+zO/PbW6tnRj/ANf3MlHsgqn241OQd2rv7eigvEE4WAB28IW3seD/BXx5k7UjJE6KVLLuym7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41057d34e3738cfe16cef9913f5e22acf5a9f75edda57e63064b40273e08afae","last_reissued_at":"2026-07-05T09:48:36.824904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:36.824904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Retrieval Performance: An Ensemble Approach For Hard Negative Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Hansa Meghwani","submitted_at":"2024-10-18T05:23:39Z","abstract_excerpt":"Ranking consistently emerges as a primary focus in information retrieval research. Retrieval and ranking models serve as the foundation for numerous applications, including web search, open domain QA, enterprise domain QA, and text-based recommender systems. Typically, these models undergo training on triplets consisting of binary relevance assignments, comprising one positive and one negative passage. However, their utilization involves a context where a significantly more nuanced understanding of relevance is necessary, especially when re-ranking a large pool of potentially relevant passages"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02404","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.02404/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.02404","created_at":"2026-07-05T09:48:36.824961+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02404v1","created_at":"2026-07-05T09:48:36.824961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02404","created_at":"2026-07-05T09:48:36.824961+00:00"},{"alias_kind":"pith_short_12","alias_value":"IECX2NHDOOGP","created_at":"2026-07-05T09:48:36.824961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IECX2NHDOOGP4FWO","created_at":"2026-07-05T09:48:36.824961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IECX2NHD","created_at":"2026-07-05T09:48:36.824961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18366","citing_title":"Hard Negative Mining for Domain-Specific Retrieval in Enterprise Systems","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IECX2NHDOOGP4FWO7GIT6XRCVT","json":"https://pith.science/pith/IECX2NHDOOGP4FWO7GIT6XRCVT.json","graph_json":"https://pith.science/api/pith-number/IECX2NHDOOGP4FWO7GIT6XRCVT/graph.json","events_json":"https://pith.science/api/pith-number/IECX2NHDOOGP4FWO7GIT6XRCVT/events.json","paper":"https://pith.science/paper/IECX2NHD"},"agent_actions":{"view_html":"https://pith.science/pith/IECX2NHDOOGP4FWO7GIT6XRCVT","download_json":"https://pith.science/pith/IECX2NHDOOGP4FWO7GIT6XRCVT.json","view_paper":"https://pith.science/paper/IECX2NHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02404&json=true","fetch_graph":"https://pith.science/api/pith-number/IECX2NHDOOGP4FWO7GIT6XRCVT/graph.json","fetch_events":"https://pith.science/api/pith-number/IECX2NHDOOGP4FWO7GIT6XRCVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IECX2NHDOOGP4FWO7GIT6XRCVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IECX2NHDOOGP4FWO7GIT6XRCVT/action/storage_attestation","attest_author":"https://pith.science/pith/IECX2NHDOOGP4FWO7GIT6XRCVT/action/author_attestation","sign_citation":"https://pith.science/pith/IECX2NHDOOGP4FWO7GIT6XRCVT/action/citation_signature","submit_replication":"https://pith.science/pith/IECX2NHDOOGP4FWO7GIT6XRCVT/action/replication_record"}},"created_at":"2026-07-05T09:48:36.824961+00:00","updated_at":"2026-07-05T09:48:36.824961+00:00"}