{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:X5RA6FVLEBFMCJZNWUJOQA4NOF","short_pith_number":"pith:X5RA6FVL","canonical_record":{"source":{"id":"2606.00202","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T17:26:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"78eac960579eed8c83e2c45295a5fd8da8d7244d499e2f79dd3d8c8a51d79d11","abstract_canon_sha256":"7ed217ccc2b420da158d7135d14f3ad7d2a8cd90a91efacfb8cf19ebd4757571"},"schema_version":"1.0"},"canonical_sha256":"bf620f16ab204ac1272db512e8038d714d2065745d0d1509505dc06045675392","source":{"kind":"arxiv","id":"2606.00202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00202","created_at":"2026-06-02T01:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00202v1","created_at":"2026-06-02T01:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00202","created_at":"2026-06-02T01:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"X5RA6FVLEBFM","created_at":"2026-06-02T01:03:21Z"},{"alias_kind":"pith_short_16","alias_value":"X5RA6FVLEBFMCJZN","created_at":"2026-06-02T01:03:21Z"},{"alias_kind":"pith_short_8","alias_value":"X5RA6FVL","created_at":"2026-06-02T01:03:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:X5RA6FVLEBFMCJZNWUJOQA4NOF","target":"record","payload":{"canonical_record":{"source":{"id":"2606.00202","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T17:26:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"78eac960579eed8c83e2c45295a5fd8da8d7244d499e2f79dd3d8c8a51d79d11","abstract_canon_sha256":"7ed217ccc2b420da158d7135d14f3ad7d2a8cd90a91efacfb8cf19ebd4757571"},"schema_version":"1.0"},"canonical_sha256":"bf620f16ab204ac1272db512e8038d714d2065745d0d1509505dc06045675392","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:21.428833Z","signature_b64":"8dXAY7UPZWwp6MFVTgjZaPrK7g7h5rEuvTdi41YnOp/wzt+3cYzEq+5KwkuCqGN7wSss9d8fBoDxkYI9G34FAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf620f16ab204ac1272db512e8038d714d2065745d0d1509505dc06045675392","last_reissued_at":"2026-06-02T01:03:21.428505Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:21.428505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.00202","source_version":1,"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-06-02T01:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBtxziQvNixK33YrHy9YP3oz3SutMarP+Tec1o6G+D6SJRnAHc267mW8kMDvtRNfg6Ufvj1UdPZ61j0wIa1pAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:05:56.011009Z"},"content_sha256":"c8826ca9a20ec655d432ce988987085d2390884407f848c48018a8695e80c89d","schema_version":"1.0","event_id":"sha256:c8826ca9a20ec655d432ce988987085d2390884407f848c48018a8695e80c89d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:X5RA6FVLEBFMCJZNWUJOQA4NOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Cynthia Rudin, Hayden McTavish, Margo Seltzer, Varun Babbar, Zakk Heile","submitted_at":"2026-05-29T17:26:14Z","abstract_excerpt":"Standard machine learning pipelines often admit many near-optimal models. These \"Rashomon sets\" pose a range of challenges and opportunities for uncertainty-aware, robust decision making. They allow users to incorporate domain knowledge and preferences that would otherwise be difficult to specify directly in an objective, and they quantify diversity among valid models for a given training dataset and objective function. However, computation of Rashomon sets, even for simple, interpretable model classes such as sparse decision trees, continues to require immense memory and runtime resources. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00202","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/2606.00202/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"},"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-06-02T01:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xesvmCQGW9xuG9+mEUL53r8zyHRR6PEzNi9Z74GJ6xzMKg+D5sZWf+SFO0AaFUvA49tSqSFgqgCCD+3eDvzMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:05:56.011402Z"},"content_sha256":"ca561a94cd92d39511f295875811c399cedc7f70a0cbb6871dfe77ec2ccf87c6","schema_version":"1.0","event_id":"sha256:ca561a94cd92d39511f295875811c399cedc7f70a0cbb6871dfe77ec2ccf87c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5RA6FVLEBFMCJZNWUJOQA4NOF/bundle.json","state_url":"https://pith.science/pith/X5RA6FVLEBFMCJZNWUJOQA4NOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5RA6FVLEBFMCJZNWUJOQA4NOF/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-30T22:05:56Z","links":{"resolver":"https://pith.science/pith/X5RA6FVLEBFMCJZNWUJOQA4NOF","bundle":"https://pith.science/pith/X5RA6FVLEBFMCJZNWUJOQA4NOF/bundle.json","state":"https://pith.science/pith/X5RA6FVLEBFMCJZNWUJOQA4NOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5RA6FVLEBFMCJZNWUJOQA4NOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:X5RA6FVLEBFMCJZNWUJOQA4NOF","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":"7ed217ccc2b420da158d7135d14f3ad7d2a8cd90a91efacfb8cf19ebd4757571","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T17:26:14Z","title_canon_sha256":"78eac960579eed8c83e2c45295a5fd8da8d7244d499e2f79dd3d8c8a51d79d11"},"schema_version":"1.0","source":{"id":"2606.00202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00202","created_at":"2026-06-02T01:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00202v1","created_at":"2026-06-02T01:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00202","created_at":"2026-06-02T01:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"X5RA6FVLEBFM","created_at":"2026-06-02T01:03:21Z"},{"alias_kind":"pith_short_16","alias_value":"X5RA6FVLEBFMCJZN","created_at":"2026-06-02T01:03:21Z"},{"alias_kind":"pith_short_8","alias_value":"X5RA6FVL","created_at":"2026-06-02T01:03:21Z"}],"graph_snapshots":[{"event_id":"sha256:ca561a94cd92d39511f295875811c399cedc7f70a0cbb6871dfe77ec2ccf87c6","target":"graph","created_at":"2026-06-02T01:03:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.00202/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Standard machine learning pipelines often admit many near-optimal models. These \"Rashomon sets\" pose a range of challenges and opportunities for uncertainty-aware, robust decision making. They allow users to incorporate domain knowledge and preferences that would otherwise be difficult to specify directly in an objective, and they quantify diversity among valid models for a given training dataset and objective function. However, computation of Rashomon sets, even for simple, interpretable model classes such as sparse decision trees, continues to require immense memory and runtime resources. We","authors_text":"Cynthia Rudin, Hayden McTavish, Margo Seltzer, Varun Babbar, Zakk Heile","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T17:26:14Z","title":"From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00202","kind":"arxiv","version":1},"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:c8826ca9a20ec655d432ce988987085d2390884407f848c48018a8695e80c89d","target":"record","created_at":"2026-06-02T01:03:21Z","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":"7ed217ccc2b420da158d7135d14f3ad7d2a8cd90a91efacfb8cf19ebd4757571","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T17:26:14Z","title_canon_sha256":"78eac960579eed8c83e2c45295a5fd8da8d7244d499e2f79dd3d8c8a51d79d11"},"schema_version":"1.0","source":{"id":"2606.00202","kind":"arxiv","version":1}},"canonical_sha256":"bf620f16ab204ac1272db512e8038d714d2065745d0d1509505dc06045675392","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf620f16ab204ac1272db512e8038d714d2065745d0d1509505dc06045675392","first_computed_at":"2026-06-02T01:03:21.428505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:21.428505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8dXAY7UPZWwp6MFVTgjZaPrK7g7h5rEuvTdi41YnOp/wzt+3cYzEq+5KwkuCqGN7wSss9d8fBoDxkYI9G34FAQ==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:21.428833Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8826ca9a20ec655d432ce988987085d2390884407f848c48018a8695e80c89d","sha256:ca561a94cd92d39511f295875811c399cedc7f70a0cbb6871dfe77ec2ccf87c6"],"state_sha256":"da10824104d175e90ae5571d5f506de570fefaec1a2700416bca41571e84c149"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9XQtC578ZtgNe1svtDIYx54rXr1ZSe4Q95x3AK4k46VAcEpny09GfuNNhMySZtpyzgXhbx22ziyVPWGHDG7ZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T22:05:56.013568Z","bundle_sha256":"6ef48449b045d5a50a7e93c2da8812fa57ba7624cd811f754cbba1de80339fe1"}}