{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GNYR4JNJR544MSOC74UXMNCZDC","short_pith_number":"pith:GNYR4JNJ","canonical_record":{"source":{"id":"1207.1389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:14:28Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"25eb92aeeb2cfa9e8e0b4af6491f93ee250eed9b7442fafdc283ca80883e2ebf","abstract_canon_sha256":"e5c20b6745e31e2ddce72746d7e121337e68028251456042351e46e02d941cc8"},"schema_version":"1.0"},"canonical_sha256":"33711e25a98f79c649c2ff2976345918b0bf229c9bc0e9ece0c5daa14c43f0dd","source":{"kind":"arxiv","id":"1207.1389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1389","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1389v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1389","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"GNYR4JNJR544","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GNYR4JNJR544MSOC","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GNYR4JNJ","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GNYR4JNJR544MSOC74UXMNCZDC","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:14:28Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"25eb92aeeb2cfa9e8e0b4af6491f93ee250eed9b7442fafdc283ca80883e2ebf","abstract_canon_sha256":"e5c20b6745e31e2ddce72746d7e121337e68028251456042351e46e02d941cc8"},"schema_version":"1.0"},"canonical_sha256":"33711e25a98f79c649c2ff2976345918b0bf229c9bc0e9ece0c5daa14c43f0dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.419447Z","signature_b64":"kn6XBT1wUlNmgujvf0E7ySkmIHAg0QARCaBrA9VDy2DggUB5TjQIOIJDiETTSv8LVyqaddaUpvB0RLWeQFTxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33711e25a98f79c649c2ff2976345918b0bf229c9bc0e9ece0c5daa14c43f0dd","last_reissued_at":"2026-05-18T03:51:37.418904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.418904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1389","source_version":1,"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-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYsb56vmg/mpSJQvp0g4GIG5I+T54DgZvREcFeH4KGs+qfs5za+1hWC0DR0n2ayqyVIAzt7xBcPKQ3Qw4ul4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:08:30.264627Z"},"content_sha256":"96de1b530ac8240879e2442176d4272fd4902f91cd4bce08e68bad5be00e2ee9","schema_version":"1.0","event_id":"sha256:96de1b530ac8240879e2442176d4272fd4902f91cd4bce08e68bad5be00e2ee9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GNYR4JNJR544MSOC74UXMNCZDC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Number of Experiments Sufficient and in the Worst Case Necessary to Identify All Causal Relations Among N Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"cs.AI","authors_text":"Clark Glymour, Frederick Eberhardt, Richard Scheines","submitted_at":"2012-07-04T16:14:28Z","abstract_excerpt":"We show that if any number of variables are allowed to be simultaneously and independently randomized in any one experiment, log2(N) + 1 experiments are sufficient and in the worst case necessary to determine the causal relations among N >= 2 variables when no latent variables, no sample selection bias and no feedback cycles are present. For all K, 0 < K < 1/(2N) we provide an upper bound on the number experiments required to determine causal structure when each experiment simultaneously randomizes K variables. For large N, these bounds are significantly lower than the N - 1 bound required whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1389","kind":"arxiv","version":1},"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-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUIE2fl0vLDBkhLjb0V+ybEG0OpNlTBM304Z0qQiuQb4qScKjEbyfM9RTVpNuclevGR9wfvQ08Ex671th5NICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:08:30.264974Z"},"content_sha256":"a5252a9586fb86234b1aca5137eabdd4441ce2d7f0f33bcea1c883eb9c475fd2","schema_version":"1.0","event_id":"sha256:a5252a9586fb86234b1aca5137eabdd4441ce2d7f0f33bcea1c883eb9c475fd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC/bundle.json","state_url":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNYR4JNJR544MSOC74UXMNCZDC/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-30T07:08:30Z","links":{"resolver":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC","bundle":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC/bundle.json","state":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNYR4JNJR544MSOC74UXMNCZDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GNYR4JNJR544MSOC74UXMNCZDC","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":"e5c20b6745e31e2ddce72746d7e121337e68028251456042351e46e02d941cc8","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:14:28Z","title_canon_sha256":"25eb92aeeb2cfa9e8e0b4af6491f93ee250eed9b7442fafdc283ca80883e2ebf"},"schema_version":"1.0","source":{"id":"1207.1389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1389","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1389v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1389","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"GNYR4JNJR544","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GNYR4JNJR544MSOC","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GNYR4JNJ","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:a5252a9586fb86234b1aca5137eabdd4441ce2d7f0f33bcea1c883eb9c475fd2","target":"graph","created_at":"2026-05-18T03:51:37Z","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":"We show that if any number of variables are allowed to be simultaneously and independently randomized in any one experiment, log2(N) + 1 experiments are sufficient and in the worst case necessary to determine the causal relations among N >= 2 variables when no latent variables, no sample selection bias and no feedback cycles are present. For all K, 0 < K < 1/(2N) we provide an upper bound on the number experiments required to determine causal structure when each experiment simultaneously randomizes K variables. For large N, these bounds are significantly lower than the N - 1 bound required whe","authors_text":"Clark Glymour, Frederick Eberhardt, Richard Scheines","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:14:28Z","title":"On the Number of Experiments Sufficient and in the Worst Case Necessary to Identify All Causal Relations Among N Variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1389","kind":"arxiv","version":1},"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:96de1b530ac8240879e2442176d4272fd4902f91cd4bce08e68bad5be00e2ee9","target":"record","created_at":"2026-05-18T03:51:37Z","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":"e5c20b6745e31e2ddce72746d7e121337e68028251456042351e46e02d941cc8","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:14:28Z","title_canon_sha256":"25eb92aeeb2cfa9e8e0b4af6491f93ee250eed9b7442fafdc283ca80883e2ebf"},"schema_version":"1.0","source":{"id":"1207.1389","kind":"arxiv","version":1}},"canonical_sha256":"33711e25a98f79c649c2ff2976345918b0bf229c9bc0e9ece0c5daa14c43f0dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33711e25a98f79c649c2ff2976345918b0bf229c9bc0e9ece0c5daa14c43f0dd","first_computed_at":"2026-05-18T03:51:37.418904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:37.418904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kn6XBT1wUlNmgujvf0E7ySkmIHAg0QARCaBrA9VDy2DggUB5TjQIOIJDiETTSv8LVyqaddaUpvB0RLWeQFTxDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:37.419447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96de1b530ac8240879e2442176d4272fd4902f91cd4bce08e68bad5be00e2ee9","sha256:a5252a9586fb86234b1aca5137eabdd4441ce2d7f0f33bcea1c883eb9c475fd2"],"state_sha256":"834f2210991b86cf1d7775ed1a4d5f0ed3e005d5f1c76e57aa80f3c301dd5067"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6r/BqWz22YlE/SRPNUf5XukIg1vlTgtWEHkn3h7NmjS4Co1AOeXfBgEYnQrpZHOkPcpgMyvy3n9XGY7Ij+uNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T07:08:30.266991Z","bundle_sha256":"bab9fd68a37fca3de09d16beecc0b21a20fa63b0a99eb5a95389f7fe50d96604"}}