{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IMQEZDYZRNJZZWQ7IAVKU6VRSP","short_pith_number":"pith:IMQEZDYZ","canonical_record":{"source":{"id":"1811.04715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-12T13:30:19Z","cross_cats_sorted":[],"title_canon_sha256":"aadc2660e82438d4313caf8ff77358ce596fc611617572318dc0439410aa2907","abstract_canon_sha256":"d91952c43905b284e145b48307525a22ad5e670122a2363da50127675c2f4c8b"},"schema_version":"1.0"},"canonical_sha256":"43204c8f198b539cda1f402aaa7ab193d48b50ac49a3bfb6fd60597ffc5be066","source":{"kind":"arxiv","id":"1811.04715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04715","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04715v1","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04715","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"pith_short_12","alias_value":"IMQEZDYZRNJZ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IMQEZDYZRNJZZWQ7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IMQEZDYZ","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IMQEZDYZRNJZZWQ7IAVKU6VRSP","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-12T13:30:19Z","cross_cats_sorted":[],"title_canon_sha256":"aadc2660e82438d4313caf8ff77358ce596fc611617572318dc0439410aa2907","abstract_canon_sha256":"d91952c43905b284e145b48307525a22ad5e670122a2363da50127675c2f4c8b"},"schema_version":"1.0"},"canonical_sha256":"43204c8f198b539cda1f402aaa7ab193d48b50ac49a3bfb6fd60597ffc5be066","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:04.275627Z","signature_b64":"KnqiNLJeyXlGwRkHrA9gh3idmQdGl3MAdaokOp0mEQd1c2L87LGGbRxkxklmqxbLDxuMwryPSHtXEFTOeCHBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43204c8f198b539cda1f402aaa7ab193d48b50ac49a3bfb6fd60597ffc5be066","last_reissued_at":"2026-05-18T00:01:04.275059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:04.275059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04715","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:01:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"La0Ve5utmMFta1yCiYHl5LnIOlFL1E+Sxx9ZxPby8HrDsQ/BZ88x1ozHWdv8YsogcaN1HIIDfjlwi/sZBr+DAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:07:12.302254Z"},"content_sha256":"5e9b3c914879b0492c69b101c777bb09eddd73296019c6d5dc99c5e53d06cd7d","schema_version":"1.0","event_id":"sha256:5e9b3c914879b0492c69b101c777bb09eddd73296019c6d5dc99c5e53d06cd7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IMQEZDYZRNJZZWQ7IAVKU6VRSP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex Shape Priors for Level Set Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Shousheng Luo, Xue-Cheng Tai","submitted_at":"2018-11-12T13:30:19Z","abstract_excerpt":"For many applications, we need to use techniques to represent convex shapes and objects. In this work, we use level set method to represent shapes and find a necessary and sufficient condition on the level set function to guarantee the convexity of the represented shapes. We take image segmentation as an example to apply our technique. Numerical algorithm is developed to solve the variational model. In order to improve the performance of segmentation for complex images, we also incorporate landmarks into the model. One option is to specify points that the object boundary must contain. Another "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04715","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:01:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cdqTLAWpWNYabiUCXgbw+Crx4oleE72NheB69iy7er4QtLWaTGYsI3DWLzRAtGSaQN4gdqQ+NqjODh2rw1AAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:07:12.302932Z"},"content_sha256":"ce7ce34aa4ce887b06e9b0485176871108f5780fbb983da3ad54198b24cb8460","schema_version":"1.0","event_id":"sha256:ce7ce34aa4ce887b06e9b0485176871108f5780fbb983da3ad54198b24cb8460"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IMQEZDYZRNJZZWQ7IAVKU6VRSP/bundle.json","state_url":"https://pith.science/pith/IMQEZDYZRNJZZWQ7IAVKU6VRSP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IMQEZDYZRNJZZWQ7IAVKU6VRSP/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-26T18:07:12Z","links":{"resolver":"https://pith.science/pith/IMQEZDYZRNJZZWQ7IAVKU6VRSP","bundle":"https://pith.science/pith/IMQEZDYZRNJZZWQ7IAVKU6VRSP/bundle.json","state":"https://pith.science/pith/IMQEZDYZRNJZZWQ7IAVKU6VRSP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IMQEZDYZRNJZZWQ7IAVKU6VRSP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IMQEZDYZRNJZZWQ7IAVKU6VRSP","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":"d91952c43905b284e145b48307525a22ad5e670122a2363da50127675c2f4c8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-12T13:30:19Z","title_canon_sha256":"aadc2660e82438d4313caf8ff77358ce596fc611617572318dc0439410aa2907"},"schema_version":"1.0","source":{"id":"1811.04715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04715","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04715v1","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04715","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"pith_short_12","alias_value":"IMQEZDYZRNJZ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IMQEZDYZRNJZZWQ7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IMQEZDYZ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:ce7ce34aa4ce887b06e9b0485176871108f5780fbb983da3ad54198b24cb8460","target":"graph","created_at":"2026-05-18T00:01:04Z","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":"For many applications, we need to use techniques to represent convex shapes and objects. In this work, we use level set method to represent shapes and find a necessary and sufficient condition on the level set function to guarantee the convexity of the represented shapes. We take image segmentation as an example to apply our technique. Numerical algorithm is developed to solve the variational model. In order to improve the performance of segmentation for complex images, we also incorporate landmarks into the model. One option is to specify points that the object boundary must contain. Another ","authors_text":"Shousheng Luo, Xue-Cheng Tai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-12T13:30:19Z","title":"Convex Shape Priors for Level Set Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04715","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:5e9b3c914879b0492c69b101c777bb09eddd73296019c6d5dc99c5e53d06cd7d","target":"record","created_at":"2026-05-18T00:01:04Z","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":"d91952c43905b284e145b48307525a22ad5e670122a2363da50127675c2f4c8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-12T13:30:19Z","title_canon_sha256":"aadc2660e82438d4313caf8ff77358ce596fc611617572318dc0439410aa2907"},"schema_version":"1.0","source":{"id":"1811.04715","kind":"arxiv","version":1}},"canonical_sha256":"43204c8f198b539cda1f402aaa7ab193d48b50ac49a3bfb6fd60597ffc5be066","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43204c8f198b539cda1f402aaa7ab193d48b50ac49a3bfb6fd60597ffc5be066","first_computed_at":"2026-05-18T00:01:04.275059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:04.275059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KnqiNLJeyXlGwRkHrA9gh3idmQdGl3MAdaokOp0mEQd1c2L87LGGbRxkxklmqxbLDxuMwryPSHtXEFTOeCHBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:04.275627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e9b3c914879b0492c69b101c777bb09eddd73296019c6d5dc99c5e53d06cd7d","sha256:ce7ce34aa4ce887b06e9b0485176871108f5780fbb983da3ad54198b24cb8460"],"state_sha256":"9c2e3e9f7ca542e48596b3c7e800418c1e0b3fd56977df1de7dcd9af327d561f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akqfOBQXzLWUEtHiwtz2LCvwMYxoLI9Bk8Okz7XzLGI/iN/fuQY78DCsCdL/8x0It6qeRT6VnvhCkWe7g3Y4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:07:12.306508Z","bundle_sha256":"3457d2be3dd92d7f5b3444349fafa6ce93a9848038eb430c111f6fe213a52b0c"}}