{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VQ3EMB7BMVX7JMDK37T2N25CLK","short_pith_number":"pith:VQ3EMB7B","canonical_record":{"source":{"id":"1702.05413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-17T16:01:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"16c5651c9a1c31f220adec975563b4f0c370d8b4b1b50e51de1c9823a7a2ef2e","abstract_canon_sha256":"30fe233729ef6f7afc977226dd7136dd4c854c2bab5a49d8819e3a1ed15fe41a"},"schema_version":"1.0"},"canonical_sha256":"ac364607e1656ff4b06adfe7a6eba25a98486e1923cbda1f798c98772340a753","source":{"kind":"arxiv","id":"1702.05413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05413","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05413v1","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05413","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"pith_short_12","alias_value":"VQ3EMB7BMVX7","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VQ3EMB7BMVX7JMDK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VQ3EMB7B","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VQ3EMB7BMVX7JMDK37T2N25CLK","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-17T16:01:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"16c5651c9a1c31f220adec975563b4f0c370d8b4b1b50e51de1c9823a7a2ef2e","abstract_canon_sha256":"30fe233729ef6f7afc977226dd7136dd4c854c2bab5a49d8819e3a1ed15fe41a"},"schema_version":"1.0"},"canonical_sha256":"ac364607e1656ff4b06adfe7a6eba25a98486e1923cbda1f798c98772340a753","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:31.799920Z","signature_b64":"tuQWuQdKGsE+deiaPSEnMvQRDeXfUEM/W5Ak9xtxSCisCHvLGWNwUP4sf1SFIuVeogeNBPv2UCq2x2Qc0ldmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac364607e1656ff4b06adfe7a6eba25a98486e1923cbda1f798c98772340a753","last_reissued_at":"2026-05-18T00:50:31.799207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:31.799207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05413","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:50:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+PLh0yeGDboJy66uurgr1CGFTWWmmSxs2Qthv0ZbScuuuXA8JP1hw2RHQHAj0O1M1zh53NYYjIVEtaD1nsrxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:42:21.077064Z"},"content_sha256":"25a9c3f6c9999a9d56f7a39b88285368e6048d21a91850dad8f554c34d07f550","schema_version":"1.0","event_id":"sha256:25a9c3f6c9999a9d56f7a39b88285368e6048d21a91850dad8f554c34d07f550"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VQ3EMB7BMVX7JMDK37T2N25CLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"3D Cell Nuclei Segmentation with Balanced Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CV","authors_text":"Johannes Stegmaier, Julian Arz, Peter Sanders, Ralf Mikut","submitted_at":"2017-02-17T16:01:50Z","abstract_excerpt":"Cell nuclei segmentation is one of the most important tasks in the analysis of biomedical images. With ever-growing sizes and amounts of three-dimensional images to be processed, there is a need for better and faster segmentation methods. Graph-based image segmentation has seen a rise in popularity in recent years, but is seen as very costly with regard to computational demand. We propose a new segmentation algorithm which overcomes these limitations. Our method uses recursive balanced graph partitioning to segment foreground components of a fast and efficient binarization. We construct a mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05413","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:50:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1kzLlh3dJLBPNti400SO9E2yzfkRXApxbH3ZfXF/8qUyzkvN1Pig79NUmiiF56CFyrqgNdKYqwhlOJ5tfb+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:42:21.077441Z"},"content_sha256":"108d2fd41900387d1c1afcd36136f650103b35c9b9a030c2450f33c5561498f1","schema_version":"1.0","event_id":"sha256:108d2fd41900387d1c1afcd36136f650103b35c9b9a030c2450f33c5561498f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK/bundle.json","state_url":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQ3EMB7BMVX7JMDK37T2N25CLK/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-01T05:42:21Z","links":{"resolver":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK","bundle":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK/bundle.json","state":"https://pith.science/pith/VQ3EMB7BMVX7JMDK37T2N25CLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQ3EMB7BMVX7JMDK37T2N25CLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VQ3EMB7BMVX7JMDK37T2N25CLK","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":"30fe233729ef6f7afc977226dd7136dd4c854c2bab5a49d8819e3a1ed15fe41a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-17T16:01:50Z","title_canon_sha256":"16c5651c9a1c31f220adec975563b4f0c370d8b4b1b50e51de1c9823a7a2ef2e"},"schema_version":"1.0","source":{"id":"1702.05413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05413","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05413v1","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05413","created_at":"2026-05-18T00:50:31Z"},{"alias_kind":"pith_short_12","alias_value":"VQ3EMB7BMVX7","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VQ3EMB7BMVX7JMDK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VQ3EMB7B","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:108d2fd41900387d1c1afcd36136f650103b35c9b9a030c2450f33c5561498f1","target":"graph","created_at":"2026-05-18T00:50:31Z","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":"Cell nuclei segmentation is one of the most important tasks in the analysis of biomedical images. With ever-growing sizes and amounts of three-dimensional images to be processed, there is a need for better and faster segmentation methods. Graph-based image segmentation has seen a rise in popularity in recent years, but is seen as very costly with regard to computational demand. We propose a new segmentation algorithm which overcomes these limitations. Our method uses recursive balanced graph partitioning to segment foreground components of a fast and efficient binarization. We construct a mode","authors_text":"Johannes Stegmaier, Julian Arz, Peter Sanders, Ralf Mikut","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-17T16:01:50Z","title":"3D Cell Nuclei Segmentation with Balanced Graph Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05413","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:25a9c3f6c9999a9d56f7a39b88285368e6048d21a91850dad8f554c34d07f550","target":"record","created_at":"2026-05-18T00:50:31Z","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":"30fe233729ef6f7afc977226dd7136dd4c854c2bab5a49d8819e3a1ed15fe41a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-17T16:01:50Z","title_canon_sha256":"16c5651c9a1c31f220adec975563b4f0c370d8b4b1b50e51de1c9823a7a2ef2e"},"schema_version":"1.0","source":{"id":"1702.05413","kind":"arxiv","version":1}},"canonical_sha256":"ac364607e1656ff4b06adfe7a6eba25a98486e1923cbda1f798c98772340a753","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac364607e1656ff4b06adfe7a6eba25a98486e1923cbda1f798c98772340a753","first_computed_at":"2026-05-18T00:50:31.799207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:31.799207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tuQWuQdKGsE+deiaPSEnMvQRDeXfUEM/W5Ak9xtxSCisCHvLGWNwUP4sf1SFIuVeogeNBPv2UCq2x2Qc0ldmAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:31.799920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25a9c3f6c9999a9d56f7a39b88285368e6048d21a91850dad8f554c34d07f550","sha256:108d2fd41900387d1c1afcd36136f650103b35c9b9a030c2450f33c5561498f1"],"state_sha256":"9a39b708b675f341318d5e608b614132cfcf06f62af33513e94b314b724803f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JyOh1ExQorSC/vi2ZJQN/YIZqCyxQAK9XYkyxFnhLB2UZGyI9LgYRfA26O/FbJ3+aZp1Udf48oyfP59PFqJ4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:42:21.079654Z","bundle_sha256":"4bd907b3b0914e551d495b9d701d3d4633626aadcc6c158b202d0d13e05c6687"}}