{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P2ZNQ7W5IGTLNT7RHALACWSYUG","short_pith_number":"pith:P2ZNQ7W5","canonical_record":{"source":{"id":"1602.04835","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-15T21:02:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2a7288f9f5ec09f5a8c7bcceeab80bfbe44443fe84398c9a1aee324764fe3954","abstract_canon_sha256":"23395d0355b704070e0d3afa3784e4f9b9294b040c52e52823b0a8236d6e9696"},"schema_version":"1.0"},"canonical_sha256":"7eb2d87edd41a6b6cff13816015a58a1a2a82b6d14ca99402c7a1bc82d4f26ca","source":{"kind":"arxiv","id":"1602.04835","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04835","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04835v4","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04835","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"P2ZNQ7W5IGTL","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P2ZNQ7W5IGTLNT7R","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P2ZNQ7W5","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P2ZNQ7W5IGTLNT7RHALACWSYUG","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04835","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-15T21:02:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2a7288f9f5ec09f5a8c7bcceeab80bfbe44443fe84398c9a1aee324764fe3954","abstract_canon_sha256":"23395d0355b704070e0d3afa3784e4f9b9294b040c52e52823b0a8236d6e9696"},"schema_version":"1.0"},"canonical_sha256":"7eb2d87edd41a6b6cff13816015a58a1a2a82b6d14ca99402c7a1bc82d4f26ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:07.886560Z","signature_b64":"KO1e4bg4hFWlUgJKlTFjyH6kybgl0s8Oo6qInlWFiyr6nH0nnJMlCIyvL5HNiwAE0WKJTYDlds0ZlUg0OxP6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7eb2d87edd41a6b6cff13816015a58a1a2a82b6d14ca99402c7a1bc82d4f26ca","last_reissued_at":"2026-05-18T01:20:07.885907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:07.885907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04835","source_version":4,"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-18T01:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H3AVqQBvaeyJ/gkNtZKJ+2o2AIRLsWZ1kn3asr34dNsTOrgMRh9Uasi7J6kaXzugSuNhlg07xO9KlMUAtMU8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:36:54.434774Z"},"content_sha256":"4932abe8adcda9bcbd977578d87835ee23c8a17e2c85d725fc5376c09c84a051","schema_version":"1.0","event_id":"sha256:4932abe8adcda9bcbd977578d87835ee23c8a17e2c85d725fc5376c09c84a051"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P2ZNQ7W5IGTLNT7RHALACWSYUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cutset Width and Spacing for Reduced Cutset Coding of Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David L. Neuhoff, Matthew G. Reyes","submitted_at":"2016-02-15T21:02:22Z","abstract_excerpt":"In this paper we explore tradeoffs, regarding coding performance, between the thickness and spacing of the cutset used in Reduced Cutset Coding (RCC) of a Markov random field image model. Considering MRF models on a square lattice of sites, we show that under a stationarity condition, increasing the thickness of the cutset reduces coding rate for the cutset, increasing the spacing between components of the cutset increases the coding rate of the non-cutset pixels, though the coding rate of the latter is always strictly less than that of the former. We show that the redundancy of RCC can be dec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04835","kind":"arxiv","version":4},"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-18T01:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+qPbih6w6GLE7XjjgvqrJLucqGxaXIXz/WTSM8HPr2ppUiNqWndjQgExoLW9teZSkdsrW34Ivhy1Mci9BykDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:36:54.435129Z"},"content_sha256":"056cb91b6f6f15c95fe7b47b6b91c2d4379e3a40b7e95aa0018de47a09f39797","schema_version":"1.0","event_id":"sha256:056cb91b6f6f15c95fe7b47b6b91c2d4379e3a40b7e95aa0018de47a09f39797"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2ZNQ7W5IGTLNT7RHALACWSYUG/bundle.json","state_url":"https://pith.science/pith/P2ZNQ7W5IGTLNT7RHALACWSYUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2ZNQ7W5IGTLNT7RHALACWSYUG/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-03T20:36:54Z","links":{"resolver":"https://pith.science/pith/P2ZNQ7W5IGTLNT7RHALACWSYUG","bundle":"https://pith.science/pith/P2ZNQ7W5IGTLNT7RHALACWSYUG/bundle.json","state":"https://pith.science/pith/P2ZNQ7W5IGTLNT7RHALACWSYUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2ZNQ7W5IGTLNT7RHALACWSYUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P2ZNQ7W5IGTLNT7RHALACWSYUG","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":"23395d0355b704070e0d3afa3784e4f9b9294b040c52e52823b0a8236d6e9696","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-15T21:02:22Z","title_canon_sha256":"2a7288f9f5ec09f5a8c7bcceeab80bfbe44443fe84398c9a1aee324764fe3954"},"schema_version":"1.0","source":{"id":"1602.04835","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04835","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04835v4","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04835","created_at":"2026-05-18T01:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"P2ZNQ7W5IGTL","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P2ZNQ7W5IGTLNT7R","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P2ZNQ7W5","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:056cb91b6f6f15c95fe7b47b6b91c2d4379e3a40b7e95aa0018de47a09f39797","target":"graph","created_at":"2026-05-18T01:20:07Z","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":"In this paper we explore tradeoffs, regarding coding performance, between the thickness and spacing of the cutset used in Reduced Cutset Coding (RCC) of a Markov random field image model. Considering MRF models on a square lattice of sites, we show that under a stationarity condition, increasing the thickness of the cutset reduces coding rate for the cutset, increasing the spacing between components of the cutset increases the coding rate of the non-cutset pixels, though the coding rate of the latter is always strictly less than that of the former. We show that the redundancy of RCC can be dec","authors_text":"David L. Neuhoff, Matthew G. Reyes","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-15T21:02:22Z","title":"Cutset Width and Spacing for Reduced Cutset Coding of Markov Random Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04835","kind":"arxiv","version":4},"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:4932abe8adcda9bcbd977578d87835ee23c8a17e2c85d725fc5376c09c84a051","target":"record","created_at":"2026-05-18T01:20:07Z","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":"23395d0355b704070e0d3afa3784e4f9b9294b040c52e52823b0a8236d6e9696","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-15T21:02:22Z","title_canon_sha256":"2a7288f9f5ec09f5a8c7bcceeab80bfbe44443fe84398c9a1aee324764fe3954"},"schema_version":"1.0","source":{"id":"1602.04835","kind":"arxiv","version":4}},"canonical_sha256":"7eb2d87edd41a6b6cff13816015a58a1a2a82b6d14ca99402c7a1bc82d4f26ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7eb2d87edd41a6b6cff13816015a58a1a2a82b6d14ca99402c7a1bc82d4f26ca","first_computed_at":"2026-05-18T01:20:07.885907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:07.885907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KO1e4bg4hFWlUgJKlTFjyH6kybgl0s8Oo6qInlWFiyr6nH0nnJMlCIyvL5HNiwAE0WKJTYDlds0ZlUg0OxP6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:07.886560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04835","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4932abe8adcda9bcbd977578d87835ee23c8a17e2c85d725fc5376c09c84a051","sha256:056cb91b6f6f15c95fe7b47b6b91c2d4379e3a40b7e95aa0018de47a09f39797"],"state_sha256":"7813a37fd31fa8624a00f2a4ae61e5a3290754f80c48e0be3a6b7d221fb19126"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Byac9QGL0+ohESZzlFY8NUPs28/Jj7466HOQAH4wzQhru/eJiqbtnSjp6AcSoduFK2ccliHMMwU6Q+kAl+3WDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:36:54.436951Z","bundle_sha256":"440929f001564ee8da669a7f534e073bcb6eed645430f112afaf7030664fbdaf"}}