{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WH6QQLPBUT4K4EMSB2UJIDMVDQ","short_pith_number":"pith:WH6QQLPB","schema_version":"1.0","canonical_sha256":"b1fd082de1a4f8ae11920ea8940d951c274175902447ea3663d9df2c8fe8f004","source":{"kind":"arxiv","id":"1710.02572","version":3},"attestation_state":"computed","paper":{"title":"An Optimization Approach to Learning Falling Rule Lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chaofan Chen, Cynthia Rudin","submitted_at":"2017-10-06T20:16:54Z","abstract_excerpt":"A falling rule list is a probabilistic decision list for binary classification, consisting of a series of if-then rules with antecedents in the if clauses and probabilities of the desired outcome (\"1\") in the then clauses. Just as in a regular decision list, the order of rules in a falling rule list is important -- each example is classified by the first rule whose antecedent it satisfies. Unlike a regular decision list, a falling rule list requires the probabilities of the desired outcome (\"1\") to be monotonically decreasing down the list. We propose an optimization approach to learning falli"},"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":"1710.02572","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-06T20:16:54Z","cross_cats_sorted":[],"title_canon_sha256":"5e27365c528df04549e48e4578968a18972e6f7665698a5fe52b8c5256b7890a","abstract_canon_sha256":"d3f2e2ed81110650edbd1494c5f20f31cfbce3980a2c0074d6e8631f4b632a5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:38.831955Z","signature_b64":"3oMxvySK51qLGpcub7LUBihS2KEn7CMFtOBfnyCoOgRVJrsmsGsvd9WzD3u5b0iZXwOsSOb3DlIr/z9Sqa0rBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1fd082de1a4f8ae11920ea8940d951c274175902447ea3663d9df2c8fe8f004","last_reissued_at":"2026-05-18T00:20:38.831284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:38.831284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimization Approach to Learning Falling Rule Lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chaofan Chen, Cynthia Rudin","submitted_at":"2017-10-06T20:16:54Z","abstract_excerpt":"A falling rule list is a probabilistic decision list for binary classification, consisting of a series of if-then rules with antecedents in the if clauses and probabilities of the desired outcome (\"1\") in the then clauses. Just as in a regular decision list, the order of rules in a falling rule list is important -- each example is classified by the first rule whose antecedent it satisfies. Unlike a regular decision list, a falling rule list requires the probabilities of the desired outcome (\"1\") to be monotonically decreasing down the list. We propose an optimization approach to learning falli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02572","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":""},"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":"1710.02572","created_at":"2026-05-18T00:20:38.831410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02572v3","created_at":"2026-05-18T00:20:38.831410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02572","created_at":"2026-05-18T00:20:38.831410+00:00"},{"alias_kind":"pith_short_12","alias_value":"WH6QQLPBUT4K","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WH6QQLPBUT4K4EMS","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WH6QQLPB","created_at":"2026-05-18T12:31:53.515858+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/WH6QQLPBUT4K4EMSB2UJIDMVDQ","json":"https://pith.science/pith/WH6QQLPBUT4K4EMSB2UJIDMVDQ.json","graph_json":"https://pith.science/api/pith-number/WH6QQLPBUT4K4EMSB2UJIDMVDQ/graph.json","events_json":"https://pith.science/api/pith-number/WH6QQLPBUT4K4EMSB2UJIDMVDQ/events.json","paper":"https://pith.science/paper/WH6QQLPB"},"agent_actions":{"view_html":"https://pith.science/pith/WH6QQLPBUT4K4EMSB2UJIDMVDQ","download_json":"https://pith.science/pith/WH6QQLPBUT4K4EMSB2UJIDMVDQ.json","view_paper":"https://pith.science/paper/WH6QQLPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02572&json=true","fetch_graph":"https://pith.science/api/pith-number/WH6QQLPBUT4K4EMSB2UJIDMVDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WH6QQLPBUT4K4EMSB2UJIDMVDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WH6QQLPBUT4K4EMSB2UJIDMVDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WH6QQLPBUT4K4EMSB2UJIDMVDQ/action/storage_attestation","attest_author":"https://pith.science/pith/WH6QQLPBUT4K4EMSB2UJIDMVDQ/action/author_attestation","sign_citation":"https://pith.science/pith/WH6QQLPBUT4K4EMSB2UJIDMVDQ/action/citation_signature","submit_replication":"https://pith.science/pith/WH6QQLPBUT4K4EMSB2UJIDMVDQ/action/replication_record"}},"created_at":"2026-05-18T00:20:38.831410+00:00","updated_at":"2026-05-18T00:20:38.831410+00:00"}