{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XCKNFZBJR3O5ENVLMJ2KPBGNGM","short_pith_number":"pith:XCKNFZBJ","schema_version":"1.0","canonical_sha256":"b894d2e4298eddd236ab6274a784cd3322c17cbb1ad4e1e5cc7f311e72f06c45","source":{"kind":"arxiv","id":"2202.06913","version":3},"attestation_state":"computed","paper":{"title":"FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Farhad Shakerin, Gopal Gupta, Huaduo Wang","submitted_at":"2022-02-14T18:07:54Z","abstract_excerpt":"FOLD-RM is an automated inductive learning algorithm for learning default rules for mixed (numerical and categorical) data. It generates an (explainable) answer set programming (ASP) rule set for multi-category classification tasks while maintaining efficiency and scalability. The FOLD-RM algorithm is competitive in performance with the widely-used, state-of-the-art algorithms such as XGBoost and multi-layer perceptrons (MLPs), however, unlike these algorithms, the FOLD-RM algorithm produces an explainable model. FOLD-RM outperforms XGBoost on some datasets, particularly large ones. FOLD-RM al"},"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":"2202.06913","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-14T18:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"382566bfb5f1d76c358158186dafe29130e0db4449739fcc89234fd2ce22ae56","abstract_canon_sha256":"5b31e4a2723951fdda6ec2bc6eef4fe3f8d6e456b3474a40473e4b8550f24ba0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:23:24.564868Z","signature_b64":"kYA4XsZVU6GZt6Aqdg0FbsViRvSsifJvE5GVnxpXxN+zVr3k83gM4uh2bTs0gHTLSO5wntAfWMvpVsYFeU6NCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b894d2e4298eddd236ab6274a784cd3322c17cbb1ad4e1e5cc7f311e72f06c45","last_reissued_at":"2026-07-05T04:23:24.564401Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:23:24.564401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Farhad Shakerin, Gopal Gupta, Huaduo Wang","submitted_at":"2022-02-14T18:07:54Z","abstract_excerpt":"FOLD-RM is an automated inductive learning algorithm for learning default rules for mixed (numerical and categorical) data. It generates an (explainable) answer set programming (ASP) rule set for multi-category classification tasks while maintaining efficiency and scalability. The FOLD-RM algorithm is competitive in performance with the widely-used, state-of-the-art algorithms such as XGBoost and multi-layer perceptrons (MLPs), however, unlike these algorithms, the FOLD-RM algorithm produces an explainable model. FOLD-RM outperforms XGBoost on some datasets, particularly large ones. FOLD-RM al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.06913","kind":"arxiv","version":3},"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/2202.06913/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":"2202.06913","created_at":"2026-07-05T04:23:24.564458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.06913v3","created_at":"2026-07-05T04:23:24.564458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.06913","created_at":"2026-07-05T04:23:24.564458+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCKNFZBJR3O5","created_at":"2026-07-05T04:23:24.564458+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCKNFZBJR3O5ENVL","created_at":"2026-07-05T04:23:24.564458+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCKNFZBJ","created_at":"2026-07-05T04:23:24.564458+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/XCKNFZBJR3O5ENVLMJ2KPBGNGM","json":"https://pith.science/pith/XCKNFZBJR3O5ENVLMJ2KPBGNGM.json","graph_json":"https://pith.science/api/pith-number/XCKNFZBJR3O5ENVLMJ2KPBGNGM/graph.json","events_json":"https://pith.science/api/pith-number/XCKNFZBJR3O5ENVLMJ2KPBGNGM/events.json","paper":"https://pith.science/paper/XCKNFZBJ"},"agent_actions":{"view_html":"https://pith.science/pith/XCKNFZBJR3O5ENVLMJ2KPBGNGM","download_json":"https://pith.science/pith/XCKNFZBJR3O5ENVLMJ2KPBGNGM.json","view_paper":"https://pith.science/paper/XCKNFZBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.06913&json=true","fetch_graph":"https://pith.science/api/pith-number/XCKNFZBJR3O5ENVLMJ2KPBGNGM/graph.json","fetch_events":"https://pith.science/api/pith-number/XCKNFZBJR3O5ENVLMJ2KPBGNGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCKNFZBJR3O5ENVLMJ2KPBGNGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCKNFZBJR3O5ENVLMJ2KPBGNGM/action/storage_attestation","attest_author":"https://pith.science/pith/XCKNFZBJR3O5ENVLMJ2KPBGNGM/action/author_attestation","sign_citation":"https://pith.science/pith/XCKNFZBJR3O5ENVLMJ2KPBGNGM/action/citation_signature","submit_replication":"https://pith.science/pith/XCKNFZBJR3O5ENVLMJ2KPBGNGM/action/replication_record"}},"created_at":"2026-07-05T04:23:24.564458+00:00","updated_at":"2026-07-05T04:23:24.564458+00:00"}