{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GNYR4JNJR544MSOC74UXMNCZDC","short_pith_number":"pith:GNYR4JNJ","schema_version":"1.0","canonical_sha256":"33711e25a98f79c649c2ff2976345918b0bf229c9bc0e9ece0c5daa14c43f0dd","source":{"kind":"arxiv","id":"1207.1389","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.1389","created_at":"2026-05-18T03:51:37.418982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1389v1","created_at":"2026-05-18T03:51:37.418982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1389","created_at":"2026-05-18T03:51:37.418982+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNYR4JNJR544","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNYR4JNJR544MSOC","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNYR4JNJ","created_at":"2026-05-18T12:27:06.952714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.27477","citing_title":"Iterative Causal Discovery: Per-Edge Impossibility Certificates, Tier-Aware Oracle Queries, and the $1+K$ Lower Bound","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC","json":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC.json","graph_json":"https://pith.science/api/pith-number/GNYR4JNJR544MSOC74UXMNCZDC/graph.json","events_json":"https://pith.science/api/pith-number/GNYR4JNJR544MSOC74UXMNCZDC/events.json","paper":"https://pith.science/paper/GNYR4JNJ"},"agent_actions":{"view_html":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC","download_json":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC.json","view_paper":"https://pith.science/paper/GNYR4JNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1389&json=true","fetch_graph":"https://pith.science/api/pith-number/GNYR4JNJR544MSOC74UXMNCZDC/graph.json","fetch_events":"https://pith.science/api/pith-number/GNYR4JNJR544MSOC74UXMNCZDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC/action/storage_attestation","attest_author":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC/action/author_attestation","sign_citation":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC/action/citation_signature","submit_replication":"https://pith.science/pith/GNYR4JNJR544MSOC74UXMNCZDC/action/replication_record"}},"created_at":"2026-05-18T03:51:37.418982+00:00","updated_at":"2026-05-18T03:51:37.418982+00:00"}