{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QC2TGX5WBTA7NLAJCFL4PFEKS4","short_pith_number":"pith:QC2TGX5W","schema_version":"1.0","canonical_sha256":"80b5335fb60cc1f6ac091157c7948a9731c4902e7e355a0bd656dec735546b56","source":{"kind":"arxiv","id":"2409.13990","version":5},"attestation_state":"computed","paper":{"title":"Batch Predictive Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Edgar Dobriban, Eric Tchetgen Tchetgen, Yonghoon Lee","submitted_at":"2024-09-21T02:52:13Z","abstract_excerpt":"Constructing prediction sets with coverage guarantees for unobserved outcomes is a core problem in modern statistics. Methods for predictive inference have been developed for a wide range of settings, but usually only consider test data points one at a time. Here we study the problem of distribution-free predictive inference for a batch of multiple test points, aiming to construct prediction sets for functions -- such as the mean or median -- of any number of unobserved test datapoints. This setting includes constructing simultaneous prediction sets with a high probability of coverage, and sel"},"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":"2409.13990","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2024-09-21T02:52:13Z","cross_cats_sorted":[],"title_canon_sha256":"fc802dded53ecb92e3bd828b84a88becddf74a2b1ca512443b8134c3eb702b26","abstract_canon_sha256":"ef7576fdf3d4065985898f27f471b7cae91fcfae9ec4c1f39804c02e2d96885d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:43.785986Z","signature_b64":"lq1DG4uLqf9szxAXufjSDojcwVCt/9t5l+lJ8m38In13JxisF2iizoQmAtDDCTXo+ujMYjosX3xCqffoLgXEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80b5335fb60cc1f6ac091157c7948a9731c4902e7e355a0bd656dec735546b56","last_reissued_at":"2026-07-05T11:34:43.785479Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:43.785479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Batch Predictive Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Edgar Dobriban, Eric Tchetgen Tchetgen, Yonghoon Lee","submitted_at":"2024-09-21T02:52:13Z","abstract_excerpt":"Constructing prediction sets with coverage guarantees for unobserved outcomes is a core problem in modern statistics. Methods for predictive inference have been developed for a wide range of settings, but usually only consider test data points one at a time. Here we study the problem of distribution-free predictive inference for a batch of multiple test points, aiming to construct prediction sets for functions -- such as the mean or median -- of any number of unobserved test datapoints. This setting includes constructing simultaneous prediction sets with a high probability of coverage, and sel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13990","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/2409.13990/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":"2409.13990","created_at":"2026-07-05T11:34:43.785545+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.13990v5","created_at":"2026-07-05T11:34:43.785545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13990","created_at":"2026-07-05T11:34:43.785545+00:00"},{"alias_kind":"pith_short_12","alias_value":"QC2TGX5WBTA7","created_at":"2026-07-05T11:34:43.785545+00:00"},{"alias_kind":"pith_short_16","alias_value":"QC2TGX5WBTA7NLAJ","created_at":"2026-07-05T11:34:43.785545+00:00"},{"alias_kind":"pith_short_8","alias_value":"QC2TGX5W","created_at":"2026-07-05T11:34:43.785545+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06479","citing_title":"Risk-Controlled Post-Processing of Decision Policies","ref_index":92,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QC2TGX5WBTA7NLAJCFL4PFEKS4","json":"https://pith.science/pith/QC2TGX5WBTA7NLAJCFL4PFEKS4.json","graph_json":"https://pith.science/api/pith-number/QC2TGX5WBTA7NLAJCFL4PFEKS4/graph.json","events_json":"https://pith.science/api/pith-number/QC2TGX5WBTA7NLAJCFL4PFEKS4/events.json","paper":"https://pith.science/paper/QC2TGX5W"},"agent_actions":{"view_html":"https://pith.science/pith/QC2TGX5WBTA7NLAJCFL4PFEKS4","download_json":"https://pith.science/pith/QC2TGX5WBTA7NLAJCFL4PFEKS4.json","view_paper":"https://pith.science/paper/QC2TGX5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.13990&json=true","fetch_graph":"https://pith.science/api/pith-number/QC2TGX5WBTA7NLAJCFL4PFEKS4/graph.json","fetch_events":"https://pith.science/api/pith-number/QC2TGX5WBTA7NLAJCFL4PFEKS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QC2TGX5WBTA7NLAJCFL4PFEKS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QC2TGX5WBTA7NLAJCFL4PFEKS4/action/storage_attestation","attest_author":"https://pith.science/pith/QC2TGX5WBTA7NLAJCFL4PFEKS4/action/author_attestation","sign_citation":"https://pith.science/pith/QC2TGX5WBTA7NLAJCFL4PFEKS4/action/citation_signature","submit_replication":"https://pith.science/pith/QC2TGX5WBTA7NLAJCFL4PFEKS4/action/replication_record"}},"created_at":"2026-07-05T11:34:43.785545+00:00","updated_at":"2026-07-05T11:34:43.785545+00:00"}