{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5ZJEZ2Q757NDYDTQMTWKW2ZVBC","short_pith_number":"pith:5ZJEZ2Q7","schema_version":"1.0","canonical_sha256":"ee524cea1fefda3c0e7064ecab6b3508a275c28d082c58aa81b21e37ed1d22f9","source":{"kind":"arxiv","id":"2601.09071","version":1},"attestation_state":"computed","paper":{"title":"Resolving Predictive Multiplicity for the Rashomon Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cynthia Rudin, Hadis Anahideh, Parian Haghighat","submitted_at":"2026-01-14T02:02:54Z","abstract_excerpt":"The existence of multiple, equally accurate models for a given predictive task leads to predictive multiplicity, where a ``Rashomon set'' of models achieve similar accuracy but diverges in their individual predictions. This inconsistency undermines trust in high-stakes applications where we want consistent predictions. We propose three approaches to reduce inconsistency among predictions for the members of the Rashomon set. The first approach is \\textbf{outlier correction}. An outlier has a label that none of the good models are capable of predicting correctly. Outliers can cause the Rashomon "},"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":"2601.09071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-01-14T02:02:54Z","cross_cats_sorted":[],"title_canon_sha256":"26fbe4581e458fbbc7cfe84b6ffe0e6c05be0d068bdf845e7131bfea15284189","abstract_canon_sha256":"465dc41e3f9a4b84452884f3e5f369a788ac29cd25a02666502fe1ae760d6b1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:02.231620Z","signature_b64":"k7EWkh03jzfJXllE+12V9odR4EsMkH0yDJrTjjGYqZNk9DwQDFEqubfNRzoo2Y9nRm+6qRv0r96ZPYIYsynjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee524cea1fefda3c0e7064ecab6b3508a275c28d082c58aa81b21e37ed1d22f9","last_reissued_at":"2026-05-20T00:03:02.230804Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:02.230804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resolving Predictive Multiplicity for the Rashomon Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cynthia Rudin, Hadis Anahideh, Parian Haghighat","submitted_at":"2026-01-14T02:02:54Z","abstract_excerpt":"The existence of multiple, equally accurate models for a given predictive task leads to predictive multiplicity, where a ``Rashomon set'' of models achieve similar accuracy but diverges in their individual predictions. This inconsistency undermines trust in high-stakes applications where we want consistent predictions. We propose three approaches to reduce inconsistency among predictions for the members of the Rashomon set. The first approach is \\textbf{outlier correction}. An outlier has a label that none of the good models are capable of predicting correctly. Outliers can cause the Rashomon "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.09071","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.09071/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":"2601.09071","created_at":"2026-05-20T00:03:02.230941+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.09071v1","created_at":"2026-05-20T00:03:02.230941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.09071","created_at":"2026-05-20T00:03:02.230941+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZJEZ2Q757ND","created_at":"2026-05-20T00:03:02.230941+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZJEZ2Q757NDYDTQ","created_at":"2026-05-20T00:03:02.230941+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZJEZ2Q7","created_at":"2026-05-20T00:03:02.230941+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.22188","citing_title":"From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5ZJEZ2Q757NDYDTQMTWKW2ZVBC","json":"https://pith.science/pith/5ZJEZ2Q757NDYDTQMTWKW2ZVBC.json","graph_json":"https://pith.science/api/pith-number/5ZJEZ2Q757NDYDTQMTWKW2ZVBC/graph.json","events_json":"https://pith.science/api/pith-number/5ZJEZ2Q757NDYDTQMTWKW2ZVBC/events.json","paper":"https://pith.science/paper/5ZJEZ2Q7"},"agent_actions":{"view_html":"https://pith.science/pith/5ZJEZ2Q757NDYDTQMTWKW2ZVBC","download_json":"https://pith.science/pith/5ZJEZ2Q757NDYDTQMTWKW2ZVBC.json","view_paper":"https://pith.science/paper/5ZJEZ2Q7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.09071&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZJEZ2Q757NDYDTQMTWKW2ZVBC/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZJEZ2Q757NDYDTQMTWKW2ZVBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZJEZ2Q757NDYDTQMTWKW2ZVBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZJEZ2Q757NDYDTQMTWKW2ZVBC/action/storage_attestation","attest_author":"https://pith.science/pith/5ZJEZ2Q757NDYDTQMTWKW2ZVBC/action/author_attestation","sign_citation":"https://pith.science/pith/5ZJEZ2Q757NDYDTQMTWKW2ZVBC/action/citation_signature","submit_replication":"https://pith.science/pith/5ZJEZ2Q757NDYDTQMTWKW2ZVBC/action/replication_record"}},"created_at":"2026-05-20T00:03:02.230941+00:00","updated_at":"2026-05-20T00:03:02.230941+00:00"}