{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HU3VFS6EDFKJX7X6OEHB2JO2O7","short_pith_number":"pith:HU3VFS6E","canonical_record":{"source":{"id":"2505.17844","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-05-23T12:58:42Z","cross_cats_sorted":[],"title_canon_sha256":"ce04c6a53a8ac19798b5e6b953d35aaffe5247cacc55f81f249070d21cdec747","abstract_canon_sha256":"87df9a1ecf2a4ff8cbd61bb7343fb77063743b88d14445898902ac9712703782"},"schema_version":"1.0"},"canonical_sha256":"3d3752cbc419549bfefe710e1d25da77dbcbf169696446467a0d346728d32c09","source":{"kind":"arxiv","id":"2505.17844","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17844","created_at":"2026-07-05T11:08:32Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17844v1","created_at":"2026-07-05T11:08:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17844","created_at":"2026-07-05T11:08:32Z"},{"alias_kind":"pith_short_12","alias_value":"HU3VFS6EDFKJ","created_at":"2026-07-05T11:08:32Z"},{"alias_kind":"pith_short_16","alias_value":"HU3VFS6EDFKJX7X6","created_at":"2026-07-05T11:08:32Z"},{"alias_kind":"pith_short_8","alias_value":"HU3VFS6E","created_at":"2026-07-05T11:08:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HU3VFS6EDFKJX7X6OEHB2JO2O7","target":"record","payload":{"canonical_record":{"source":{"id":"2505.17844","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-05-23T12:58:42Z","cross_cats_sorted":[],"title_canon_sha256":"ce04c6a53a8ac19798b5e6b953d35aaffe5247cacc55f81f249070d21cdec747","abstract_canon_sha256":"87df9a1ecf2a4ff8cbd61bb7343fb77063743b88d14445898902ac9712703782"},"schema_version":"1.0"},"canonical_sha256":"3d3752cbc419549bfefe710e1d25da77dbcbf169696446467a0d346728d32c09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:32.831425Z","signature_b64":"IUHDgiUvsx2Y6AMufuKGH5PPCpSVgxwk4FBJOIV9OZw8YMv4yzf7aip8ZfMJJ+RJIXRvntMD6Qg7Nf654Zj0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d3752cbc419549bfefe710e1d25da77dbcbf169696446467a0d346728d32c09","last_reissued_at":"2026-07-05T11:08:32.830952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:32.830952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.17844","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-07-05T11:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7M+esRCcbKecpD0h7cblQQFChX7nDvJSf+H3i7dBRQ2T2ZmLRgjdVQfvEkSTmNv2uxPkfVf6tMz/1ScWrLcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:55:37.817687Z"},"content_sha256":"0306092d2667881433f94a473df389a839c77a2f9102e5948e83b80cfb4459ee","schema_version":"1.0","event_id":"sha256:0306092d2667881433f94a473df389a839c77a2f9102e5948e83b80cfb4459ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HU3VFS6EDFKJX7X6OEHB2JO2O7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Roth, Fabian Deuser, Hannah Schieber, Martin Werner, Norbert Oswald, Philipp Hausenblas","submitted_at":"2025-05-23T12:58:42Z","abstract_excerpt":"Contrastive learning is a representational learning paradigm in which a neural network maps data elements to feature vectors. It improves the feature space by forming lots with an anchor and examples that are either positive or negative based on class similarity. Hard negative examples, which are close to the anchor in the feature space but from a different class, improve learning performance. Finding such examples of high quality efficiently in large, high-dimensional datasets is computationally challenging. In this paper, we propose a GPU-friendly Locality-Sensitive Hashing (LSH) scheme that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17844","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/2505.17844/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-05T11:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"siJK3im2uixMq4dF3VLY64Qsfim3sy5H9T+xUltjJSxhc56TS2gGFiQ3Hzx9wPEoaC17sOsRR1tg1JjtUv0VAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:55:37.818058Z"},"content_sha256":"400922e3480dfd8845404c33da264f7767c88faad8cae7cafb87f209d7496dff","schema_version":"1.0","event_id":"sha256:400922e3480dfd8845404c33da264f7767c88faad8cae7cafb87f209d7496dff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HU3VFS6EDFKJX7X6OEHB2JO2O7/bundle.json","state_url":"https://pith.science/pith/HU3VFS6EDFKJX7X6OEHB2JO2O7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HU3VFS6EDFKJX7X6OEHB2JO2O7/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-07T03:55:37Z","links":{"resolver":"https://pith.science/pith/HU3VFS6EDFKJX7X6OEHB2JO2O7","bundle":"https://pith.science/pith/HU3VFS6EDFKJX7X6OEHB2JO2O7/bundle.json","state":"https://pith.science/pith/HU3VFS6EDFKJX7X6OEHB2JO2O7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HU3VFS6EDFKJX7X6OEHB2JO2O7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HU3VFS6EDFKJX7X6OEHB2JO2O7","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":"87df9a1ecf2a4ff8cbd61bb7343fb77063743b88d14445898902ac9712703782","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-05-23T12:58:42Z","title_canon_sha256":"ce04c6a53a8ac19798b5e6b953d35aaffe5247cacc55f81f249070d21cdec747"},"schema_version":"1.0","source":{"id":"2505.17844","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17844","created_at":"2026-07-05T11:08:32Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17844v1","created_at":"2026-07-05T11:08:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17844","created_at":"2026-07-05T11:08:32Z"},{"alias_kind":"pith_short_12","alias_value":"HU3VFS6EDFKJ","created_at":"2026-07-05T11:08:32Z"},{"alias_kind":"pith_short_16","alias_value":"HU3VFS6EDFKJX7X6","created_at":"2026-07-05T11:08:32Z"},{"alias_kind":"pith_short_8","alias_value":"HU3VFS6E","created_at":"2026-07-05T11:08:32Z"}],"graph_snapshots":[{"event_id":"sha256:400922e3480dfd8845404c33da264f7767c88faad8cae7cafb87f209d7496dff","target":"graph","created_at":"2026-07-05T11:08:32Z","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/2505.17844/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Contrastive learning is a representational learning paradigm in which a neural network maps data elements to feature vectors. It improves the feature space by forming lots with an anchor and examples that are either positive or negative based on class similarity. Hard negative examples, which are close to the anchor in the feature space but from a different class, improve learning performance. Finding such examples of high quality efficiently in large, high-dimensional datasets is computationally challenging. In this paper, we propose a GPU-friendly Locality-Sensitive Hashing (LSH) scheme that","authors_text":"Daniel Roth, Fabian Deuser, Hannah Schieber, Martin Werner, Norbert Oswald, Philipp Hausenblas","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-05-23T12:58:42Z","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17844","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:0306092d2667881433f94a473df389a839c77a2f9102e5948e83b80cfb4459ee","target":"record","created_at":"2026-07-05T11:08:32Z","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":"87df9a1ecf2a4ff8cbd61bb7343fb77063743b88d14445898902ac9712703782","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-05-23T12:58:42Z","title_canon_sha256":"ce04c6a53a8ac19798b5e6b953d35aaffe5247cacc55f81f249070d21cdec747"},"schema_version":"1.0","source":{"id":"2505.17844","kind":"arxiv","version":1}},"canonical_sha256":"3d3752cbc419549bfefe710e1d25da77dbcbf169696446467a0d346728d32c09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d3752cbc419549bfefe710e1d25da77dbcbf169696446467a0d346728d32c09","first_computed_at":"2026-07-05T11:08:32.830952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:32.830952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IUHDgiUvsx2Y6AMufuKGH5PPCpSVgxwk4FBJOIV9OZw8YMv4yzf7aip8ZfMJJ+RJIXRvntMD6Qg7Nf654Zj0AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:32.831425Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.17844","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0306092d2667881433f94a473df389a839c77a2f9102e5948e83b80cfb4459ee","sha256:400922e3480dfd8845404c33da264f7767c88faad8cae7cafb87f209d7496dff"],"state_sha256":"48d8690c3a8eb210c3620832e04298874473e90e79c5a1287356b3cb1f69a4b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dsAir8rkcv6jYeIaML9pPxY5NJz7pof9tqkZdd+3CIofn0RzLKIyg7wBqNATYCjXOi4RSfehabFqHGeE88m1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T03:55:37.820052Z","bundle_sha256":"de5b666e8dfa8b0ecbfed64f45ea332dbaf978008b5220217068dfce3fa4c18e"}}