{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KVTIDOXJAOAXCLLYLEGNBUFOZ7","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":"bcc44a19568c594f1cbb850fe74b20a493d4bdb48d49841ce14e81be412d02ab","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-31T14:33:29Z","title_canon_sha256":"9a9138793cb5a91137961ae273a300c975a44529c84707d996861af9bbb81e23"},"schema_version":"1.0","source":{"id":"1710.11510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11510","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11510v1","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11510","created_at":"2026-05-18T00:31:37Z"},{"alias_kind":"pith_short_12","alias_value":"KVTIDOXJAOAX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KVTIDOXJAOAXCLLY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KVTIDOXJ","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:c2bef04778827350d4ad3c5625068bb34b4f3d7d2d5092120f943644fc8f3679","target":"graph","created_at":"2026-05-18T00:31:37Z","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"},"paper":{"abstract_excerpt":"We present the multi-layer extension of the Sparse Ternary Codes (STC) for fast similarity search where we focus on the reconstruction of the database vectors from the ternary codes. To consider the trade-offs between the compactness of the STC and the quality of the reconstructed vectors, we study the rate-distortion behavior of these codes under different setups. We show that a single-layer code cannot achieve satisfactory results at high rates. Therefore, we extend the concept of STC to multiple layers and design the ML-STC, a codebook-free system that successively refines the reconstructio","authors_text":"Dimche Kostadinov, Slava Voloshynovskiy, Sohrab Ferdowsi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-31T14:33:29Z","title":"A multi-layer network based on Sparse Ternary Codes for universal vector compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11510","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:2c7f26c855bc157cc982efc2adecd0c6cb5b496fda5662826be03d3e644346cc","target":"record","created_at":"2026-05-18T00:31:37Z","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":"bcc44a19568c594f1cbb850fe74b20a493d4bdb48d49841ce14e81be412d02ab","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-31T14:33:29Z","title_canon_sha256":"9a9138793cb5a91137961ae273a300c975a44529c84707d996861af9bbb81e23"},"schema_version":"1.0","source":{"id":"1710.11510","kind":"arxiv","version":1}},"canonical_sha256":"556681bae90381712d78590cd0d0aecfd68f1a4f0f0bb979130a03c0951d84f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"556681bae90381712d78590cd0d0aecfd68f1a4f0f0bb979130a03c0951d84f5","first_computed_at":"2026-05-18T00:31:37.104590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:37.104590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pT8plhxDdmHDmi7atcSDMLgg1AdViYZ+Em0TJEksVy8AmNdI1EzhlDGcYMVqc4DMG8vwN8AmJro+jmMUXeZ7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:37.105234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c7f26c855bc157cc982efc2adecd0c6cb5b496fda5662826be03d3e644346cc","sha256:c2bef04778827350d4ad3c5625068bb34b4f3d7d2d5092120f943644fc8f3679"],"state_sha256":"72f1dad0b0f8378b53bd480bc0d9f037f8bce7ca589eb0da0616d8f600a43041"}