{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KS6ACA7DMDDLHP3F5TF3BB3ULV","short_pith_number":"pith:KS6ACA7D","schema_version":"1.0","canonical_sha256":"54bc0103e360c6b3bf65eccbb087745d464b7168e478f8e3d1e442558c667b20","source":{"kind":"arxiv","id":"1705.07661","version":2},"attestation_state":"computed","paper":{"title":"Streaming Binary Sketching based on Subspace Tracking and Diagonal Uniformization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anne Morvan, Antoine Souloumiac, C\\'edric Gouy-Pailler, Jamal Atif","submitted_at":"2017-05-22T10:54:20Z","abstract_excerpt":"In this paper, we address the problem of learning compact similarity-preserving embeddings for massive high-dimensional streams of data in order to perform efficient similarity search. We present a new online method for computing binary compressed representations -sketches- of high-dimensional real feature vectors. Given an expected code length $c$ and high-dimensional input data points, our algorithm provides a $c$-bits binary code for preserving the distance between the points from the original high-dimensional space. Our algorithm does not require neither the storage of the whole dataset no"},"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":"1705.07661","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-22T10:54:20Z","cross_cats_sorted":[],"title_canon_sha256":"8c081d3487f2e190c2b19c80db92d8451da3390a1d76aee3d2fb45824b271b08","abstract_canon_sha256":"4cb5d6fc24adbd0211fcb6401162fc95ee8b4db23d0008fae53459054f4cbe19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:02.359175Z","signature_b64":"/2jmjzn9kvx0GKdXbY/9eG5FDFAMc9i2enY8t5eXPm8NGInuidYEiDZU8eKnJ6/fC+yWjW8Tawjvb6t1Qo2DDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54bc0103e360c6b3bf65eccbb087745d464b7168e478f8e3d1e442558c667b20","last_reissued_at":"2026-05-18T00:24:02.358713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:02.358713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Binary Sketching based on Subspace Tracking and Diagonal Uniformization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anne Morvan, Antoine Souloumiac, C\\'edric Gouy-Pailler, Jamal Atif","submitted_at":"2017-05-22T10:54:20Z","abstract_excerpt":"In this paper, we address the problem of learning compact similarity-preserving embeddings for massive high-dimensional streams of data in order to perform efficient similarity search. We present a new online method for computing binary compressed representations -sketches- of high-dimensional real feature vectors. Given an expected code length $c$ and high-dimensional input data points, our algorithm provides a $c$-bits binary code for preserving the distance between the points from the original high-dimensional space. Our algorithm does not require neither the storage of the whole dataset no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07661","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":""},"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":"1705.07661","created_at":"2026-05-18T00:24:02.358784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07661v2","created_at":"2026-05-18T00:24:02.358784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07661","created_at":"2026-05-18T00:24:02.358784+00:00"},{"alias_kind":"pith_short_12","alias_value":"KS6ACA7DMDDL","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KS6ACA7DMDDLHP3F","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KS6ACA7D","created_at":"2026-05-18T12:31:28.150371+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/KS6ACA7DMDDLHP3F5TF3BB3ULV","json":"https://pith.science/pith/KS6ACA7DMDDLHP3F5TF3BB3ULV.json","graph_json":"https://pith.science/api/pith-number/KS6ACA7DMDDLHP3F5TF3BB3ULV/graph.json","events_json":"https://pith.science/api/pith-number/KS6ACA7DMDDLHP3F5TF3BB3ULV/events.json","paper":"https://pith.science/paper/KS6ACA7D"},"agent_actions":{"view_html":"https://pith.science/pith/KS6ACA7DMDDLHP3F5TF3BB3ULV","download_json":"https://pith.science/pith/KS6ACA7DMDDLHP3F5TF3BB3ULV.json","view_paper":"https://pith.science/paper/KS6ACA7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07661&json=true","fetch_graph":"https://pith.science/api/pith-number/KS6ACA7DMDDLHP3F5TF3BB3ULV/graph.json","fetch_events":"https://pith.science/api/pith-number/KS6ACA7DMDDLHP3F5TF3BB3ULV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KS6ACA7DMDDLHP3F5TF3BB3ULV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KS6ACA7DMDDLHP3F5TF3BB3ULV/action/storage_attestation","attest_author":"https://pith.science/pith/KS6ACA7DMDDLHP3F5TF3BB3ULV/action/author_attestation","sign_citation":"https://pith.science/pith/KS6ACA7DMDDLHP3F5TF3BB3ULV/action/citation_signature","submit_replication":"https://pith.science/pith/KS6ACA7DMDDLHP3F5TF3BB3ULV/action/replication_record"}},"created_at":"2026-05-18T00:24:02.358784+00:00","updated_at":"2026-05-18T00:24:02.358784+00:00"}