{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:U7RU6FORB2JOGSXA5UG7AOPKVZ","short_pith_number":"pith:U7RU6FOR","schema_version":"1.0","canonical_sha256":"a7e34f15d10e92e34ae0ed0df039eaae5d12f972d06e5bb49bf5af83a7a16c8b","source":{"kind":"arxiv","id":"1609.01118","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.01118","created_at":"2026-05-17T23:56:34.620360+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.01118v2","created_at":"2026-05-17T23:56:34.620360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01118","created_at":"2026-05-17T23:56:34.620360+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7RU6FORB2JO","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7RU6FORB2JOGSXA","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7RU6FOR","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ","json":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ.json","graph_json":"https://pith.science/api/pith-number/U7RU6FORB2JOGSXA5UG7AOPKVZ/graph.json","events_json":"https://pith.science/api/pith-number/U7RU6FORB2JOGSXA5UG7AOPKVZ/events.json","paper":"https://pith.science/paper/U7RU6FOR"},"agent_actions":{"view_html":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ","download_json":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ.json","view_paper":"https://pith.science/paper/U7RU6FOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.01118&json=true","fetch_graph":"https://pith.science/api/pith-number/U7RU6FORB2JOGSXA5UG7AOPKVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/U7RU6FORB2JOGSXA5UG7AOPKVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ/action/storage_attestation","attest_author":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ/action/author_attestation","sign_citation":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ/action/citation_signature","submit_replication":"https://pith.science/pith/U7RU6FORB2JOGSXA5UG7AOPKVZ/action/replication_record"}},"created_at":"2026-05-17T23:56:34.620360+00:00","updated_at":"2026-05-17T23:56:34.620360+00:00"}