{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XQ42RJBILQRZSOF2N3KJYRV35A","short_pith_number":"pith:XQ42RJBI","canonical_record":{"source":{"id":"1705.07529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-22T01:24:53Z","cross_cats_sorted":[],"title_canon_sha256":"44ab97d407d54efa7b7c8e6eaa96f1d05a3a6b69b25c30eff8ec2728c67ea3a4","abstract_canon_sha256":"0b10db7d9b122d61d5cd3ce6ebb04d7ab8426143dd7b123ef82f26d95914cae5"},"schema_version":"1.0"},"canonical_sha256":"bc39a8a4285c239938ba6ed49c46bbe80f17b96bc0b1a0d8465c04bc2cf2b20a","source":{"kind":"arxiv","id":"1705.07529","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07529","created_at":"2026-05-18T00:02:28Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07529v2","created_at":"2026-05-18T00:02:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07529","created_at":"2026-05-18T00:02:28Z"},{"alias_kind":"pith_short_12","alias_value":"XQ42RJBILQRZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XQ42RJBILQRZSOF2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XQ42RJBI","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XQ42RJBILQRZSOF2N3KJYRV35A","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-22T01:24:53Z","cross_cats_sorted":[],"title_canon_sha256":"44ab97d407d54efa7b7c8e6eaa96f1d05a3a6b69b25c30eff8ec2728c67ea3a4","abstract_canon_sha256":"0b10db7d9b122d61d5cd3ce6ebb04d7ab8426143dd7b123ef82f26d95914cae5"},"schema_version":"1.0"},"canonical_sha256":"bc39a8a4285c239938ba6ed49c46bbe80f17b96bc0b1a0d8465c04bc2cf2b20a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:28.264333Z","signature_b64":"UBbp1XkTI2dbFZfKgPh8t59kqPcU5rhrLGeBskFdZcBKDx9UCLvhNK+9LBT6Z7kWrLyzz8sfutVCw0tKCfyLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc39a8a4285c239938ba6ed49c46bbe80f17b96bc0b1a0d8465c04bc2cf2b20a","last_reissued_at":"2026-05-18T00:02:28.263630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:28.263630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07529","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-18T00:02:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PnsQ7iOVqDSLPJ/LterHlA8hIP52cpoHaXaXc/AydTf5Md5phUTBd8w6PiM0JMrMkVTnCOu2dCw8V0jMArVaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:59:13.827383Z"},"content_sha256":"01297e84787f672b54077e839e38192737e62de3cc9d05d48488e4c3fdd9cd2e","schema_version":"1.0","event_id":"sha256:01297e84787f672b54077e839e38192737e62de3cc9d05d48488e4c3fdd9cd2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XQ42RJBILQRZSOF2N3KJYRV35A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing hypotheses on a tree: new error rates and controlling strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Chiara Sabatti, Christine B. Peterson, Marina Bogomolov, Yoav Benjamini","submitted_at":"2017-05-22T01:24:53Z","abstract_excerpt":"We introduce a multiple testing procedure (TreeBH) which addresses the challenge of controlling error rates at multiple levels of resolution. Conceptually, we frame this problem as the selection of hypotheses which are organized hierarchically in a tree structure. We describe a fast algorithm for the proposed sequential procedure, and prove that it controls relevant error rates given certain assumptions on the dependence among the p-values. Through simulations, we demonstrate that TreeBH offers the desired guarantees under a range of dependency structures (including one similar to that encount"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07529","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-18T00:02:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cIebR+sATb/+2sND3EdErXSqcXTxnaRbCt4HeLzp9LAWZIaiFVzPNRPG0hkVwp0bsThTrANHklFZyKrP3swsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:59:13.828050Z"},"content_sha256":"ba4d0397a6d2ea76c17c1119ae1dd06a59368628b13a4be1943f28eb364cd8b7","schema_version":"1.0","event_id":"sha256:ba4d0397a6d2ea76c17c1119ae1dd06a59368628b13a4be1943f28eb364cd8b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQ42RJBILQRZSOF2N3KJYRV35A/bundle.json","state_url":"https://pith.science/pith/XQ42RJBILQRZSOF2N3KJYRV35A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQ42RJBILQRZSOF2N3KJYRV35A/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-24T23:59:13Z","links":{"resolver":"https://pith.science/pith/XQ42RJBILQRZSOF2N3KJYRV35A","bundle":"https://pith.science/pith/XQ42RJBILQRZSOF2N3KJYRV35A/bundle.json","state":"https://pith.science/pith/XQ42RJBILQRZSOF2N3KJYRV35A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQ42RJBILQRZSOF2N3KJYRV35A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XQ42RJBILQRZSOF2N3KJYRV35A","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":"0b10db7d9b122d61d5cd3ce6ebb04d7ab8426143dd7b123ef82f26d95914cae5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-22T01:24:53Z","title_canon_sha256":"44ab97d407d54efa7b7c8e6eaa96f1d05a3a6b69b25c30eff8ec2728c67ea3a4"},"schema_version":"1.0","source":{"id":"1705.07529","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07529","created_at":"2026-05-18T00:02:28Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07529v2","created_at":"2026-05-18T00:02:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07529","created_at":"2026-05-18T00:02:28Z"},{"alias_kind":"pith_short_12","alias_value":"XQ42RJBILQRZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XQ42RJBILQRZSOF2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XQ42RJBI","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:ba4d0397a6d2ea76c17c1119ae1dd06a59368628b13a4be1943f28eb364cd8b7","target":"graph","created_at":"2026-05-18T00:02:28Z","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":"We introduce a multiple testing procedure (TreeBH) which addresses the challenge of controlling error rates at multiple levels of resolution. Conceptually, we frame this problem as the selection of hypotheses which are organized hierarchically in a tree structure. We describe a fast algorithm for the proposed sequential procedure, and prove that it controls relevant error rates given certain assumptions on the dependence among the p-values. Through simulations, we demonstrate that TreeBH offers the desired guarantees under a range of dependency structures (including one similar to that encount","authors_text":"Chiara Sabatti, Christine B. Peterson, Marina Bogomolov, Yoav Benjamini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-22T01:24:53Z","title":"Testing hypotheses on a tree: new error rates and controlling strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07529","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:01297e84787f672b54077e839e38192737e62de3cc9d05d48488e4c3fdd9cd2e","target":"record","created_at":"2026-05-18T00:02:28Z","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":"0b10db7d9b122d61d5cd3ce6ebb04d7ab8426143dd7b123ef82f26d95914cae5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-05-22T01:24:53Z","title_canon_sha256":"44ab97d407d54efa7b7c8e6eaa96f1d05a3a6b69b25c30eff8ec2728c67ea3a4"},"schema_version":"1.0","source":{"id":"1705.07529","kind":"arxiv","version":2}},"canonical_sha256":"bc39a8a4285c239938ba6ed49c46bbe80f17b96bc0b1a0d8465c04bc2cf2b20a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc39a8a4285c239938ba6ed49c46bbe80f17b96bc0b1a0d8465c04bc2cf2b20a","first_computed_at":"2026-05-18T00:02:28.263630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:28.263630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UBbp1XkTI2dbFZfKgPh8t59kqPcU5rhrLGeBskFdZcBKDx9UCLvhNK+9LBT6Z7kWrLyzz8sfutVCw0tKCfyLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:28.264333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07529","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01297e84787f672b54077e839e38192737e62de3cc9d05d48488e4c3fdd9cd2e","sha256:ba4d0397a6d2ea76c17c1119ae1dd06a59368628b13a4be1943f28eb364cd8b7"],"state_sha256":"3b22e30251cbb6d6fe8fa2a97ec78bf149e957eba3eb986e107fe3ea5c1b6518"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qEjTu0/8/ySEt7jlnFONXy+OUdxsNB+C/V8VNksaA3QhyfPVJ8L1O6dqkibyYg34WZ9R9tQL+vLd8QebT2xAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:59:13.832232Z","bundle_sha256":"0b34d3db7cd4a613fddb4949727f9e4c22c833a8b0c8be6c3afeca16dfa70c77"}}