{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7FNFUD37I7GYXSHZYYXL5OKRGN","short_pith_number":"pith:7FNFUD37","schema_version":"1.0","canonical_sha256":"f95a5a0f7f47cd8bc8f9c62ebeb951337dd2527c04490ce4a3ef8ea66c07d129","source":{"kind":"arxiv","id":"2103.06476","version":9},"attestation_state":"computed","paper":{"title":"Time-uniform central limit theory and asymptotic confidence sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Aaditya Ramdas, David Arbour, Edward H. Kennedy, Ian Waudby-Smith, Ritwik Sinha","submitted_at":"2021-03-11T05:45:35Z","abstract_excerpt":"Confidence intervals based on the central limit theorem (CLT) are a cornerstone of classical statistics. Despite being only asymptotically valid, they are ubiquitous because they permit statistical inference under weak assumptions and can often be applied to problems even when nonasymptotic inference is impossible. This paper introduces time-uniform analogues of such asymptotic confidence intervals, adding to the literature on confidence sequences (CS) -- sequences of confidence intervals that are uniformly valid over time -- which provide valid inference at arbitrary stopping times and incur "},"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":"2103.06476","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2021-03-11T05:45:35Z","cross_cats_sorted":["stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"187da245bd300351fb70fad8ee2a9244019fc4baea4a1e3cac9a0a23a9ae9e63","abstract_canon_sha256":"be35051738c7a0a1c22a7632fdb4a468fa495bc4a3d952c81b4735bf793d9a5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:43.565690Z","signature_b64":"fVhPYCbtCkjguUPhP2zDsbGgOqRuBgxf0Cni5GmBC9TYN8tV08MI6byV4G3vcv5U80719Lzqc38tUrILm5/9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95a5a0f7f47cd8bc8f9c62ebeb951337dd2527c04490ce4a3ef8ea66c07d129","last_reissued_at":"2026-07-05T07:55:43.565179Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:43.565179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-uniform central limit theory and asymptotic confidence sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Aaditya Ramdas, David Arbour, Edward H. Kennedy, Ian Waudby-Smith, Ritwik Sinha","submitted_at":"2021-03-11T05:45:35Z","abstract_excerpt":"Confidence intervals based on the central limit theorem (CLT) are a cornerstone of classical statistics. Despite being only asymptotically valid, they are ubiquitous because they permit statistical inference under weak assumptions and can often be applied to problems even when nonasymptotic inference is impossible. This paper introduces time-uniform analogues of such asymptotic confidence intervals, adding to the literature on confidence sequences (CS) -- sequences of confidence intervals that are uniformly valid over time -- which provide valid inference at arbitrary stopping times and incur "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.06476","kind":"arxiv","version":9},"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/2103.06476/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":"2103.06476","created_at":"2026-07-05T07:55:43.565238+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.06476v9","created_at":"2026-07-05T07:55:43.565238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.06476","created_at":"2026-07-05T07:55:43.565238+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FNFUD37I7GY","created_at":"2026-07-05T07:55:43.565238+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FNFUD37I7GYXSHZ","created_at":"2026-07-05T07:55:43.565238+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FNFUD37","created_at":"2026-07-05T07:55:43.565238+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03406","citing_title":"A General Framework for Optimal Group Sequential Testing via Mixed-Integer Linear Programming","ref_index":152,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07964","citing_title":"Asymptotically Log-Optimal Bayes-Assisted Confidence Sequences for Bounded Means","ref_index":90,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07964","citing_title":"Asymptotically Log-Optimal Bayes-Assisted Confidence Sequences for Bounded Means","ref_index":90,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15740","citing_title":"Evidence Sufficiency Under Delayed Ground Truth: Proxy Monitoring for Risk Decision Systems","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FNFUD37I7GYXSHZYYXL5OKRGN","json":"https://pith.science/pith/7FNFUD37I7GYXSHZYYXL5OKRGN.json","graph_json":"https://pith.science/api/pith-number/7FNFUD37I7GYXSHZYYXL5OKRGN/graph.json","events_json":"https://pith.science/api/pith-number/7FNFUD37I7GYXSHZYYXL5OKRGN/events.json","paper":"https://pith.science/paper/7FNFUD37"},"agent_actions":{"view_html":"https://pith.science/pith/7FNFUD37I7GYXSHZYYXL5OKRGN","download_json":"https://pith.science/pith/7FNFUD37I7GYXSHZYYXL5OKRGN.json","view_paper":"https://pith.science/paper/7FNFUD37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.06476&json=true","fetch_graph":"https://pith.science/api/pith-number/7FNFUD37I7GYXSHZYYXL5OKRGN/graph.json","fetch_events":"https://pith.science/api/pith-number/7FNFUD37I7GYXSHZYYXL5OKRGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FNFUD37I7GYXSHZYYXL5OKRGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FNFUD37I7GYXSHZYYXL5OKRGN/action/storage_attestation","attest_author":"https://pith.science/pith/7FNFUD37I7GYXSHZYYXL5OKRGN/action/author_attestation","sign_citation":"https://pith.science/pith/7FNFUD37I7GYXSHZYYXL5OKRGN/action/citation_signature","submit_replication":"https://pith.science/pith/7FNFUD37I7GYXSHZYYXL5OKRGN/action/replication_record"}},"created_at":"2026-07-05T07:55:43.565238+00:00","updated_at":"2026-07-05T07:55:43.565238+00:00"}