{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WMTRYHNVMHZR3QVNMEIAQSF4VU","short_pith_number":"pith:WMTRYHNV","canonical_record":{"source":{"id":"1303.5749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-20T15:33:17Z","cross_cats_sorted":[],"title_canon_sha256":"fedbc2e237d896d682299fd67cd10acd8048101e40a6a2b0c8b080fb84256291","abstract_canon_sha256":"a65627d91d7babe07ab89e9e423f99f4e48c5fbf777f6ac479244743b6ae3abb"},"schema_version":"1.0"},"canonical_sha256":"b3271c1db561f31dc2ad61100848bcad208e2ee75170ef5c38d37e853a5cf617","source":{"kind":"arxiv","id":"1303.5749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5749","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5749v1","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5749","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"pith_short_12","alias_value":"WMTRYHNVMHZR","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WMTRYHNVMHZR3QVN","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WMTRYHNV","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WMTRYHNVMHZR3QVNMEIAQSF4VU","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-20T15:33:17Z","cross_cats_sorted":[],"title_canon_sha256":"fedbc2e237d896d682299fd67cd10acd8048101e40a6a2b0c8b080fb84256291","abstract_canon_sha256":"a65627d91d7babe07ab89e9e423f99f4e48c5fbf777f6ac479244743b6ae3abb"},"schema_version":"1.0"},"canonical_sha256":"b3271c1db561f31dc2ad61100848bcad208e2ee75170ef5c38d37e853a5cf617","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:01.395718Z","signature_b64":"TcpImF9iTMfieTDj4nBAk16+NhJ3CUS6uAN2LYJnu0hBJ5BNFAD0Zz9S/au4F67HeNfTQUh7pqwXQQasdFfpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3271c1db561f31dc2ad61100848bcad208e2ee75170ef5c38d37e853a5cf617","last_reissued_at":"2026-05-18T03:30:01.395224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:01.395224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5749","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:30:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"syYWTpgKjOvhyiJ97zsOjOI9ljr1SlZA2HipGeHYM5KsnWzO56WLdy8Bb1kLl0Htk8qkOXLdGSPqa4WxbE84DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:51:23.763764Z"},"content_sha256":"d53d1828cd6cfff8ce90d6247774c6a0f410749baa8870a7aae2200264afb29d","schema_version":"1.0","event_id":"sha256:d53d1828cd6cfff8ce90d6247774c6a0f410749baa8870a7aae2200264afb29d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WMTRYHNVMHZR3QVNMEIAQSF4VU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Graph-Based Inference Method for Conditional Independence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ross D. Shachter","submitted_at":"2013-03-20T15:33:17Z","abstract_excerpt":"The graphoid axioms for conditional independence, originally described by Dawid [1979], are fundamental to probabilistic reasoning [Pearl, 19881.  Such axioms provide a mechanism for manipulating conditional independence assertions without resorting to their numerical definition.  This paper explores a representation for independence statements using multiple undirected graphs and some simple graphical transformations. The independence statements derivable in this system are equivalent to those obtainable by the graphoid axioms.  Therefore, this is a purely graphical proof technique for condit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5749","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:30:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kAwZGDuUg1D8bJ3yw7+LBIJsRxwOHWqbIytu6qgxA9g9yDCVxBxeM0kKPi70ITFXbsC6rUvv4r5tTH9d2cd6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:51:23.764105Z"},"content_sha256":"fb90252da41063a853e6e06d880103f1f800114d1450404065cd4ece0a492ab0","schema_version":"1.0","event_id":"sha256:fb90252da41063a853e6e06d880103f1f800114d1450404065cd4ece0a492ab0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMTRYHNVMHZR3QVNMEIAQSF4VU/bundle.json","state_url":"https://pith.science/pith/WMTRYHNVMHZR3QVNMEIAQSF4VU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMTRYHNVMHZR3QVNMEIAQSF4VU/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-02T15:51:23Z","links":{"resolver":"https://pith.science/pith/WMTRYHNVMHZR3QVNMEIAQSF4VU","bundle":"https://pith.science/pith/WMTRYHNVMHZR3QVNMEIAQSF4VU/bundle.json","state":"https://pith.science/pith/WMTRYHNVMHZR3QVNMEIAQSF4VU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMTRYHNVMHZR3QVNMEIAQSF4VU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WMTRYHNVMHZR3QVNMEIAQSF4VU","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":"a65627d91d7babe07ab89e9e423f99f4e48c5fbf777f6ac479244743b6ae3abb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-20T15:33:17Z","title_canon_sha256":"fedbc2e237d896d682299fd67cd10acd8048101e40a6a2b0c8b080fb84256291"},"schema_version":"1.0","source":{"id":"1303.5749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5749","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5749v1","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5749","created_at":"2026-05-18T03:30:01Z"},{"alias_kind":"pith_short_12","alias_value":"WMTRYHNVMHZR","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WMTRYHNVMHZR3QVN","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WMTRYHNV","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:fb90252da41063a853e6e06d880103f1f800114d1450404065cd4ece0a492ab0","target":"graph","created_at":"2026-05-18T03:30:01Z","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":"The graphoid axioms for conditional independence, originally described by Dawid [1979], are fundamental to probabilistic reasoning [Pearl, 19881.  Such axioms provide a mechanism for manipulating conditional independence assertions without resorting to their numerical definition.  This paper explores a representation for independence statements using multiple undirected graphs and some simple graphical transformations. The independence statements derivable in this system are equivalent to those obtainable by the graphoid axioms.  Therefore, this is a purely graphical proof technique for condit","authors_text":"Ross D. Shachter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-20T15:33:17Z","title":"A Graph-Based Inference Method for Conditional Independence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5749","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:d53d1828cd6cfff8ce90d6247774c6a0f410749baa8870a7aae2200264afb29d","target":"record","created_at":"2026-05-18T03:30:01Z","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":"a65627d91d7babe07ab89e9e423f99f4e48c5fbf777f6ac479244743b6ae3abb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-20T15:33:17Z","title_canon_sha256":"fedbc2e237d896d682299fd67cd10acd8048101e40a6a2b0c8b080fb84256291"},"schema_version":"1.0","source":{"id":"1303.5749","kind":"arxiv","version":1}},"canonical_sha256":"b3271c1db561f31dc2ad61100848bcad208e2ee75170ef5c38d37e853a5cf617","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3271c1db561f31dc2ad61100848bcad208e2ee75170ef5c38d37e853a5cf617","first_computed_at":"2026-05-18T03:30:01.395224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:01.395224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TcpImF9iTMfieTDj4nBAk16+NhJ3CUS6uAN2LYJnu0hBJ5BNFAD0Zz9S/au4F67HeNfTQUh7pqwXQQasdFfpCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:01.395718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d53d1828cd6cfff8ce90d6247774c6a0f410749baa8870a7aae2200264afb29d","sha256:fb90252da41063a853e6e06d880103f1f800114d1450404065cd4ece0a492ab0"],"state_sha256":"b80d11021b194376cc2eaa098a49e1b24ef662adc0dd2b7249034cbdabe6bc9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCXCeqfODInHRK2GlUGOWvFh2LmEvfes5trVEuOE/6rKE7ZnDvOh6iATglNZ0whYZe8n63eYpbMFIIwMWSnJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:51:23.766053Z","bundle_sha256":"0da1f419352869dda52f4c47f65ed5a6e1d7569a884930bcbb3638f4cad2367a"}}