{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:24IC4FA5DYNCHXIUEPLQMHOHUP","short_pith_number":"pith:24IC4FA5","canonical_record":{"source":{"id":"1105.1429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-07T09:53:14Z","cross_cats_sorted":["math.DG"],"title_canon_sha256":"047eabf4e0ebccbde917e1398fd2c9696221769df20bec6adda28e89fc0b10d2","abstract_canon_sha256":"245849d6c482f3ddab853ca8cd37254720ce470702151a84d822940531dba126"},"schema_version":"1.0"},"canonical_sha256":"d7102e141d1e1a23dd1423d7061dc7a3fd55876676bcef542b9f2880f35837cc","source":{"kind":"arxiv","id":"1105.1429","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1429","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1429v2","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1429","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"pith_short_12","alias_value":"24IC4FA5DYNC","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"24IC4FA5DYNCHXIU","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"24IC4FA5","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:24IC4FA5DYNCHXIUEPLQMHOHUP","target":"record","payload":{"canonical_record":{"source":{"id":"1105.1429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-07T09:53:14Z","cross_cats_sorted":["math.DG"],"title_canon_sha256":"047eabf4e0ebccbde917e1398fd2c9696221769df20bec6adda28e89fc0b10d2","abstract_canon_sha256":"245849d6c482f3ddab853ca8cd37254720ce470702151a84d822940531dba126"},"schema_version":"1.0"},"canonical_sha256":"d7102e141d1e1a23dd1423d7061dc7a3fd55876676bcef542b9f2880f35837cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:01.516504Z","signature_b64":"6nVdkoE5H2fVzbDLXl/sGRpRYkAx6XZRV69V6wRnvKYsXolwhVdFop4tx6g+ig+tJgUCl4zA9ecELIEe2m7pAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7102e141d1e1a23dd1423d7061dc7a3fd55876676bcef542b9f2880f35837cc","last_reissued_at":"2026-05-18T02:30:01.516111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:01.516111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.1429","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-18T02:30:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tsrT/j8D1/sokZpkZHjfxdgdW/YAZU9Qs87/yA1SPBqeM+IznJ3cdZRegFfMMfp48gVreAWqG/A/egF4K8vHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:39:02.728203Z"},"content_sha256":"afa94e2e284a98b23bd9761ada388ff33bde71b9b86cdc9cfec9b01d084132c3","schema_version":"1.0","event_id":"sha256:afa94e2e284a98b23bd9761ada388ff33bde71b9b86cdc9cfec9b01d084132c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:24IC4FA5DYNCHXIUEPLQMHOHUP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Application of the level-set model with constraints in image segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG"],"primary_cat":"math.NA","authors_text":"Daniel \\v{S}ev\\v{c}ovi\\v{c}, Tom\\'a\\v{s} Oberhuber, Vladim\\'ir Klement","submitted_at":"2011-05-07T09:53:14Z","abstract_excerpt":"We propose and analyze a constrained level-set method for semi-automatic image segmentation. Our level-set model with constraints on the level-set function enables us to specify which parts of the image lie inside respectively outside the segmented objects. Such a-priori information can be expressed in terms of upper and lower constraints prescribed for the level-set function. Constraints have the same conceptual meaning as initial seeds of the popular graph-cuts based methods for image segmentation. A numerical approximation scheme is based on the complementary-finite volumes method combined "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1429","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-18T02:30:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OyRjxgzWt7On2QGH+fQe/iGIMSC5mf1YVAR+wEicygJwD48G5UjCHUYJk02QaLF8esR3He6grrHB/ZgU4rZiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:39:02.728575Z"},"content_sha256":"a6864351cd9fc48df0fa0b84e5811f9e3250b01995072f4723815e9d4d9870e2","schema_version":"1.0","event_id":"sha256:a6864351cd9fc48df0fa0b84e5811f9e3250b01995072f4723815e9d4d9870e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP/bundle.json","state_url":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24IC4FA5DYNCHXIUEPLQMHOHUP/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-03T12:39:02Z","links":{"resolver":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP","bundle":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP/bundle.json","state":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24IC4FA5DYNCHXIUEPLQMHOHUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:24IC4FA5DYNCHXIUEPLQMHOHUP","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":"245849d6c482f3ddab853ca8cd37254720ce470702151a84d822940531dba126","cross_cats_sorted":["math.DG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-07T09:53:14Z","title_canon_sha256":"047eabf4e0ebccbde917e1398fd2c9696221769df20bec6adda28e89fc0b10d2"},"schema_version":"1.0","source":{"id":"1105.1429","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1429","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1429v2","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1429","created_at":"2026-05-18T02:30:01Z"},{"alias_kind":"pith_short_12","alias_value":"24IC4FA5DYNC","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"24IC4FA5DYNCHXIU","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"24IC4FA5","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:a6864351cd9fc48df0fa0b84e5811f9e3250b01995072f4723815e9d4d9870e2","target":"graph","created_at":"2026-05-18T02:30:01Z","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 propose and analyze a constrained level-set method for semi-automatic image segmentation. Our level-set model with constraints on the level-set function enables us to specify which parts of the image lie inside respectively outside the segmented objects. Such a-priori information can be expressed in terms of upper and lower constraints prescribed for the level-set function. Constraints have the same conceptual meaning as initial seeds of the popular graph-cuts based methods for image segmentation. A numerical approximation scheme is based on the complementary-finite volumes method combined ","authors_text":"Daniel \\v{S}ev\\v{c}ovi\\v{c}, Tom\\'a\\v{s} Oberhuber, Vladim\\'ir Klement","cross_cats":["math.DG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-07T09:53:14Z","title":"Application of the level-set model with constraints in image segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1429","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:afa94e2e284a98b23bd9761ada388ff33bde71b9b86cdc9cfec9b01d084132c3","target":"record","created_at":"2026-05-18T02:30:01Z","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":"245849d6c482f3ddab853ca8cd37254720ce470702151a84d822940531dba126","cross_cats_sorted":["math.DG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-07T09:53:14Z","title_canon_sha256":"047eabf4e0ebccbde917e1398fd2c9696221769df20bec6adda28e89fc0b10d2"},"schema_version":"1.0","source":{"id":"1105.1429","kind":"arxiv","version":2}},"canonical_sha256":"d7102e141d1e1a23dd1423d7061dc7a3fd55876676bcef542b9f2880f35837cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7102e141d1e1a23dd1423d7061dc7a3fd55876676bcef542b9f2880f35837cc","first_computed_at":"2026-05-18T02:30:01.516111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:01.516111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6nVdkoE5H2fVzbDLXl/sGRpRYkAx6XZRV69V6wRnvKYsXolwhVdFop4tx6g+ig+tJgUCl4zA9ecELIEe2m7pAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:01.516504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.1429","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afa94e2e284a98b23bd9761ada388ff33bde71b9b86cdc9cfec9b01d084132c3","sha256:a6864351cd9fc48df0fa0b84e5811f9e3250b01995072f4723815e9d4d9870e2"],"state_sha256":"f06eb84ae4df42cbcbe83ca9a752abaa4b2768799324cdc528bb7b442b7d987a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afAXx5pHsDGMq8t0BozMaBWpMP06F7X8zxYk6u5UT0C2NrmSF2TtOM0EQP5GT49C1c+ddlgVCiZNsM1FMv96AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:39:02.730744Z","bundle_sha256":"ab62a052da3b30dd2b2f8eba664bafeb0dcde7a52ce06ff99f2cb7352fd6aad6"}}