{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LXR3LHXLVEKYMZHFCBXBFYH4TI","short_pith_number":"pith:LXR3LHXL","canonical_record":{"source":{"id":"1802.09098","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-25T22:19:06Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"76c5dc57f7b2eeea509b80e6d2b2331c35c05222206db6b2d33869a4175fa0fb","abstract_canon_sha256":"708e123cd5185d5224f957a54e8b7648d7c6aa1052cb132b9586adc9cdb9d4ea"},"schema_version":"1.0"},"canonical_sha256":"5de3b59eeba9158664e5106e12e0fc9a0dde13d4bbefb87f7365aa92a25847de","source":{"kind":"arxiv","id":"1802.09098","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09098","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09098v2","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09098","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"LXR3LHXLVEKY","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LXR3LHXLVEKYMZHF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LXR3LHXL","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LXR3LHXLVEKYMZHFCBXBFYH4TI","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09098","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-25T22:19:06Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"76c5dc57f7b2eeea509b80e6d2b2331c35c05222206db6b2d33869a4175fa0fb","abstract_canon_sha256":"708e123cd5185d5224f957a54e8b7648d7c6aa1052cb132b9586adc9cdb9d4ea"},"schema_version":"1.0"},"canonical_sha256":"5de3b59eeba9158664e5106e12e0fc9a0dde13d4bbefb87f7365aa92a25847de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:56.145836Z","signature_b64":"KF9dgSHCWaQuTIDAppbDVpBhcIaphVS22a1XhrPbzkNinApFHJO41Nh6zku7RdDJVXEZwfs2pH2Oa8IfipGPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5de3b59eeba9158664e5106e12e0fc9a0dde13d4bbefb87f7365aa92a25847de","last_reissued_at":"2026-05-17T23:40:56.145133Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:56.145133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09098","source_version":2,"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-05-17T23:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yChTR0NTyjuGan80mPPvXC8Z8w0l8kq4l6tG5/2gDBFBtbKdmSbPZWxFMCZn2I47DRhW6HeKwWKNxfJ2sGcyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:30:45.671014Z"},"content_sha256":"69a28d1e6f06222df36e2dec781cf53ab30b8885b549321d142fc438c55311cb","schema_version":"1.0","event_id":"sha256:69a28d1e6f06222df36e2dec781cf53ab30b8885b549321d142fc438c55311cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LXR3LHXLVEKYMZHFCBXBFYH4TI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SAFFRON: an adaptive algorithm for online control of the false discovery rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Aaditya Ramdas, Martin Wainwright, Michael Jordan, Tijana Zrnic","submitted_at":"2018-02-25T22:19:06Z","abstract_excerpt":"In the online false discovery rate (FDR) problem, one observes a possibly infinite sequence of $p$-values $P_1,P_2,\\dots$, each testing a different null hypothesis, and an algorithm must pick a sequence of rejection thresholds $\\alpha_1,\\alpha_2,\\dots$ in an online fashion, effectively rejecting the $k$-th null hypothesis whenever $P_k \\leq \\alpha_k$. Importantly, $\\alpha_k$ must be a function of the past, and cannot depend on $P_k$ or any of the later unseen $p$-values, and must be chosen to guarantee that for any time $t$, the FDR up to time $t$ is less than some pre-determined quantity $\\al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09098","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GzGcNxTMReFowjHxfgSYUCneh8GtGT57VuoHTo63R/EF6Ksf6rf/3I08cLiBKEJNU3CzYRYX14OEbmT+7GCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:30:45.671671Z"},"content_sha256":"5db5e7b40e70cb65a5d295203350cc77bb4284fbd64c30e8c40a8dd37b555993","schema_version":"1.0","event_id":"sha256:5db5e7b40e70cb65a5d295203350cc77bb4284fbd64c30e8c40a8dd37b555993"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXR3LHXLVEKYMZHFCBXBFYH4TI/bundle.json","state_url":"https://pith.science/pith/LXR3LHXLVEKYMZHFCBXBFYH4TI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXR3LHXLVEKYMZHFCBXBFYH4TI/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-05-30T19:30:45Z","links":{"resolver":"https://pith.science/pith/LXR3LHXLVEKYMZHFCBXBFYH4TI","bundle":"https://pith.science/pith/LXR3LHXLVEKYMZHFCBXBFYH4TI/bundle.json","state":"https://pith.science/pith/LXR3LHXLVEKYMZHFCBXBFYH4TI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXR3LHXLVEKYMZHFCBXBFYH4TI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LXR3LHXLVEKYMZHFCBXBFYH4TI","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":"708e123cd5185d5224f957a54e8b7648d7c6aa1052cb132b9586adc9cdb9d4ea","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-25T22:19:06Z","title_canon_sha256":"76c5dc57f7b2eeea509b80e6d2b2331c35c05222206db6b2d33869a4175fa0fb"},"schema_version":"1.0","source":{"id":"1802.09098","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09098","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09098v2","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09098","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"LXR3LHXLVEKY","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LXR3LHXLVEKYMZHF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LXR3LHXL","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:5db5e7b40e70cb65a5d295203350cc77bb4284fbd64c30e8c40a8dd37b555993","target":"graph","created_at":"2026-05-17T23:40:56Z","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"},"paper":{"abstract_excerpt":"In the online false discovery rate (FDR) problem, one observes a possibly infinite sequence of $p$-values $P_1,P_2,\\dots$, each testing a different null hypothesis, and an algorithm must pick a sequence of rejection thresholds $\\alpha_1,\\alpha_2,\\dots$ in an online fashion, effectively rejecting the $k$-th null hypothesis whenever $P_k \\leq \\alpha_k$. Importantly, $\\alpha_k$ must be a function of the past, and cannot depend on $P_k$ or any of the later unseen $p$-values, and must be chosen to guarantee that for any time $t$, the FDR up to time $t$ is less than some pre-determined quantity $\\al","authors_text":"Aaditya Ramdas, Martin Wainwright, Michael Jordan, Tijana Zrnic","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-25T22:19:06Z","title":"SAFFRON: an adaptive algorithm for online control of the false discovery rate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09098","kind":"arxiv","version":2},"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:69a28d1e6f06222df36e2dec781cf53ab30b8885b549321d142fc438c55311cb","target":"record","created_at":"2026-05-17T23:40:56Z","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":"708e123cd5185d5224f957a54e8b7648d7c6aa1052cb132b9586adc9cdb9d4ea","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-25T22:19:06Z","title_canon_sha256":"76c5dc57f7b2eeea509b80e6d2b2331c35c05222206db6b2d33869a4175fa0fb"},"schema_version":"1.0","source":{"id":"1802.09098","kind":"arxiv","version":2}},"canonical_sha256":"5de3b59eeba9158664e5106e12e0fc9a0dde13d4bbefb87f7365aa92a25847de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5de3b59eeba9158664e5106e12e0fc9a0dde13d4bbefb87f7365aa92a25847de","first_computed_at":"2026-05-17T23:40:56.145133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:56.145133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KF9dgSHCWaQuTIDAppbDVpBhcIaphVS22a1XhrPbzkNinApFHJO41Nh6zku7RdDJVXEZwfs2pH2Oa8IfipGPAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:56.145836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09098","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69a28d1e6f06222df36e2dec781cf53ab30b8885b549321d142fc438c55311cb","sha256:5db5e7b40e70cb65a5d295203350cc77bb4284fbd64c30e8c40a8dd37b555993"],"state_sha256":"cc010ccfd67fb93f9f46f8da1f8198e595a76072330924e1c6d957807a1faf52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V0JJ0A1DYynsINzARvzqyIsgvGKc9p3d639IlzAI4Vdfe8p/1OvhiNbSajwVCcyS9nxZtpT9Si585w6ogphmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:30:45.674894Z","bundle_sha256":"35bf1cfa834f670c4933763a19245c91a288c6e646ffe6c3af2f55a772edee94"}}