{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K4SO7DDW3GDKP4Z2GL7LQCKZP3","short_pith_number":"pith:K4SO7DDW","schema_version":"1.0","canonical_sha256":"5724ef8c76d986a7f33a32feb809597ec1b4df3601d1a76675c315d7eb75f948","source":{"kind":"arxiv","id":"2403.09680","version":2},"attestation_state":"computed","paper":{"title":"Pre-Sorted Tsetlin Machine (The Genetic K-Medoid Method)","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Jordan Morris","submitted_at":"2024-02-07T15:30:23Z","abstract_excerpt":"This paper proposes a machine learning pre-sort stage to traditional supervised learning using Tsetlin Machines. Initially, K data-points are identified from the dataset using an expedited genetic algorithm to solve the maximum dispersion problem. These are then used as the initial placement to run the K-Medoid clustering algorithm. Finally, an expedited genetic algorithm is used to align K independent Tsetlin Machines by maximising hamming distance. For MNIST level classification problems, results demonstrate up to 10% improvement in accuracy, approx. 383X reduction in training time and appro"},"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":"2403.09680","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.NE","submitted_at":"2024-02-07T15:30:23Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9cf74eaba4051305dc9f7fd2cd25aa653bb4fc5fb84cf7f1a6d04d776f071c23","abstract_canon_sha256":"47119d90abe1a9893fe4b4ed1092a0247c9d498ab70157ce8a1cc049d91f961c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:05:39.768341Z","signature_b64":"xEpxSr1zInN0JcVBpB8LsJe2Z1zfqlFHMch5QNjLc9tQEecGpnpE0jmH1jm22unGY4KxjtWHTalQ10lU0xepBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5724ef8c76d986a7f33a32feb809597ec1b4df3601d1a76675c315d7eb75f948","last_reissued_at":"2026-07-05T08:05:39.767826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:05:39.767826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pre-Sorted Tsetlin Machine (The Genetic K-Medoid Method)","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Jordan Morris","submitted_at":"2024-02-07T15:30:23Z","abstract_excerpt":"This paper proposes a machine learning pre-sort stage to traditional supervised learning using Tsetlin Machines. Initially, K data-points are identified from the dataset using an expedited genetic algorithm to solve the maximum dispersion problem. These are then used as the initial placement to run the K-Medoid clustering algorithm. Finally, an expedited genetic algorithm is used to align K independent Tsetlin Machines by maximising hamming distance. For MNIST level classification problems, results demonstrate up to 10% improvement in accuracy, approx. 383X reduction in training time and appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09680","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/2403.09680/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":"2403.09680","created_at":"2026-07-05T08:05:39.767885+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.09680v2","created_at":"2026-07-05T08:05:39.767885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09680","created_at":"2026-07-05T08:05:39.767885+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4SO7DDW3GDK","created_at":"2026-07-05T08:05:39.767885+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4SO7DDW3GDKP4Z2","created_at":"2026-07-05T08:05:39.767885+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4SO7DDW","created_at":"2026-07-05T08:05:39.767885+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/K4SO7DDW3GDKP4Z2GL7LQCKZP3","json":"https://pith.science/pith/K4SO7DDW3GDKP4Z2GL7LQCKZP3.json","graph_json":"https://pith.science/api/pith-number/K4SO7DDW3GDKP4Z2GL7LQCKZP3/graph.json","events_json":"https://pith.science/api/pith-number/K4SO7DDW3GDKP4Z2GL7LQCKZP3/events.json","paper":"https://pith.science/paper/K4SO7DDW"},"agent_actions":{"view_html":"https://pith.science/pith/K4SO7DDW3GDKP4Z2GL7LQCKZP3","download_json":"https://pith.science/pith/K4SO7DDW3GDKP4Z2GL7LQCKZP3.json","view_paper":"https://pith.science/paper/K4SO7DDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.09680&json=true","fetch_graph":"https://pith.science/api/pith-number/K4SO7DDW3GDKP4Z2GL7LQCKZP3/graph.json","fetch_events":"https://pith.science/api/pith-number/K4SO7DDW3GDKP4Z2GL7LQCKZP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4SO7DDW3GDKP4Z2GL7LQCKZP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4SO7DDW3GDKP4Z2GL7LQCKZP3/action/storage_attestation","attest_author":"https://pith.science/pith/K4SO7DDW3GDKP4Z2GL7LQCKZP3/action/author_attestation","sign_citation":"https://pith.science/pith/K4SO7DDW3GDKP4Z2GL7LQCKZP3/action/citation_signature","submit_replication":"https://pith.science/pith/K4SO7DDW3GDKP4Z2GL7LQCKZP3/action/replication_record"}},"created_at":"2026-07-05T08:05:39.767885+00:00","updated_at":"2026-07-05T08:05:39.767885+00:00"}