{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:24JY2QGQW2OW57MEFFQV6XBSKJ","short_pith_number":"pith:24JY2QGQ","canonical_record":{"source":{"id":"2401.09379","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2024-01-17T17:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"7f50cf97ac3111edaa4d634ff366ed462c82bde262efcf38b4b223ece077e4b9","abstract_canon_sha256":"96154257176a09e70eae1aa3183863ef808378e1139e52e2eaf01aeddb1e9f08"},"schema_version":"1.0"},"canonical_sha256":"d7138d40d0b69d6efd8429615f5c325249cb43c46c915d5c7a85bf1dbcf2980e","source":{"kind":"arxiv","id":"2401.09379","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.09379","created_at":"2026-07-05T09:35:07Z"},{"alias_kind":"arxiv_version","alias_value":"2401.09379v5","created_at":"2026-07-05T09:35:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09379","created_at":"2026-07-05T09:35:07Z"},{"alias_kind":"pith_short_12","alias_value":"24JY2QGQW2OW","created_at":"2026-07-05T09:35:07Z"},{"alias_kind":"pith_short_16","alias_value":"24JY2QGQW2OW57ME","created_at":"2026-07-05T09:35:07Z"},{"alias_kind":"pith_short_8","alias_value":"24JY2QGQ","created_at":"2026-07-05T09:35:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:24JY2QGQW2OW57MEFFQV6XBSKJ","target":"record","payload":{"canonical_record":{"source":{"id":"2401.09379","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2024-01-17T17:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"7f50cf97ac3111edaa4d634ff366ed462c82bde262efcf38b4b223ece077e4b9","abstract_canon_sha256":"96154257176a09e70eae1aa3183863ef808378e1139e52e2eaf01aeddb1e9f08"},"schema_version":"1.0"},"canonical_sha256":"d7138d40d0b69d6efd8429615f5c325249cb43c46c915d5c7a85bf1dbcf2980e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:07.764301Z","signature_b64":"ZJ4StCA8jAQjqvrUGYddc3d6zgH15vh0ciFuo+0NyWA8i4NZ8bX3j3wsd7yEUYA27i/dI/BYP9y0BOXupApJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7138d40d0b69d6efd8429615f5c325249cb43c46c915d5c7a85bf1dbcf2980e","last_reissued_at":"2026-07-05T09:35:07.763741Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:07.763741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.09379","source_version":5,"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-07-05T09:35:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCj3kxsrQyYLFsSn3OScVVz2W44QhXqhtZLQReYO3vr+nVwSc0eyHzId4stwADAs6QdjuBGfK8J5gu0jtEFmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:37:00.520342Z"},"content_sha256":"82772775e052dda4931df46cbc1fb39b12f62487c579a872ae46ae6ddc22de67","schema_version":"1.0","event_id":"sha256:82772775e052dda4931df46cbc1fb39b12f62487c579a872ae46ae6ddc22de67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:24JY2QGQW2OW57MEFFQV6XBSKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Merging uncertainty sets via majority vote","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Aaditya Ramdas, Matteo Gasparin","submitted_at":"2024-01-17T17:51:27Z","abstract_excerpt":"Given $K$ uncertainty sets that are arbitrarily dependent -- for example, confidence intervals for an unknown parameter obtained with $K$ different estimators, or prediction sets obtained via conformal prediction based on $K$ different algorithms on shared data -- we address the question of how to efficiently combine them in a black-box manner to produce a single uncertainty set. We present a simple and broadly applicable majority vote procedure that produces a merged set with nearly the same error guarantee as the input sets. We then extend this core idea in a few ways: we show that weighted "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09379","kind":"arxiv","version":5},"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/2401.09379/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-07-05T09:35:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PgdBO+WD2nzzjQ9ENoc0dAIkHPyLEtdYj3UDDwdKs172nrqKrkJWqp2uBMFhUCWDhKvS/ZGAw1Klb8/JhAf7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:37:00.521127Z"},"content_sha256":"c04394b1da13c77300d114ecee9ba46da22bba073239325583e372b4a0c6533a","schema_version":"1.0","event_id":"sha256:c04394b1da13c77300d114ecee9ba46da22bba073239325583e372b4a0c6533a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24JY2QGQW2OW57MEFFQV6XBSKJ/bundle.json","state_url":"https://pith.science/pith/24JY2QGQW2OW57MEFFQV6XBSKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24JY2QGQW2OW57MEFFQV6XBSKJ/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-08-01T09:37:00Z","links":{"resolver":"https://pith.science/pith/24JY2QGQW2OW57MEFFQV6XBSKJ","bundle":"https://pith.science/pith/24JY2QGQW2OW57MEFFQV6XBSKJ/bundle.json","state":"https://pith.science/pith/24JY2QGQW2OW57MEFFQV6XBSKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24JY2QGQW2OW57MEFFQV6XBSKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:24JY2QGQW2OW57MEFFQV6XBSKJ","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":"96154257176a09e70eae1aa3183863ef808378e1139e52e2eaf01aeddb1e9f08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2024-01-17T17:51:27Z","title_canon_sha256":"7f50cf97ac3111edaa4d634ff366ed462c82bde262efcf38b4b223ece077e4b9"},"schema_version":"1.0","source":{"id":"2401.09379","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.09379","created_at":"2026-07-05T09:35:07Z"},{"alias_kind":"arxiv_version","alias_value":"2401.09379v5","created_at":"2026-07-05T09:35:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09379","created_at":"2026-07-05T09:35:07Z"},{"alias_kind":"pith_short_12","alias_value":"24JY2QGQW2OW","created_at":"2026-07-05T09:35:07Z"},{"alias_kind":"pith_short_16","alias_value":"24JY2QGQW2OW57ME","created_at":"2026-07-05T09:35:07Z"},{"alias_kind":"pith_short_8","alias_value":"24JY2QGQ","created_at":"2026-07-05T09:35:07Z"}],"graph_snapshots":[{"event_id":"sha256:c04394b1da13c77300d114ecee9ba46da22bba073239325583e372b4a0c6533a","target":"graph","created_at":"2026-07-05T09:35:07Z","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/2401.09379/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given $K$ uncertainty sets that are arbitrarily dependent -- for example, confidence intervals for an unknown parameter obtained with $K$ different estimators, or prediction sets obtained via conformal prediction based on $K$ different algorithms on shared data -- we address the question of how to efficiently combine them in a black-box manner to produce a single uncertainty set. We present a simple and broadly applicable majority vote procedure that produces a merged set with nearly the same error guarantee as the input sets. We then extend this core idea in a few ways: we show that weighted ","authors_text":"Aaditya Ramdas, Matteo Gasparin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2024-01-17T17:51:27Z","title":"Merging uncertainty sets via majority vote"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09379","kind":"arxiv","version":5},"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:82772775e052dda4931df46cbc1fb39b12f62487c579a872ae46ae6ddc22de67","target":"record","created_at":"2026-07-05T09:35:07Z","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":"96154257176a09e70eae1aa3183863ef808378e1139e52e2eaf01aeddb1e9f08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2024-01-17T17:51:27Z","title_canon_sha256":"7f50cf97ac3111edaa4d634ff366ed462c82bde262efcf38b4b223ece077e4b9"},"schema_version":"1.0","source":{"id":"2401.09379","kind":"arxiv","version":5}},"canonical_sha256":"d7138d40d0b69d6efd8429615f5c325249cb43c46c915d5c7a85bf1dbcf2980e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7138d40d0b69d6efd8429615f5c325249cb43c46c915d5c7a85bf1dbcf2980e","first_computed_at":"2026-07-05T09:35:07.763741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:35:07.763741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZJ4StCA8jAQjqvrUGYddc3d6zgH15vh0ciFuo+0NyWA8i4NZ8bX3j3wsd7yEUYA27i/dI/BYP9y0BOXupApJDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:35:07.764301Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.09379","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82772775e052dda4931df46cbc1fb39b12f62487c579a872ae46ae6ddc22de67","sha256:c04394b1da13c77300d114ecee9ba46da22bba073239325583e372b4a0c6533a"],"state_sha256":"1264b2f37c2296403945658fa22d9415f710bcaf032968c251ab77ecd154ba6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xIkOOUriA6EYMDljY9r0YvP1s5eCS2K4MxnmE6rlYahnNpgpd3K10Ae+XOuprgk0Tzh4g367/FoAL/kdV4vhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T09:37:00.524650Z","bundle_sha256":"cd05a9ebcb1467e6afe2daf7e2663b734bdf86d0c93bac3cbb355f9d15b583ed"}}