{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CLURH4VXOT6C7HHVNRCU2ABK5B","short_pith_number":"pith:CLURH4VX","schema_version":"1.0","canonical_sha256":"12e913f2b774fc2f9cf56c454d002ae85a543433ab04ece1101d1a282253d1ce","source":{"kind":"arxiv","id":"2103.09173","version":2},"attestation_state":"computed","paper":{"title":"Ternary Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ce Ju, Chang Liu, Chee Seng Chan, Kam Woh Ng, Lixin Fan, Qiang Yang, Tianyu Zhang, Yilun Jin","submitted_at":"2021-03-16T16:20:54Z","abstract_excerpt":"This paper proposes a novel ternary hash encoding for learning to hash methods, which provides a principled more efficient coding scheme with performances better than those of the state-of-the-art binary hashing counterparts. Two kinds of axiomatic ternary logic, Kleene logic and {\\L}ukasiewicz logic are adopted to calculate the Ternary Hamming Distance (THD) for both the learning/encoding and testing/querying phases. Our work demonstrates that, with an efficient implementation of ternary logic on standard binary machines, the proposed ternary hashing is compared favorably to the binary hashin"},"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":"2103.09173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-03-16T16:20:54Z","cross_cats_sorted":[],"title_canon_sha256":"c6db5011e5e6ad8e326f440b3c5eeebac672498ef70fe069c3042065bff46b18","abstract_canon_sha256":"0f0a2242d576f7174c1d95d16f931eec2ff388789a3cae00667bb23b290e153b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:24:40.939913Z","signature_b64":"KiuHD7jFx+cxXCalhJZIABj8jZxQ5c7O4Zo2yxJzQVfGX+42mVJzt2YhJAyzHrWBscR4fKGBHCg5aLdNjPYUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12e913f2b774fc2f9cf56c454d002ae85a543433ab04ece1101d1a282253d1ce","last_reissued_at":"2026-07-05T02:24:40.939531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:24:40.939531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ternary Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ce Ju, Chang Liu, Chee Seng Chan, Kam Woh Ng, Lixin Fan, Qiang Yang, Tianyu Zhang, Yilun Jin","submitted_at":"2021-03-16T16:20:54Z","abstract_excerpt":"This paper proposes a novel ternary hash encoding for learning to hash methods, which provides a principled more efficient coding scheme with performances better than those of the state-of-the-art binary hashing counterparts. Two kinds of axiomatic ternary logic, Kleene logic and {\\L}ukasiewicz logic are adopted to calculate the Ternary Hamming Distance (THD) for both the learning/encoding and testing/querying phases. Our work demonstrates that, with an efficient implementation of ternary logic on standard binary machines, the proposed ternary hashing is compared favorably to the binary hashin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.09173","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.09173/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":"2103.09173","created_at":"2026-07-05T02:24:40.939588+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.09173v2","created_at":"2026-07-05T02:24:40.939588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.09173","created_at":"2026-07-05T02:24:40.939588+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLURH4VXOT6C","created_at":"2026-07-05T02:24:40.939588+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLURH4VXOT6C7HHV","created_at":"2026-07-05T02:24:40.939588+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLURH4VX","created_at":"2026-07-05T02:24:40.939588+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/CLURH4VXOT6C7HHVNRCU2ABK5B","json":"https://pith.science/pith/CLURH4VXOT6C7HHVNRCU2ABK5B.json","graph_json":"https://pith.science/api/pith-number/CLURH4VXOT6C7HHVNRCU2ABK5B/graph.json","events_json":"https://pith.science/api/pith-number/CLURH4VXOT6C7HHVNRCU2ABK5B/events.json","paper":"https://pith.science/paper/CLURH4VX"},"agent_actions":{"view_html":"https://pith.science/pith/CLURH4VXOT6C7HHVNRCU2ABK5B","download_json":"https://pith.science/pith/CLURH4VXOT6C7HHVNRCU2ABK5B.json","view_paper":"https://pith.science/paper/CLURH4VX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.09173&json=true","fetch_graph":"https://pith.science/api/pith-number/CLURH4VXOT6C7HHVNRCU2ABK5B/graph.json","fetch_events":"https://pith.science/api/pith-number/CLURH4VXOT6C7HHVNRCU2ABK5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLURH4VXOT6C7HHVNRCU2ABK5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLURH4VXOT6C7HHVNRCU2ABK5B/action/storage_attestation","attest_author":"https://pith.science/pith/CLURH4VXOT6C7HHVNRCU2ABK5B/action/author_attestation","sign_citation":"https://pith.science/pith/CLURH4VXOT6C7HHVNRCU2ABK5B/action/citation_signature","submit_replication":"https://pith.science/pith/CLURH4VXOT6C7HHVNRCU2ABK5B/action/replication_record"}},"created_at":"2026-07-05T02:24:40.939588+00:00","updated_at":"2026-07-05T02:24:40.939588+00:00"}