{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UFGRBPD37YKVEAMBYXPSVNUPJD","short_pith_number":"pith:UFGRBPD3","schema_version":"1.0","canonical_sha256":"a14d10bc7bfe15520181c5df2ab68f48eeaccc35c3d60304a110245b973ea758","source":{"kind":"arxiv","id":"1504.07614","version":1},"attestation_state":"computed","paper":{"title":"Or's of And's for Interpretable Classification, with Application to Context-Aware Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cynthia Rudin, Erica Klampfl, Finale Doshi-Velez, Perry MacNeille, Tong Wang, Yimin Liu","submitted_at":"2015-04-28T19:53:59Z","abstract_excerpt":"We present a machine learning algorithm for building classifiers that are comprised of a small number of disjunctions of conjunctions (or's of and's). An example of a classifier of this form is as follows: If X satisfies (x1 = 'blue' AND x3 = 'middle') OR (x1 = 'blue' AND x2 = '<15') OR (x1 = 'yellow'), then we predict that Y=1, ELSE predict Y=0. An attribute-value pair is called a literal and a conjunction of literals is called a pattern. Models of this form have the advantage of being interpretable to human experts, since they produce a set of conditions that concisely describe a specific cl"},"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":"1504.07614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-28T19:53:59Z","cross_cats_sorted":[],"title_canon_sha256":"e63ac802eb465bb5804eb1f9fcfb8536ac1eba2b9f54b770552c3164f9f86ce6","abstract_canon_sha256":"567b59867ba491933ff1ab2ed274910cf752f77de74a30b3dcd8a444e38da5cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:34.196555Z","signature_b64":"+CavstzHU/2UpQcGU1gAq8YWkyMauLzeuBH7Opj5PUKb8wbSC4PwR7wqN5bL72HvhC99YIxbQuKSf6yVH1XvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a14d10bc7bfe15520181c5df2ab68f48eeaccc35c3d60304a110245b973ea758","last_reissued_at":"2026-05-18T02:17:34.195799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:34.195799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Or's of And's for Interpretable Classification, with Application to Context-Aware Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cynthia Rudin, Erica Klampfl, Finale Doshi-Velez, Perry MacNeille, Tong Wang, Yimin Liu","submitted_at":"2015-04-28T19:53:59Z","abstract_excerpt":"We present a machine learning algorithm for building classifiers that are comprised of a small number of disjunctions of conjunctions (or's of and's). An example of a classifier of this form is as follows: If X satisfies (x1 = 'blue' AND x3 = 'middle') OR (x1 = 'blue' AND x2 = '<15') OR (x1 = 'yellow'), then we predict that Y=1, ELSE predict Y=0. An attribute-value pair is called a literal and a conjunction of literals is called a pattern. Models of this form have the advantage of being interpretable to human experts, since they produce a set of conditions that concisely describe a specific cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07614","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":"1504.07614","created_at":"2026-05-18T02:17:34.195934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07614v1","created_at":"2026-05-18T02:17:34.195934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07614","created_at":"2026-05-18T02:17:34.195934+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFGRBPD37YKV","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFGRBPD37YKVEAMB","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFGRBPD3","created_at":"2026-05-18T12:29:44.643036+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/UFGRBPD37YKVEAMBYXPSVNUPJD","json":"https://pith.science/pith/UFGRBPD37YKVEAMBYXPSVNUPJD.json","graph_json":"https://pith.science/api/pith-number/UFGRBPD37YKVEAMBYXPSVNUPJD/graph.json","events_json":"https://pith.science/api/pith-number/UFGRBPD37YKVEAMBYXPSVNUPJD/events.json","paper":"https://pith.science/paper/UFGRBPD3"},"agent_actions":{"view_html":"https://pith.science/pith/UFGRBPD37YKVEAMBYXPSVNUPJD","download_json":"https://pith.science/pith/UFGRBPD37YKVEAMBYXPSVNUPJD.json","view_paper":"https://pith.science/paper/UFGRBPD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07614&json=true","fetch_graph":"https://pith.science/api/pith-number/UFGRBPD37YKVEAMBYXPSVNUPJD/graph.json","fetch_events":"https://pith.science/api/pith-number/UFGRBPD37YKVEAMBYXPSVNUPJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFGRBPD37YKVEAMBYXPSVNUPJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFGRBPD37YKVEAMBYXPSVNUPJD/action/storage_attestation","attest_author":"https://pith.science/pith/UFGRBPD37YKVEAMBYXPSVNUPJD/action/author_attestation","sign_citation":"https://pith.science/pith/UFGRBPD37YKVEAMBYXPSVNUPJD/action/citation_signature","submit_replication":"https://pith.science/pith/UFGRBPD37YKVEAMBYXPSVNUPJD/action/replication_record"}},"created_at":"2026-05-18T02:17:34.195934+00:00","updated_at":"2026-05-18T02:17:34.195934+00:00"}