{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ENM3BHNOGF6FJENY3ZYVLIPEKP","short_pith_number":"pith:ENM3BHNO","schema_version":"1.0","canonical_sha256":"2359b09dae317c5491b8de7155a1e453f89576dae201cafc9a60941653fe014e","source":{"kind":"arxiv","id":"1511.02210","version":1},"attestation_state":"computed","paper":{"title":"Learning Optimized Or's of And's","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Cynthia Rudin, Tong Wang","submitted_at":"2015-11-06T19:55:59Z","abstract_excerpt":"Or's of And's (OA) models are comprised of a small number of disjunctions of conjunctions, also called disjunctive normal form. An example of an OA model is as follows: If ($x_1 = $ `blue' AND $x_2=$ `middle') OR ($x_1 = $ `yellow'), then predict $Y=1$, else predict $Y=0$. Or's of And's models have the advantage of being interpretable to human experts, since they are a set of conditions that concisely capture the characteristics of a specific subset of data. We present two optimization-based machine learning frameworks for constructing OA models, Optimized OA (OOA) and its faster version, Opti"},"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":"1511.02210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-06T19:55:59Z","cross_cats_sorted":[],"title_canon_sha256":"45f4c9016d77b42bd1d1a74c04b50507a1a39dd46554b1ffac2de509195fcecb","abstract_canon_sha256":"e1f428a23cc7f2b16ab7fbad0f6c0cb1fdac4112fbb726d95589d7c9dbf67859"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:37.450240Z","signature_b64":"RSFTLADj2Xme4o2aPsN8NEIqjkINe+f77vOXvbpHl/F8HTQfo7zvlAuoDw67m7V1m+af+hGt8rZgGbpQ2b/eDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2359b09dae317c5491b8de7155a1e453f89576dae201cafc9a60941653fe014e","last_reissued_at":"2026-05-18T01:27:37.449635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:37.449635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Optimized Or's of And's","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Cynthia Rudin, Tong Wang","submitted_at":"2015-11-06T19:55:59Z","abstract_excerpt":"Or's of And's (OA) models are comprised of a small number of disjunctions of conjunctions, also called disjunctive normal form. An example of an OA model is as follows: If ($x_1 = $ `blue' AND $x_2=$ `middle') OR ($x_1 = $ `yellow'), then predict $Y=1$, else predict $Y=0$. Or's of And's models have the advantage of being interpretable to human experts, since they are a set of conditions that concisely capture the characteristics of a specific subset of data. We present two optimization-based machine learning frameworks for constructing OA models, Optimized OA (OOA) and its faster version, Opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02210","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":"1511.02210","created_at":"2026-05-18T01:27:37.449756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02210v1","created_at":"2026-05-18T01:27:37.449756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02210","created_at":"2026-05-18T01:27:37.449756+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENM3BHNOGF6F","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENM3BHNOGF6FJENY","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENM3BHNO","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02221","citing_title":"Bias Detection via Maximum Subgroup Discrepancy","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ENM3BHNOGF6FJENY3ZYVLIPEKP","json":"https://pith.science/pith/ENM3BHNOGF6FJENY3ZYVLIPEKP.json","graph_json":"https://pith.science/api/pith-number/ENM3BHNOGF6FJENY3ZYVLIPEKP/graph.json","events_json":"https://pith.science/api/pith-number/ENM3BHNOGF6FJENY3ZYVLIPEKP/events.json","paper":"https://pith.science/paper/ENM3BHNO"},"agent_actions":{"view_html":"https://pith.science/pith/ENM3BHNOGF6FJENY3ZYVLIPEKP","download_json":"https://pith.science/pith/ENM3BHNOGF6FJENY3ZYVLIPEKP.json","view_paper":"https://pith.science/paper/ENM3BHNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02210&json=true","fetch_graph":"https://pith.science/api/pith-number/ENM3BHNOGF6FJENY3ZYVLIPEKP/graph.json","fetch_events":"https://pith.science/api/pith-number/ENM3BHNOGF6FJENY3ZYVLIPEKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENM3BHNOGF6FJENY3ZYVLIPEKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENM3BHNOGF6FJENY3ZYVLIPEKP/action/storage_attestation","attest_author":"https://pith.science/pith/ENM3BHNOGF6FJENY3ZYVLIPEKP/action/author_attestation","sign_citation":"https://pith.science/pith/ENM3BHNOGF6FJENY3ZYVLIPEKP/action/citation_signature","submit_replication":"https://pith.science/pith/ENM3BHNOGF6FJENY3ZYVLIPEKP/action/replication_record"}},"created_at":"2026-05-18T01:27:37.449756+00:00","updated_at":"2026-05-18T01:27:37.449756+00:00"}