{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SGZVCXU4CM7HBYPN23WL77RVRA","short_pith_number":"pith:SGZVCXU4","canonical_record":{"source":{"id":"1702.08055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-26T17:16:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1477a5f320b94eae3857bcddc904d8a9ed9f4af3643077868c0f4bfcc3a3031","abstract_canon_sha256":"7db1e643134eb470841ebd5ddcc89385b8d7295d5681053321743b457ff133ba"},"schema_version":"1.0"},"canonical_sha256":"91b3515e9c133e70e1edd6ecbffe35882e83e188b570d0facfb9299c9b03dde7","source":{"kind":"arxiv","id":"1702.08055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08055","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08055v1","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08055","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"pith_short_12","alias_value":"SGZVCXU4CM7H","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SGZVCXU4CM7HBYPN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SGZVCXU4","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SGZVCXU4CM7HBYPN23WL77RVRA","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-26T17:16:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1477a5f320b94eae3857bcddc904d8a9ed9f4af3643077868c0f4bfcc3a3031","abstract_canon_sha256":"7db1e643134eb470841ebd5ddcc89385b8d7295d5681053321743b457ff133ba"},"schema_version":"1.0"},"canonical_sha256":"91b3515e9c133e70e1edd6ecbffe35882e83e188b570d0facfb9299c9b03dde7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:56.180008Z","signature_b64":"1h+Q4hu99fw1O6vbYHt1BaCEaGZbs3Vk2mpr0tngysUSUo7RRDtrVcRStFA7iPsyHtXKPDqo7iM9Y0Gs0ZrRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91b3515e9c133e70e1edd6ecbffe35882e83e188b570d0facfb9299c9b03dde7","last_reissued_at":"2026-05-18T00:49:56.179480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:56.179480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08055","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-18T00:49:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sDBgeOXC+eZoG/51EK23QrPtYPxYSIhHmCXTFo9WakY+LXRnUzVnPA4XChfLmrkSjyQaGP6BxB00u34sJCliBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:41:33.152270Z"},"content_sha256":"671a4b707bb574bb2960db5cfdcdc999b4c3e30b1086214716ddd8476df1cdfc","schema_version":"1.0","event_id":"sha256:671a4b707bb574bb2960db5cfdcdc999b4c3e30b1086214716ddd8476df1cdfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SGZVCXU4CM7HBYPN23WL77RVRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Row-Centric Lossless Compression of Markov Images","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":"2017-02-26T17:16:51Z","abstract_excerpt":"Motivated by the question of whether the recently introduced Reduced Cutset Coding (RCC) offers rate-complexity performance benefits over conventional context-based conditional coding for sources with two-dimensional Markov structure, this paper compares several row-centric coding strategies that vary in the amount of conditioning as well as whether a model or an empirical table is used in the encoding of blocks of rows. The conclusion is that, at least for sources exhibiting low-order correlations, 1-sided model-based conditional coding is superior to the method of RCC for a given constraint "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08055","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-18T00:49:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7apmJh5fMdJEdgE3jC+9GleJ9jY3d46V1JnD5gyzbgJ3Hq46lVsViu+O2rsUazQizJGcUUeDAVDp9I6662/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:41:33.152636Z"},"content_sha256":"d9a81456221108bb528e10163db02a4dc5dee7d04c89619389bed7f0d06c16dd","schema_version":"1.0","event_id":"sha256:d9a81456221108bb528e10163db02a4dc5dee7d04c89619389bed7f0d06c16dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGZVCXU4CM7HBYPN23WL77RVRA/bundle.json","state_url":"https://pith.science/pith/SGZVCXU4CM7HBYPN23WL77RVRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGZVCXU4CM7HBYPN23WL77RVRA/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-03T02:41:33Z","links":{"resolver":"https://pith.science/pith/SGZVCXU4CM7HBYPN23WL77RVRA","bundle":"https://pith.science/pith/SGZVCXU4CM7HBYPN23WL77RVRA/bundle.json","state":"https://pith.science/pith/SGZVCXU4CM7HBYPN23WL77RVRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGZVCXU4CM7HBYPN23WL77RVRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SGZVCXU4CM7HBYPN23WL77RVRA","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":"7db1e643134eb470841ebd5ddcc89385b8d7295d5681053321743b457ff133ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-26T17:16:51Z","title_canon_sha256":"a1477a5f320b94eae3857bcddc904d8a9ed9f4af3643077868c0f4bfcc3a3031"},"schema_version":"1.0","source":{"id":"1702.08055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08055","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08055v1","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08055","created_at":"2026-05-18T00:49:56Z"},{"alias_kind":"pith_short_12","alias_value":"SGZVCXU4CM7H","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SGZVCXU4CM7HBYPN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SGZVCXU4","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:d9a81456221108bb528e10163db02a4dc5dee7d04c89619389bed7f0d06c16dd","target":"graph","created_at":"2026-05-18T00:49:56Z","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":"Motivated by the question of whether the recently introduced Reduced Cutset Coding (RCC) offers rate-complexity performance benefits over conventional context-based conditional coding for sources with two-dimensional Markov structure, this paper compares several row-centric coding strategies that vary in the amount of conditioning as well as whether a model or an empirical table is used in the encoding of blocks of rows. The conclusion is that, at least for sources exhibiting low-order correlations, 1-sided model-based conditional coding is superior to the method of RCC for a given constraint ","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":"2017-02-26T17:16:51Z","title":"Row-Centric Lossless Compression of Markov Images"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08055","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:671a4b707bb574bb2960db5cfdcdc999b4c3e30b1086214716ddd8476df1cdfc","target":"record","created_at":"2026-05-18T00:49:56Z","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":"7db1e643134eb470841ebd5ddcc89385b8d7295d5681053321743b457ff133ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-26T17:16:51Z","title_canon_sha256":"a1477a5f320b94eae3857bcddc904d8a9ed9f4af3643077868c0f4bfcc3a3031"},"schema_version":"1.0","source":{"id":"1702.08055","kind":"arxiv","version":1}},"canonical_sha256":"91b3515e9c133e70e1edd6ecbffe35882e83e188b570d0facfb9299c9b03dde7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91b3515e9c133e70e1edd6ecbffe35882e83e188b570d0facfb9299c9b03dde7","first_computed_at":"2026-05-18T00:49:56.179480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:56.179480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1h+Q4hu99fw1O6vbYHt1BaCEaGZbs3Vk2mpr0tngysUSUo7RRDtrVcRStFA7iPsyHtXKPDqo7iM9Y0Gs0ZrRCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:56.180008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:671a4b707bb574bb2960db5cfdcdc999b4c3e30b1086214716ddd8476df1cdfc","sha256:d9a81456221108bb528e10163db02a4dc5dee7d04c89619389bed7f0d06c16dd"],"state_sha256":"a8e7bf6ed6b2020a942f1c35e1776ecf88402ee642d0b80da268759a05aafb0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2NUayaczlf7ybGzeBVQMxC0d3yv+pmNbDkJyCuYKHYVQOMJxDi2QhIAFPRi1ewDsfKjEPqAOF/erw5Q9BxhhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:41:33.154773Z","bundle_sha256":"9b3e46e12b12ca4b3015142cb10cea947ef78e6905fdfa17dbfe809754e0c89a"}}