{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OPCF3Y5GHHZSFNKQ7OOW5XWZU2","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":"30114ee377d412526da8a47f9902905a3b5653d23dd1ea3db1a6ac6640f67ee3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-12T07:39:59Z","title_canon_sha256":"0352d2ad1d7b72b002f0d300bb680b269f72bc1b842e7ce005262bd8e63ff411"},"schema_version":"1.0","source":{"id":"1608.03697","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03697","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03697v2","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03697","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"pith_short_12","alias_value":"OPCF3Y5GHHZS","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OPCF3Y5GHHZSFNKQ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OPCF3Y5G","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:7aa4ff37b89830b4ed3c6e6af2d84ed78d18ec49fde8e3a70abec5d1ed895d6d","target":"graph","created_at":"2026-05-18T00:25:42Z","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":"Let $X_i, i \\in V$ form a Markov random field (MRF) represented by an undirected graph $G = (V,E)$, and $V'$ be a subset of $V$.\n  We determine the smallest graph that can always represent the subfield $X_i, i \\in V'$ as an MRF. Based on this result, we obtain a necessary and sufficient condition for a subfield of a Markov tree to be also a Markov tree. When $G$ is a path so that $X_i, i \\in V$ form a Markov chain, it is known that the $I$-Measure is always nonnegative and the information diagram assumes a very special structure Kawabata and Yeung (1992). We prove that Markov chain is essentia","authors_text":"Ali Al-Bashabsheh, Chao Chen, Pierre Moulin, Qi Chen, Raymond W. Yeung","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-12T07:39:59Z","title":"On Information-Theoretic Characterizations of Markov Random Fields and Subfields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03697","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:1a337a5a84c2317b7b1da50a883a59f4db3fc508a07e433708d0a39bf8fc6dc5","target":"record","created_at":"2026-05-18T00:25:42Z","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":"30114ee377d412526da8a47f9902905a3b5653d23dd1ea3db1a6ac6640f67ee3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-12T07:39:59Z","title_canon_sha256":"0352d2ad1d7b72b002f0d300bb680b269f72bc1b842e7ce005262bd8e63ff411"},"schema_version":"1.0","source":{"id":"1608.03697","kind":"arxiv","version":2}},"canonical_sha256":"73c45de3a639f322b550fb9d6eded9a6bde6c1c037bdb45e9c7f37ec0ae290ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73c45de3a639f322b550fb9d6eded9a6bde6c1c037bdb45e9c7f37ec0ae290ec","first_computed_at":"2026-05-18T00:25:42.445845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:42.445845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tMYxpr/ErhCFmV6dSW7HVlUjxASg9bU1cr6BhgSAv9fPAewdkvNZuBOcVMkX61VGNfjlpNel+6JW/Lx4E+gBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:42.446513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03697","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a337a5a84c2317b7b1da50a883a59f4db3fc508a07e433708d0a39bf8fc6dc5","sha256:7aa4ff37b89830b4ed3c6e6af2d84ed78d18ec49fde8e3a70abec5d1ed895d6d"],"state_sha256":"38cb311b121b0b844eabc7986a7716a391fc83ff131649a7854166dc95fc5e8a"}