{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UEHHAGBKE2RSZTMEXC3KKF4NGM","short_pith_number":"pith:UEHHAGBK","schema_version":"1.0","canonical_sha256":"a10e70182a26a32ccd84b8b6a5178d33265633b851dae8da23ba8b2c4d941b1c","source":{"kind":"arxiv","id":"1607.03975","version":2},"attestation_state":"computed","paper":{"title":"Estimating and Controlling the False Discovery Rate for the PC Algorithm Using Edge-Specific P-Values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.ML","authors_text":"Eric V. Strobl, Peter L. Spirtes, Shyam Visweswaran","submitted_at":"2016-07-14T01:34:57Z","abstract_excerpt":"The PC algorithm allows investigators to estimate a complete partially directed acyclic graph (CPDAG) from a finite dataset, but few groups have investigated strategies for estimating and controlling the false discovery rate (FDR) of the edges in the CPDAG. In this paper, we introduce PC with p-values (PC-p), a fast algorithm which robustly computes edge-specific p-values and then estimates and controls the FDR across the edges. PC-p specifically uses the p-values returned by many conditional independence tests to upper bound the p-values of more complex edge-specific hypothesis tests. The alg"},"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":"1607.03975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-14T01:34:57Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"2cfecfdead41cfcb1968be689ecd84b89b8833e9d403bf6780baacde464dc7e0","abstract_canon_sha256":"b0847d827a205c277eafca7eed18d225fea13cca638b6a58b62881a188c1c348"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:45.971692Z","signature_b64":"R+yYC8zVy5bnhGDuU3BjNhnniUYnzZXB+oTzEnEuxdY7tLOBCYV+atsJazGJkmrliuibrqLVr/gerjhNtcXiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a10e70182a26a32ccd84b8b6a5178d33265633b851dae8da23ba8b2c4d941b1c","last_reissued_at":"2026-05-18T00:44:45.971234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:45.971234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating and Controlling the False Discovery Rate for the PC Algorithm Using Edge-Specific P-Values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.ML","authors_text":"Eric V. Strobl, Peter L. Spirtes, Shyam Visweswaran","submitted_at":"2016-07-14T01:34:57Z","abstract_excerpt":"The PC algorithm allows investigators to estimate a complete partially directed acyclic graph (CPDAG) from a finite dataset, but few groups have investigated strategies for estimating and controlling the false discovery rate (FDR) of the edges in the CPDAG. In this paper, we introduce PC with p-values (PC-p), a fast algorithm which robustly computes edge-specific p-values and then estimates and controls the FDR across the edges. PC-p specifically uses the p-values returned by many conditional independence tests to upper bound the p-values of more complex edge-specific hypothesis tests. The alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03975","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":"1607.03975","created_at":"2026-05-18T00:44:45.971300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03975v2","created_at":"2026-05-18T00:44:45.971300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03975","created_at":"2026-05-18T00:44:45.971300+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEHHAGBKE2RS","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEHHAGBKE2RSZTME","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEHHAGBK","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/UEHHAGBKE2RSZTMEXC3KKF4NGM","json":"https://pith.science/pith/UEHHAGBKE2RSZTMEXC3KKF4NGM.json","graph_json":"https://pith.science/api/pith-number/UEHHAGBKE2RSZTMEXC3KKF4NGM/graph.json","events_json":"https://pith.science/api/pith-number/UEHHAGBKE2RSZTMEXC3KKF4NGM/events.json","paper":"https://pith.science/paper/UEHHAGBK"},"agent_actions":{"view_html":"https://pith.science/pith/UEHHAGBKE2RSZTMEXC3KKF4NGM","download_json":"https://pith.science/pith/UEHHAGBKE2RSZTMEXC3KKF4NGM.json","view_paper":"https://pith.science/paper/UEHHAGBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03975&json=true","fetch_graph":"https://pith.science/api/pith-number/UEHHAGBKE2RSZTMEXC3KKF4NGM/graph.json","fetch_events":"https://pith.science/api/pith-number/UEHHAGBKE2RSZTMEXC3KKF4NGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEHHAGBKE2RSZTMEXC3KKF4NGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEHHAGBKE2RSZTMEXC3KKF4NGM/action/storage_attestation","attest_author":"https://pith.science/pith/UEHHAGBKE2RSZTMEXC3KKF4NGM/action/author_attestation","sign_citation":"https://pith.science/pith/UEHHAGBKE2RSZTMEXC3KKF4NGM/action/citation_signature","submit_replication":"https://pith.science/pith/UEHHAGBKE2RSZTMEXC3KKF4NGM/action/replication_record"}},"created_at":"2026-05-18T00:44:45.971300+00:00","updated_at":"2026-05-18T00:44:45.971300+00:00"}