{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6B75LOAVOSNFQNPR5DOV7IV7UY","short_pith_number":"pith:6B75LOAV","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"},"canonical_sha256":"f07fd5b815749a5835f1e8dd5fa2bfa6222ccbad99008e2662d4a1be63da6db4","source":{"kind":"arxiv","id":"1610.00378","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00378","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00378v2","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00378","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"6B75LOAVOSNF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6B75LOAVOSNFQNPR","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6B75LOAV","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6B75LOAVOSNFQNPR5DOV7IV7UY","target":"record","payload":{"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"},"canonical_sha256":"f07fd5b815749a5835f1e8dd5fa2bfa6222ccbad99008e2662d4a1be63da6db4","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"},"source_kind":"arxiv","source_id":"1610.00378","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-18T01:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBjcO5uYLTATQbww1HMnX2HSzQjJYT39o+/GhrqVjEJ2jDJxsY8tn+QjBtL165MqgwlVGyzS1/0y8iYKrh5xAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:52:04.524813Z"},"content_sha256":"380b34683aa3d70bf29f66646b0c2664f606f4899e686cc24b4d52519cc38036","schema_version":"1.0","event_id":"sha256:380b34683aa3d70bf29f66646b0c2664f606f4899e686cc24b4d52519cc38036"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6B75LOAVOSNFQNPR5DOV7IV7UY","target":"graph","payload":{"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"},"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-18T01:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8Dr9MqWgpUc+HY0t9tEgO2Gc6WqsxipoMzNTvEU2yK7RM7Ec7U+zI7rzUdZYVY+xl9jzqCrokiox+s2sVy0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:52:04.525409Z"},"content_sha256":"c219e5b59c03cfffaefb5ef7629c18c9fd01e192223b769615a7dde3a804a155","schema_version":"1.0","event_id":"sha256:c219e5b59c03cfffaefb5ef7629c18c9fd01e192223b769615a7dde3a804a155"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY/bundle.json","state_url":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6B75LOAVOSNFQNPR5DOV7IV7UY/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-27T18:52:04Z","links":{"resolver":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY","bundle":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY/bundle.json","state":"https://pith.science/pith/6B75LOAVOSNFQNPR5DOV7IV7UY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6B75LOAVOSNFQNPR5DOV7IV7UY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6B75LOAVOSNFQNPR5DOV7IV7UY","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":"3562a8015e23a0fe288feb3d85f4d4047c6aa37b11688816f90606dcbc645d06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-10-03T00:47:51Z","title_canon_sha256":"b93f90e6f92d1602b218c8dad858e68993368d394eacebc87b09198103f86bea"},"schema_version":"1.0","source":{"id":"1610.00378","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00378","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00378v2","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00378","created_at":"2026-05-18T01:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"6B75LOAVOSNF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6B75LOAVOSNFQNPR","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6B75LOAV","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:c219e5b59c03cfffaefb5ef7629c18c9fd01e192223b769615a7dde3a804a155","target":"graph","created_at":"2026-05-18T01:03:07Z","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":"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","authors_text":"Joseph Ramsey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-10-03T00:47:51Z","title":"Improving Accuracy and Scalability of the PC Algorithm by Maximizing P-value"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00378","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:380b34683aa3d70bf29f66646b0c2664f606f4899e686cc24b4d52519cc38036","target":"record","created_at":"2026-05-18T01:03:07Z","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":"3562a8015e23a0fe288feb3d85f4d4047c6aa37b11688816f90606dcbc645d06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-10-03T00:47:51Z","title_canon_sha256":"b93f90e6f92d1602b218c8dad858e68993368d394eacebc87b09198103f86bea"},"schema_version":"1.0","source":{"id":"1610.00378","kind":"arxiv","version":2}},"canonical_sha256":"f07fd5b815749a5835f1e8dd5fa2bfa6222ccbad99008e2662d4a1be63da6db4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f07fd5b815749a5835f1e8dd5fa2bfa6222ccbad99008e2662d4a1be63da6db4","first_computed_at":"2026-05-18T01:03:07.211543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:07.211543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QQDZRaAl4D/DoYIqsxfBBe3JfirYy8q2N763WJylGK/W9EI3ig28if6k1mmA6UevYrxIrGs+lOmv8XMmpwgJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:07.212234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00378","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:380b34683aa3d70bf29f66646b0c2664f606f4899e686cc24b4d52519cc38036","sha256:c219e5b59c03cfffaefb5ef7629c18c9fd01e192223b769615a7dde3a804a155"],"state_sha256":"09667360a4d915d0b09e1282e50d780d54dfb88ff9a688b7856fa11ccea0b4b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JskWT3eUZfv/tAM8LDl222W9GJ1M0iymhmryUzY+1PdiInJDS4LY79MOhZR2qBp9HUVKtNlAPXctG7vd8YnlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:52:04.527937Z","bundle_sha256":"7b2739782acc1f9ec85e071ccc8f56c5a3ba5b4753743bfa4a9db0cfbd582e9f"}}