{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CMA3KDBF4PDFXMMXZQXAK6IHDU","short_pith_number":"pith:CMA3KDBF","canonical_record":{"source":{"id":"1608.01431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-04T05:37:35Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"bc6f3136c359aec50e3ca880a67d0d8aee22217eca814ada0e2d703e277c9235","abstract_canon_sha256":"742eecce274650b938b3df0002f836e12e4f37e1bac6070d59ceb3b90f066c34"},"schema_version":"1.0"},"canonical_sha256":"1301b50c25e3c65bb197cc2e0579071d222ded864d823400bf488f0e112a7421","source":{"kind":"arxiv","id":"1608.01431","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01431","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01431v2","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01431","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"CMA3KDBF4PDF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CMA3KDBF4PDFXMMX","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CMA3KDBF","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CMA3KDBF4PDFXMMXZQXAK6IHDU","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-04T05:37:35Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"bc6f3136c359aec50e3ca880a67d0d8aee22217eca814ada0e2d703e277c9235","abstract_canon_sha256":"742eecce274650b938b3df0002f836e12e4f37e1bac6070d59ceb3b90f066c34"},"schema_version":"1.0"},"canonical_sha256":"1301b50c25e3c65bb197cc2e0579071d222ded864d823400bf488f0e112a7421","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:23.251604Z","signature_b64":"IcC3mPQiP7XOhZ0e8WFM2VaDwZZcPrpuEYl3Jp5nZvebTkTYaq3HEGH8wyb26nl7jWwB/qDZbV4o+08aSit3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1301b50c25e3c65bb197cc2e0579071d222ded864d823400bf488f0e112a7421","last_reissued_at":"2026-05-18T00:33:23.250944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:23.250944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01431","source_version":2,"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:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7nenrkAVs4epz7zo+DqXCZgp+wOleHMlDfayS0TzjXi0fkFrSxQcqPQSSAtqS/N1YqYbqda7vxXbMC7LeRnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:03:51.607387Z"},"content_sha256":"93f9ce661d0043158da09faf8ce47c7a0430f30ef6f2f980c6f7f490d024f1cc","schema_version":"1.0","event_id":"sha256:93f9ce661d0043158da09faf8ce47c7a0430f30ef6f2f980c6f7f490d024f1cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CMA3KDBF4PDFXMMXZQXAK6IHDU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient iterative thresholding method for image segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CV","authors_text":"Dong Wang, Haohan Li, Xiaoping Wang, Xiaoyu Wei","submitted_at":"2016-08-04T05:37:35Z","abstract_excerpt":"We proposed an efficient iterative thresholding method for multi-phase image segmentation. The algorithm is based on minimizing piecewise constant Mumford-Shah functional in which the contour length (or perimeter) is approximated by a non-local multi-phase energy. The minimization problem is solved by an iterative method. Each iteration consists of computing simple convolutions followed by a thresholding step. The algorithm is easy to implement and has the optimal complexity $O(N \\log N)$ per iteration. We also show that the iterative algorithm has the total energy decaying property. We presen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01431","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"},"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:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJqsXMDAYW1cj3BaH5LLxtPRuRZQD/aVsB0MjPDOvJaG7GBYv6sjHJKuJ2epQFd9h8U1xbYxdJDAKnpuukKIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:03:51.607735Z"},"content_sha256":"bf98ed4f84c2e2601c134c59c1973d09489bbbe43b9e1c12ca393fa0ca2d52d1","schema_version":"1.0","event_id":"sha256:bf98ed4f84c2e2601c134c59c1973d09489bbbe43b9e1c12ca393fa0ca2d52d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU/bundle.json","state_url":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU/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-02T02:03:51Z","links":{"resolver":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU","bundle":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU/bundle.json","state":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CMA3KDBF4PDFXMMXZQXAK6IHDU","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":"742eecce274650b938b3df0002f836e12e4f37e1bac6070d59ceb3b90f066c34","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-04T05:37:35Z","title_canon_sha256":"bc6f3136c359aec50e3ca880a67d0d8aee22217eca814ada0e2d703e277c9235"},"schema_version":"1.0","source":{"id":"1608.01431","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01431","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01431v2","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01431","created_at":"2026-05-18T00:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"CMA3KDBF4PDF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CMA3KDBF4PDFXMMX","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CMA3KDBF","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:bf98ed4f84c2e2601c134c59c1973d09489bbbe43b9e1c12ca393fa0ca2d52d1","target":"graph","created_at":"2026-05-18T00:33:23Z","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":"We proposed an efficient iterative thresholding method for multi-phase image segmentation. The algorithm is based on minimizing piecewise constant Mumford-Shah functional in which the contour length (or perimeter) is approximated by a non-local multi-phase energy. The minimization problem is solved by an iterative method. Each iteration consists of computing simple convolutions followed by a thresholding step. The algorithm is easy to implement and has the optimal complexity $O(N \\log N)$ per iteration. We also show that the iterative algorithm has the total energy decaying property. We presen","authors_text":"Dong Wang, Haohan Li, Xiaoping Wang, Xiaoyu Wei","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-04T05:37:35Z","title":"An efficient iterative thresholding method for image segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01431","kind":"arxiv","version":2},"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:93f9ce661d0043158da09faf8ce47c7a0430f30ef6f2f980c6f7f490d024f1cc","target":"record","created_at":"2026-05-18T00:33:23Z","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":"742eecce274650b938b3df0002f836e12e4f37e1bac6070d59ceb3b90f066c34","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-04T05:37:35Z","title_canon_sha256":"bc6f3136c359aec50e3ca880a67d0d8aee22217eca814ada0e2d703e277c9235"},"schema_version":"1.0","source":{"id":"1608.01431","kind":"arxiv","version":2}},"canonical_sha256":"1301b50c25e3c65bb197cc2e0579071d222ded864d823400bf488f0e112a7421","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1301b50c25e3c65bb197cc2e0579071d222ded864d823400bf488f0e112a7421","first_computed_at":"2026-05-18T00:33:23.250944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:23.250944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IcC3mPQiP7XOhZ0e8WFM2VaDwZZcPrpuEYl3Jp5nZvebTkTYaq3HEGH8wyb26nl7jWwB/qDZbV4o+08aSit3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:23.251604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01431","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93f9ce661d0043158da09faf8ce47c7a0430f30ef6f2f980c6f7f490d024f1cc","sha256:bf98ed4f84c2e2601c134c59c1973d09489bbbe43b9e1c12ca393fa0ca2d52d1"],"state_sha256":"25efc249815e488168eeb4377721b0ebc817ee0c3ebc82296ffd4c8e75bf3a57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jx0jm7tUgNhNtdFFxO1gI0xfajcmqYAOUy/zMwXZ1n+UDvs35iWzmgMBoetTCq/wjVHNBHYdGpSb1jEw8lFvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:03:51.609763Z","bundle_sha256":"f8c7587f5bc0c4059629377de2e3e9b6d402cb63388eef660d8eb68b4ce8f919"}}