{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CBAO3VGEMBY3ZESEO5Q2BFSYEZ","short_pith_number":"pith:CBAO3VGE","schema_version":"1.0","canonical_sha256":"1040edd4c46071bc92447761a096582654d519ecc4b931befbf6224b7c4349e3","source":{"kind":"arxiv","id":"2605.18288","version":1},"attestation_state":"computed","paper":{"title":"Collision-Resistant Single-Pass Method for Unsupervised Fine-Grained Image Hashing","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anh-Kiet Duong, Jean-Michel Carozza, Petra Gomez-Kr\\\"amer","submitted_at":"2026-05-18T12:16:33Z","abstract_excerpt":"Unsupervised fine-grained image hashing aims to learn compact binary codes that preserve subtle visual differences among highly similar instances without manual annotations. However, most existing methods neglect collision resistance, leading to identical hash codes for slightly semantically different samples. In this paper, we propose Collision-Resistant Single-Pass Self-Supervised Semantic Hashing (CS3H), a collision-resistant framework that directly optimizes Hamming-space similarity via a single-pass normalized Hamming distance loss to produce well-separated binary representations. We furt"},"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":"2605.18288","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-18T12:16:33Z","cross_cats_sorted":[],"title_canon_sha256":"a7220d10ace4246577d4c7ad023ddde91b854aba01898a1e3a2effaad1d15166","abstract_canon_sha256":"e203113bb59fec14c0a9bd1b10e6b52c9a4e526f31bef12f860fa91f0dd2d34c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:53.582591Z","signature_b64":"gHDIJEC3ToNITK4KuhqVleKEyfjKwhSeAof3qLo/KUzvEbEmwirTEAuZStRcHpnBqYQOiMwXXhviPMFCdj5PBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1040edd4c46071bc92447761a096582654d519ecc4b931befbf6224b7c4349e3","last_reissued_at":"2026-05-20T00:05:53.581833Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:53.581833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Collision-Resistant Single-Pass Method for Unsupervised Fine-Grained Image Hashing","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anh-Kiet Duong, Jean-Michel Carozza, Petra Gomez-Kr\\\"amer","submitted_at":"2026-05-18T12:16:33Z","abstract_excerpt":"Unsupervised fine-grained image hashing aims to learn compact binary codes that preserve subtle visual differences among highly similar instances without manual annotations. However, most existing methods neglect collision resistance, leading to identical hash codes for slightly semantically different samples. In this paper, we propose Collision-Resistant Single-Pass Self-Supervised Semantic Hashing (CS3H), a collision-resistant framework that directly optimizes Hamming-space similarity via a single-pass normalized Hamming distance loss to produce well-separated binary representations. We furt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18288","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/2605.18288/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.225682Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.923856Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"21f3215d9c4a9fa5311efdc5638a2b73d8ccb700e68834f97832f242abac1c68"},"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":"2605.18288","created_at":"2026-05-20T00:05:53.581961+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18288v1","created_at":"2026-05-20T00:05:53.581961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18288","created_at":"2026-05-20T00:05:53.581961+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBAO3VGEMBY3","created_at":"2026-05-20T00:05:53.581961+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBAO3VGEMBY3ZESE","created_at":"2026-05-20T00:05:53.581961+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBAO3VGE","created_at":"2026-05-20T00:05:53.581961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.18288","citing_title":"Collision-Resistant Single-Pass Method for Unsupervised Fine-Grained Image Hashing","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CBAO3VGEMBY3ZESEO5Q2BFSYEZ","json":"https://pith.science/pith/CBAO3VGEMBY3ZESEO5Q2BFSYEZ.json","graph_json":"https://pith.science/api/pith-number/CBAO3VGEMBY3ZESEO5Q2BFSYEZ/graph.json","events_json":"https://pith.science/api/pith-number/CBAO3VGEMBY3ZESEO5Q2BFSYEZ/events.json","paper":"https://pith.science/paper/CBAO3VGE"},"agent_actions":{"view_html":"https://pith.science/pith/CBAO3VGEMBY3ZESEO5Q2BFSYEZ","download_json":"https://pith.science/pith/CBAO3VGEMBY3ZESEO5Q2BFSYEZ.json","view_paper":"https://pith.science/paper/CBAO3VGE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18288&json=true","fetch_graph":"https://pith.science/api/pith-number/CBAO3VGEMBY3ZESEO5Q2BFSYEZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CBAO3VGEMBY3ZESEO5Q2BFSYEZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBAO3VGEMBY3ZESEO5Q2BFSYEZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBAO3VGEMBY3ZESEO5Q2BFSYEZ/action/storage_attestation","attest_author":"https://pith.science/pith/CBAO3VGEMBY3ZESEO5Q2BFSYEZ/action/author_attestation","sign_citation":"https://pith.science/pith/CBAO3VGEMBY3ZESEO5Q2BFSYEZ/action/citation_signature","submit_replication":"https://pith.science/pith/CBAO3VGEMBY3ZESEO5Q2BFSYEZ/action/replication_record"}},"created_at":"2026-05-20T00:05:53.581961+00:00","updated_at":"2026-05-20T00:05:53.581961+00:00"}