{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MYE4DBGW6JLGYP3VUB7TKG3532","short_pith_number":"pith:MYE4DBGW","canonical_record":{"source":{"id":"1511.06911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-21T17:55:14Z","cross_cats_sorted":[],"title_canon_sha256":"6df4c06cc575d5e22c41e6a130f4ebe05826afbd7c04d9ecbe473df552460812","abstract_canon_sha256":"29a6506c5edf67ca2581d0b342c882f3e74c0f74fb61307da1c1b77392d76acd"},"schema_version":"1.0"},"canonical_sha256":"6609c184d6f2566c3f75a07f351b7dde97dea9db260df480130be8c53eb214f7","source":{"kind":"arxiv","id":"1511.06911","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06911","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06911v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06911","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"MYE4DBGW6JLG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYE4DBGW6JLGYP3V","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYE4DBGW","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MYE4DBGW6JLGYP3VUB7TKG3532","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-21T17:55:14Z","cross_cats_sorted":[],"title_canon_sha256":"6df4c06cc575d5e22c41e6a130f4ebe05826afbd7c04d9ecbe473df552460812","abstract_canon_sha256":"29a6506c5edf67ca2581d0b342c882f3e74c0f74fb61307da1c1b77392d76acd"},"schema_version":"1.0"},"canonical_sha256":"6609c184d6f2566c3f75a07f351b7dde97dea9db260df480130be8c53eb214f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:50.202993Z","signature_b64":"6UEhSwb6CjY3OZt6pvwDbQ7wTsccwOaxxuJ+W99yI3SUvuVcbQYvWjJHu3zDk2MZe1sg1sOy3y2VhL/8IvUTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6609c184d6f2566c3f75a07f351b7dde97dea9db260df480130be8c53eb214f7","last_reissued_at":"2026-05-18T00:57:50.202330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:50.202330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06911","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hI7cso+PI9wtjjYfjBrZy1ikhkzgn3fn5qkSMXxdcRCvqRSAdqpy6tdoaeog8aRd5gJ6cpnbU4CP7pWdEohyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:08:41.512800Z"},"content_sha256":"0577db12fbca3178adacbf3a6273cf58af800f8fc58ff9ec2cf55098d7cbb429","schema_version":"1.0","event_id":"sha256:0577db12fbca3178adacbf3a6273cf58af800f8fc58ff9ec2cf55098d7cbb429"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MYE4DBGW6JLGYP3VUB7TKG3532","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Screen Content Image Segmentation Using Sparse-Smooth Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"AmirAli Abdolrashidi, Shervin Minaee, Yao Wang","submitted_at":"2015-11-21T17:55:14Z","abstract_excerpt":"Sparse decomposition has been extensively used for different applications including signal compression and denoising and document analysis. In this paper, sparse decomposition is used for image segmentation. The proposed algorithm separates the background and foreground using a sparse-smooth decomposition technique such that the smooth and sparse components correspond to the background and foreground respectively. This algorithm is tested on several test images from HEVC test sequences and is shown to have superior performance over other methods, such as the hierarchical k-means clustering in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06911","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qsopk+dW2Jup2ogQuvfVxV2eVnGVFtrM7krNHWzU5DzdZkLRvjRPKSR0RJmeB18k2A5nxogqMyMHi0l8Pik3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:08:41.513143Z"},"content_sha256":"7131e98beb3bb8611ffc51053b602988f1775ffdaf0fdfa1bc9a46b6c2357e92","schema_version":"1.0","event_id":"sha256:7131e98beb3bb8611ffc51053b602988f1775ffdaf0fdfa1bc9a46b6c2357e92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYE4DBGW6JLGYP3VUB7TKG3532/bundle.json","state_url":"https://pith.science/pith/MYE4DBGW6JLGYP3VUB7TKG3532/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYE4DBGW6JLGYP3VUB7TKG3532/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-12T06:08:41Z","links":{"resolver":"https://pith.science/pith/MYE4DBGW6JLGYP3VUB7TKG3532","bundle":"https://pith.science/pith/MYE4DBGW6JLGYP3VUB7TKG3532/bundle.json","state":"https://pith.science/pith/MYE4DBGW6JLGYP3VUB7TKG3532/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYE4DBGW6JLGYP3VUB7TKG3532/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MYE4DBGW6JLGYP3VUB7TKG3532","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":"29a6506c5edf67ca2581d0b342c882f3e74c0f74fb61307da1c1b77392d76acd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-21T17:55:14Z","title_canon_sha256":"6df4c06cc575d5e22c41e6a130f4ebe05826afbd7c04d9ecbe473df552460812"},"schema_version":"1.0","source":{"id":"1511.06911","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06911","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06911v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06911","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"MYE4DBGW6JLG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYE4DBGW6JLGYP3V","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYE4DBGW","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:7131e98beb3bb8611ffc51053b602988f1775ffdaf0fdfa1bc9a46b6c2357e92","target":"graph","created_at":"2026-05-18T00:57:50Z","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":"Sparse decomposition has been extensively used for different applications including signal compression and denoising and document analysis. In this paper, sparse decomposition is used for image segmentation. The proposed algorithm separates the background and foreground using a sparse-smooth decomposition technique such that the smooth and sparse components correspond to the background and foreground respectively. This algorithm is tested on several test images from HEVC test sequences and is shown to have superior performance over other methods, such as the hierarchical k-means clustering in ","authors_text":"AmirAli Abdolrashidi, Shervin Minaee, Yao Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-21T17:55:14Z","title":"Screen Content Image Segmentation Using Sparse-Smooth Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06911","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:0577db12fbca3178adacbf3a6273cf58af800f8fc58ff9ec2cf55098d7cbb429","target":"record","created_at":"2026-05-18T00:57:50Z","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":"29a6506c5edf67ca2581d0b342c882f3e74c0f74fb61307da1c1b77392d76acd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-21T17:55:14Z","title_canon_sha256":"6df4c06cc575d5e22c41e6a130f4ebe05826afbd7c04d9ecbe473df552460812"},"schema_version":"1.0","source":{"id":"1511.06911","kind":"arxiv","version":1}},"canonical_sha256":"6609c184d6f2566c3f75a07f351b7dde97dea9db260df480130be8c53eb214f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6609c184d6f2566c3f75a07f351b7dde97dea9db260df480130be8c53eb214f7","first_computed_at":"2026-05-18T00:57:50.202330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:50.202330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6UEhSwb6CjY3OZt6pvwDbQ7wTsccwOaxxuJ+W99yI3SUvuVcbQYvWjJHu3zDk2MZe1sg1sOy3y2VhL/8IvUTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:50.202993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06911","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0577db12fbca3178adacbf3a6273cf58af800f8fc58ff9ec2cf55098d7cbb429","sha256:7131e98beb3bb8611ffc51053b602988f1775ffdaf0fdfa1bc9a46b6c2357e92"],"state_sha256":"97e1190ddde282ff31953b9da52ef44635d34742c7a46dac957e4f0064479ece"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ECIqZrs+yqdcjEYyDroJzt2pWFX0xBKT8pH0r64xLd/QyR8h2nORX5JZMBmgc2uJVUFFJuo9guzE3oIQ7RLhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:08:41.515470Z","bundle_sha256":"217c11fb39b9a93d7fa8eb0d2645782d5eb005b70967ce25bc76088d2e47311f"}}