{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GQD3YU2FABPZJQERPQHMGC5FI7","short_pith_number":"pith:GQD3YU2F","schema_version":"1.0","canonical_sha256":"3407bc5345005f94c0917c0ec30ba547dfb088c94c7ec43f3f2dd459e593db58","source":{"kind":"arxiv","id":"1605.04711","version":3},"attestation_state":"computed","paper":{"title":"Ternary Weight Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bin Liu, Bo Zhang, Fengfu Li, Junchi Yan, Xiaoxing Wang","submitted_at":"2016-05-16T10:21:25Z","abstract_excerpt":"We present a memory and computation efficient ternary weight networks (TWNs) - with weights constrained to +1, 0 and -1. The Euclidian distance between full (float or double) precision weights and the ternary weights along with a scaling factor is minimized in training stage. Besides, a threshold-based ternary function is optimized to get an approximated solution which can be fast and easily computed. TWNs have shown better expressive abilities than binary precision counterparts. Meanwhile, TWNs achieve up to 16$\\times$ model compression rate and need fewer multiplications compared with the fl"},"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":"1605.04711","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-16T10:21:25Z","cross_cats_sorted":[],"title_canon_sha256":"081e682d804ed5446c17e99b09a89a70a9ac0d330885caba6cd56a58aec68f41","abstract_canon_sha256":"830ff8a71acffedffa8f7d600d90e4367aa5fb82be470bc8314cfe69edd51900"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:22.201877Z","signature_b64":"u6zpQWbcywdpYXlGMHa7AE6c00F540uoLPNGCA4icOTz7T4T5vgyNrh8+U4MUeYqksECGI3CLFIVb6W5y6QLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3407bc5345005f94c0917c0ec30ba547dfb088c94c7ec43f3f2dd459e593db58","last_reissued_at":"2026-07-05T05:17:22.201381Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:22.201381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ternary Weight Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bin Liu, Bo Zhang, Fengfu Li, Junchi Yan, Xiaoxing Wang","submitted_at":"2016-05-16T10:21:25Z","abstract_excerpt":"We present a memory and computation efficient ternary weight networks (TWNs) - with weights constrained to +1, 0 and -1. The Euclidian distance between full (float or double) precision weights and the ternary weights along with a scaling factor is minimized in training stage. Besides, a threshold-based ternary function is optimized to get an approximated solution which can be fast and easily computed. TWNs have shown better expressive abilities than binary precision counterparts. Meanwhile, TWNs achieve up to 16$\\times$ model compression rate and need fewer multiplications compared with the fl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04711","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1605.04711/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1605.04711","created_at":"2026-07-05T05:17:22.201443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04711v3","created_at":"2026-07-05T05:17:22.201443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04711","created_at":"2026-07-05T05:17:22.201443+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQD3YU2FABPZ","created_at":"2026-07-05T05:17:22.201443+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQD3YU2FABPZJQER","created_at":"2026-07-05T05:17:22.201443+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQD3YU2F","created_at":"2026-07-05T05:17:22.201443+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":15,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26650","citing_title":"CAT-Q: Cost-efficient and Accurate Ternary Quantization for LLMs","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2606.22249","citing_title":"On the Expressive Power of Weight Quantization in Large Language Models","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2606.13054","citing_title":"TWLA: Achieving Ternary Weights and Low-Bit Activations for LLMs via Post-Training Quantization","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30814","citing_title":"A Reconfigurable Computing In-Memory Macro with Charge-sharing-based Weighted Accumulator","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"1907.00593","citing_title":"Weight Normalization based Quantization for Deep Neural Network Compression","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"1907.07220","citing_title":"Learning Multimodal Fixed-Point Weights using Gradient Descent","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21171","citing_title":"FTerViT: Fully Ternary Vision Transformer","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19630","citing_title":"EMO-BOOST: Emotion-Augmented Audio-Visual Features for Improved Generalization in Deepfake Detection","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10989","citing_title":"SURGE: Surrogate Gradient Adaptation in Binary Neural Networks","ref_index":96,"is_internal_anchor":false},{"citing_arxiv_id":"2507.16079","citing_title":"A Lower Bound for the Number of Linear Regions of Ternary ReLU Regression Neural Networks","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10989","citing_title":"SURGE: Surrogate Gradient Adaptation in Binary Neural Networks","ref_index":96,"is_internal_anchor":false},{"citing_arxiv_id":"1609.08144","citing_title":"Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26979","citing_title":"Multibit neural inference in a N-ary crossbar architecture","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20913","citing_title":"FairyFuse: Multiplication-Free LLM Inference on CPUs via Fused Ternary Kernels","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08474","citing_title":"Quantization Impact on the Accuracy and Communication Efficiency Trade-off in Federated Learning for Aerospace Predictive Maintenance","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GQD3YU2FABPZJQERPQHMGC5FI7","json":"https://pith.science/pith/GQD3YU2FABPZJQERPQHMGC5FI7.json","graph_json":"https://pith.science/api/pith-number/GQD3YU2FABPZJQERPQHMGC5FI7/graph.json","events_json":"https://pith.science/api/pith-number/GQD3YU2FABPZJQERPQHMGC5FI7/events.json","paper":"https://pith.science/paper/GQD3YU2F"},"agent_actions":{"view_html":"https://pith.science/pith/GQD3YU2FABPZJQERPQHMGC5FI7","download_json":"https://pith.science/pith/GQD3YU2FABPZJQERPQHMGC5FI7.json","view_paper":"https://pith.science/paper/GQD3YU2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04711&json=true","fetch_graph":"https://pith.science/api/pith-number/GQD3YU2FABPZJQERPQHMGC5FI7/graph.json","fetch_events":"https://pith.science/api/pith-number/GQD3YU2FABPZJQERPQHMGC5FI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQD3YU2FABPZJQERPQHMGC5FI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQD3YU2FABPZJQERPQHMGC5FI7/action/storage_attestation","attest_author":"https://pith.science/pith/GQD3YU2FABPZJQERPQHMGC5FI7/action/author_attestation","sign_citation":"https://pith.science/pith/GQD3YU2FABPZJQERPQHMGC5FI7/action/citation_signature","submit_replication":"https://pith.science/pith/GQD3YU2FABPZJQERPQHMGC5FI7/action/replication_record"}},"created_at":"2026-07-05T05:17:22.201443+00:00","updated_at":"2026-07-05T05:17:22.201443+00:00"}