{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZG2RYII6EKTPTOGKTLAL6PD3DI","short_pith_number":"pith:ZG2RYII6","canonical_record":{"source":{"id":"1806.08716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-22T15:10:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ff77d3035a10ab866c43d1abed0eb33def9f6e6fe0f168c6bfcf6fa370c18bde","abstract_canon_sha256":"cf176f3b0a81a6d069e86e05e6e075bfca651feb0c4950aff03e840ccd4d1eb9"},"schema_version":"1.0"},"canonical_sha256":"c9b51c211e22a6f9b8ca9ac0bf3c7b1a136c8b1d1974836f6dbf9c6bb5faf4bb","source":{"kind":"arxiv","id":"1806.08716","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08716","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08716v2","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08716","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZG2RYII6EKTP","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZG2RYII6EKTPTOGK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZG2RYII6","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZG2RYII6EKTPTOGKTLAL6PD3DI","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-22T15:10:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ff77d3035a10ab866c43d1abed0eb33def9f6e6fe0f168c6bfcf6fa370c18bde","abstract_canon_sha256":"cf176f3b0a81a6d069e86e05e6e075bfca651feb0c4950aff03e840ccd4d1eb9"},"schema_version":"1.0"},"canonical_sha256":"c9b51c211e22a6f9b8ca9ac0bf3c7b1a136c8b1d1974836f6dbf9c6bb5faf4bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:16.514478Z","signature_b64":"+hSrYd62iLDB9tMIbYXjPZFfA5rFrhWLf1Fl9frNUFGM3HZ0G81aRqlkpTWQL6vx+a45on+XBxRh6IJddhJ1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9b51c211e22a6f9b8ca9ac0bf3c7b1a136c8b1d1974836f6dbf9c6bb5faf4bb","last_reissued_at":"2026-05-18T00:10:16.513858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:16.513858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08716","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-18T00:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMOUshw0p3U7rI1dFr7HZEueffMocN8STmSVInI/AftURNfBDRLM9vNWHUr92MpF6JxhFbRHRGUTxWTeyWYSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:15:41.301137Z"},"content_sha256":"d152cab3a37ff40ec551340175bfe45bed9ece9f80bd2f2748ba884763377255","schema_version":"1.0","event_id":"sha256:d152cab3a37ff40ec551340175bfe45bed9ece9f80bd2f2748ba884763377255"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZG2RYII6EKTPTOGKTLAL6PD3DI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Qualitatively Diverse and Interpretable Rules for Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Slavin Ross, Finale Doshi-Velez, Weiwei Pan","submitted_at":"2018-06-22T15:10:41Z","abstract_excerpt":"There has been growing interest in developing accurate models that can also be explained to humans. Unfortunately, if there exist multiple distinct but accurate models for some dataset, current machine learning methods are unlikely to find them: standard techniques will likely recover a complex model that combines them. In this work, we introduce a way to identify a maximal set of distinct but accurate models for a dataset. We demonstrate empirically that, in situations where the data supports multiple accurate classifiers, we tend to recover simpler, more interpretable classifiers rather than"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08716","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-18T00:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1qn/uESL9dH2Twodw4j6c7QdTcdIZ7TMovevjYJxEAOBBii9kHgMWwZGJ/YnzaSmC12BszD2PF5Sgu18tG+xAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:15:41.301504Z"},"content_sha256":"6ef0b4aa6e3f8a59aa53e5021b72716052ac53f36ba1892019f6a3df4388beca","schema_version":"1.0","event_id":"sha256:6ef0b4aa6e3f8a59aa53e5021b72716052ac53f36ba1892019f6a3df4388beca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZG2RYII6EKTPTOGKTLAL6PD3DI/bundle.json","state_url":"https://pith.science/pith/ZG2RYII6EKTPTOGKTLAL6PD3DI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZG2RYII6EKTPTOGKTLAL6PD3DI/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-05-28T05:15:41Z","links":{"resolver":"https://pith.science/pith/ZG2RYII6EKTPTOGKTLAL6PD3DI","bundle":"https://pith.science/pith/ZG2RYII6EKTPTOGKTLAL6PD3DI/bundle.json","state":"https://pith.science/pith/ZG2RYII6EKTPTOGKTLAL6PD3DI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZG2RYII6EKTPTOGKTLAL6PD3DI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZG2RYII6EKTPTOGKTLAL6PD3DI","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":"cf176f3b0a81a6d069e86e05e6e075bfca651feb0c4950aff03e840ccd4d1eb9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-22T15:10:41Z","title_canon_sha256":"ff77d3035a10ab866c43d1abed0eb33def9f6e6fe0f168c6bfcf6fa370c18bde"},"schema_version":"1.0","source":{"id":"1806.08716","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08716","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08716v2","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08716","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZG2RYII6EKTP","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZG2RYII6EKTPTOGK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZG2RYII6","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:6ef0b4aa6e3f8a59aa53e5021b72716052ac53f36ba1892019f6a3df4388beca","target":"graph","created_at":"2026-05-18T00:10: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":"There has been growing interest in developing accurate models that can also be explained to humans. Unfortunately, if there exist multiple distinct but accurate models for some dataset, current machine learning methods are unlikely to find them: standard techniques will likely recover a complex model that combines them. In this work, we introduce a way to identify a maximal set of distinct but accurate models for a dataset. We demonstrate empirically that, in situations where the data supports multiple accurate classifiers, we tend to recover simpler, more interpretable classifiers rather than","authors_text":"Andrew Slavin Ross, Finale Doshi-Velez, Weiwei Pan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-22T15:10:41Z","title":"Learning Qualitatively Diverse and Interpretable Rules for Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08716","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:d152cab3a37ff40ec551340175bfe45bed9ece9f80bd2f2748ba884763377255","target":"record","created_at":"2026-05-18T00:10: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":"cf176f3b0a81a6d069e86e05e6e075bfca651feb0c4950aff03e840ccd4d1eb9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-22T15:10:41Z","title_canon_sha256":"ff77d3035a10ab866c43d1abed0eb33def9f6e6fe0f168c6bfcf6fa370c18bde"},"schema_version":"1.0","source":{"id":"1806.08716","kind":"arxiv","version":2}},"canonical_sha256":"c9b51c211e22a6f9b8ca9ac0bf3c7b1a136c8b1d1974836f6dbf9c6bb5faf4bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9b51c211e22a6f9b8ca9ac0bf3c7b1a136c8b1d1974836f6dbf9c6bb5faf4bb","first_computed_at":"2026-05-18T00:10:16.513858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:16.513858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+hSrYd62iLDB9tMIbYXjPZFfA5rFrhWLf1Fl9frNUFGM3HZ0G81aRqlkpTWQL6vx+a45on+XBxRh6IJddhJ1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:16.514478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08716","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d152cab3a37ff40ec551340175bfe45bed9ece9f80bd2f2748ba884763377255","sha256:6ef0b4aa6e3f8a59aa53e5021b72716052ac53f36ba1892019f6a3df4388beca"],"state_sha256":"1697f2131e61f59042a3ec2afee566b8b06154aefc149191a9df16bd64732e74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OeTxSmxX8Fr1oSukdx2VgL6InRNNNxxyBueS2MS4AFOU+7AUZR82sgA5NdtBRrDBJJMyQqGVInIsZfPJ+YD4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:15:41.303526Z","bundle_sha256":"232e91e5fe573e0ce21fb0c58141dbdde390d80452e2c9be77384997e850e1be"}}