{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BFQCYH2RKOMQSAVZ2R5KOZODMU","short_pith_number":"pith:BFQCYH2R","schema_version":"1.0","canonical_sha256":"09602c1f5153990902b9d47aa765c3650d71b46b1d17babb7f04928539416b11","source":{"kind":"arxiv","id":"1602.03061","version":2},"attestation_state":"computed","paper":{"title":"Minimum Conditional Description Length Estimation for Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"David L. Neuhoff, Matthew G. Reyes","submitted_at":"2016-02-09T16:36:51Z","abstract_excerpt":"In this paper we discuss a method, which we call Minimum Conditional Description Length (MCDL), for estimating the parameters of a subset of sites within a Markov random field. We assume that the edges are known for the entire graph $G=(V,E)$. Then, for a subset $U\\subset V$, we estimate the parameters for nodes and edges in $U$ as well as for edges incident to a node in $U$, by finding the exponential parameter for that subset that yields the best compression conditioned on the values on the boundary $\\partial U$. Our estimate is derived from a temporally stationary sequence of observations o"},"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":"1602.03061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-09T16:36:51Z","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"a38aaa028582a7e182b91153124af288ca1c15dd6bfd7eb0eb9799546ef37f5a","abstract_canon_sha256":"bd4d883151624809852fff444efbf706892c3e53c508543112068bec3dca4651"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:06.216650Z","signature_b64":"dPzO80uRbF5PSYsTRMof+mC2rFO7HEgHFNPAOcXs9hiQ3Pcs9iThTIM1rvTmVzLobdkWuulifssApsGwTBX6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09602c1f5153990902b9d47aa765c3650d71b46b1d17babb7f04928539416b11","last_reissued_at":"2026-05-18T01:20:06.215775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:06.215775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Conditional Description Length Estimation for Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"David L. Neuhoff, Matthew G. Reyes","submitted_at":"2016-02-09T16:36:51Z","abstract_excerpt":"In this paper we discuss a method, which we call Minimum Conditional Description Length (MCDL), for estimating the parameters of a subset of sites within a Markov random field. We assume that the edges are known for the entire graph $G=(V,E)$. Then, for a subset $U\\subset V$, we estimate the parameters for nodes and edges in $U$ as well as for edges incident to a node in $U$, by finding the exponential parameter for that subset that yields the best compression conditioned on the values on the boundary $\\partial U$. Our estimate is derived from a temporally stationary sequence of observations o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03061","kind":"arxiv","version":2},"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":"1602.03061","created_at":"2026-05-18T01:20:06.215901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03061v2","created_at":"2026-05-18T01:20:06.215901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03061","created_at":"2026-05-18T01:20:06.215901+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFQCYH2RKOMQ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFQCYH2RKOMQSAVZ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFQCYH2R","created_at":"2026-05-18T12:30:07.202191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BFQCYH2RKOMQSAVZ2R5KOZODMU","json":"https://pith.science/pith/BFQCYH2RKOMQSAVZ2R5KOZODMU.json","graph_json":"https://pith.science/api/pith-number/BFQCYH2RKOMQSAVZ2R5KOZODMU/graph.json","events_json":"https://pith.science/api/pith-number/BFQCYH2RKOMQSAVZ2R5KOZODMU/events.json","paper":"https://pith.science/paper/BFQCYH2R"},"agent_actions":{"view_html":"https://pith.science/pith/BFQCYH2RKOMQSAVZ2R5KOZODMU","download_json":"https://pith.science/pith/BFQCYH2RKOMQSAVZ2R5KOZODMU.json","view_paper":"https://pith.science/paper/BFQCYH2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03061&json=true","fetch_graph":"https://pith.science/api/pith-number/BFQCYH2RKOMQSAVZ2R5KOZODMU/graph.json","fetch_events":"https://pith.science/api/pith-number/BFQCYH2RKOMQSAVZ2R5KOZODMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFQCYH2RKOMQSAVZ2R5KOZODMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFQCYH2RKOMQSAVZ2R5KOZODMU/action/storage_attestation","attest_author":"https://pith.science/pith/BFQCYH2RKOMQSAVZ2R5KOZODMU/action/author_attestation","sign_citation":"https://pith.science/pith/BFQCYH2RKOMQSAVZ2R5KOZODMU/action/citation_signature","submit_replication":"https://pith.science/pith/BFQCYH2RKOMQSAVZ2R5KOZODMU/action/replication_record"}},"created_at":"2026-05-18T01:20:06.215901+00:00","updated_at":"2026-05-18T01:20:06.215901+00:00"}