{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4XLFO6CWYVF5CE33L5RNIU55A6","short_pith_number":"pith:4XLFO6CW","schema_version":"1.0","canonical_sha256":"e5d6577856c54bd1137b5f62d453bd0792ec094a5aea3c697b8f7c48b1bda65c","source":{"kind":"arxiv","id":"1701.07675","version":2},"attestation_state":"computed","paper":{"title":"Sparse Ternary Codes for similarity search have higher coding gain than dense binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Dimche Kostadinov, Slava Voloshynovskiy, Sohrab Ferdowsi, Taras Holotyak","submitted_at":"2017-01-26T12:41:58Z","abstract_excerpt":"This paper addresses the problem of Approximate Nearest Neighbor (ANN) search in pattern recognition where feature vectors in a database are encoded as compact codes in order to speed-up the similarity search in large-scale databases. Considering the ANN problem from an information-theoretic perspective, we interpret it as an encoding, which maps the original feature vectors to a less entropic sparse representation while requiring them to be as informative as possible. We then define the coding gain for ANN search using information-theoretic measures. We next show that the classical approach t"},"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":"1701.07675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T12:41:58Z","cross_cats_sorted":["cs.CV","cs.IR","math.IT"],"title_canon_sha256":"33cfe314524a65edbd8548a3294a62db7a586e2a77c1b7424e4f493e8cef4e40","abstract_canon_sha256":"f4ff14d6e36af5c894aa11a3de682b75558ef37fde0889a9f1a8ae0a00f4c4d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:42.736468Z","signature_b64":"benmMOh/wcpYf7wlXqCJ8vIZGZLv01VIFbxWFS/0HYkyoAaczVGKAGtbX8hkhg22AqgSvD+0f4qm6ed6ckHBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5d6577856c54bd1137b5f62d453bd0792ec094a5aea3c697b8f7c48b1bda65c","last_reissued_at":"2026-05-18T00:45:42.735873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:42.735873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Ternary Codes for similarity search have higher coding gain than dense binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Dimche Kostadinov, Slava Voloshynovskiy, Sohrab Ferdowsi, Taras Holotyak","submitted_at":"2017-01-26T12:41:58Z","abstract_excerpt":"This paper addresses the problem of Approximate Nearest Neighbor (ANN) search in pattern recognition where feature vectors in a database are encoded as compact codes in order to speed-up the similarity search in large-scale databases. Considering the ANN problem from an information-theoretic perspective, we interpret it as an encoding, which maps the original feature vectors to a less entropic sparse representation while requiring them to be as informative as possible. We then define the coding gain for ANN search using information-theoretic measures. We next show that the classical approach t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07675","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":"1701.07675","created_at":"2026-05-18T00:45:42.735973+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07675v2","created_at":"2026-05-18T00:45:42.735973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07675","created_at":"2026-05-18T00:45:42.735973+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XLFO6CWYVF5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XLFO6CWYVF5CE33","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XLFO6CW","created_at":"2026-05-18T12:31:00.734936+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/4XLFO6CWYVF5CE33L5RNIU55A6","json":"https://pith.science/pith/4XLFO6CWYVF5CE33L5RNIU55A6.json","graph_json":"https://pith.science/api/pith-number/4XLFO6CWYVF5CE33L5RNIU55A6/graph.json","events_json":"https://pith.science/api/pith-number/4XLFO6CWYVF5CE33L5RNIU55A6/events.json","paper":"https://pith.science/paper/4XLFO6CW"},"agent_actions":{"view_html":"https://pith.science/pith/4XLFO6CWYVF5CE33L5RNIU55A6","download_json":"https://pith.science/pith/4XLFO6CWYVF5CE33L5RNIU55A6.json","view_paper":"https://pith.science/paper/4XLFO6CW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07675&json=true","fetch_graph":"https://pith.science/api/pith-number/4XLFO6CWYVF5CE33L5RNIU55A6/graph.json","fetch_events":"https://pith.science/api/pith-number/4XLFO6CWYVF5CE33L5RNIU55A6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XLFO6CWYVF5CE33L5RNIU55A6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XLFO6CWYVF5CE33L5RNIU55A6/action/storage_attestation","attest_author":"https://pith.science/pith/4XLFO6CWYVF5CE33L5RNIU55A6/action/author_attestation","sign_citation":"https://pith.science/pith/4XLFO6CWYVF5CE33L5RNIU55A6/action/citation_signature","submit_replication":"https://pith.science/pith/4XLFO6CWYVF5CE33L5RNIU55A6/action/replication_record"}},"created_at":"2026-05-18T00:45:42.735973+00:00","updated_at":"2026-05-18T00:45:42.735973+00:00"}