{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PG6HVBXA7BKNAGPORIU4NSIFLX","short_pith_number":"pith:PG6HVBXA","canonical_record":{"source":{"id":"1207.4135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:52:02Z","cross_cats_sorted":[],"title_canon_sha256":"1c0df878bcc273f7f53714476b793715f8cdc6bdc8d8aaba8a69bec8fe9e7fbf","abstract_canon_sha256":"c88ddaaf9820b382ce3bd86bc0c97035f9f8f540d6db7686a71436e3d117ee4c"},"schema_version":"1.0"},"canonical_sha256":"79bc7a86e0f854d019ee8a29c6c9055dca7a101d77d5aff37b1eb5598d9187aa","source":{"kind":"arxiv","id":"1207.4135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4135","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4135v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4135","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"PG6HVBXA7BKN","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PG6HVBXA7BKNAGPO","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PG6HVBXA","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PG6HVBXA7BKNAGPORIU4NSIFLX","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:52:02Z","cross_cats_sorted":[],"title_canon_sha256":"1c0df878bcc273f7f53714476b793715f8cdc6bdc8d8aaba8a69bec8fe9e7fbf","abstract_canon_sha256":"c88ddaaf9820b382ce3bd86bc0c97035f9f8f540d6db7686a71436e3d117ee4c"},"schema_version":"1.0"},"canonical_sha256":"79bc7a86e0f854d019ee8a29c6c9055dca7a101d77d5aff37b1eb5598d9187aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:47.782036Z","signature_b64":"OyyGFhMXEeweCRHrHKiq33HW6kf1VQ2fsicj+rN6LAHIhLVrP1HKhs8sHgLfGxEGIoAadrvz4yl75uU8j+LhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79bc7a86e0f854d019ee8a29c6c9055dca7a101d77d5aff37b1eb5598d9187aa","last_reissued_at":"2026-05-18T03:50:47.781406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:47.781406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4135","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOn3Er8X4/Yz1TY6QhievWdDbGWK5E1sg1AZgLiePfoPGl/I4DoIh6o7fHwSHYeMdIb2fDxBSEakfxs15sGLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:05:53.497187Z"},"content_sha256":"5138332c8b822147f9e0cfd0b17a1bd601abfaaf969d9800f553fad6c7e0cd2b","schema_version":"1.0","event_id":"sha256:5138332c8b822147f9e0cfd0b17a1bd601abfaaf969d9800f553fad6c7e0cd2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PG6HVBXA7BKNAGPORIU4NSIFLX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Case-Factor Diagrams for Structured Probabilistic Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David A. McAllester, Fernando Pereira, Michael Collins","submitted_at":"2012-07-11T14:52:02Z","abstract_excerpt":"We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Boolean formulas that we call case-factor diagrams (CFDs). CFDs are similar to binary decision diagrams (BDDs) but are concise for circuits of bounded tree width (unlike BDDs) and can concisely represent the set of parse trees over a given string undera given context free grammar (also unlike BDDs). A probabilistic model consists of aCFD defining a feasible set of Boolean assignments and a weight (or cost) for each indi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4135","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:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKYa15jFD+K6y0YlhifIZITdBAYTBMA9kw0sj1GoadIzKN1m3yDTlX9ADMSXzDTBpWqolHyuhObhbPJsTjAfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:05:53.497839Z"},"content_sha256":"ed722dca4d308671170ff374fb60afb875c19987521a1d776a87fee1e03769d2","schema_version":"1.0","event_id":"sha256:ed722dca4d308671170ff374fb60afb875c19987521a1d776a87fee1e03769d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PG6HVBXA7BKNAGPORIU4NSIFLX/bundle.json","state_url":"https://pith.science/pith/PG6HVBXA7BKNAGPORIU4NSIFLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PG6HVBXA7BKNAGPORIU4NSIFLX/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-08T17:05:53Z","links":{"resolver":"https://pith.science/pith/PG6HVBXA7BKNAGPORIU4NSIFLX","bundle":"https://pith.science/pith/PG6HVBXA7BKNAGPORIU4NSIFLX/bundle.json","state":"https://pith.science/pith/PG6HVBXA7BKNAGPORIU4NSIFLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PG6HVBXA7BKNAGPORIU4NSIFLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PG6HVBXA7BKNAGPORIU4NSIFLX","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":"c88ddaaf9820b382ce3bd86bc0c97035f9f8f540d6db7686a71436e3d117ee4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:52:02Z","title_canon_sha256":"1c0df878bcc273f7f53714476b793715f8cdc6bdc8d8aaba8a69bec8fe9e7fbf"},"schema_version":"1.0","source":{"id":"1207.4135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4135","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4135v1","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4135","created_at":"2026-05-18T03:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"PG6HVBXA7BKN","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PG6HVBXA7BKNAGPO","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PG6HVBXA","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:ed722dca4d308671170ff374fb60afb875c19987521a1d776a87fee1e03769d2","target":"graph","created_at":"2026-05-18T03:50:47Z","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 introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Boolean formulas that we call case-factor diagrams (CFDs). CFDs are similar to binary decision diagrams (BDDs) but are concise for circuits of bounded tree width (unlike BDDs) and can concisely represent the set of parse trees over a given string undera given context free grammar (also unlike BDDs). A probabilistic model consists of aCFD defining a feasible set of Boolean assignments and a weight (or cost) for each indi","authors_text":"David A. McAllester, Fernando Pereira, Michael Collins","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:52:02Z","title":"Case-Factor Diagrams for Structured Probabilistic Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4135","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:5138332c8b822147f9e0cfd0b17a1bd601abfaaf969d9800f553fad6c7e0cd2b","target":"record","created_at":"2026-05-18T03:50:47Z","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":"c88ddaaf9820b382ce3bd86bc0c97035f9f8f540d6db7686a71436e3d117ee4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T14:52:02Z","title_canon_sha256":"1c0df878bcc273f7f53714476b793715f8cdc6bdc8d8aaba8a69bec8fe9e7fbf"},"schema_version":"1.0","source":{"id":"1207.4135","kind":"arxiv","version":1}},"canonical_sha256":"79bc7a86e0f854d019ee8a29c6c9055dca7a101d77d5aff37b1eb5598d9187aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79bc7a86e0f854d019ee8a29c6c9055dca7a101d77d5aff37b1eb5598d9187aa","first_computed_at":"2026-05-18T03:50:47.781406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:47.781406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OyyGFhMXEeweCRHrHKiq33HW6kf1VQ2fsicj+rN6LAHIhLVrP1HKhs8sHgLfGxEGIoAadrvz4yl75uU8j+LhBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:47.782036Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5138332c8b822147f9e0cfd0b17a1bd601abfaaf969d9800f553fad6c7e0cd2b","sha256:ed722dca4d308671170ff374fb60afb875c19987521a1d776a87fee1e03769d2"],"state_sha256":"79fec0d76638fca5d066576cb64aefe27cb5b957d5e36c8280ee461437ef3691"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Hh2JFDOVxbNonhFASqQXG2MelSvdkCW4NDO/cbRUSwPpEchZpx3TycKbikyg05lCZjFkCiZK+HMx9p4+oz5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:05:53.501757Z","bundle_sha256":"192d8955d93324577fe3ee00122cc762f0f3cd4c592cb5444470589adfaf49db"}}