{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AGCYJZJDNIE7YF6JTDJMHRRB3C","short_pith_number":"pith:AGCYJZJD","schema_version":"1.0","canonical_sha256":"018584e5236a09fc17c998d2c3c621d8ba59b0d313cfadc4568520f70e3b7e5c","source":{"kind":"arxiv","id":"2303.16047","version":3},"attestation_state":"computed","paper":{"title":"Exploring and Interacting with the Set of Good Sparse Generalized Additive Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chudi Zhong, Cynthia Rudin, Jiachang Liu, Margo Seltzer, Zhi Chen","submitted_at":"2023-03-28T15:25:46Z","abstract_excerpt":"In real applications, interaction between machine learning models and domain experts is critical; however, the classical machine learning paradigm that usually produces only a single model does not facilitate such interaction. Approximating and exploring the Rashomon set, i.e., the set of all near-optimal models, addresses this practical challenge by providing the user with a searchable space containing a diverse set of models from which domain experts can choose. We present algorithms to efficiently and accurately approximate the Rashomon set of sparse, generalized additive models with ellips"},"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":"2303.16047","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-28T15:25:46Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"3e2900a2bcc32a4b3a60dd3e003b5ddd10d2eafd092c1df0f526417d39ec7c7b","abstract_canon_sha256":"181e4a764bcbdd7aac227f6cf180032a80a54528e94939ad9a41c0ca9ca5b63e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:13:40.955106Z","signature_b64":"TM7QmW7bY0uAwXfdvccs3SBeUo7RI5x3Z4V1XgU32lhd8Jr6q7GCwGhUPcMHfD6NwTF4M/RUvW4CYDwp49cKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"018584e5236a09fc17c998d2c3c621d8ba59b0d313cfadc4568520f70e3b7e5c","last_reissued_at":"2026-07-05T07:13:40.954635Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:13:40.954635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring and Interacting with the Set of Good Sparse Generalized Additive Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chudi Zhong, Cynthia Rudin, Jiachang Liu, Margo Seltzer, Zhi Chen","submitted_at":"2023-03-28T15:25:46Z","abstract_excerpt":"In real applications, interaction between machine learning models and domain experts is critical; however, the classical machine learning paradigm that usually produces only a single model does not facilitate such interaction. Approximating and exploring the Rashomon set, i.e., the set of all near-optimal models, addresses this practical challenge by providing the user with a searchable space containing a diverse set of models from which domain experts can choose. We present algorithms to efficiently and accurately approximate the Rashomon set of sparse, generalized additive models with ellips"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16047","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.16047/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2303.16047","created_at":"2026-07-05T07:13:40.954692+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.16047v3","created_at":"2026-07-05T07:13:40.954692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16047","created_at":"2026-07-05T07:13:40.954692+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGCYJZJDNIE7","created_at":"2026-07-05T07:13:40.954692+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGCYJZJDNIE7YF6J","created_at":"2026-07-05T07:13:40.954692+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGCYJZJD","created_at":"2026-07-05T07:13:40.954692+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/AGCYJZJDNIE7YF6JTDJMHRRB3C","json":"https://pith.science/pith/AGCYJZJDNIE7YF6JTDJMHRRB3C.json","graph_json":"https://pith.science/api/pith-number/AGCYJZJDNIE7YF6JTDJMHRRB3C/graph.json","events_json":"https://pith.science/api/pith-number/AGCYJZJDNIE7YF6JTDJMHRRB3C/events.json","paper":"https://pith.science/paper/AGCYJZJD"},"agent_actions":{"view_html":"https://pith.science/pith/AGCYJZJDNIE7YF6JTDJMHRRB3C","download_json":"https://pith.science/pith/AGCYJZJDNIE7YF6JTDJMHRRB3C.json","view_paper":"https://pith.science/paper/AGCYJZJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.16047&json=true","fetch_graph":"https://pith.science/api/pith-number/AGCYJZJDNIE7YF6JTDJMHRRB3C/graph.json","fetch_events":"https://pith.science/api/pith-number/AGCYJZJDNIE7YF6JTDJMHRRB3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGCYJZJDNIE7YF6JTDJMHRRB3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGCYJZJDNIE7YF6JTDJMHRRB3C/action/storage_attestation","attest_author":"https://pith.science/pith/AGCYJZJDNIE7YF6JTDJMHRRB3C/action/author_attestation","sign_citation":"https://pith.science/pith/AGCYJZJDNIE7YF6JTDJMHRRB3C/action/citation_signature","submit_replication":"https://pith.science/pith/AGCYJZJDNIE7YF6JTDJMHRRB3C/action/replication_record"}},"created_at":"2026-07-05T07:13:40.954692+00:00","updated_at":"2026-07-05T07:13:40.954692+00:00"}