{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:E4WOZCEGX5P6RACM7KWJXX2WJE","short_pith_number":"pith:E4WOZCEG","canonical_record":{"source":{"id":"1405.4047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-05-16T01:30:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"214ad4a1bb9a5c85b8c646b7aea7e48628a36a7f091679b34f4488b93a7abf99","abstract_canon_sha256":"8a923babfc03d4637a3422d51cb2559d0a94423dc7928d95125666f971ed0b70"},"schema_version":"1.0"},"canonical_sha256":"272cec8886bf5fe8804cfaac9bdf564913898f7c86353a9fda6b9243cbf54249","source":{"kind":"arxiv","id":"1405.4047","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4047","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4047v2","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4047","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"E4WOZCEGX5P6","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E4WOZCEGX5P6RACM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E4WOZCEG","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:E4WOZCEGX5P6RACM7KWJXX2WJE","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-05-16T01:30:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"214ad4a1bb9a5c85b8c646b7aea7e48628a36a7f091679b34f4488b93a7abf99","abstract_canon_sha256":"8a923babfc03d4637a3422d51cb2559d0a94423dc7928d95125666f971ed0b70"},"schema_version":"1.0"},"canonical_sha256":"272cec8886bf5fe8804cfaac9bdf564913898f7c86353a9fda6b9243cbf54249","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:16.865835Z","signature_b64":"N9gPk36MMp8p+4omWIkiARxsYp3Pleybnd9T5Kbw5jmt8BTqEMc5UabKY8dwgUL14avEdJmBLjfGw/as9Sr6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"272cec8886bf5fe8804cfaac9bdf564913898f7c86353a9fda6b9243cbf54249","last_reissued_at":"2026-05-18T02:41:16.865165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:16.865165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4047","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ro3stCWezcqxgaV0ETzuT07ZsXMhUHjrZwEgMTzlvdoJpoYZCVIw8X/hKp0ldPyD8DBOhtPiZsEj0Z16wBg2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:02:11.201445Z"},"content_sha256":"c70cbdaac451623441cad830559b3e1032026839b2a8a10197994a8033a7b638","schema_version":"1.0","event_id":"sha256:c70cbdaac451623441cad830559b3e1032026839b2a8a10197994a8033a7b638"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:E4WOZCEGX5P6RACM7KWJXX2WJE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Methods and Models for Interpretable Linear Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.ME","authors_text":"Berk Ustun, Cynthia Rudin","submitted_at":"2014-05-16T01:30:11Z","abstract_excerpt":"We present an integer programming framework to build accurate and interpretable discrete linear classification models. Unlike existing approaches, our framework is designed to provide practitioners with the control and flexibility they need to tailor accurate and interpretable models for a domain of choice. To this end, our framework can produce models that are fully optimized for accuracy, by minimizing the 0--1 classification loss, and that address multiple aspects of interpretability, by incorporating a range of discrete constraints and penalty functions. We use our framework to produce mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4047","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7HfGOp0JJeZATWKEkL1+IRrseoy8ykapngyuNMKR6qRrqbjQcKeDmUAe/EkhJDodjkApYSLt7NzE/M9zj32CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:02:11.201797Z"},"content_sha256":"2d5b059de1ab7eb169d4eeda41a516e4d4746a8bddaee733db5cb93a4c31767e","schema_version":"1.0","event_id":"sha256:2d5b059de1ab7eb169d4eeda41a516e4d4746a8bddaee733db5cb93a4c31767e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4WOZCEGX5P6RACM7KWJXX2WJE/bundle.json","state_url":"https://pith.science/pith/E4WOZCEGX5P6RACM7KWJXX2WJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4WOZCEGX5P6RACM7KWJXX2WJE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T17:02:11Z","links":{"resolver":"https://pith.science/pith/E4WOZCEGX5P6RACM7KWJXX2WJE","bundle":"https://pith.science/pith/E4WOZCEGX5P6RACM7KWJXX2WJE/bundle.json","state":"https://pith.science/pith/E4WOZCEGX5P6RACM7KWJXX2WJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4WOZCEGX5P6RACM7KWJXX2WJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:E4WOZCEGX5P6RACM7KWJXX2WJE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8a923babfc03d4637a3422d51cb2559d0a94423dc7928d95125666f971ed0b70","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-05-16T01:30:11Z","title_canon_sha256":"214ad4a1bb9a5c85b8c646b7aea7e48628a36a7f091679b34f4488b93a7abf99"},"schema_version":"1.0","source":{"id":"1405.4047","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4047","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4047v2","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4047","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"E4WOZCEGX5P6","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E4WOZCEGX5P6RACM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E4WOZCEG","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:2d5b059de1ab7eb169d4eeda41a516e4d4746a8bddaee733db5cb93a4c31767e","target":"graph","created_at":"2026-05-18T02:41:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We present an integer programming framework to build accurate and interpretable discrete linear classification models. Unlike existing approaches, our framework is designed to provide practitioners with the control and flexibility they need to tailor accurate and interpretable models for a domain of choice. To this end, our framework can produce models that are fully optimized for accuracy, by minimizing the 0--1 classification loss, and that address multiple aspects of interpretability, by incorporating a range of discrete constraints and penalty functions. We use our framework to produce mod","authors_text":"Berk Ustun, Cynthia Rudin","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-05-16T01:30:11Z","title":"Methods and Models for Interpretable Linear Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4047","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c70cbdaac451623441cad830559b3e1032026839b2a8a10197994a8033a7b638","target":"record","created_at":"2026-05-18T02:41:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8a923babfc03d4637a3422d51cb2559d0a94423dc7928d95125666f971ed0b70","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-05-16T01:30:11Z","title_canon_sha256":"214ad4a1bb9a5c85b8c646b7aea7e48628a36a7f091679b34f4488b93a7abf99"},"schema_version":"1.0","source":{"id":"1405.4047","kind":"arxiv","version":2}},"canonical_sha256":"272cec8886bf5fe8804cfaac9bdf564913898f7c86353a9fda6b9243cbf54249","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"272cec8886bf5fe8804cfaac9bdf564913898f7c86353a9fda6b9243cbf54249","first_computed_at":"2026-05-18T02:41:16.865165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:16.865165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N9gPk36MMp8p+4omWIkiARxsYp3Pleybnd9T5Kbw5jmt8BTqEMc5UabKY8dwgUL14avEdJmBLjfGw/as9Sr6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:16.865835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4047","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c70cbdaac451623441cad830559b3e1032026839b2a8a10197994a8033a7b638","sha256:2d5b059de1ab7eb169d4eeda41a516e4d4746a8bddaee733db5cb93a4c31767e"],"state_sha256":"b19925f532c48abbb5179004566ecbd62b8c19a10c524116db020f302b34fd45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOpJcE/3+W1EhXbM+atqKubEkVwWdtGg+sZvCYlzfz5T+wxVQFsDz3/TOI66SllyR2Wrgffk9faNF8Bv2sx3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T17:02:11.203753Z","bundle_sha256":"b4286a1d12bbb44749629a1136a0772cfcd9db118b271257ed62783d9c9048f4"}}