{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DA44KYOHC2SXFBIBZTLZ3GQBSF","short_pith_number":"pith:DA44KYOH","schema_version":"1.0","canonical_sha256":"1839c561c716a5728501ccd79d9a01917825d89ca8084f2e35093e5f0bccc2e1","source":{"kind":"arxiv","id":"1804.01508","version":15},"attestation_state":"computed","paper":{"title":"The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.AI","authors_text":"Ole-Christoffer Granmo","submitted_at":"2018-04-04T16:52:34Z","abstract_excerpt":"Although simple individually, artificial neurons provide state-of-the-art performance when interconnected in deep networks. Arguably, the Tsetlin Automaton is an even simpler and more versatile learning mechanism, capable of solving the multi-armed bandit problem. Merely by means of a single integer as memory, it learns the optimal action in stochastic environments through increment and decrement operations. In this paper, we introduce the Tsetlin Machine, which solves complex pattern recognition problems with propositional formulas, composed by a collective of Tsetlin Automata. To eliminate t"},"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":"1804.01508","kind":"arxiv","version":15},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-04-04T16:52:34Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"eecf290d966fb60218e77f0d02e19a655bbd54db9adb66b39a8a08e12492b2a2","abstract_canon_sha256":"1c6a7177895ad7e3e428be9beb5d976cc5c159e19752c400240bd22b17ef88fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:01.412344Z","signature_b64":"oIZA0Rm3ZVilpbrW8D5kKUUgg3DReCjOPIAea0IIDRcmGQuQtbtaaVMoGgFOKHJ3laDaGxYZDfxfGca2V1iJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1839c561c716a5728501ccd79d9a01917825d89ca8084f2e35093e5f0bccc2e1","last_reissued_at":"2026-07-05T02:04:01.411989Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:01.411989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.AI","authors_text":"Ole-Christoffer Granmo","submitted_at":"2018-04-04T16:52:34Z","abstract_excerpt":"Although simple individually, artificial neurons provide state-of-the-art performance when interconnected in deep networks. Arguably, the Tsetlin Automaton is an even simpler and more versatile learning mechanism, capable of solving the multi-armed bandit problem. Merely by means of a single integer as memory, it learns the optimal action in stochastic environments through increment and decrement operations. In this paper, we introduce the Tsetlin Machine, which solves complex pattern recognition problems with propositional formulas, composed by a collective of Tsetlin Automata. To eliminate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01508","kind":"arxiv","version":15},"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/1804.01508/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":"1804.01508","created_at":"2026-07-05T02:04:01.412043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01508v15","created_at":"2026-07-05T02:04:01.412043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01508","created_at":"2026-07-05T02:04:01.412043+00:00"},{"alias_kind":"pith_short_12","alias_value":"DA44KYOHC2SX","created_at":"2026-07-05T02:04:01.412043+00:00"},{"alias_kind":"pith_short_16","alias_value":"DA44KYOHC2SXFBIB","created_at":"2026-07-05T02:04:01.412043+00:00"},{"alias_kind":"pith_short_8","alias_value":"DA44KYOH","created_at":"2026-07-05T02:04:01.412043+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06719","citing_title":"Macroeconomic Message Passing for Anticipating Foreign Exchange Regime Changes: A Deep Logical Learning Approach using Graph Tsetlin Machines","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26220","citing_title":"Interpretable rule-based learning in an autonomous thermodynamic network","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2606.19964","citing_title":"Low-Energy Reduced RISC-V Instruction Subset Processor for Tsetlin Machine Inference at the Edge","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18832","citing_title":"Target-confidence Recourse Using tSeTlin machines: TRUST","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08552","citing_title":"Quantitative Promise Theory: Intentionality and Inference in Autonomous Agents","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16707","citing_title":"On-Device Interpretable Tsetlin Machine-Based Intrusion Detection for Secure IoMT","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16707","citing_title":"On-Device Interpretable Tsetlin Machine-Based Intrusion Detection for Secure IoMT","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2507.14874","citing_title":"The Tsetlin Machine Goes Deep: Logical Learning and Reasoning With Graphs","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03205","citing_title":"A Tsetlin Machine-driven Intrusion Detection System for Next-Generation IoMT Security","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06982","citing_title":"FastOmniTMAE: Parallel Clause Learning for Scalable and Hardware-Efficient Tsetlin Embeddings","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DA44KYOHC2SXFBIBZTLZ3GQBSF","json":"https://pith.science/pith/DA44KYOHC2SXFBIBZTLZ3GQBSF.json","graph_json":"https://pith.science/api/pith-number/DA44KYOHC2SXFBIBZTLZ3GQBSF/graph.json","events_json":"https://pith.science/api/pith-number/DA44KYOHC2SXFBIBZTLZ3GQBSF/events.json","paper":"https://pith.science/paper/DA44KYOH"},"agent_actions":{"view_html":"https://pith.science/pith/DA44KYOHC2SXFBIBZTLZ3GQBSF","download_json":"https://pith.science/pith/DA44KYOHC2SXFBIBZTLZ3GQBSF.json","view_paper":"https://pith.science/paper/DA44KYOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01508&json=true","fetch_graph":"https://pith.science/api/pith-number/DA44KYOHC2SXFBIBZTLZ3GQBSF/graph.json","fetch_events":"https://pith.science/api/pith-number/DA44KYOHC2SXFBIBZTLZ3GQBSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DA44KYOHC2SXFBIBZTLZ3GQBSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DA44KYOHC2SXFBIBZTLZ3GQBSF/action/storage_attestation","attest_author":"https://pith.science/pith/DA44KYOHC2SXFBIBZTLZ3GQBSF/action/author_attestation","sign_citation":"https://pith.science/pith/DA44KYOHC2SXFBIBZTLZ3GQBSF/action/citation_signature","submit_replication":"https://pith.science/pith/DA44KYOHC2SXFBIBZTLZ3GQBSF/action/replication_record"}},"created_at":"2026-07-05T02:04:01.412043+00:00","updated_at":"2026-07-05T02:04:01.412043+00:00"}