{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:P6RWX7TEI7WUNZMGKL3FUERE6F","short_pith_number":"pith:P6RWX7TE","schema_version":"1.0","canonical_sha256":"7fa36bfe6447ed46e58652f65a1224f17581a1e172caa480d09045c0892d1cf7","source":{"kind":"arxiv","id":"1807.06419","version":1},"attestation_state":"computed","paper":{"title":"On Ternary Coding and Three-Valued Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Subhash Kak","submitted_at":"2018-07-13T17:23:54Z","abstract_excerpt":"Mathematically, ternary coding is more efficient than binary coding. It is little used in computation because technology for binary processing is already established and the implementation of ternary coding is more complicated, but remains relevant in algorithms that use decision trees and in communications. In this paper we present a new comparison of binary and ternary coding and their relative efficiencies are computed both for number representation and decision trees. The implications of our inability to use optimal representation through mathematics or logic are examined. Apart from consi"},"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":"1807.06419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-13T17:23:54Z","cross_cats_sorted":[],"title_canon_sha256":"c17e13a4312340485d8fa512b658319d2ffe66eb21167fdec18151c6540772e1","abstract_canon_sha256":"0c9b1efd4e6ee682b93d34fb2fc85abab1ade654f4110e3c26bd4fbe5313f425"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:33.122026Z","signature_b64":"gHpiForCfe0T3looYR/EYTpHAl7Bq7RS8fWlSrmqJhMMy+KtdaOADHrAV6CWRME+QGtfcou2vbLgoliWbydVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fa36bfe6447ed46e58652f65a1224f17581a1e172caa480d09045c0892d1cf7","last_reissued_at":"2026-05-18T00:10:33.121348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:33.121348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Ternary Coding and Three-Valued Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Subhash Kak","submitted_at":"2018-07-13T17:23:54Z","abstract_excerpt":"Mathematically, ternary coding is more efficient than binary coding. It is little used in computation because technology for binary processing is already established and the implementation of ternary coding is more complicated, but remains relevant in algorithms that use decision trees and in communications. In this paper we present a new comparison of binary and ternary coding and their relative efficiencies are computed both for number representation and decision trees. The implications of our inability to use optimal representation through mathematics or logic are examined. Apart from consi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06419","kind":"arxiv","version":1},"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":"1807.06419","created_at":"2026-05-18T00:10:33.121443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06419v1","created_at":"2026-05-18T00:10:33.121443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06419","created_at":"2026-05-18T00:10:33.121443+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6RWX7TEI7WU","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6RWX7TEI7WUNZMG","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6RWX7TE","created_at":"2026-05-18T12:32:43.782077+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/P6RWX7TEI7WUNZMGKL3FUERE6F","json":"https://pith.science/pith/P6RWX7TEI7WUNZMGKL3FUERE6F.json","graph_json":"https://pith.science/api/pith-number/P6RWX7TEI7WUNZMGKL3FUERE6F/graph.json","events_json":"https://pith.science/api/pith-number/P6RWX7TEI7WUNZMGKL3FUERE6F/events.json","paper":"https://pith.science/paper/P6RWX7TE"},"agent_actions":{"view_html":"https://pith.science/pith/P6RWX7TEI7WUNZMGKL3FUERE6F","download_json":"https://pith.science/pith/P6RWX7TEI7WUNZMGKL3FUERE6F.json","view_paper":"https://pith.science/paper/P6RWX7TE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06419&json=true","fetch_graph":"https://pith.science/api/pith-number/P6RWX7TEI7WUNZMGKL3FUERE6F/graph.json","fetch_events":"https://pith.science/api/pith-number/P6RWX7TEI7WUNZMGKL3FUERE6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6RWX7TEI7WUNZMGKL3FUERE6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6RWX7TEI7WUNZMGKL3FUERE6F/action/storage_attestation","attest_author":"https://pith.science/pith/P6RWX7TEI7WUNZMGKL3FUERE6F/action/author_attestation","sign_citation":"https://pith.science/pith/P6RWX7TEI7WUNZMGKL3FUERE6F/action/citation_signature","submit_replication":"https://pith.science/pith/P6RWX7TEI7WUNZMGKL3FUERE6F/action/replication_record"}},"created_at":"2026-05-18T00:10:33.121443+00:00","updated_at":"2026-05-18T00:10:33.121443+00:00"}