{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6B75LOAVOSNFQNPR5DOV7IV7UY","short_pith_number":"pith:6B75LOAV","schema_version":"1.0","canonical_sha256":"f07fd5b815749a5835f1e8dd5fa2bfa6222ccbad99008e2662d4a1be63da6db4","source":{"kind":"arxiv","id":"1610.00378","version":2},"attestation_state":"computed","paper":{"title":"Improving Accuracy and Scalability of the PC Algorithm by Maximizing P-value","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Joseph Ramsey","submitted_at":"2016-10-03T00:47:51Z","abstract_excerpt":"A number of attempts have been made to improve accuracy and/or scalability of the PC (Peter and Clark) algorithm, some well known (Buhlmann, et al., 2010; Kalisch and Buhlmann, 2007; 2008; Zhang, 2012, to give some examples). We add here one more tool to the toolbox: the simple observation that if one is forced to choose between a variety of possible conditioning sets for a pair of variables, one should choose the one with the highest p-value. One can use the CPC (Conservative PC, Ramsey et al., 2012) algorithm as a guide to possible sepsets for a pair of variables. However, whereas CPC uses a"},"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":"1610.00378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-10-03T00:47:51Z","cross_cats_sorted":[],"title_canon_sha256":"b93f90e6f92d1602b218c8dad858e68993368d394eacebc87b09198103f86bea","abstract_canon_sha256":"3562a8015e23a0fe288feb3d85f4d4047c6aa37b11688816f90606dcbc645d06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:07.212234Z","signature_b64":"QQDZRaAl4D/DoYIqsxfBBe3JfirYy8q2N763WJylGK/W9EI3ig28if6k1mmA6UevYrxIrGs+lOmv8XMmpwgJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f07fd5b815749a5835f1e8dd5fa2bfa6222ccbad99008e2662d4a1be63da6db4","last_reissued_at":"2026-05-18T01:03:07.211543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:07.211543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Accuracy and Scalability of the PC Algorithm by Maximizing P-value","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Joseph Ramsey","submitted_at":"2016-10-03T00:47:51Z","abstract_excerpt":"A number of attempts have been made to improve accuracy and/or scalability of the PC (Peter and Clark) algorithm, some well known (Buhlmann, et al., 2010; Kalisch and Buhlmann, 2007; 2008; Zhang, 2012, to give some examples). We add here one more tool to the toolbox: the simple observation that if one is forced to choose between a variety of possible conditioning sets for a pair of variables, one should choose the one with the highest p-value. One can use the CPC (Conservative PC, Ramsey et al., 2012) algorithm as a guide to possible sepsets for a pair of variables. However, whereas CPC uses a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00378","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":"1610.00378","created_at":"2026-05-18T01:03:07.211657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00378v2","created_at":"2026-05-18T01:03:07.211657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00378","created_at":"2026-05-18T01:03:07.211657+00:00"},{"alias_kind":"pith_short_12","alias_value":"6B75LOAVOSNF","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6B75LOAVOSNFQNPR","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6B75LOAV","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05743","citing_title":"Fourier Feature Methods for Nonlinear Causal Discovery: FFML Scoring, TRFF Scoring, and FFCI Testing in Mixed Data","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY","json":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY.json","graph_json":"https://pith.science/api/pith-number/6B75LOAVOSNFQNPR5DOV7IV7UY/graph.json","events_json":"https://pith.science/api/pith-number/6B75LOAVOSNFQNPR5DOV7IV7UY/events.json","paper":"https://pith.science/paper/6B75LOAV"},"agent_actions":{"view_html":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY","download_json":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY.json","view_paper":"https://pith.science/paper/6B75LOAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00378&json=true","fetch_graph":"https://pith.science/api/pith-number/6B75LOAVOSNFQNPR5DOV7IV7UY/graph.json","fetch_events":"https://pith.science/api/pith-number/6B75LOAVOSNFQNPR5DOV7IV7UY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY/action/storage_attestation","attest_author":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY/action/author_attestation","sign_citation":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY/action/citation_signature","submit_replication":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY/action/replication_record"}},"created_at":"2026-05-18T01:03:07.211657+00:00","updated_at":"2026-05-18T01:03:07.211657+00:00"}