{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K52RTWZK6CAPEAXQZXO5YYE7ET","short_pith_number":"pith:K52RTWZK","canonical_record":{"source":{"id":"1604.08001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-04-27T10:00:41Z","cross_cats_sorted":[],"title_canon_sha256":"e0ee4c4d8ba7a3bfcc261702e72bb4c77744b3e72ec155d958961e319ba623a5","abstract_canon_sha256":"a6ea17c10ad08ae7fb5119c3f4b8f843f1bc47bc94b8dd805ebc100d621bc04c"},"schema_version":"1.0"},"canonical_sha256":"577519db2af080f202f0cddddc609f24d1d4464b3156cb48bcb9b2456aff7c9c","source":{"kind":"arxiv","id":"1604.08001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08001","created_at":"2026-05-18T00:54:20Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08001v1","created_at":"2026-05-18T00:54:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08001","created_at":"2026-05-18T00:54:20Z"},{"alias_kind":"pith_short_12","alias_value":"K52RTWZK6CAP","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K52RTWZK6CAPEAXQ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K52RTWZK","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K52RTWZK6CAPEAXQZXO5YYE7ET","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-04-27T10:00:41Z","cross_cats_sorted":[],"title_canon_sha256":"e0ee4c4d8ba7a3bfcc261702e72bb4c77744b3e72ec155d958961e319ba623a5","abstract_canon_sha256":"a6ea17c10ad08ae7fb5119c3f4b8f843f1bc47bc94b8dd805ebc100d621bc04c"},"schema_version":"1.0"},"canonical_sha256":"577519db2af080f202f0cddddc609f24d1d4464b3156cb48bcb9b2456aff7c9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:20.453071Z","signature_b64":"UVi9pqP7hSLmAsMT7gwp8vX3g1+uiHsIeFuzzPFCvyQ5fOwmw9sC5IFEfQY3qVt4YGH218rPbfRsEbK4SEAhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"577519db2af080f202f0cddddc609f24d1d4464b3156cb48bcb9b2456aff7c9c","last_reissued_at":"2026-05-18T00:54:20.452707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:20.452707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08001","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:54:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJYE8RhpdQyOIp8LDrFM08tx4f3fTpm7AtY8vHqzjRufuGfKIuLJWMpKgnLdAMMHSWuvY0al9ButAyTbqkgkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:10:15.498215Z"},"content_sha256":"40c018fa93e76e612f9209f93c497d4791e958b705fb6b3477b067e590715395","schema_version":"1.0","event_id":"sha256:40c018fa93e76e612f9209f93c497d4791e958b705fb6b3477b067e590715395"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K52RTWZK6CAPEAXQZXO5YYE7ET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Context Tree based Image Contour Coding using A Geometric Prior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Amin Zheng, Dinei Florencio, Gene Cheung","submitted_at":"2016-04-27T10:00:41Z","abstract_excerpt":"If object contours in images are coded efficiently as side information, then they can facilitate advanced image / video coding techniques, such as graph Fourier transform coding or motion prediction of arbitrarily shaped pixel blocks. In this paper, we study the problem of lossless and lossy compression of detected contours in images. Specifically, we first convert a detected object contour composed of contiguous between-pixel edges to a sequence of directional symbols drawn from a small alphabet. To encode the symbol sequence using arithmetic coding, we compute an optimal variable-length cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08001","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:54:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z6BkZTtDlZ54bNvW6KAo7Yvez0oPl+AZyIdm72PQimFF98GLqv2LHdmA6ehaa+XikJ5yyW1itS+19hMaKOmABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:10:15.498577Z"},"content_sha256":"ca7b167789bcebc491c4402242647201a64921e4c7add197cc42e65a7f45bfd1","schema_version":"1.0","event_id":"sha256:ca7b167789bcebc491c4402242647201a64921e4c7add197cc42e65a7f45bfd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K52RTWZK6CAPEAXQZXO5YYE7ET/bundle.json","state_url":"https://pith.science/pith/K52RTWZK6CAPEAXQZXO5YYE7ET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K52RTWZK6CAPEAXQZXO5YYE7ET/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-05-28T09:10:15Z","links":{"resolver":"https://pith.science/pith/K52RTWZK6CAPEAXQZXO5YYE7ET","bundle":"https://pith.science/pith/K52RTWZK6CAPEAXQZXO5YYE7ET/bundle.json","state":"https://pith.science/pith/K52RTWZK6CAPEAXQZXO5YYE7ET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K52RTWZK6CAPEAXQZXO5YYE7ET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K52RTWZK6CAPEAXQZXO5YYE7ET","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":"a6ea17c10ad08ae7fb5119c3f4b8f843f1bc47bc94b8dd805ebc100d621bc04c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-04-27T10:00:41Z","title_canon_sha256":"e0ee4c4d8ba7a3bfcc261702e72bb4c77744b3e72ec155d958961e319ba623a5"},"schema_version":"1.0","source":{"id":"1604.08001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08001","created_at":"2026-05-18T00:54:20Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08001v1","created_at":"2026-05-18T00:54:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08001","created_at":"2026-05-18T00:54:20Z"},{"alias_kind":"pith_short_12","alias_value":"K52RTWZK6CAP","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K52RTWZK6CAPEAXQ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K52RTWZK","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:ca7b167789bcebc491c4402242647201a64921e4c7add197cc42e65a7f45bfd1","target":"graph","created_at":"2026-05-18T00:54:20Z","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":"If object contours in images are coded efficiently as side information, then they can facilitate advanced image / video coding techniques, such as graph Fourier transform coding or motion prediction of arbitrarily shaped pixel blocks. In this paper, we study the problem of lossless and lossy compression of detected contours in images. Specifically, we first convert a detected object contour composed of contiguous between-pixel edges to a sequence of directional symbols drawn from a small alphabet. To encode the symbol sequence using arithmetic coding, we compute an optimal variable-length cont","authors_text":"Amin Zheng, Dinei Florencio, Gene Cheung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-04-27T10:00:41Z","title":"Context Tree based Image Contour Coding using A Geometric Prior"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08001","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:40c018fa93e76e612f9209f93c497d4791e958b705fb6b3477b067e590715395","target":"record","created_at":"2026-05-18T00:54:20Z","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":"a6ea17c10ad08ae7fb5119c3f4b8f843f1bc47bc94b8dd805ebc100d621bc04c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-04-27T10:00:41Z","title_canon_sha256":"e0ee4c4d8ba7a3bfcc261702e72bb4c77744b3e72ec155d958961e319ba623a5"},"schema_version":"1.0","source":{"id":"1604.08001","kind":"arxiv","version":1}},"canonical_sha256":"577519db2af080f202f0cddddc609f24d1d4464b3156cb48bcb9b2456aff7c9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"577519db2af080f202f0cddddc609f24d1d4464b3156cb48bcb9b2456aff7c9c","first_computed_at":"2026-05-18T00:54:20.452707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:20.452707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UVi9pqP7hSLmAsMT7gwp8vX3g1+uiHsIeFuzzPFCvyQ5fOwmw9sC5IFEfQY3qVt4YGH218rPbfRsEbK4SEAhCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:20.453071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40c018fa93e76e612f9209f93c497d4791e958b705fb6b3477b067e590715395","sha256:ca7b167789bcebc491c4402242647201a64921e4c7add197cc42e65a7f45bfd1"],"state_sha256":"338be89f4db3bbf79c7848634e03c6302b0707c22356d89860b353dd41cbe65a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7iMNFh9306ynlGi84M8ozYXoUadlc/Pub1aYQqKuQKPH5/3C3YGk19Ra9Ix6VQcug1vpEtjlG/N4YxQa67pIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:10:15.500513Z","bundle_sha256":"3ccb1260d3a659bd4b75c327a04e2a8d5d8013cdd67b7cee7df6b452958cd271"}}