{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NJB4PAHMB5YXXAZSTRVZH6ULHL","short_pith_number":"pith:NJB4PAHM","schema_version":"1.0","canonical_sha256":"6a43c780ec0f717b83329c6b93fa8b3af47dee48d363f69c12d4d28e7e333c66","source":{"kind":"arxiv","id":"1312.5479","version":3},"attestation_state":"computed","paper":{"title":"Sparse similarity-preserving hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CV","authors_text":"Alex M. Bronstein, Guillermo Sapiro, Jonathan Masci, Michael M. Bronstein, Pablo Sprechmann","submitted_at":"2013-12-19T11:04:40Z","abstract_excerpt":"In recent years, a lot of attention has been devoted to efficient nearest neighbor search by means of similarity-preserving hashing. One of the plights of existing hashing techniques is the intrinsic trade-off between performance and computational complexity: while longer hash codes allow for lower false positive rates, it is very difficult to increase the embedding dimensionality without incurring in very high false negatives rates or prohibiting computational costs. In this paper, we propose a way to overcome this limitation by enforcing the hash codes to be sparse. Sparse high-dimensional c"},"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":"1312.5479","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-19T11:04:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ad62c78a90ef28b86081cad46f4b4ea46222315f0da42d2408e33e0d88a01706","abstract_canon_sha256":"b5e8ce01cf47363494f76d415d7b9692dbd2e5ea161e93e33d75100cc8c29c9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:56.444598Z","signature_b64":"b2Bl6EcIndAJeEDv1mdhuj3qbNZFCqC8KN3WSNbS8143VFM1SeQiicB7nSIgHAhhevHNBv7Mwva3wW12IHVRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a43c780ec0f717b83329c6b93fa8b3af47dee48d363f69c12d4d28e7e333c66","last_reissued_at":"2026-05-18T02:58:56.443955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:56.443955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse similarity-preserving hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CV","authors_text":"Alex M. Bronstein, Guillermo Sapiro, Jonathan Masci, Michael M. Bronstein, Pablo Sprechmann","submitted_at":"2013-12-19T11:04:40Z","abstract_excerpt":"In recent years, a lot of attention has been devoted to efficient nearest neighbor search by means of similarity-preserving hashing. One of the plights of existing hashing techniques is the intrinsic trade-off between performance and computational complexity: while longer hash codes allow for lower false positive rates, it is very difficult to increase the embedding dimensionality without incurring in very high false negatives rates or prohibiting computational costs. In this paper, we propose a way to overcome this limitation by enforcing the hash codes to be sparse. Sparse high-dimensional c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5479","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.5479","created_at":"2026-05-18T02:58:56.444038+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.5479v3","created_at":"2026-05-18T02:58:56.444038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5479","created_at":"2026-05-18T02:58:56.444038+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJB4PAHMB5YX","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJB4PAHMB5YXXAZS","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJB4PAHM","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NJB4PAHMB5YXXAZSTRVZH6ULHL","json":"https://pith.science/pith/NJB4PAHMB5YXXAZSTRVZH6ULHL.json","graph_json":"https://pith.science/api/pith-number/NJB4PAHMB5YXXAZSTRVZH6ULHL/graph.json","events_json":"https://pith.science/api/pith-number/NJB4PAHMB5YXXAZSTRVZH6ULHL/events.json","paper":"https://pith.science/paper/NJB4PAHM"},"agent_actions":{"view_html":"https://pith.science/pith/NJB4PAHMB5YXXAZSTRVZH6ULHL","download_json":"https://pith.science/pith/NJB4PAHMB5YXXAZSTRVZH6ULHL.json","view_paper":"https://pith.science/paper/NJB4PAHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.5479&json=true","fetch_graph":"https://pith.science/api/pith-number/NJB4PAHMB5YXXAZSTRVZH6ULHL/graph.json","fetch_events":"https://pith.science/api/pith-number/NJB4PAHMB5YXXAZSTRVZH6ULHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJB4PAHMB5YXXAZSTRVZH6ULHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJB4PAHMB5YXXAZSTRVZH6ULHL/action/storage_attestation","attest_author":"https://pith.science/pith/NJB4PAHMB5YXXAZSTRVZH6ULHL/action/author_attestation","sign_citation":"https://pith.science/pith/NJB4PAHMB5YXXAZSTRVZH6ULHL/action/citation_signature","submit_replication":"https://pith.science/pith/NJB4PAHMB5YXXAZSTRVZH6ULHL/action/replication_record"}},"created_at":"2026-05-18T02:58:56.444038+00:00","updated_at":"2026-05-18T02:58:56.444038+00:00"}