{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:U7RU6FORB2JOGSXA5UG7AOPKVZ","short_pith_number":"pith:U7RU6FOR","canonical_record":{"source":{"id":"1609.01118","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-09-05T12:00:07Z","cross_cats_sorted":["q-bio.GN","stat.CO"],"title_canon_sha256":"35d21bf8dc4cb2c5b62c09b3cb2749c7145509629be1764a3788465a5ad2a821","abstract_canon_sha256":"17ecc4a9d40a98a44e0c6013e1560009a2c50681a0465b64262134aff69a893f"},"schema_version":"1.0"},"canonical_sha256":"a7e34f15d10e92e34ae0ed0df039eaae5d12f972d06e5bb49bf5af83a7a16c8b","source":{"kind":"arxiv","id":"1609.01118","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01118","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01118v2","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01118","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"U7RU6FORB2JO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7RU6FORB2JOGSXA","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7RU6FOR","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:U7RU6FORB2JOGSXA5UG7AOPKVZ","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01118","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-09-05T12:00:07Z","cross_cats_sorted":["q-bio.GN","stat.CO"],"title_canon_sha256":"35d21bf8dc4cb2c5b62c09b3cb2749c7145509629be1764a3788465a5ad2a821","abstract_canon_sha256":"17ecc4a9d40a98a44e0c6013e1560009a2c50681a0465b64262134aff69a893f"},"schema_version":"1.0"},"canonical_sha256":"a7e34f15d10e92e34ae0ed0df039eaae5d12f972d06e5bb49bf5af83a7a16c8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:34.620860Z","signature_b64":"FrbQSbY4MSpIqH4AW+ZaAz3MUYtJpn4pQph7/fwVHkTVQfFKtv6iqMbjWhYZBwYKs5BmcDoUakuwhHwBQeWEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7e34f15d10e92e34ae0ed0df039eaae5d12f972d06e5bb49bf5af83a7a16c8b","last_reissued_at":"2026-05-17T23:56:34.620239Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:34.620239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01118","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:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yHkc5jvWw83Errj1Ih5KoZhWC3ehJSu9KQhLciYAr4zDSgasxibkAKRo1NpkADb1QkrhuPW3OhwB0H3rlH7VDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:23:17.181927Z"},"content_sha256":"66b28a6abefc524060756cab0b155e258da4a5d62ad101a76daed765ec2e0c8d","schema_version":"1.0","event_id":"sha256:66b28a6abefc524060756cab0b155e258da4a5d62ad101a76daed765ec2e0c8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:U7RU6FORB2JOGSXA5UG7AOPKVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extracting replicable associations across multiple studies: algorithms for controlling the false discovery rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN","stat.CO"],"primary_cat":"stat.ME","authors_text":"Daniel Yekutieli, David Amar, Ron Shamir","submitted_at":"2016-09-05T12:00:07Z","abstract_excerpt":"Extracting associations that recur across multiple studies while controlling the false discovery rate is a fundamental challenge. Here, we consider an extension of Efron's single-study two-groups model to allow joint analysis of multiple studies. We assume that given a set of p-values obtained from each study, the researcher is interested in associations that recur in at least $k>1$ studies. We propose new algorithms that differ in how the study dependencies are modeled. We compared our new methods and others using various simulated scenarios. The top performing algorithm, SCREEN (Scalable Clu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01118","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:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fi6NMhzQNmT0oDnciIU5jXTUKQQgNwG6zROgqAemzbtrENblpwzJsivzQSdq5vOx39hYZfMEHMTVkbOieyi2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:23:17.182535Z"},"content_sha256":"53cf0fff0675280573bc4371ef8f9f0d4e8ba1f4bb13b66e3c59cde7dee7f067","schema_version":"1.0","event_id":"sha256:53cf0fff0675280573bc4371ef8f9f0d4e8ba1f4bb13b66e3c59cde7dee7f067"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ/bundle.json","state_url":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ/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-06-01T09:23:17Z","links":{"resolver":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ","bundle":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ/bundle.json","state":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:U7RU6FORB2JOGSXA5UG7AOPKVZ","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":"17ecc4a9d40a98a44e0c6013e1560009a2c50681a0465b64262134aff69a893f","cross_cats_sorted":["q-bio.GN","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-09-05T12:00:07Z","title_canon_sha256":"35d21bf8dc4cb2c5b62c09b3cb2749c7145509629be1764a3788465a5ad2a821"},"schema_version":"1.0","source":{"id":"1609.01118","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01118","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01118v2","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01118","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"U7RU6FORB2JO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7RU6FORB2JOGSXA","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7RU6FOR","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:53cf0fff0675280573bc4371ef8f9f0d4e8ba1f4bb13b66e3c59cde7dee7f067","target":"graph","created_at":"2026-05-17T23:56:34Z","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":"Extracting associations that recur across multiple studies while controlling the false discovery rate is a fundamental challenge. Here, we consider an extension of Efron's single-study two-groups model to allow joint analysis of multiple studies. We assume that given a set of p-values obtained from each study, the researcher is interested in associations that recur in at least $k>1$ studies. We propose new algorithms that differ in how the study dependencies are modeled. We compared our new methods and others using various simulated scenarios. The top performing algorithm, SCREEN (Scalable Clu","authors_text":"Daniel Yekutieli, David Amar, Ron Shamir","cross_cats":["q-bio.GN","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-09-05T12:00:07Z","title":"Extracting replicable associations across multiple studies: algorithms for controlling the false discovery rate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01118","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:66b28a6abefc524060756cab0b155e258da4a5d62ad101a76daed765ec2e0c8d","target":"record","created_at":"2026-05-17T23:56:34Z","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":"17ecc4a9d40a98a44e0c6013e1560009a2c50681a0465b64262134aff69a893f","cross_cats_sorted":["q-bio.GN","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-09-05T12:00:07Z","title_canon_sha256":"35d21bf8dc4cb2c5b62c09b3cb2749c7145509629be1764a3788465a5ad2a821"},"schema_version":"1.0","source":{"id":"1609.01118","kind":"arxiv","version":2}},"canonical_sha256":"a7e34f15d10e92e34ae0ed0df039eaae5d12f972d06e5bb49bf5af83a7a16c8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7e34f15d10e92e34ae0ed0df039eaae5d12f972d06e5bb49bf5af83a7a16c8b","first_computed_at":"2026-05-17T23:56:34.620239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:34.620239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FrbQSbY4MSpIqH4AW+ZaAz3MUYtJpn4pQph7/fwVHkTVQfFKtv6iqMbjWhYZBwYKs5BmcDoUakuwhHwBQeWEDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:34.620860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01118","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66b28a6abefc524060756cab0b155e258da4a5d62ad101a76daed765ec2e0c8d","sha256:53cf0fff0675280573bc4371ef8f9f0d4e8ba1f4bb13b66e3c59cde7dee7f067"],"state_sha256":"bc39e23ea1894fd870bc9819aa0ff843fe65689ec4cfc6b90108dbcc7b22d5d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cUiN5fI3RzZhmxqnjtfR98cvBV5H0TPF81V7pIzRbTYcfXnE3sv5PD4zr6ReqU5B978Ztw2VbOmHMy+5G7QSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:23:17.185522Z","bundle_sha256":"45ce7fd70dbde4e21eec948386a5fcce00ad2bd88a08a1a29f28cdac28462617"}}