{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7VGJWIAXVMSM66IR26XL7SRNI3","short_pith_number":"pith:7VGJWIAX","schema_version":"1.0","canonical_sha256":"fd4c9b2017ab24cf7911d7aebfca2d46f4c1519eba2771f15651487cb2ee9a1a","source":{"kind":"arxiv","id":"2007.02114","version":1},"attestation_state":"computed","paper":{"title":"A Novel Multi-Step Finite-State Automaton for Arbitrarily Deterministic Tsetlin Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Adrian Wheeldon, Alex Yakovlev, Jie Lei, K. Darshana Abeyrathna, Morten Goodwin, Ole-Christoffer Granmo, Rishad Shafik","submitted_at":"2020-07-04T14:56:05Z","abstract_excerpt":"Due to the high energy consumption and scalability challenges of deep learning, there is a critical need to shift research focus towards dealing with energy consumption constraints. Tsetlin Machines (TMs) are a recent approach to machine learning that has demonstrated significantly reduced energy usage compared to neural networks alike, while performing competitively accuracy-wise on several benchmarks. However, TMs rely heavily on energy-costly random number generation to stochastically guide a team of Tsetlin Automata to a Nash Equilibrium of the TM game. In this paper, we propose a novel fi"},"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":"2007.02114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-04T14:56:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b3f303c5c4d8ef3bd5516f24d2e0e6428ffd7f5641245165cbeb8e55a0ac5635","abstract_canon_sha256":"055098df4a928df92a95a4c97dae3a002ebfa4e3d8e87537e1c43e63505aa6db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:19.278197Z","signature_b64":"RQKA2bQUt7meELFGRE2VI8+ZbdS4lMgK1x/NGYFGmGjJC1UY11bXGPEIti7oNPNTeJFeKx4aFDnhaOLhXx+fCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd4c9b2017ab24cf7911d7aebfca2d46f4c1519eba2771f15651487cb2ee9a1a","last_reissued_at":"2026-07-05T01:16:19.277736Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:19.277736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Multi-Step Finite-State Automaton for Arbitrarily Deterministic Tsetlin Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Adrian Wheeldon, Alex Yakovlev, Jie Lei, K. Darshana Abeyrathna, Morten Goodwin, Ole-Christoffer Granmo, Rishad Shafik","submitted_at":"2020-07-04T14:56:05Z","abstract_excerpt":"Due to the high energy consumption and scalability challenges of deep learning, there is a critical need to shift research focus towards dealing with energy consumption constraints. Tsetlin Machines (TMs) are a recent approach to machine learning that has demonstrated significantly reduced energy usage compared to neural networks alike, while performing competitively accuracy-wise on several benchmarks. However, TMs rely heavily on energy-costly random number generation to stochastically guide a team of Tsetlin Automata to a Nash Equilibrium of the TM game. In this paper, we propose a novel fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02114","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.02114/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":"2007.02114","created_at":"2026-07-05T01:16:19.277805+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.02114v1","created_at":"2026-07-05T01:16:19.277805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02114","created_at":"2026-07-05T01:16:19.277805+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VGJWIAXVMSM","created_at":"2026-07-05T01:16:19.277805+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VGJWIAXVMSM66IR","created_at":"2026-07-05T01:16:19.277805+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VGJWIAX","created_at":"2026-07-05T01:16:19.277805+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/7VGJWIAXVMSM66IR26XL7SRNI3","json":"https://pith.science/pith/7VGJWIAXVMSM66IR26XL7SRNI3.json","graph_json":"https://pith.science/api/pith-number/7VGJWIAXVMSM66IR26XL7SRNI3/graph.json","events_json":"https://pith.science/api/pith-number/7VGJWIAXVMSM66IR26XL7SRNI3/events.json","paper":"https://pith.science/paper/7VGJWIAX"},"agent_actions":{"view_html":"https://pith.science/pith/7VGJWIAXVMSM66IR26XL7SRNI3","download_json":"https://pith.science/pith/7VGJWIAXVMSM66IR26XL7SRNI3.json","view_paper":"https://pith.science/paper/7VGJWIAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.02114&json=true","fetch_graph":"https://pith.science/api/pith-number/7VGJWIAXVMSM66IR26XL7SRNI3/graph.json","fetch_events":"https://pith.science/api/pith-number/7VGJWIAXVMSM66IR26XL7SRNI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VGJWIAXVMSM66IR26XL7SRNI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VGJWIAXVMSM66IR26XL7SRNI3/action/storage_attestation","attest_author":"https://pith.science/pith/7VGJWIAXVMSM66IR26XL7SRNI3/action/author_attestation","sign_citation":"https://pith.science/pith/7VGJWIAXVMSM66IR26XL7SRNI3/action/citation_signature","submit_replication":"https://pith.science/pith/7VGJWIAXVMSM66IR26XL7SRNI3/action/replication_record"}},"created_at":"2026-07-05T01:16:19.277805+00:00","updated_at":"2026-07-05T01:16:19.277805+00:00"}